ECE 36800 - Data Structures
Course Details
Lecture Hours: 3 Credits: 3
Counts as:
Normally Offered:
Each Fall, Spring
Catalog Description:
Provides insight into the use of data structures. Topics include stacks, queues and lists, trees, graphs, sorting, searching, and hashing.
Course Objectives:
To provide insight into the use of data structures. To prepare the students for advanced software courses. Students use their previous programming experience to design and test software as part of team projects using sorting, searching, tree-based and graph-based techniques learned in this course.
Required Text(s):
- Algorithms in C, Part 5: Graph Algorithms , 3rd Edition , Robert Sedgewick , Addison Wesley , 2002 , ISBN No. 9780201316636
- Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching , 3rd Edition , Robert Sedgewick , Addison Wesley , 1999 , ISBN No. 9780201314526
Recommended Text(s):
None.
Lecture Outline:
| Hours | Major Topics |
|---|---|
| 1 | Introduction |
| 3 | Complexity and Asymptotic Notation |
| 6 | Stacks, Queues, Deques; Abstract Data types; Implementation; Arrays, Pointers, Linked Lists; Applications |
| 3 | Stack and Recursion |
| 9 | Sorting; Exchange, Selection, Tree, Insertion, Merge |
| 8 | Searching; Sequential, Binary, Tree, and Hashing; Balanced Trees, B-Trees, Tries |
| 12 | Graphs; Graph Traversal, PERT Diagrams, Spanning Trees, Shortest Paths |
Engineering Design Content:
- Synthesis
- Analysis
- Construction
- Testing
- Evaluation
Assessment Method:
A student who receives a passing grade must have satisfied all of the course outcomes to some minimum degree. By awarding the student a passing grade, the instructor confirms that all of the outcomes have been satisfied. Outcomes based on material covered only during the final week or two of the course should be avoided.