(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.
(4 credit hours: 3 lectures + Three hours Lab.)
Parent Business Unit ID:
Prerequisite:
COMP2311 | OBJECT-ORIENTED PROGRAMMING
COMP2310 | OBJECT-ORIENTED PROGRAMMING
COMP231 | ADVANCED PROGRAMMING
