Lov Kumar : Lovkumar@hyderabad - Bits-Pilani - Ac.in Spitambare@wilp - Bits-Pilani - Ac.in

FIRST SEMESTER 2022-2023
Course Handout Part II

Date: 29-08-2022
In addition to Part-I (General Handout for all courses appended to the time table) this portion gives further
specific details regarding the course.
Course No. : CS F211

Course Title : Data Structures & Algorithms
Instructor-in-Charge : Dr Lov Kumar (lovkumar@hyderabad.bits-pilani.ac.in )
Instructor : Sanjeevkumar Pitambare ( spitambare@wilp.bits-pilani.ac.in)
Scope and Objectives of the Course:

Data Structures & Algorithms is a foundational course in Computer Science. It pertains to the design of efficient
logical structures to store, access &manipulate data and the design of efficient algorithms to solve
computational problems. The course starts with defining precise notions of measuring efficiency of algorithms.
The course covers design, implementation and analysis of data structures such as linked lists, stacks, queues,
heaps, binary search trees and graphs. It discusses sorting and search techniques, with detailed performance
analysis. Additionally, the course covers algorithm design techniques such as Divide-and Conquer, Greedy
Algorithms and Dynamic Programming, with applications to computational problems.
The objectives of the course are for the student to be able to

 Understand asymptotic time complexity and analyze algorithms using this formalism.
 Understand basic data structures with performance analysis and obtain the ability to write correct and
efficient implementations.
 Understand basic searching and sorting techniques.
 Understand basic algorithmic design techniques and acquire the ability to apply these techniques to
design correct and efficient algorithms to pertinent problems.
 Understand rudimentary notions of time complexity lower bounds, especially in relation to search and
sorting problems.
Textbook:
T1. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein. Introduction to Algorithms, MIT Press
(Indian reprint: Prentice Hall of India), 3rd Edition, 2009.
Reference books
R1. M.T. Goodrich and R. Tamassia, Algorithm Design: Foundations, Analysis and Internet
examples, John Wiley & Sons, 2006.
R2. J. Kleinberg and E. Tardos,Algorithm Design. Pearson Education, 2013.
R3. S. Dasgupta, C. Papadimitriou, U. Vazirani, Algorithms, McGraw-Hill (Indian edition), 2017.
Course Plan:
Chapter in
Lecture
Learning objectives Topics to be covered the Text
No.
Book
Introducing the
1-2 importance of data Course introduction. 1
structures & algorithms
Introduce asymptotic
notation formalism for
3-4 Growth of functions 3
analyzing performance
of algorithms
Sorting algorithms: Insertion sort, Bubble
Understand standard sort, Quick sort, Merge sort, Radix sort and
5-12 sorting techniques with Bucket sort. 2, 7, 8
performance analysis Lower bounds on complexity of comparison-
based sorting algorithms.
Understand standard
selection techniques Selection algorithms. Linear-time selection
13-15 9
with performance algorithm via median of medians
analysis
Understand elementary Elementary Data Structures: Stacks, Queues,
16-25 10, 6
data structures Linked lists, Priority queues, Heaps, Heapsort
26-27 Understand hash tables Hash tables 11

Understand binary
search techniques and Binary search trees, balancing binary search
28-30 12, 13
techniques to balance trees, Red-Black Trees, Skip lists
them
To understand standard
algorithm design
Algorithm design techniques: Divide and
techniques and acquire
31-37 conquer, Greedy algorithms, Dynamic 4, 15, 16
the ability to correctly
Programming, Backtracking, Branch & Bound
apply them to
problems.
To understand basics of
38 Amortized analysis 17
amortized analysis
To understand basic
graph algorithms and Graph algorithms: Traversals, Shortest Path
39-42 22, 24, 25
their performance Algorithms
analysis
Evaluation Scheme:
Nature of
Component Duration Weightage Date & Time
Component
Mid semester 01/11 11.00 -
90 minutes 30% Closed book
Test 12.30PM
One before
Quiz 30 minutes 10% Midsem and one Open Book
after Midsem
One before
3 Lab Midsem (5%) and
Lab Assignments 25% Open Book
Assignments two after Midsem
(20%)
Comprehensive
180 minutes 35% 20/12 AN Closed book
Examination
Chamber Consultation Hour: It will be on Google Meet at a time that will be announced in class.
Notices: Will be posted online on the Google Classroom. Students are expected to access notifications from
Google Meet that they would need to check several times a day. Students are responsible for keeping up with
announcements.
Make-up Policy:
No makeup exam allowed without prior permission.
Academic Honesty and Integrity Policy:

Academic honesty and integrity are to be maintained by all the students throughout the semester and no type of
academic dishonesty is acceptable.
INSTRUCTOR-IN-CHARGE
CS F211

Lov Kumar : Lovkumar@hyderabad - Bits-Pilani - Ac.in Spitambare@wilp - Bits-Pilani - Ac.in

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Lov Kumar : Lovkumar@hyderabad - Bits-Pilani - Ac.in Spitambare@wilp - Bits-Pilani - Ac.in

Uploaded by

Copyright:

Available Formats

FIRST SEMESTER 2022-2023

Course Handout Part II

Course No. : CS F211

Scope and Objectives of the Course:

The objectives of the course are for the student to be able to

26-27 Understand hash tables Hash tables 11

Academic Honesty and Integrity Policy:

You might also like