CSCI-C 343 Data Structures
3 credits
- Prerequisite(s): CSCI-C 212 OR CSCI 24000 OR CSCI-A 255 AND CSCI-C 241 OR INFO-I 201 OR CSCI 34000
- Delivery: On-Campus, Online
- Semesters offered: Fall, Spring, Summer (Check the schedule to confirm.)
Description
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
- Describe, explain, and use abstract data types, including stacks, queues, lists, sets, and maps. CS 1
- 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.) CS 1
- Implement various algorithms for searching and sorting, including linear search, binary search, insertion sort, selection sort, merge sort, quicksort, and heap sort. CS 1
- Read and write recursive algorithms, and determine when recursion is suitable. CS 1
- Describe an algorithm's asymptotic performance and its practical implications. CS 1
Policies and Procedures
Please be aware of the following linked policies and procedures. Note that in individual courses instructors will have stipulations specific to their course.