CS20A - Data Structures |  |
This course uses the following course codes:
- COMP 2000
- CS20A
Number of credits: 4
This course has the following prerequisites:
This course has no corequisites.
The assessment for the course is as follows:
This course has coursework assessment.
In course assignments weight: 25%
Final exam: 75%
Course syllabus
- Stacks, queues, linked lists.
- Methods for solving the search and insert problem.
- Hashing
Hash function Clustering Methods of resolving collisions, e.g. linear, quadratic, chaining, double hashing
- Trees
Binary trees Search trees Tree traversal Analysis of binary search tree algorithm
- Heaps
Priority queues
- Internal and external sorting
Shell sort quicksort heapsort mergesort Polyphase merge sort Technique of replacement selection. Topological sort
- Abstract data types
Concepts representation and implementation
- Graph concepts and terminology
Representation of graphs Depth-first and breadth-first traversals Minimal cost paths Minimal cost spanning trees
- Matrices
Efficiently storing and manipulating matrices with special properties, e.g. symmetric, triangular, band, sparse and others
