CS F211

SECOND SEMESTER 2018-2019
Course Handout Part II

Date:07-01-2019
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 : N.L.Bhanu Murthy
Scope and Objective of the Course:

The main objective of this course is to introduce structures for storing data and algorithms for
retrieving/manipulating data. It incorporates techniques for designing such structures. The course covers design,
implementation and applications of data structures including linked lists, stacks, queues, heaps, hash tables,
balanced binary search trees, and graphs. This course also introduces mathematical and experimental techniques
for analyzing the complexity of algorithms. The course discusses sorting and searching algorithms with detailed
analysis on complexity of algorithms. The course introduces algorithm design techniques like Divide and
Conquer, Greedy, Dynamic Programming to solve various interesting problems.
At the end of the course the student should be able to
 Understand Asymptotic notation and apply the same to analyze algorithms.
 Understanding of basic data structures with the complete analysis and implementation details.
 Understanding of sorting and searching algorithms.
 Understanding of basic algorithmic techniques.
 Apply appropriate data structure and algorithms to solve problems.
Textbooks:
T1. Cormen T.H., Leiserson, C.E., Rivest, R.L., and C. Stein. Introduction to
Algorithms, MIT Press, Second Edition (Indian reprint: Prentice-Hall).
Reference books
T1. Micheal T. Goodrich and Roberto Tamassia: Algorithm Design: Foundations, Analysis and
Internet examples (John Wiley &Sons, Inc., 2002)
R2. Jon Kleinberg and Eva Tardos. Algorithm Design. Pearson Education. (2007)
R3. Sanjoy Das Gupta, Christos Papadimitriou, Umesh Vazirani, Algorithms, Tata McGraw-Hill
Publishers
Course Plan:
Chapter in
Lecture No. Learning objectives Topics to be covered the Text
Book
To introduce data T1 –
1–2 structures and Course Introduction & Motivation. 1
algorithms
To understand analysis Growth of Functions & T1 –
3–4 2,3,4
of algorithms Asymptotic Notation
5 - 13 Sorting Algorithms – Bubble Sort, Quick T1 – 6, 7, 8
Sort, Insertion Sort, Merge Sort, Heap
To understand sorting
Sort, Radix Sort and Bucket Sort
algorithms
Lower Bound on Complexity of Sorting
Algorithms
14 - 16 To understand selection Selection Algorithms, MoM problems T1 - 9
techniques
17 – 25 Data Structures – Stacks, Queues, T1 –
Trees, Priority Queues, Linked 10
To understand base data
Lists, Heaps,
structures
(Approaches, Implementation
Issues, Complexity & Efficiency)
27 – 28 Data Structures – Hash Tables (Separate T1 –
To understand hash
Chaining vs. Open Addressing, 11
tables
Probing, Rehashing)
29 – 30 Data Structures –Binary Search T1 –
Tree, Balanced Binary Search 12,
To understand binary Trees - Red-Black Trees 13
search trees Skip list (Approaches,
Implementation Issues,
Complexity & Efficiency)
31 – 37 Algorithm Techniques – Divide & T1 –
To understand algorithm Conquer, Greedy, Dynamic Programming, 4, 15,
techniques Back Tracking and Branch & Bound 16
38 – 42 Graphs & Graph Algorithms: T1 –

Representation schemes, Traversals, 22,
To understand graph
Problems on Weighted Graphs - Shortest 24
algorithms
Path Algorithms: Dijkstra’s, Floyd-
Warshall’s etc)
Evaluation Scheme:
Nature of
Component Duration Weightage (%) Date & Time
Component
Mid Test 90 minutes 25% Closed Book
13/3
1.30 -3.00 PM
Lab – Continuous Every 35% (Assignments Open Book
Evaluation & Final Test assignment by Continuous
will be Evaluation (25%)
evaluated. &
TBD
Final lab Final Lab Test
examinatio (10%))
n will be of
two hours
Comprehensive 3 hours 40% Closed Book
07/05 FN
Chamber Consultation Hour: To be announced in the class.
Notices: All notices pertaining to this course will be displayed on the CS & IS Notice Board.
Make-up Policy: Prior Permission is must and Make-up shall be granted only in genuine cases based on
individual’s need, circumstances. The recommendation from chief warden is necessary to request for a make-up.
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

Uploaded by

Copyright:

Available Formats

CS F211

Uploaded by

Document Information

Original Description:

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

CS F211

Uploaded by

Copyright:

Available Formats

SECOND SEMESTER 2018-2019

Course Handout Part II

Course No. : CS F211

Scope and Objective of the Course:

38 – 42 Graphs & Graph Algorithms: T1 –

Chamber Consultation Hour: To be announced in the class.

You might also like