Data Structures Algorithms Online Quiz
Following quiz provides Multiple Choice Questions (MCQs) related to Data Structures Algorithms. You will have to read all the given answers and click over the correct answer. If you are not sure about the answer then you can check the answer using Show Answer button. You can use Next Quiz button to check new set of questions in the quiz.
Q 1 - A procedure that calls itself is called
Answer : C
Explanation
In recursion, a procedure calls itself, either directly or by calling a procedure which in turn calls it.
Answer : C
Explanation
Stack uses push() to insert an item in stack, and pop() to remove the top item from stack.
Q 3 - The following formula will produce
Fn = Fn-1 + Fn-2
Answer : B
Explanation
Fibonacci Series generates subsequent number by adding two previous numbers.
Q 4 - Which of the following searching techniques do not require the data to be in sorted form
Answer : A
Explanation
Both binary and interpolation search requires data set to be in sorted form. Linear search can work even if the data is not sorted.
Q 5 - Graph traversal is different from a tree traversal, because
Answer : C
Explanation
As trees do not have loops, they are easier to traverse.
Q 6 - Time required to merge two sorted lists of size m and n, is
Answer : B
Explanation
The time required to merge two sorted list is Ο(m + n).
Q 7 - Which of the following uses memoization?
B - Divide and conquer approach
Answer : C
Explanation
Remembering the results of previously calculated solutions is called memoization.
Q 8 - In a min heap
A - minimum values are stored.
B - child nodes have less value than parent nodes.
Answer : C
Explanation
In a min heap, parent nodes store lesser values than child nodes. The minimum value of the entire heap is stored at root.
Answer : A
Explanation
Shell sort uses insertion sort when interval value is 1.
Q 10 - Which of the following algorithm does not divide the list −
Answer : A
Explanation
Linear search, seaches the desired element in the target list in a sequential manner, without breaking it in any way.
