CS 110C Data Structures and Algorithms: C++ (4)
Credit, Degree Applicable
Analysis and design of computer algorithms and the underlying data structures using an object-oriented approach. Analysis of algorithm timing and efficiency. Study of lists, stacks, queues, trees, searching, sorting, and recursion. Introduction to Unified Modeling Language (UML), heaps, graphs, tables, hashing, and direct access files. Further study of abstract data types.
C-ID COMP 132
After successful completion of this course, students will be able to:
- Outcome 1: Predict the results of data structures, including lists, stacks, queues, trees, graphs, heaps, and hash tables, with associated algorithms such as insertion, deletion, retrieval, search, and traversal.
- Outcome 2: Evaluate data structures and algorithms for given problems, including sorting and searching, considering appropriateness and efficiency.
- Outcome 3: Design and implement data structures and algorithms, including array-based and linked list implementations.
- Outcome 4: Design and implement recursive solutions.