(ForComputer Engineering 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. Engineering related applications
(3 credit hours)
Parent Business Unit ID:
Prerequisite:
COMP132 | INTRODUCTION TO COMPUTER AND PROGRAMMING
COMP230 | COMPUTER AND PROGRAMMING
COMP142 | COMPUTER AND PROGRAMMING
