Course Teaching: [DATA STRUCTURES AND ALGORITHMS] [2019/2020]
Course Overview
This course discusses fundamental concepts of data structures and the algorithms that proceed from them. Topics to be covered include the implementation and use of linked lists, stacks, queues, trees, priority queues, heaps and graphs, with an emphasis on recursion, abstract data types, object oriented design, and associated algorithms and complexity issues.
Course Snapshot
- Credits: [3]
- Audience: [Undergraduates]
- Delivery Mode: [In-person]
- No. of Students: [35]
- Students Evaluation: [N/A]
Teaching Objectives
Understand the concept of data structures and algorithms, Deduce algorithm complexities and Design and implement abstract data types.
Analyze and experiment different searching and sorting algorithms.
Apply practical skills through a team-based project using data structures
Assessment & Student Engagement
- Strategies for Engagement: (discussions, group work, etc.)
Assessment Methods Weighting Quizzes 5% Assignment 5% Exam 90%
Reflections
- What worked well:
- What could be improved:
- Student feedback highlights:
Resources
Michael T. Goodrich and Roberto Tamassia, Data Structures and Algorithms in Java, 6th Edition, 2014, John Wiley & Sons, Inc., ISBN-10: 1118771338, ISBN-13: 978-1118771334
Testimonials (optional)
If you’ve taken this course and you’re visiting this site, feel free to drop a comment and share your thoughts or experience!