[go: up one dir, main page]
Scribd
Upload
127 views2 pages

E0 251 Aug 3:1 Data Structures and Algorithms: Instructor

This document provides information about a course on data structures and algorithms taught by Sathish Govindarajan. The course covers basic data structures like arrays and linked lists, as well as standard data structures like heaps and binary search trees. It teaches algorithm design techniques including divide and conquer, greedy algorithms, and dynamic programming. The course also covers graph algorithms, lower bounds, NP-completeness, advanced data structures, and randomized and approximation algorithms. Students are evaluated based on assignments, a midterm exam, and a final exam. The textbook is Data Structure and Algorithm Analysis in C by Mark Allen Weiss and Algorithm Design by Kleinberg and Tardos.

Uploaded by

Boul chandra Garai
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
127 views2 pages

E0 251 Aug 3:1 Data Structures and Algorithms: Instructor

This document provides information about a course on data structures and algorithms taught by Sathish Govindarajan. The course covers basic data structures like arrays and linked lists, as well as standard data structures like heaps and binary search trees. It teaches algorithm design techniques including divide and conquer, greedy algorithms, and dynamic programming. The course also covers graph algorithms, lower bounds, NP-completeness, advanced data structures, and randomized and approximation algorithms. Students are evaluated based on assignments, a midterm exam, and a final exam. The textbook is Data Structure and Algorithm Analysis in C by Mark Allen Weiss and Algorithm Design by Kleinberg and Tardos.

Uploaded by

Boul chandra Garai
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

E0 251 Aug 3:1

Data Structures and Algorithms

Instructor
Sathish Govindarajan
Email: gsat@iisc.ac.in
Teaching Assistant

Email:

Department: Computer Science and Automation


Course Time: Tue, Thur 9:30-11am
Lecture venue: Room 252, CSA
Detailed Course Page: https://drona.csa.iisc.ernet.in/~gsat/Course/DSA/

Announcements

Brief description of the course


The course is intended for postgraduate students in non-computer science departments who would like to learn

data structures and algorithms. It would be helpful if the student has taken an undergraduate level course on

data structures/algorithms/programming during their bachelors degree. The course covers the below topics

with mathematical rigor.

The course reviews basic data structures like arrays, linked Lists, stacks and queues. Then, it covers heap and

binary search tree data structures. Algorithm design techniques like divide and conquer, greedy, dynamic

programming are covered using few illustrative problems. Algorithms for graph problems are then covered.

Lower bounds and NP-completeness is then covered. The last part of the course overviews advanced data

structures and algorithms. Union-Find, splay trees, hashing data structures are covered. Finally, randomized

and approximation algorithms are covered.


Prerequisites
None
Syllabus

Page 1/2
Review of Basic Data Structures - Arrays, Linked Lists, Stacks, Queues

Standard Data Structures - Heaps, Balanced Search Trees

Algorithmic Paradigms - Divide and Conquer, Greedy, Dynamic Programming

Graph Algorithms - Traversals, Shortest Paths, MST

Lower bounds, Reductions, NP Completeness

Advanced Data Structures - Union Find, Hashing, Splay Trees

Advanced Algorithms - Randomized Algorithms, Approximation Algorithms


Course outcomes
After taking this course, a student would

1) Have a good knowledge of heap, search tree data structures

2) Apply these data structures for solving other problems

3) Have a understanding of various algorithm design techniques

4) Design algorithms for new problems using these techniques

5) Have a high level understanding and exposure to advanced topics in data structures and algorithms

6) Be able to implement the studied data structures and algorithms in a high level programming language
Grading policy
30% for Assignments

30% for Mid-term Exam

40% for Final Exam


Assignments

Resources
Textbook
Data Structure and Algorithm Analysis in C by Mark Allen Weiss
Algorithm Design by Kleinberg and Tardos

Lecture Notes

Page 2/2

You might also like