| |
May 04, 2024
|
|
|
|
|
CS 2852 - Data Structures3 lecture hours 2 lab hours 4 credits
Course Description
This course covers the organization of data and the algorithms that act upon them. The topics of arrays, linked lists, stacks, queues, trees, sets, and hash tables are introduced. Fundamentals of algorithm performance are also introduced, with an emphasis placed on time complexity analysis. Laboratory activities include implementation of data structures as well as the application of data structures from standard libraries. (prereq: SE 1021 )
Course Learning Outcomes
Upon successful completion of this course, the student will be able to:
• understand and apply complex data structures and algorithms
• use appropriate algorithms (and associated data structures) to solve problems
• have a thorough understanding of commonly used library data structures
• analyze the time complexity of algorithms
• understand the use of recursion in problem solving
• use data structures in software design and implementation
• apply standard library data structures in software design
• select appropriate data structures for a given application
Prerequisites by Topic
• Enterprise Architect
• Java GUI
• Event-driven programming
• Exception handling
• File I/O
• ArrayList
• Interfaces/Abstract classes
Course Topics
• Exams (2 classes)
• Introduction (1 class)
• Java Collections Framework (1 class)
• Array based lists (2 classes)
• Iterators (1 class)
• Cloning (1 class)
• Linked lists (3 classes)
• Asymptotic Algorithm Analysis (2 classes)
• Stacks and Queues (1 class)
• Recursion (2 classes)
• Generics (1 class)
• Trees (5 classes)
• TreeMap and TreeSet (1 class)
• Hash tables (2 classes)
• HashMap and HashSet (1 class)
• Review (3 classes)
Laboratory Topics
• Benchmarking (1 session)
• ArrayList/Linked lists (3 sessions)
• Recursive algorithms (1 session)
• Stack/Queue (1 session)
• Tree (2 sessions)
• Hash table (1 session)
Coordinator
Christopher Taylor
Add to Portfolio (opens a new window)
|
|
Skip to Main Content
