Data Structures and Algorithms (IDST232C) - 2016

Syllabus for Data Structures and Algorithms is avaliable here.
Attendance is mandatory with policy as per the UG Manual.

Email your lab exam programs to iiitdslab2016@gmail.com
Results of Theory and Lab exams. (Updated: 04 Apr 2016)

Join the group for information and announcements (and ask the faculty if you are not aware of the group).

Click for resources of the course including slides, programs and assignments.

Lab assignments:
    Lab 1Complexity and elpased time calculation
    Lab 2Arrays and pointers
    Lab 3Arrays and Stacks
    Lab 4Queues
    Lab 5Linked lists
    Lab 6Doubly linked lists
    Lab 7Quicksort and mergesort
    Lab 8Hashing
    Lab 9Binary search trees
    Lab 10Graph searching algorithms
    Lab 11Disjoint sets and Kruskal's MST

For lab make sure that you:
    a. Implement suggestions in Coding Practices (v1.6).
    b. NEVER use global/static variables.
    c. Make data structures (eg stack) using appropriate struct.
    d. Do not abuse purpose of functions by using them to do avoidable scanf/printf stuff.

Interesting links:
    Himanshu Shekhar's (irm2015006) Proxy Script.
    Stack Overflow for help related to programming.

Attendance is avaliable here.

Please correspond (only) to bss.ta_at_iiita for corrections to attendance of Sec-B and respective faculty for other sections.