Scribd
Upload
12 views4 pages

Subject:Data Structure 1.: Define Dynamic Memory Allocation & State Its Importance

Uploaded by

Keshav Kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
12 views4 pages

Subject:Data Structure 1.: Define Dynamic Memory Allocation & State Its Importance

Uploaded by

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

Subject:Data Structure

Chapter 1

1. Define Data Structure.


2. Define searching and give its types.
3 Define sorting & give its types.
3. Give any 4 applications of data structure
4. Explain space & time complexity with example.
5. Solve the given:Consider the following list of elements & search element 29
using binary search.A={11,5,21,3,29,17,2,45}
6. Write the steps for performing selection sort for given elements of array.
A={11,3,2,30,21,85,1,-8}
7. Compare static and dynamic data structure? and explain any 1 static and dynamic
data structure
8. Define sorting & give its types
9. Give any 4 applications of data structure.
10. Solve the given problem:Sort the following number in ascending order
using bubble sort .Given numbers: 10,3,45,1,9,6,84,14 & write output
after each iteration
11. Write a program to implement searching methods -linear, binary search.
12. Write a ‘C’ program to search a particular data from the given array
using linear search..
13. Compare Linear and Binary Search.

Chapter 2
1. Define queue and state its types.
2. Give any two applications of stack.
3. Explain construction of circular queue with example
4. Write a program to implement stack.
5. Explain any 2 applications of stack
6. Write an C program to implement queue.
7. Give any two applications of queue.
8. Demonstrate the memory representation of Stack using array with the
help of a diagram.
9. Write a ‘C’ program to insert an element into the queue and delete element
from the queue.
10. Explain any four primitive operations on stack.
11. Compare stack and queue.
12. Explain Queue as an ADT.

Chapter 3
1. Define singly linked list
2. State the operations performed on linked list
3. Write an algorithm to search a particular node in the given linked list.
4. Write a short note on GLL(Generalized Linked List)
5. Explain Circular linked list with example.
6. Compare Linear linked list and Circular linked List(any 2 points)
7. Define the term of linked list.i)Node ii)Next
8. Write a short note on applications of linked list.
9. Explain insertion of new node at start and end of singly linked list.
10. Define dynamic memory allocation & state its importance.
Chapter 4
1. Define the following terms w.r.t. tree I)In-degree ii)Out-degree
2. Describe given two types of graph : Directed and Undirected
3. Solve the given: Traverse the following tree by in-order, pre-order & post-order
methods.

4. Solve: Construct the minimum spanning tree (MST) for the given graph using
Kruskal’s Algorithm-

5. Solve: Using Dijkstra’s Algorithm, find the shortest distance from source vertex
‘S’ to remaining vertices in the following graph-
6. Explain tree with any 4 terminology and construct BST with following
numbers:20,3,7,96,85,41,6,3,74.
7. Compare tree and graph.
8. Describe any two types of tree from the following:General tree,Binary
tree,Binary search tree
9. Solve and evaluate the following arithmetic expression P written in
postfix notation.P:4,2,^,3,*,3,-,8,4,/,+
10. Write an algorithm to traverse the tree inorder and postorder with
example.
11. Solve:Construct the minimum spanning tree (MST) for the given graph
using Prim’s Algorithm

12.Give the adjacency matrix and adjacency list representation of given graph.

13.Solve:Construct the binary search tree using following elements.


{35,55,30,7,10,100,28,82,53,25,3}
Show diagrammatically each step of construction of BST.
14.Solve & Evaluate given postfix expression:456*+
Chapter 5
1. State the main function of symbol table?
2. List indexing techniques in data structures?
3. Explain the concept of a B-Tree and its significance in computer science. How
does it differ from other tree data structures like Binary Trees and AVL
Trees?
4. Explain symbol table representation.
5. Describe given terminologies i)Open hashing ii)Closed hashing iii)Load
density iv)rehashing
6. State the maximum height of any AVL-tree with 7 nodes? Assume that
the height of a tree with a single node is 0.
7. State any 2 issues in hashing.
8. Write a short note on realization of heap and operation.
9. Explain hash function and state its properties of good hash function.
10. Explain how to construct AVL tree with example

You might also like