Time flies! By this time next week (Monday morning), you'll be sitting for your final exam.
This week, we'll focus on the importance of measuring and optimizing execution time to develop efficient programs. We'll explore techniques and profiling tools to identify "hot spots" and improve program performance.
Tomorrow (Tuesday), we'll wrap up lectures for the term, review the course, and address any questions you have about the exam. If you need help, online forum support and "Help Sessions" will be available later this week.
Don't forget to submit the assignment before today's deadline.
See you tomorrow!
Cheers
Ashesh
This week, we will continue exploring sorting algorithms , focusing on the lower bounds for comparison-based sorting. Additionally, we’ll discuss a sorting algorithm designed to address some challenges by imposing specific preconditions.
We will also cover three abstract data types - Heaps , Priority Queues , and Hashing - and their potential applications.
We’ll review important details about your final exam , including a sample exam and a few past papers. During our discussions, please feel free to ask any questions you may have regarding the final exam.
See you tomorrow!
Cheers
Ashesh
Last week, we introduced the fundamental concepts of graphs, including terminology, representation methods (adjacency matrix and adjacency list), and basic operations. This week, we will focus on Graph Abstract Data Types (ADTs) and their applications. We will explore depth-first search (DFS) and breadth-first search (BFS) as foundational graph traversal algorithms, accompanied by practical examples implemented in C. After discussing DFS and BFS, we will delve into advanced graph algorithms, examining how they reduce search space to derive solutions efficiently.
The assignment released last week is due Monday, Week 05. We strongly encourage you to begin soon if you haven't already.
If you have any questions or need assistance, please post in the forum or join one of the scheduled help sessions.
Remember to stay on top of the material as the summer term moves quickly!
Cheers,
Ashesh