Module code | WTW 285 |
Qualification | Undergraduate |
Faculty | Faculty of Natural and Agricultural Sciences |
Module content | Setting up and solving recurrence relations. Equivalence and partial order relations. Graphs: paths, cycles, trees, isomorphism. Graph algorithms: Kruskal, Prim, Fleury. Finite state automata. |
Module credits | 12.00 |
Programmes | |
Service modules | Faculty of Engineering, Built Environment and Information Technology Faculty of Education |
Prerequisites | WTW 115 |
Contact time | 1 tutorial per week, 2 lectures per week |
Language of tuition | Module is presented in English |
Academic organisation | Mathematics and Applied Maths |
Period of presentation | Semester 2 |
Copyright © University of Pretoria 2024. All rights reserved.
Get Social With Us
Download the UP Mobile App