|Module code||WTW 285|
|Faculty||Faculty of Natural and Agricultural Sciences|
Setting up and solving recurrence relations. Equivalence and partial order relations. Graphs: paths, cycles, trees, isomorphism. Graph algorithms: Kruskal, Prim, Fleury. Finite state automata.
|Service modules||Faculty of Engineering, Built Environment and Information Technology
Faculty of Education
|Contact time||1 tutorial per week, 2 lectures per week|
|Language of tuition||Module is presented in English|
|Department||Mathematics and Applied Mathematics|
|Period of presentation||Semester 2|
Copyright © University of Pretoria 2023. All rights reserved.
COVID-19 Corona Virus South African Resource Portal
To contact the University during the COVID-19 lockdown, please send an email to [email protected]
Get Social With Us
Download the UP Mobile App