Course objectives:

- to provide an understanding of data structures

- To enable implementation of data structures

- To enable application of data structures in standard algorithms for computational problems.

Description:

- Data Structures and Algorithms (DSA) course is meant for B.Tech students of various branches.

Course contents:

- This course would cover various topics of Data Structures and Algorithms such as

Introduction - fundamental data structures.

Arrays - operations - Lists: list ADT - doubly linked list - circular list - implementation - Stacks - Queues - Skip List. Dictionaries: Sets - Dictionaries - Hash Tables - Hashing functions. Applications.

Binary Trees:binary search trees - splay trees - Balanced Trees - Red-Black Trees etc.

Directed Graphs - Dijkstra's algorithm - Floyd's algorithm - Warshall's  algorithm - Directed Acrylic graphs - Undirected graphs etc.

Pre-requisites:

Basic C programming knowledge is a pre-requisite for this course.

Course outcome:

At the end of the course, the student would be able to

- understand the elementary data structures

- implement data structures

- select appropriate data structures for computational problems

- apply simple algorithms using data structures for specific applications.

Note: Course contents would be customized as per student's syllabus. Course contents listed here are tentative.