With this course students can cover the following areas:
Overview, Preliminaries, List, Pointer Implementation of List, Advanced Linked List Structures, Stack, Queues, Tree Structures, Binary Trees, Applications of Tree Structures, Different Tree Structures, Graphs, Graph Traversals, Introduction to Algorithms, Analyzing Algorithms, Asymptotic Analysis of Algorithms, Recursion, Internal Sorting, Internal Sorting by Insertion, Internal Sorting by Selection, External Sorting, Searching Methods, Binary Search Trees, Hashing, Memory Management.
Open and Distance Learning
learning opportunities to anyone, anywhere, and at any time.
Faculty of Natural Sciences
The Faculty currently offers 29 programmes of study ranging from Certificate to Postgraduate level, as well as stand-alone courses and short courses. The main undergraduate programmes offered by the Faculty are BSc degree programme and BSc (Hons) degree programmes with nearly 5,000 students.