OSU-CS260
From
(Created page with ':'''CS 261 – Data Structures''' <u>Catalog Description</u>: Complexity Analysis. Approximation Methods. Trees and Graphs. File Processing. Binary Search Trees. Hashing. Stora...') |
|||
| Line 15: | Line 15: | ||
<u>Measurable Student Learning Outcomes</u>:<br> At the completion of the course, students will be able to…<br> 1. Describe the properties, interfaces, and behaviors of basic abstract data types, such as collection, bag, indexed collection, sorted collection, stack, and queue (Level 1; ABET Outcomes: A, J, I)<br> 2. Read an algorithm or program code segment that contains iterative constructs and analyze the asymptotic time complexity of the algorithm or code segment (Level 4; ABET Outcomes: A, J)<br> 3. State the asymptotic time complexity of the fundamental operations associated with a variety of data structures, such as vector, linked list, tree, and heap (Level 1; ABET Outcomes: A, J)<br> 4. Recall 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 (Level 1; ABET Outcomes: A, B, J)<br> 5. Design and implement general-purpose, reusable data structures that implement one or more abstractions (Level 4; ABET Outcomes: A, B, C, K, I)<br> 6. Compare and contrast the operation of common data structures (such as linear structures, priority queues, tree structures, hash tables, maps, and graphs) in terms of time complexity, space utilization, and the abstract data types they implement (Level 6; ABET Outcomes: A, B, J) | <u>Measurable Student Learning Outcomes</u>:<br> At the completion of the course, students will be able to…<br> 1. Describe the properties, interfaces, and behaviors of basic abstract data types, such as collection, bag, indexed collection, sorted collection, stack, and queue (Level 1; ABET Outcomes: A, J, I)<br> 2. Read an algorithm or program code segment that contains iterative constructs and analyze the asymptotic time complexity of the algorithm or code segment (Level 4; ABET Outcomes: A, J)<br> 3. State the asymptotic time complexity of the fundamental operations associated with a variety of data structures, such as vector, linked list, tree, and heap (Level 1; ABET Outcomes: A, J)<br> 4. Recall 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 (Level 1; ABET Outcomes: A, B, J)<br> 5. Design and implement general-purpose, reusable data structures that implement one or more abstractions (Level 4; ABET Outcomes: A, B, C, K, I)<br> 6. Compare and contrast the operation of common data structures (such as linear structures, priority queues, tree structures, hash tables, maps, and graphs) in terms of time complexity, space utilization, and the abstract data types they implement (Level 6; ABET Outcomes: A, B, J) | ||
| - | + | <!--Please be mindful of the talk page discussions that have determined this template's appearance.--> | |
Current revision as of 19:05, 31 October 2011
- CS 261 – Data Structures
Catalog Description: Complexity Analysis. Approximation Methods. Trees and Graphs. File Processing. Binary Search Trees. Hashing. Storage Management.
Credits: 4 Terms Offered: Fall, Winter, Spring
Prerequisites: CS 162, MTH 231
Courses that require this as a prerequisite: CS 275, CS 311, CS 321, CS 325, CS 381, CS 440
Structure: Three 50-minute (or two 80-minute) lectures, and one 50-minute recitation per week
Course Content:
• Abstract data types (collection, bag, stack, queue, deque, indexed, set, etc.)
• Data structures (implementations of ADTs, including vectors, linked lists, sorted vectors, skiplists, binary search trees, AVL trees, hash tables)
• Complexity analysis (space, time requirements)
Measurable Student Learning Outcomes:
At the completion of the course, students will be able to…
1. Describe the properties, interfaces, and behaviors of basic abstract data types, such as collection, bag, indexed collection, sorted collection, stack, and queue (Level 1; ABET Outcomes: A, J, I)
2. Read an algorithm or program code segment that contains iterative constructs and analyze the asymptotic time complexity of the algorithm or code segment (Level 4; ABET Outcomes: A, J)
3. State the asymptotic time complexity of the fundamental operations associated with a variety of data structures, such as vector, linked list, tree, and heap (Level 1; ABET Outcomes: A, J)
4. Recall 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 (Level 1; ABET Outcomes: A, B, J)
5. Design and implement general-purpose, reusable data structures that implement one or more abstractions (Level 4; ABET Outcomes: A, B, C, K, I)
6. Compare and contrast the operation of common data structures (such as linear structures, priority queues, tree structures, hash tables, maps, and graphs) in terms of time complexity, space utilization, and the abstract data types they implement (Level 6; ABET Outcomes: A, B, J)
