 | Use this page to maintain syllabus information, learning objectives, required materials, and technical requirements for the course. |
| CS 25300 - Data Structures And Algorithms For DS/AI |
|---|
|
Associated Term:
Spring 2024
Learning Outcomes: 1. Apply an asymptotic analysis to given code and explain its significance. 2. Analyze asymptotic performance of data structures and algorithms with respect to time and space. 3. Describe different implementations of a data structure and explain when what implementation is most efficient. 4. Demonstrate how to add functionality to a data structure to efficiently handle new operations and queries. 5. Assess how the choice of data structures and algorithm design methods impacts the performance of programs. 6. Make effective and appropriate use of data structures such as stacks, queues, linked lists, hash tables, Bloom filters, priority queues, dictionaries, search trees, tries, and graphs. Required Materials: Technical Requirements: |
| Return to Previous | New Search |
 |