DSAD Regular HO
DSAD Regular HO
Course Description
The course covers design, implementation and applications of basic and advanced data structures including
trees, graphs, bloom filters. The course also covers algorithm design techniques like greedy, dynamic, map
reduce etc. using examples from sorting, searching, graph theory, networking and number theory. The
complexity issues are also discussed further.
Course Objectives
No Objective
Introduce linear and non-linear data structures and best practices to choose appropriate data
CO2
structure for a given application
Teach various dictionary data structures (Lists, Trees, Heaps, Bloom filters) with illustrations on
CO3
possible representation, various operations and their efficiency
Discuss in detail various algorithm design approaches ( Greedy method, divide and conquer and
CO5 dynamic programming) with appropriate examples, methods to make correct design choice and the
efficiency concerns
Learning Outcomes:
No Learning Outcomes
Describe various fundamental and advanced data structures, their properties, algorithm design
LO1
techniques and various means of evaluating algorithms
Demonstrate the ability to evaluate algorithms, to select from a range of possible options, to provide
LO2
justification for that selection, and to implement the algorithm in a particular context.
LO3 Solve problems using Algorithms for Linear and Non-Linear Data Structures
LO4 Explain with a practical example, each of the algorithm design strategies (greedy, divide-and-
conquer, dynamic programming and map-reduce)
Relate the real-world problems to known data structures and algorithms leading to the recommend
LO6
appropriate solutions in representation and implementation.
LO8 Classify problems into complexity classes P and NP and to prove hardness of problems
Textbook(s):
CONTENT STRUCTURE
SESSION CONTENTS
Evaluation Scheme
Legend: EC = Evaluation Component
Important Information
Syllabus for Mid-Semester Test (Closed Book): Topics in Weeks 1-7
Syllabus for Comprehensive Exam (Open Book): All topics given in plan of study
Evaluation Guidelines:
1. EC-1 consists of two Assignments (25% weightage) and 2 Quizzes (best score of quiz will be
considered – 5%) . Announcements regarding the same will be made in a timely manner.
2. For Closed Book tests: No books or reference material of any kind will be permitted.
Laptops/Mobiles of any kind are not allowed. Exchange of any material is not allowed.
3. For Open Book exams: Use of prescribed and reference text books, in original (not photocopies) is
permitted. Class notes/slides as reference material in filed or bound form is permitted. However,
loose sheets of paper will not be allowed. Use of calculators is permitted in all exams.
Laptops/Mobiles of any kind are not allowed. Exchange of any material is not allowed.
4. If a student is unable to appear for the Regular Test/Exam due to genuine exigencies, the student
should follow the procedure to apply for the Make-Up Test/Exam. The genuineness of the reason for
absence in the Regular Exam shall be assessed prior to giving permission to appear for the Make-up
Exam. Make-Up Test/Exam will be conducted only at selected exam centers on the dates to be
announced later.
It shall be the responsibility of the individual student to be regular in maintaining the self-study schedule as
given in the course handout, attend the lectures, and take all the prescribed evaluation components such as
Assignment/Quiz, Mid-Semester Test and Comprehensive Exam according to the evaluation scheme
provided in the handout.