SYLLABUS 

Module 1 – Introduction :

Module 2 – Stacks and Queues :

Module 3 – Linked Lists :

Module 4 – Searching, Sorting, and Hashing :

Module 5 – Trees:  

LECTURE NOTES – 01 : ARRAY RECAP

LECTURE NOTES – 02 : 2D ARRAY

LECTURE NOTES – 03 : MULTIPLY 2D MATRIX 

LECTURE NOTES – 04 : WHAT IS DSA 

LECTURE NOTES – 05 : STACK PART A

LECTURE NOTES - 06 : STACK PART B

LECTURE NOTES - 07 : STACK PART C

LECTURE NOTES - 08 : Infix To Postfix

LECTURE NOTES - 09 : Postfix Expression

LECTURE NOTES - 10 : TOH N=3,4

LECTURE NOTES -11 :  QUEUE 1D ARRAY

LECTURE NOTES -12 :  QUEUE  

LECTURE NOTES -14 :  SORTING & SEARCHING

LECTURE NOTES -15 :  SORTING & SEARCHING S

LECTURE NOTES -16 :  SINGLE LINKED LIST

LECTURE NOTES -17 :  DOUBLE LINKED LIST

LECTURE NOTES -18 :  CIRCULAR LINKED LIST

..........................................

LECTURE NOTES -25 :  DSA CLASS NOTES

QUIZ

QUIZ 01 ARRAY  

QUIZ 02 STACK QUEUE

QUIZ 03 SORTING 

QUIZ 04 LINK LIST

ASSIGNMENT

ASSIGNMENT 01  

ASSIGNMENT 02   

ASSIGNMENT 03   

ASSIGNMENT 04 

ASSIGNMENT 05 

LIST OF EXPERIMENTS

                                    LEVEL -BASIC

M 1.1.    Implementation of 1D Array.

             LEVEL -ADVANCED

M 1.2.    Implementation of 1D Array Address Calculation.

M 1.3.    Tower of Hanoi Problem.

                              LEVEL – ADVANCED +

M 1.4.    Implementing basic operations on Strings: Find string length, concatenation, copy, reverse, substring etc.

                                 LEVEL -BASIC

M 2.1.   WAP to perform the following operations on Stack of    integers using array: a> push b> pop c> display.

                                 LEVEL - ADVANCED

M 2.2.   Program to converts infix expression to postfix expression using stack.

M 2.3.    WAP to evaluate postfix expression.

M 2.4.   C program that performs Insert, Delete and display operations on a Queue using Array.

M 2.5.    WAP Convert Infix to Prefix

                                   LEVEL – ADVANCED +

M 2.10. Demonstration of the working of Stack using linked list.

M 2.11. Demonstration of working of Queue using single linked list

                                    LEVEL -BASIC

M 3.1.   Single Linked List (SLL): Implementation of Single Linked List>append(Add at End)>add_Beg>add_after> delBeg > delEnd> Del_Pos>Length>Reverse>Search()

M 3.2.    WAP to Implementation of Double Linked List (DLL)and its all basic functions.

                                  LEVEL - ADVANCED

M 3.3.    WAP to implementation of CLL and perform all basic operation.

                                 LEVEL - BASIC

M 4.1.       Implementation of Bubble sort

M 4.2.       Implementation of Insertion sort

M 4.3.       Implementation of Selection sort

M 4.4.       Implementation of Linear Search

M 4.5.       Implementation of Binary search

                  LEVEL - ADVANCED

M 4.6.       Implementation of Merge sort.

M 4.7.       Implementation of Quick sort.

                                         LEVEL - ADVANCED

M 5.1.   WAP to implementation of a Binary search tree and traversal of tree.

M 5.2.   To Implement PRIM’s algrithm

M 5.3.   To implement Kruskal’s algorithm.

VIRTUAL LAB

Data Structures https://cse01-iiith.vlabs.ac.in/List%20of%20experiments.html

Data Structures – 1

https://ds1-iiith.vlabs.ac.in/List%20of%20experiments.html

Data Structures – II

https://ds2-iiith.vlabs.ac.in/List%20of%20experiments.html

Problem Solving Lab 

https://ps-iiith.vlabs.ac.in/List%20of%20experiments.html

SortingBubble SortMerge SortHeap SortQuick SortGraphsDepth First SearchBreadth First SearchTreesTree TraversalBinary Search TreesStacks and QueuesStacks and QueuesInfix to PostfixSearchingUnsorted ArraysHashtablesLinked ListsLinked listsPolynomial Arithmetic using linked lists