This is for students who desire to understand Data structures from a practical perspective. Though this course is typically a part of 2nd year BE but this is one of the key subjects on which interviews are based. As a result, this course can be taken by students who want to appear for campus also.

The course will also include corresponding examples in C language so as to get a fair understanding of the implementation of different data structures and their advantages / disadvantages.

The course will focus on the following topics:

1) Stacks, Queues

2) Sorting algorithms

3) Search algorithms

4) Hashing

5) Tree

6) Graphs

The worst case, best case performance and space complexity will also be covered as these help out the developers in chosing the right kind of algorithm for a particular problem. The examples will all be taken up in C and as a result the nittie-gritties of the C language would also be taught. C being one of core languages, will help the student in better relating and understanding the subject.

At the end of the course, the student will be evaluated on sample program and tests which will be based out of the different algorithms which have been covered as part of the subject.