DATA STRUCTURES LAB(EURCS311 )

DATA STRUCTURES LAB EXPERIMENTS LIST -1

1. Operation on arrays – insertion and deletion
2. Linear search and binary search by using Arrays
3. Sorting – bubble, insertion, selection, quick sort, Merge Sort
4. Create different types of linked lists. (Single Linked List,
Double Linked List, Circular Linked List) Perform operations search,Insertion deletion …etc.
5. Stack- operations using arrays and linked lists.
6. Queue- operations using arrays and linked lists.
7. Program to create a Binary Tree for the given set of nodes. Binary tree traversals- In order, pre order, post order using recursion
8. Addition of sparse matrices
9. Polynomial addition
10. Breadth first search of a graph.

DATA STRUCTURES LAB EXPERIMENTS LIST -2

1. Infix to postfix conversion
2. Evaluation of postfix expression.
3. De-queue, circular-operations
4. Binary tree traversals- In order, pre order, post order using non-recursion
5. Multiplication of sparse matrices
6. Polynomial multiplication
7. Depth first search of a graph

PROGRAMMING ASSIGNMENT

1.Write a Program to sort a given list of objects by using Heap Sort.

2.Write a program to perform Hashing by using the concept of separate chaining.

3.Develop a program to create a Binary Search Tree, and to perform the operations search, insertion and deletion.

4.Develop a program to create a AVL Tree, and to perform the operations search, insertion and deletion.

5.Develop a program to create B+ Tree, and to perform the operations search, insertion and deletion.

DATA STRUCTURES - TEACHING PALN

Text Books:
1. Data Structures and Algorithm Analysis in C, Mark Allen Weiss, Pearson, Second Edition
2. Data Structures. Algorithms and Applications in C++, S.Sahani, Tata Mc-Graw Hill.
Lecture # Topic To be Covered
Syllabus for MID - I
1 Introduction
2 Recurrence Relations
3 Overview on Time Complexity
4 Sequential & Binary Search Methods
5 Introduction to Sorting and Selection Sort
6 Merge Sort Introduction
7 Merge Routine and Time complexity Derivation
8 Introduction to Quick Sort
9 Quick Sort Routine
10 Time Complexity Derivations
11 Data Representation, Linear List
12 Formula Based, Indirect Addressing, Simulating Pointers
13 Comparisons and Applications
14 Introduction to Arrays and Matrices
15 Introduction to Sparse Matrix and representation
16 Addition of Sparse Matrices
17 Multiplication of Sparse Matrices
18 Creation of Single Linked List
19 Operations on Single Linked List
20 Creation of Double Linked List
21 Operations on Double Linked List
22 Creation of Circular Linked List
23 Operations on Circular Linked List
24 Comparison of all Linked Lists
25 Introduction to Satck and Its Applications
26 Operations on the Stack by using Arrays
27 Infix to Postfix conversion by using Stacks
28 Postfix evaluation by using Stacks
29 Checking of Nested Balanced Parenthesis



Syllabus for MID - II
30 Introduction to Queues
31 Array Implementation of Queues
32 Introduction to Dequeues
33 Operations on Dequeues
34 Introduction to Graphs
35 Representation of Graphs
36 Graph Traversals - BFT
37 DFT and Applications
38 Introduction to Trees
39 Operations on Binary Tree
40 Binary Tree Traversals
41 Introduction to Binary Search Tree
42 Insertion operation on Binary Search Tree
43 Deletion operation on Binary Search Tree
44 Introduction to Heap
45 Operations on Heap
46 Heap Sort & Time Complexity
47 Introduction to Hashing
48 Various Types of Hashing
49 Implementation of Hashing concept by using separate Chaining
After MID -II
50 Introduction to AVL Trees
51 AVL Tree Rotations( Single, Double)
52 Insertion Operation on AVL Tree
53 Deletion Operation on AVL Tree
54 B Trees, B+ Trees
55 Insertion Operation on B+ Tree
56 Deletion Operation on B+ Tree
57 Applications of AVL and B+ Trees