CSCI2082 — Data Structures and Algorithms
CSCI 2082 - Data Structures and Algorithms CSCI 2082 - Data Structures and Algorithms Hours/Week: Lecture 3 Lab None Course Description: This course builds on the foundation provided by the CSCI 1081 , CSCI 1082 sequence to introduce the fundamental concepts of data structures and the algorithms that proceed from them. Topics include generic programming, recursion, the underlying philosophy of object-oriented programming, fundamental data structures (including stacks, queues, linked lists, and trees) and the basics of algorithmic analysis. MnTC Goals None g O(N log N) sorting algorithms; tree-processing algorithms Asymptotic algorithm complexity analysis Recursion: The concept of recursion, recursive mathematical functions, simple recursive procedures, divide-and-conquer strategies, recursive backtracking, implementation of recursion Algorithmic strategies, e.g. Brute-force algorithms; greedy algorithms; divide-and conquer; backtracking; branch-and-bound; heuristics; pattern matching and string/text algorithms; numerical approximation algorithms Generic programming and the use and creation of template data structures Fundamental data structures, e.g. Stacks, queues, linked lists, trees Fundamental computing algorithms, e.g simple searching and sorting algorithms (linear and binary search, selection, bubble, and insertion sort) Learning
Prerequisites: CSCI1082