Home⇒ Computer Engineering⇒ Data structures and algorithms
| 1-Dont try to cram or spend more time here just read it fast and cover syllabus then practice MCQ's cheptor of same topic to check your progress. . |
| 2-Wrong options are also given but dont concentrate there, Right answer is in bold format. |
| Q1 ⇒ An ADT is defined to be a mathematical model of a user-defined type along with the collection of all ____________ operations on that model Primitive [other wrong options] [Discuss in forum] |
| Q2 ⇒ Which of the following algorithms solves the all-pair shortest path problem? Floyd's algorithm [other wrong options] [Discuss in forum] |
| Q3 ⇒ The running time of an algorithm T(n),where 'n' is the input size, of a recursive algorithm is given as follows.is given by T(n) =c + T(n - 1), if n > 1 d, if n ≤ 1 The order of this algorithm is n [other wrong options] [Discuss in forum] |
| Q4 ⇒ The concept of order (Big O) is important because all of the above [other wrong options] [Discuss in forum] |
| Q5 ⇒ The order of an algorithm that finds whether a given Boolean function of 'n' variables, produces a 1 is constant [other wrong options] [Discuss in forum] |
| Q6 ⇒ Which of the following is useful in traversing a given graph by breadth first search? Queue [other wrong options] [Discuss in forum] |
| Q7 ⇒ Which of the following need not to be a binary tree ? B-Tree [other wrong options] [Discuss in forum] |
| Q8 ⇒ Which of the following data structure may give overflow error,even though the current number of element in it is less than its size? Circular queue [other wrong options] [Discuss in forum] |
| Q9 ⇒ Which of the following is a collection of items into which items can be inserted arbitrarity and from which only the smallest item can be removed? Ascending priority queue [other wrong options] [Discuss in forum] |
| Q10 ⇒ Representation of data structure in memory is known as: Abstract data type [other wrong options] [Discuss in forum] |
| Q11 ⇒ The time required to search an element in a linked list of length n is O(n) [other wrong options] [Discuss in forum] |
| Q12 ⇒ Which of the following sorting algorithm has the worst time complexity of n log(n)? Heap sort [other wrong options] [Discuss in forum] |
| Q13 ⇒ An algorithm is made up of 2 modules Ml and M2. If order of M1 is f(n) and M2 is g(n) then the order of the algorithm is max (f (n) ,g (n)) [other wrong options] [Discuss in forum] |
| Q14 ⇒ Which of the following is false ? For a serial search to work, the data in the array must be arranged in either alphabetical or numerical order [other wrong options] [Discuss in forum] |
| Q15 ⇒ The average search time of hashing, with linear probing will be less if the load factor is far less than one [other wrong options] [Discuss in forum] |
| Q16 ⇒ The time complexity of an algorithm T(n), where n is the input size, is given by T( n) = T( n - 1) + 1/n if n > 1 The order of this algorithm is log n [other wrong options] [Discuss in forum] |
| Q17 ⇒ Which of the following best describes sorting ? Arranging the data (record) in some given order [other wrong options] [Discuss in forum] |
| Q18 ⇒ If the binary search algorithm determines that the search argument is in the lower half of the array, which of the following statements will, set the appropriate variable to the appropriate value? start Sub = middle Sub + 1; [other wrong options] [Discuss in forum] |
| Q19 ⇒ The minimum number of colors needed to color a graph having n (>3) vertices and 2 edges is 2 [other wrong options] [Discuss in forum] |
| Q20 ⇒ The average successful search time for sequential search on 'n' items is (n+1)/2 [other wrong options] [Discuss in forum] |
| Or |