Data Structures and Algorithms

Undergraduate

An introduction to the programming and analysis of linear and non-linear internal (main store) data structures and associated algorithms. Topics include the formal notion of an algorithm, elementary time and space complexity; linear lists (such as stacks, queues, linked structures.); non-linear lists (trees, binary trees); recursion; sorting techniques (such as heap sort, quick sort, merge sort, shell sort.); searching techniques (such as binary search, binary search trees, red-black trees, hashing.); algorithm design paradigms (such as divide-and-conquer, dynamic programming, greedy algorithms); and applications. (Prerequisite: COMP-1000 and COMP-1410. Restricted to Computer Science students or permission of the School of Computer Science.) (3 lecture hours and 1.5 laboratory hours a week.) COMP-2547 Applied Algorithms and Data Structures This course provides an introduction to the programming and analysis of both linear and non-linear data structures and their associated algorithms. Topics include the formal notion of algorithms; basics of time and space complexity; linear data structures (such as stacks, queues, linked lists); non-linear data structures (such as trees, binary trees); recursion; sorting techniques (such as heap sort, quick sort, merge sort); searching techniques (such as binary search, binary search trees, hashing); algorithm design paradigms (such as divide-and-conquer, greedy algorithms); and applications. (Prerequisite: COMP- 1000 and 2087, Prerequisite or Co-requisite: COMP-2087. Antirequisite: COMP-2540) (May not be used to fulfill the major requirements of any major or joint major in Computer Science, except for the Bachelor of Information Technology (BIT) program. This course cannot be taken as a substitute for COMP-2540) (3 lecture hours a week).