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 343 Data Structures – Java

3 credits

  • Prerequisites: CSCI-C 212 or INFO-I 211 and CSCI-C 241 or INFO-I 201
  • Delivery: On-Campus
  • This course systematically studies data structures encountered in computing problems, structure and use of storage media, methods of representing structured data, and techniques for operating on data structures.

    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.