T AHIR I QBAL TAHIR . IKHAN @ GMAIL . COM Lecture 1 D ATA S TRUCTURES AND A LGORITHMS
COURSE OBJECTIVE The main objective of the course is to teach the students how to select and design data structures and algorithms that are appropriate for real world problem solving. Developing basic algorithms for manipulating stacks, queues, linked lists, trees, graphs. Developing the data structures (abstract data types) for implementing the aforementioned algorithms. Developing recursive algorithms for application in trees and graphs. This course is also about showing the correctness of algorithms and studying their computational complexities.
COURSE OUTCOMES On the successful completion of the course, students are expected to: Understand the principle behind the use of Abstract Data Types (ADT) Learn the commonly used ADT’s and their implementation Learn basic algorithms and basic methods used in design of algorithms Learn to compute the cost and benefits of different data structures and algorithms and how to select algorithms and data structures for a particular problem.
C OURSE I NFORMATION Textbooks Data Structures Using C and C++ by Y. Langsam, M. J. Augenstein, A. M. Tenenbaum Introduction to Data Structures in C by Ashok N. Kamthane Data Structures and Algorithms by A. V. Aho, J. E. Hopcroft, J. D. Ullman Algorithms in C++ by Robert Sedgewick
C OURSE O UTLINE
- Fall '17
- Tahir Iqbal