Same school, new name. The School of Informatics and Computing is changing its name effective January 11, 2023. Learn more about the name change

CSCI-C 310 Data Structures – Python

3 credits

  • Prerequisites: CSCI-A 205 or CSCI-A 202 or CSCI 24000 or INFO-B 211
  • Delivery:
  • The focus of this course is on solving computational problems that involve manipulating collections of data. We will study a core set of data abstractions, data structures, and algorithms that provide a foundation for writing efficient programs.

    Learning Outcomes

    1. Describe, explain, and use abstract data types, including stacks, queues, lists, sets, and maps.
    2. Implement those data types using both contiguous and linked representations. (Contiguous representation mechanisms include arrays and hash tables. Linked representation mechanisms include singly and doubly linked lists and trees.)
    3. Implement various algorithms for searching and sorting, including linear search, binary search, insertion sort, selection sort, merge sort, quicksort, and heap sort.
    4. Read and write recursive algorithms.
    5. Know when recursion is and is not appropriate.
    6. Describe an algorithm’s asymptotic performance and its practical implications.


    There is not a syllabus available for this course.