FacultyNatural Sciences
Home DepartmentComputer Science
Module TopicAlgorithms and Datastructures
Generic Module NameComputer Science 211
Alpha-numeric CodeCSC211
NQF Level6
NQF Credit Value20
Proposed semester to be offeredFirst Semester
Programmes in which the module will be offeredBSc (Computer Science) (3221,3023); BSc (Mathematical & Statistical Sciences) (3227); BSc (Physical Science) (3233,3120)
Year level2
Main Outcomes

On completion of this module, students should be able to:

  • Can implement many algorithms that run correctly on computing machinery.
  • Can derive and explain the time and space complexity of algorithms.
  • Is able to tackle software problems from a procedural, object-oriented approach.
  • Construct models and produce working products from tools that the student has produced ab inito.
Main Content
  • Data structures.
  • Implementation of algorithms for manipulation.
  • The time and space complexity of the algorithms.
  • Efficiency of algorithms.
  • Correctness of algorithms by induction proofs.
  • Loop invariants.
  • Asymptotic bounds for algorithms.
Pre-requisite modulesCOS101 and  (COS114 or COS124)
Co-requisite modulesNone
Prohibited module CombinationNone
Breakdown of Learning TimeHoursTimetable Requirement per weekOther teaching modes that does not require time-table
Contact with lecturer: / tutor:42Lectures p.w.3 
Assignments & tasks:28Practicals p.w.6
Practicals:84Tutorials p.w.1
Tests & Examinations:9  
Total Learning Time200 10
Methods of Student Assessment

Continuous Assessment (CA): 50%

Final Assessment (FA): 50%

Assessment Module typeContinuous and Final Assessment