CS 260 Computer Science 3: Data Structures

1. Explain the properties, interfaces, and behaviors of basic abstract data types, such as stacks, queues, lists, trees, heaps, hash tables, sets, maps, and graphs. 
2. Read an algorithm or program code segment that contains iterative constructs and analyze the asymptotic time complexity of the algorithm or code segment. 
3. Analyze the asymptotic time complexity of the fundamental operations associated with common data structures and their algorithms. 
4. State the space utilization of common data structures in terms of the long-term storage needed to maintain the structure, as well as the short-term memory requirements of fundamental operations, such as sorting. 
5. Design and implement general purpose, reusable data structures that implement one or more abstractions. 
6. Compare and contrast the operation of common data structure implementations in terms of time complexity, space utilization, and the abstract data types they implement. 

Statewide General Education Outcomes:   

1. Gather, comprehend, and communicate scientific and technical information in order to explore ideas, models, and solutions and generate further questions. 
2. Apply scientific and technical modes of inquiry, individually, and collaboratively, to critically evaluate existing or alternative explanations, solve problems, and make evidence-based decisions in an ethical manner. 
3. Assess the strengths and weaknesses of scientific studies and critically examine the influence of scientific and technical knowledge on human society and the environment. 

• Introduction to Complexity Theory and Asymptotic Time and Space Analysis 
• Linear Structures and Sorting 
• Tree Structures (Binary, Multi-way, and General Trees) 
• Graph Structures and Common Graph Algorithms 
• Unstructured Containers (Hash Tables, Sets, Bags, Maps)