CS 111C Data Structures and Algorithms: Java (4)
Credit, Degree Applicable
The analysis and design of computer algorithms and their underlying data structures. Analysis of the timing and efficiency of algorithms. Study of lists, stacks, queues, trees, backtracking, searching, sorting and recursion. Introduction to graphs, hash tables, heaps, priority queues and direct access files. Further study of abstract data types and object-oriented programming.
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, hash tables and priority queues, 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 algorithms and data structures, including array-based and linked list implementations.
- Outcome 4: Design and implement recursive solutions.