CSC 212 Data Structures (Fall 2020)

Overview

This course covers the fundamental concepts of data structures. Performance measurement of algorithms. Implementation and use of lists, stacks, queues, priority queues, trees, heap, hash tables and graphs.

Course outcomes

Upon the completion of this course, students will be able to:

1. Use fundamental data structures such as lists, stacks, queues, trees, sets, maps and graphs to solve problems.
2. Implement a data structure based on a given specification.
3. Write recursive algorithms to implement and use data structures.
4. Determine the time and space complexity of data structures and associated algorithms.
5. Choose the most appropriate data structure for a given problem.
6. Design appropriate data structures for a given problem.
7. Write programs using standard library data structures.

Textbook

Data Structures and Algorithms in Java, 6th edition, by M.T. Goodrich and R. Tamassia. John Wiley and Sons, Inc., ISBN: 0-471-73884-0

Course material

Available on LMS.