Scribd
Upload
24 views

data structures 10 marks question

The document covers various fundamental concepts of data structures, including definitions, types, and applications. It discusses operations on data structures, time and space complexity, sorting algorithms, and searching techniques. Additionally, it explores linked lists, stacks, queues, trees, and hashing methods with examples and algorithms.

Uploaded by

thotasuzivasu
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
24 views

data structures 10 marks question

The document covers various fundamental concepts of data structures, including definitions, types, and applications. It discusses operations on data structures, time and space complexity, sorting algorithms, and searching techniques. Additionally, it explores linked lists, stacks, queues, trees, and hashing methods with examples and algorithms.

Uploaded by

thotasuzivasu
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 4

UNIT-1

1. Define data structure. Discuss different types of data structures and their
applications.
2. Distinguish between primitive and non-primitive data structures.
3. Explain classification of data structure and operations on data structure.
4. Explain Abstract Data Type?
5. Explain Time Complexity with their components and examples.
6. What is Performance Analysis? Explain components of Space Complexity.
7. a) What do you mean by Asymptotic Notation?
b) Explain Big Oh Notation. With example.
8. a) Explain Omega Notation. With example.
b) Explain Theta Notation. With example.
9. Explain Linear Data and Non Linear Data structure with examples.
10. What is searching? Explain Binary search algorithm with example
11. Explain Linear search algorithm with example and also find its time complexity.
12. Define Searching. Differentiate the time complexities of Linear and Binary search
with examples.
13. Trace the steps of insertion sort – 12,19,33,26,29,35,22. Find the total number
comparison made?
14. Define sorting? Sort the sequence 3, 1, 4,7,5,9,2,6,5 using Selection sort?
15. Trace Bubble sort using following number: 25, 57, 48, 37, and 72?
UNIT-2

1. Explain the insertion operation in linked list. How nodes are inserted after a
specified node.
2. Discuss deletion operation in circular linked lists.
3. Discuss the insertion operation for a doubly linked list.
4. How to perform deletion operation using linked list?
5. How polynomial expression can be represented using linked list for addition?
6. Discuss the deletion operation for doubly linked list.
7. What is linked list? Write and explain the algorithm for create, insertion and
traverse operations in doubly linked list with example.
8. Define a linked list? Explain different types of linked list, mention the advantages
of linked list?

UNIT-3
What is Stack? and Write about its Representation and implementation
using arrays and linked lists
1. Define stack? Explain operations of stack?
2. Write about stack representation and implementation using arrays and linked list?
3. Write an algorithm for converting infix expression into postfix expression. And
illustrate the each step for the following expression: A-B/(C*D^E).
4. Convert (A-B^C^D) * (E - F/D) into postfix notation using Stack.
5. Write a procedure to evaluate an expression using stacks.
6. Write the algorithm for converting infix expression to postfix (polish) expression?
7. Write the prefix and postfix form for: A+B*(C-D)/(E-F)
8. Apply suitable data structure to covert infix to postifix expression
 (a * b) +c/d
 (((a / b)-c) + (d * e)) - (a * c).
 (A+B)*(C+D)*E^F

9. Discuss the Tower of Hanoi with example using recursive function.

1. What is Stack? and Write about its Representation and implementation


using arrays and linked li
UNIT-4

1. Define Queue. Implement the operations of queue using arrays.


2. Show how queues are represented using arrays?
3. Define priority queue. Explain in detail the representation of a Priority Queue
with example
4. Explain deques? Implement the operations on deques?
5. Explain circular queue? Write an algorithm to insert and delete an element from a
circular queue.
6. Explain working of priority queues with an example.
7. Explain how to represent singly linked list with help of diagram and example.
8. Write and explain algorithm to insert element at the beginning of doubly linked
list.
UNIT-5
1. Define trees? Explain tree terminologies and tree representation?
2. Define binary search tree. Show how to insert and delete an element from binary
search tree.
3. What is tree traversal. Explain the in-order, preorder and post-order traversal.
4. What is binary tree? Elaborate different binary tree traversal techniques.
5. Consider Data for binary search tree: 6, 8, 33, 3, 40, 2, 9, 10, 22, 15, and 17.
Consider 10 as root, give answer of following
6. Discuss on different methods of implementing hash function. Explain any two in
detail.
7. Discuss various tree traversal techniques with suitable examples.
8. Discuss bucket hashing technique with example.
9. Explain the basic two techniques for Collision-resolution in Hashing with
example. Also make a comparison among them.
10. Construct an expression tree for the expression (a+b*c) + ((d*e+f)*g). Give
the outputs when you apply inorder, preorder and postorder traversals.
11. Create a binary search tree for the following numbers start from an empty
binary search tree. 45,26,10,60,70,30,40 Delete keys 10,60 and 45 one after the
other and show the trees at each stage.
12. Given the input { 4371, 1323, 6173, 4199, 4344, 9679, 1989 } and a hash
function of h(X)=X (mod 10) show the resulting:
a. Separate Chaining hash table
i. b. Open addressing hash table using linear probing
13. Show the result of inserting the keys 2,3,5,7,11,13,15,6,4 into an initially empty
extendible hashing data structure with M=3.
14. What is hash function?Explain types of hash functions?
15. Explain briefly about hash table representation?
16. Insert the following list of elements into the hash table by using Quadratic
probing(size of the hash table is 10)
a. 30,45,28,65,26,77,40,11
17. Insert the following list of elements into the hash table by using Quadratic
probing(size of the hash table is 13)
a. 65,34,79,114,26,85,55,89,22,98

You might also like