(For Computer Science Students) Data type and structures; Abstract data types and encapsulation; Recursion; Proof of correctness of algorithms. Complexity of algorithms (BigO) Linked Lists; Stacks; Queues, trees; Binary trees; heap, Hashing, Sorting and Searching, Graphs,. Traversing, shortest path; and File organization. Software related applications. Prerequisite: COMP231
Parent Business Unit ID:
Prerequisite:
COMP231 | ADVANCED PROGRAMMING
