CS 213 Data Structures and Algorithms (Spring 2017-18)

Instructor Name: Abhiram Ranade

Course Type: Theory

No. of Credits: 6

Pre-requisites: None

Course Content:
Review of STL, Program Complexity, BST and 2-3 trees, tries, fast multipole method, hash tables, formula representations, graph search, dijkstra and belman-ford algorithms, searching in graphs(DFS), SAT problem, DLL, Stacks, 

Books:
CLRS is a good reference and google searches become a must.

Lectures: No attendance restriction. Slides were sometimes difficult to understand if one didn't go to the class since blackboard was used.

Assignments:
4 assignments were given worth a mark each(out of 100, so they didnt matter), no tutorials. They were not enough to get you used to the course content.

Exams and Grading:
Standard procedure - Quiz-Midterm-Quiz-Endterm

4% weight-age was given to assignments.

Exams were generally tough and lengthy. Grading was decent.

Online Useful Content:
Nothing in particular but google.

Follow up Courses:
This is a very basic course for someone who wants to explore further in CS. GO anywhere in coding after this one as this is a prereq for a lot of the other courses.

Pro-tips:
Code as much as you can. Day in, Day out. Code.

Personal Comments:

Respondent: Ananay Garg