Mech DAMP Blog

CS213 - Data Structures and Algorithms

CS213 - Data Structures and Algorithms

Instructor

Prof. Milind Sohoni

Semester

Spring ‘24

Course Difficulty

Moderate (difficult if you need to start with coding basics, easy if you know cp basics)

Time Commitment Required

1.5 hour Lectures twice a week, no course project, just tutorials for practice

Grading Policy and Statistics

for minor: AP: 1, AA: 5, AB: 11, BB: 29, BC: 22, CC: 21, CD: 6, DD: 2, FR: 1

Attendance Policy

None

Teaching Style

Pre-recorded lectures were provided every week, which weren’t of good video quality, prof helped us with any queries we had and with tutorial solving

Feedback on Assignments/ Tutorials/ Projects

Tutorials were well formulated, with sufficient questions for practice before exams

Course Importance

This course is important as it provides with the basics for cp and dsa programming, an important topic for internship tests preparation and for a software career

Future Tracks

This course is a pre-requisite for many courses in cs minor basket, and also the contents of this course are important for cp

Additional Comments

Pre-requisites- none; CPI cutoff- 8.5; can only be tagged as minor

CS 213 Review By: Asmi Rangnekar