With each visit of this Data Structure and Algorithms online Quiz / Practice Test, the list of MCQs / Objective Questions presented will be different, offering you a diverse set of practice opportunities. This variability encourages you to practice extensively, refining the accuracy of your answers and your overall grasp of the content. By utilizing this resource, you can hone your skills and become more adept at managing time constraints during actual exams.
Test Instructions Question type Randomized MCQs.Changes every time you visit the test Total Number of Questions 30 Time Limit 20 Minutes Points 1 Point for each Question
Remaining Time: 0 MINUTES
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
You have already completed the test before. Hence you can not start it again.
0 of 30 questions answered correctly
Your time:
Time has elapsed
You have reached 0 of 0 points, (0 )
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
Question 1 of 30
Q-1.Which of the following data structure is not linear data structure?
Your Answer:Correct
Your Answer:Incorrect
Question 2 of 30
Q-2.Read the following statements carefully and pick the correct option:
I. The worst time complexity of the Floyd’s algorithm is O(n3). II.
The worst time complexity of the Warshall’s algorithm is O(n3).
Your Answer:Correct
Your Answer:Incorrect
Question 3 of 30
Q-3.Which of the following versions of merge sort algorithm does uses space efficiently?
Your Answer:Correct
Your Answer:Incorrect
Question 4 of 30
Q-4.The complexity of linear search algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 5 of 30
Q-5.To calculatec(i, j )’s, w( i, j)’s and r(i, j)’s; the OBST algorithm in worst case takes
the following time.
Your Answer:Correct
Your Answer:Incorrect
Question 6 of 30
Q-6.Testing of a program consists of 2 phases which are ______________________
and ____________
Your Answer:Correct
Your Answer:Incorrect
Question 7 of 30
Q-7.The Hamiltonian cycles problem uses the following line of code to generate a
next vertex, provided x[ ] is a global array and kth vertex is under consideration:
Your Answer:Correct
Your Answer:Incorrect
Question 8 of 30
Q-8.In which of the following length records file records may contain different lengths?
Your Answer:Correct
Your Answer:Incorrect
Question 9 of 30
Q-9.The complexity of the average case of an algorithm is
Your Answer:Correct
Your Answer:Incorrect
Question 10 of 30
Q-10.which is optimal value in the case of fractional knapsack problem, capacity of
knapsack is 10
item : 1 2 3 4 5
profit : 12 32 40 30 50
weight : 4 8 2 6 1
Your Answer:Correct
Your Answer:Incorrect
Question 11 of 30
Q-11.Which of the following data structure is non-linear type?
Your Answer:Correct
Your Answer:Incorrect
Question 12 of 30
Q-12.A connected graph T without any cycles is called
Your Answer:Correct
Your Answer:Incorrect
Question 13 of 30
Q-13.Which of the following is not a limitation of binary search algorithm?
Your Answer:Correct
Your Answer:Incorrect
Question 14 of 30
Q-14.The general criteria of algorithm; Each instruction is clear and unambiguous ______
Your Answer:Correct
Your Answer:Incorrect
Question 15 of 30
Q-15.The OBST algorithm in worst case takes _______ time if all c(i, j )’s and r(i, j)’s are
calculated.
Your Answer:Correct
Your Answer:Incorrect
Question 16 of 30
Q-16.A __________ is a round trip path along n edges of G that visits every vertex once
and returns to its starting position.
Your Answer:Correct
Your Answer:Incorrect
Question 17 of 30
Q-17.In Quick sort algorithm,constants hidden in T(n lg n) are
Your Answer:Correct
Your Answer:Incorrect
Question 18 of 30
Q-18.Worst case efficiency of which search is O(n)?
Your Answer:Correct
Your Answer:Incorrect
Question 19 of 30
Q-19. What term is used to describe an O(n) algorithm?
Your Answer:Correct
Your Answer:Incorrect
Question 20 of 30
Q-20.In stable sorting algorithm
Your Answer:Correct
Your Answer:Incorrect
Question 21 of 30
Q-21.Identify the name of the sorting in which time is not proportional to n2.
Your Answer:Correct
Your Answer:Incorrect
Question 22 of 30
Q-22.In Algorithm Specification the blockes are indicated with matching _______
Your Answer:Correct
Your Answer:Incorrect
Question 23 of 30
Q-23.which is not feasible solution in the case of job sequence problem
item : 1 2 3 4
profit : 100 10 15 27
deadline : 2 1 2 1
Your Answer:Correct
Your Answer:Incorrect
Question 24 of 30
Q-24.Sequential search has a time complexity of O(n), and binary search has a time
complexity of O(log(n)). What difference will it make when the size n is 1000?
Your Answer:Correct
Your Answer:Incorrect
Question 25 of 30
Q-25.The mathematical definition for Omega can be defined as, provided f,g:NR+ and c
is a positive constant and n > n0,
Your Answer:Correct
Your Answer:Incorrect
Question 26 of 30
Q-26.A binary tree whose every node has either zero or two children is called
Your Answer:Correct
Your Answer:Incorrect
Question 27 of 30
Q-27.How do you determine the cost of a spanning tree?
Your Answer:Correct
Your Answer:Incorrect
Question 28 of 30
Q-28.The graph colouringalgorithm’s time can be bounded by _________
Your Answer:Correct
Your Answer:Incorrect
Question 29 of 30
Q-29.Which of the following is not a primitive data structure?
Your Answer:Correct
Your Answer:Incorrect
Question 30 of 30
Q-30.The total number of comparisons in a bubble sort is
Your Answer:Correct
Your Answer:Incorrect