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
NQF Level 06
Service modules Faculty of Engineering, Built Environment and Information Technology
Prerequisites WTW 115
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

The regulations and rules for the degrees published here are subject to change and may be amended after the publication of this information.

The General Academic Regulations (G Regulations) and General Student Rules apply to all faculties and registered students of the University, as well as all prospective students who have accepted an offer of a place at the University of Pretoria. On registering for a programme, the student bears the responsibility of ensuring that they familiarise themselves with the General Academic Regulations applicable to their registration, as well as the relevant faculty-specific and programme-specific regulations and information as stipulated in the relevant yearbook. Ignorance concerning these regulations will not be accepted as an excuse for any transgression, or basis for an exception to any of the aforementioned regulations.

Copyright © University of Pretoria 2022. All rights reserved.

FAQ's Email Us Virtual Campus Share Cookie Preferences