Chandan Karfa

CS591H: Data Structures and Algorithms and CS593: Data Structures and Databases Lab

Announcements:

The lab of 31st August is rescheduled to 3rd September due to Techniche.
CS591H: Dr. A Awekar will take classes from 24th July to 13th August. Dr. C. Karfa will take classes from 20th August to 12th September.
CS593: Dr. A. Awekar will conduct the Lab from 30th July to 20th August. Dr. C. Karfa will conduct Lab from 24th August to 14th September.
Welcome

Cource Overview

Fundamentals of data structures, algorithm build foundations for the students of diverse background

Pre-requisites: None

Instructors

Dr. Chandan Karfa
Dr. Amit Awekar

CS591H Class Timing and Venue:

Tuesday: 9AM-9:55AM, Wednesday: 10AM-10:55AM, Thursday: 11AM-11:55AM
Venue: 2102

CS593 Lab Timing and Venue:

Saturday: 9AM-12PM
Venue: CSE MTech Lab

Syllabus:

Review of fundamental Data Structures Models of Computation: random access machines, space and time complexity measures, lower and upper bounds
Design techniques: the greedy method, divide-and-conquer, dynamic programming, backtracking;
Sorting and Searching
Graph algorithms Hashing: separate chaining, linear probing, quadratic probing
Search Trees: binary search trees, AVL trees, B-trees.

Text Book:

[Cormen] T H Cormen, C E Leiserson, R L Rivest and C Stein, Introduction to Algorithms, 3/e, MIT Press, 2009.
[TLA] A. M. Tannenbaum, Y Langsam and M J Augenstein, Data Structures Using C, Prentice Hall India, 1996.

References:

[Tardos] Jon Kleinberg and Eva Tardos, Algorithm Design, 1/e, Pearson Education, 2006.

CS591H Grade Calculation

Quiz 1	25%
Quiz 2	25%
Exam	50%

CS593 Grade Calculation

Each Lab

10%

TAs:

CS591H Clsss Schedule

Sl No	Date	Topic	Resources
1	21st August 2019	Sorting, Bubble Sort, Selection Sort	TLA
2	22nd August 2019	Insertion Sort, Merge Sort	TLA
3	27th August 2019	Heap, Build Heap	Cormen
4	28th August 2019	Heap Sort, Quick Sort	Cormen
5	29th August 2019	Binary Search, Hashing	Cormen
6	3rd September 2019	Graph: Representation, BFS	Cormen
7	4th September 2019	Graph: BFS, DFS	Cormen
8	5th September 2019	Graph: Topological Sort	Cormen
9	11th September 2019	Greedy Approach for Spanning Tree: Prim, Kruskal	Cormen
10	12th September 2019	Dynamic Programming for all pair shortest paths	Cormen
11	12th September 2019	Quiz2
12	16th September 2019	End-Sem Exam (9AM - 11AM)

CS593 Lab Schedule

Sl No	Date	Topic	Resources
1	3rd September 2019	Sorting	Assignment1
3	7th September 2019	Heap, Hashing	Assignment2
4	14th September 2019	Graph	Assignment3