Yearbooks

Discrete structures 285


 
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
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

The information published here is subject to change and may be amended after the publication of this information. The General Regulations (G Regulations) apply to all faculties of the University of Pretoria. It is expected of each student to familiarise himself or herself well with these regulations as well as with the information contained in the General Rules section. Ignorance concerning these regulations and rules will not be accepted as an excuse for any transgression.

Copyright © University of Pretoria 2019. All rights reserved.

FAQ's Email Us Virtual Campus Share