Programming Data Structure Online Test Series 1  Programming MCQ 
Programming Data Structure Online Test Series 1  Online Quiz  Mock Exam
Finish Quiz
0 of 30 questions completed
Questions:
 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
Information
Programming Data Structure Online Test Series 1. The purpose of this online test is to help you evaluate your Data structure knowledge yourself.
This paper has 30 questions.
Time allowed is 30 minutes.
The Programming Data Structure online Mock Test Exam is Very helpful for all students. Now Scroll down below n click on “Start Quiz” or “Start Test” and Test yourself.
You have already completed the quiz before. Hence you can not start it again.
Quiz is loading...
You must sign in or sign up to start the quiz.
You have to finish following quiz, to start this quiz:
Results
0 of 30 questions answered correctly
Your time:
Time has elapsed
You have reached 0 of 0 points, (0)
Average score 

Your score 

Categories
 Not categorized 0%
Pos.  Name  Entered on  Points  Result 

Table is loading  
No data available  
 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 Answered
 Review

Question 1 of 30
1. Question
A procedure that calls itself is called
Correct
In recursion, a procedure calls itself, either directly or by calling a procedure which in turn calls it.
Incorrect
In recursion, a procedure calls itself, either directly or by calling a procedure which in turn calls it.

Question 2 of 30
2. Question
push() and pop() functions are found in
Correct
Stack uses push() to insert an item in stack, and pop() to remove the top item from stack.
Incorrect
Stack uses push() to insert an item in stack, and pop() to remove the top item from stack.

Question 3 of 30
3. Question
A linkedlist is a dynamic structure
Correct
A linkedlist is dynamic structure, it can shrink and expand as required by the program.
Incorrect
A linkedlist is dynamic structure, it can shrink and expand as required by the program.

Question 4 of 30
4. Question
Which of the following algorithm is not stable?
Correct
Among the given, only quick sort is not stable that is it may rearrange the already sorted items.
Incorrect
Among the given, only quick sort is not stable that is it may rearrange the already sorted items.

Question 5 of 30
5. Question
Which method can find if two vertices x & y have path between them?
Correct
By using both BFS and DFS, a path between two vertices of a connected graph can be determined.
Incorrect
By using both BFS and DFS, a path between two vertices of a connected graph can be determined.

Question 6 of 30
6. Question
How many swaps are required to sort the given array using bubble sort – { 2, 5, 1, 3, 4}
Correct
There will be 3 swaps in first iteration and 1 swap in second iteration.
Incorrect
There will be 3 swaps in first iteration and 1 swap in second iteration.

Question 7 of 30
7. Question
If queue is implemented using arrays, what would be the worst run time complexity of queue and dequeue operations?
Correct
As queue is maintained by two separate pointers for queue and dequeue operations, the run time for both is Ο(1).
Incorrect
As queue is maintained by two separate pointers for queue and dequeue operations, the run time for both is Ο(1).

Question 8 of 30
8. Question
In a min heap
Correct
In a min heap, parent nodes store lesser values than child nodes. The minimum value of the entire heap is stored at root.
Incorrect
In a min heap, parent nodes store lesser values than child nodes. The minimum value of the entire heap is stored at root.

Question 9 of 30
9. Question
The following sorting algorithms maintain two sublists, one sorted and one to be sorted −
Correct
Both selection sort and insertion sort maintains two sublists and then checks unsorted list for next sorted element.
Incorrect
Both selection sort and insertion sort maintains two sublists and then checks unsorted list for next sorted element.

Question 10 of 30
10. Question
A stable sorting alrithm −
Correct
A stable sorting algorithm like bubble sort, does not change the sequence of appearance of similar element in the sorted list.
Incorrect
A stable sorting algorithm like bubble sort, does not change the sequence of appearance of similar element in the sorted list.

Question 11 of 30
11. Question
In a min heap
Correct
In a min heap, parent nodes store lesser values than child nodes. The minimum value of the entire heap is stored at root.
Incorrect
In a min heap, parent nodes store lesser values than child nodes. The minimum value of the entire heap is stored at root.

Question 12 of 30
12. Question
What data structure is used for depth first traversal of a graph?
Correct
Stack is used for depth first traversal whereas queue is used for breadth first traversal
Incorrect
Stack is used for depth first traversal whereas queue is used for breadth first traversal

Question 13 of 30
13. Question
Find the odd out
Correct
FloydWarshall’s All pair shortest path Algorithm uses dynamic programming approach. All other mentioned algorithms use greedy programming approach
Incorrect
FloydWarshall’s All pair shortest path Algorithm uses dynamic programming approach. All other mentioned algorithms use greedy programming approach

Question 14 of 30
14. Question
What is the worst case time complexity of linear search algorithm?
Correct
Linear search scans sequentially to find the target value. The best case is Ο(1) and average and worst case is Ο(n). Worst case is when data is not in the list, and it has to scan all n elements.
Incorrect
Linear search scans sequentially to find the target value. The best case is Ο(1) and average and worst case is Ο(n). Worst case is when data is not in the list, and it has to scan all n elements.

Question 15 of 30
15. Question
Match the following −
(1) Bubble Sort (A) Ο(n)
(2) Shell Sort (B) Ο(n^{2})
(3) Selection Sort (C) Ο(n log n)Correct
Incorrect

Question 16 of 30
16. Question
The following formula will produce
F_{n} = F_{n1} + F_{n2}
Correct
Fibonacci Series generates subsequent number by adding two previous numbers.
Incorrect
Fibonacci Series generates subsequent number by adding two previous numbers.

Question 17 of 30
17. Question
Binary search tree is an example of complete binary tree with special attributes.
Correct
BST does not care about complete binary tree properties.
Incorrect
BST does not care about complete binary tree properties.

Question 18 of 30
18. Question
The Θ notation in asymptotic evaluation represents −
Correct
Θ represents average case. Ο represents worst case and Ω represents base case.
Incorrect
Θ represents average case. Ο represents worst case and Ω represents base case.

Question 19 of 30
19. Question
Maximum number of nodes in a binary tree with height k, where root is height 0, is
Correct
If the root node is at height 0, then a binary tree can have at max 2^{k+1} − 1 nodes.
For example: a binary tree of height 1, can have maximum 2^{1+1} − 1 = 3 nodes.Incorrect
If the root node is at height 0, then a binary tree can have at max 2^{k+1} − 1 nodes.
For example: a binary tree of height 1, can have maximum 2^{1+1} − 1 = 3 nodes. 
Question 20 of 30
20. Question
push() and pop() functions are found in
Correct
Stack uses push() to insert an item in stack, and pop() to remove the top item from stack.
Incorrect
Stack uses push() to insert an item in stack, and pop() to remove the top item from stack.

Question 21 of 30
21. Question
Time complexity of Depth First Traversal of is
Correct
Using Depth First Search, we traverse the whole graph i.e. visiting all Vertices and Edges.
Incorrect
Using Depth First Search, we traverse the whole graph i.e. visiting all Vertices and Edges.

Question 22 of 30
22. Question
Heap is an example of
Correct
Heap maintains itself to meet all the requirements of complete binary tree.
Incorrect
Heap maintains itself to meet all the requirements of complete binary tree.

Question 23 of 30
23. Question
Which of these alogrithmic approach tries to achieve localized optimum solution −
Correct
Greedy approach focuses only on localized optimum solution.
Incorrect
Greedy approach focuses only on localized optimum solution.

Question 24 of 30
24. Question
In a minheap:
Correct
In a min heap, parents always have lesser or equal values than that of their childs.
Incorrect
In a min heap, parents always have lesser or equal values than that of their childs.

Question 25 of 30
25. Question
What data structure is used for breadth first traversal of a graph?
Correct
Queue is used for breadth first traversal whereas stack is used for depth first traversal.
Incorrect
Queue is used for breadth first traversal whereas stack is used for depth first traversal.

Question 26 of 30
26. Question
Which of the below mentioned sorting algorithms are not stable?
Correct
Except selection sort, all other soring algorithms are stable.
Incorrect
Except selection sort, all other soring algorithms are stable.

Question 27 of 30
27. Question
If there’s no base criteria in a recursive program, the program will
Correct
Without a base criteria and progressive approach, a recursion is just an infinite iteration.
Incorrect
Without a base criteria and progressive approach, a recursion is just an infinite iteration.

Question 28 of 30
28. Question
Which of the following algorithm does not divide the list −
Correct
Linear search, seaches the desired element in the target list in a sequential manner, without breaking it in any way.
Incorrect
Linear search, seaches the desired element in the target list in a sequential manner, without breaking it in any way.

Question 29 of 30
29. Question
Which of the following algorithm cannot be desiged without recursion −
Correct
Every problem which can be solved using recursion can also be solved using iterations.
Incorrect
Every problem which can be solved using recursion can also be solved using iterations.

Question 30 of 30
30. Question
Visiting root node after visiting left and right subtrees is called
Correct
In Postorder traversal method, the root node is visited last, hence the name.
Incorrect
In Postorder traversal method, the root node is visited last, hence the name.