Scribd
Upload
3 views

Module 1,2,3 Data Structures 1

The document outlines three modules covering various data structures and algorithms. Module 1 focuses on stacks, queues, and linked lists, including their implementations and operations. Module 2 discusses trees, graph representations, and traversal algorithms, while Module 3 covers sorting, searching algorithms, and hashing techniques.

Uploaded by

024CSE DHARSHINI.A
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
3 views

Module 1,2,3 Data Structures 1

The document outlines three modules covering various data structures and algorithms. Module 1 focuses on stacks, queues, and linked lists, including their implementations and operations. Module 2 discusses trees, graph representations, and traversal algorithms, while Module 3 covers sorting, searching algorithms, and hashing techniques.

Uploaded by

024CSE DHARSHINI.A
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

MODULE-1

1. Explain Stack ADT and its operations


2. Explain array based implementation of stacks
3. Explain linked list implementation of stacks
4. Explain queue ADT
5. Explain array based implementation of queues
6. Explain linked list implementation of queues
7. Explain the various operations of the list ADT with examples
8. Write the program for array implementation of lists
9. Write a C program for linked list implementation of list.
10.Explain the operations of singly linked lists
11.Explain the operations of doubly linked lists
12.Explain the steps involved in insertion and deletion into a singly and
doubly linked list.
13.How polynomial manipulations are performed with lists? Explain
the operations

MODULE -2

1. Define Tree. Explain the tree traversals with algorithms and examples.
2. Construct an expression tree for the expression (a + b * c)
+((d * e + 1) * g). Give the outputs when you apply preorder, inorder and
postorder traversals.
3. Explain binary search tree ADT in detail.
4. Explain Topological sort.
5. Explain b tree and B+ tree ADT in detail.
6. Explain Heap tree ADT in detail.
7. Explain threaded binary tree ADT in detail.
8. Explain the various representation of graph with example in
detail?
9. Define topological sort? Explain with an example?
10.Write and explain the prim’s algorithm and depth first search algorithm
11.Explain the depth first search algorithm.
12.Explain the breadth first search algorithm
MODULE -3

1. Explain the sorting algorithms


2. Explain the searching algorithms
3. Explain hashing and explain the types of hashing
4. Explain open addressing
5. Write a C program to sort the elements using bubble sort, insertion sort
and radix sort.
6. Write a C program to perform searching operations using linear and
7. binary search.
8. Explain in detail about separate chaining.
9. Explain Rehashing in detail.
10.Explain Extendible hashing in detail.

You might also like