CS206M: Data Structures and Algorithms (IIT Guwahati, Spring 2013)

12:00-1:00 PM (Monday, Wednesday, Friday), CSE seminar room

http://www.iitg.ernet.in/awekar/teaching/cs206mspring13/

Announcements

·         Join class mailing and discussion list on piazza.com. Click here. You need to provide email address ending in “.iitg.ac.in”


Instructor

            Amit Awekar ([instructor first name] [instructor last name]@ gmail.com),   

            Office Hours:  After class

 

Teaching Assistants

            Hardik Modi (iitg id: g.modi),   

            Office Hours:  After class (Monday, Wednesday), CSE MTech Second Year Lab.     

Course Texts

Fundamentals of data structures in C: Horowitz, Sahni, and Anderson-Freed. University Press, Second edition. ISBN: 9788173716058.

Introduction to the design and analysis of algorithms: Levitin. Pearson Education, Second edition. ISBN: 9788131718377.

Course Prerequisites

            CS101

Course Purpose

Learn principles of design and analysis of data structures and algorithms.

Grading

A weighted average grade will be calculated as follows:

Final letter grade

·         90 or above: AA

·         80 or above: AB

·         70 or above: BB

·         65 or above: BC

·         60 or above: CC

·         55 or above: CD

·         40 or above: DD

·         Below 40: F

·         If you are auditing the course, you need to score 35 or above to get the pass grade. No home work and lecture notes for audit students.

·         No incomplete grade will be assigned in this course.

 

Re-grade Policy

If you believe that you should have score more points than you got, write a clear statement making your case and take it to the instructor. All re-grade requests must be made no later than a couple of days after declaration of each evaluation.

 

Homework Submission

Homework is to be submitted only as a soft copy. Late submission will not be accepted except for extreme medical emergencies. No other reason will be entertained. You can submit your homework before submission deadline.


Attendance

If you miss a class, it is your responsibility to make up. If you miss an exam or a quiz, please supply official documentation in order to get credit. For anticipated absence, the instructor will give an exam prior to the exam date for rest of the class. All early-exam-requests must be submitted to the instructor at least a week before the regular scheduled date for the exam.


Statement for Students with Disabilities

Reasonable accommodation will be made for students with verifiable disabilities.


Academic Integrity

The IITG policies against academic dishonesty will be strictly enforced. For the first instance of academic dishonesty, instructor will take appropriate action. However, second instance of academic dishonesty guarantees you the F grade.


Topics

2-Jan

Introduction to algorithms

4-Jan

Aymptotic analysis

5-Jan

Master theorem

7-Jan

ADT, Array, Stack, Queue

9-Jan

Linked list

11-Jan

Tree

(10:30-11:30) 12-Jan

Tree

(11:30-12:30) 12-Jan

Tree

16-Jan

Graph

17-Jan

Graph

18-Jan

Quiz 1. 10:30 am.

23-Jan

 

28-Jan

 

30-Jan

 

4-Feb

 

6-Feb

 

8-Feb

 

(10:30-11:30) 9-Feb

 

(11:30-12:30) 9-Feb

 

25-Feb

 

27-Feb

 

1-Mar

 

(10:30-11:30) 2-Mar

 

(11:30-12:30) 2-Mar

 

4-Mar

 

6-Mar

 

8-Mar

 

11-Mar

 

13-Mar

 

15-Mar

 

18-Mar

 

20-Mar

 

22-Mar

 

1-Apr

 

3-Apr

 

5-Apr

 

(10:30-11:30) 6-Apr

 

(11:30-12:30) 6-Apr

 

8-Apr

 

10-Apr

 

12-Apr