SLNO QUESTIONTYPE
1 MCQ
2 MCQ
3 MCQ
4 MCQ
5 MCQ
6 MCQ
7 MCQ
8 MCQ
9 MCQ
10 MCQ
11 MCQ
12 MCQ
13 MCQ
14 MCQ
15 MCQ
16 MCQ
17 MCQ
18 MCQ
19 MCQ
20 MCQ
1 DQ
2 DQ
3 DQ
4 DQ
5 DQ
6 DQ
7 DQ
8 DQ
9 DQ
10 DQ
11 DQ
12 DQ
1 DQ
2 DQ
3 DQ
4 DQ
QUESTION
What is a full binary tree?
The situation when in a linked list HEAD=NULL is ….
A normal queue, if implemented using an array of size MAX_SIZE, gets full when
Which graph traversal algorithm is implemented using stack data structure.
Which of the following principle does Stack use?
In the stack, If user try to remove element from the empty stack then it called as
Which graph traversal algorithm is implemented using Queue data structure.
The prefix expression for the infix expression : a+b*c/d
Quick sort uses which of the following method to implement sorting?
If the MAX_SIZE is the size of the array used in the implementation of circular queue, array index start with 0, front po
If the elements “A”, “B”, “C” and “D” are placed in a stack and are deleted one at a time, what is the order of removal?
The number of edges from the root to the node is called __________ of the tree.
Post fix form of A + (B * C)
Which one of the following is the correct way to increment the rear end in a circular queue?
The number of edges from the leaf to root is called _________ of the tree.
A mathematical-model with a collection of operations defined on that model is called
Which of the following searching algorithm is fastest?
Deletion operation is done using ......... Pointer in a queue
Stack is used for
Which of the following method is used for sorting in merge sort?
(a) What is an algorithm?
(b) Briefly discuss the various techniques for algorithm design.
(c) Write an algorithm to perform an addition of two numbers.
(a) What is Asymptotic notation?
(b) Explain different types of asymptotic notation.
(c) With the help of example discuss time complexity and space complexity.
(a) What is Data Structure?
(b) Explain different types of data structure.
(c) What are the basic operations that are performed on the data structure?
(a) What is ADT(Abstract Data Type)?
(b) Write down the ADT of following data structure:
(i) Stack ADT (ii) Queue ADT (iii) List ADT
(a) What is Stack?
(b) Write an algorithm to perform push() and pop() operation in stack.
(c) Write the prefix and postfix notation for given infix expression: (A+B)*C-(D-E)*(F+G)
(a) Write an algorithm to evaluate postfix expression using stack.
(b) Evaluate the given postfix expression step by step using stack: 5 3 2 * + 4 – 5 +
(a) What is Binary Tree?
(b) Differentiate between strictly binary tree and complete binary tree.
(c) Write down the Preorder, Postorder and Inorder traversal for given binary tree.
(a) What is Binary Search Tree (BST)?
(b) Write an algorithm to perform insert operation in BST.
(c) Construct a Binary Search Tree by inserting the following sequence of numbers:
7 , 4 , 12 , 3 , 6 , 8 , 1 , 5 , 10. Show BST in each step.
(a) Generate the Binary Search Tree (BST) based on the values for the nodes:
40 , 10 , 79 , 90 , 22 , 54 , 31 , 9 , 50 , 5 , 8. Show BST in each step.
(b) Write down the Preorder, Postorder and Inorder traversal for generated BST.
(a) What is Max Heap Tree?
(b) What are the two important properties of Heap Tree.
(c) Construct a Binary Max Heap for given sequence of numbers:
47 , 12 , 75 , 88 , 90 , 73 , 57 , 85 , 50 , 62. Show heap in each step.
(a) What is searching in data structure?
(b) Write an algorithm for Binary Search.
(c) Find the key element 31 in given array by using binary search.
10 , 14 , 19 , 26 , 27 , 31 , 33 , 35 , 42 , 44. Show the implementation at every step.
(a) What is sorting in data structure?
(b) Write an algorithm to perform Bubble Sort.
(c) Implement the bubble sorting on the given array:
44 , 7 , 12, 9 , 11 , 3 , 55 , 75 , 22. Show the sorted list in every pass.
(a) What is Graph in Data Structure?
(b) What are the different methods for representing graph in data structure? Explain with example.
(c) Write an algorithm to perform Depth First Search(DFS) and Breadth First Search (BFS) traversal in graph.
(d) Perform DFS and BFS traversal for given graph:
(a) What is Spanning Tree?
(b) What is Minimum Cost Spanning Tree?
(c) Write down the steps of Kruskal’s algorithm and Prim’s algorithm for finding minimum-cost spanning tree.
(d) Calculate the minimum cost for given graph by using both the algorithms.
(a) What is Linked List?
(b) Compare Linked List and Array.
(c) Write an algorithm to perform insert operation in a Singly Linked List at following locations:
(i) At beginning of List (ii) At end of List (iii) At specific location
(a) What is Queue?
(b) Write an algorithm to perform Enqueue and Dequeue operation in Queue.
(c) Write a pseudocode for following operation in Queue:
(i) IsFull() (ii) IsEmpty() (iii) Enqueue() (iv) Dequeue()
OPTION1 OPTION2 OPTION3 OPTION4 ANSWER LEVEL
Each node haEach node haAll the leav Each node ha
Each node ha 1
Empty Overflow Houseful Saturated Empty 1
Rear = MAXFront = (r Front = rearRear = frontRear = MAX 1
DFS BFS Both None DFS 1
LIFO princiFIFO princiLinear tree Ordered arr LIFO princi 1
Empty ColleUnderflow oOverflow ofGarbage ColUnderflow o 1
DFS BFS Both None BFS 1
+ab*/cd +*ab/cd +a*b/cd None of aboNone of abo 1
PartitioningMerging ExchangingSelection Partitioning 1
Front=rear=Front= rear Front=rear+Front=(rea Front= rear 1
ABCD DCBA DCAB ABDC DCBA 1
Height Depth Length Width Depth 1
AB + C * ABC + * AB * C + ABC * + ABC * + 1
rear =rear+1(rear+1) % (rear % maxNone of the(rear+1) % 1
Height Depth Length Width Height 1
Data StructuAbstract Da Primitive Algorithm Data Struct 1
Binary sear Linear searcJump searchAll of the a Binary sear 1
Front Rear Top List Front 1
CPU Resourc Breadth FirsExpression None of theExpression 1
PartitioningMerging ExchangingSelection Merging 1
Explain 2
Explain 2
Explain 2
Explain 2
Explain 2
Explain 2
Explain 2
Explain 2
Explain 2
Explain 2
Explain 2
Explain 2
Explain 3
Explain 3
Explain 3
Explain 3
