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. Graph theory, dynamic programming. (4 credit hours: 4 lectures)
Parent Business Unit ID:
Prerequisite:
COMP133 | COMPUTER AND PROGRAMMING
COMP132 | INTRODUCTION TO COMPUTER AND PROGRAMMING
COMP230 | COMPUTER AND PROGRAMMING
COMP142 | COMPUTER AND PROGRAMMING
