COP 3530 Data Structure and Algorithm Design¶
This course is the first of a two-course sequence on algorithms and data structures. It is designed to provide students with a solid foundation in the design, analysis, and implementation of algorithms and data structures.
Students are expected to have a good understanding of the C++ programming language and basic knowledge of data structures and algorithms before starting this course.
Prerequisite Class¶
COP3014 Algorithm and Program Design
General Contents¶
Chapters:¶
- Chapter 1: Environment and Course Overview
- Chapter 2: Modular Design, GNU Make and Testing
- Chapter 3: Memory Management, Rule of Three
- Chapter 4: Algorithm Analysis
- Chapter 5: Recursion
- Chapter 6: Templates
- Chapter 7: List ADT and Linked-list
- Chapter 8: Stack, Queue, Deque ADTs
- Chapter 9: Sorting
- Chapter 10: Hashing
- Chapter 11: Tree
- Chapter 12: Heap and Priority Queue
- Chapter 13: Brute-Force and Backtracking Algorithm
- Chapter 14: Graph