Q. The number of disk pages access in B-tree search, where h is height, n is the number of keys, and t is the minimum degree, is:

View solution

Q. An ideal sort is an in-place-sort whose additional space requirement is ...............

View solution

Q. Loop unrolling is a code optimization technique:

View solution

Q. Match the following w.r.t. programming languages:

List - I                                     List – II
(a) JAVA                        (i) Dynamically object oriented
(b) Python                     (ii) Statically Non-object oriented
(c) Prolog                      (iii) Statically object oriented
(d) ADA                         (iv) Dynamically non-object oriented

Codes:
   (a)  (b)  (c)  (d)

View solution

Q. In Activity-Selection problem, each activity i has a start time si and a finish time fi where si≤fi. Activities i and j are compatible if:

View solution

Q. Floyd-Warshall algorithm utilizes ............... to solve the all-pairs shortest paths problem on a directed graph in ................ time.

View solution

Q. Which of the following is used to make an Abstract class ?

View solution

Q. Match the following with reference to object oriented modelling :

List - I                         List - II

(a) Polymorphism        (i) Picking both operator and attributes with
operations appropriate to model an object
(b) Inheritance             (ii) Hiding implementation details of methods
from users of objects
(c) Encapsulation        (iii) Using similar operations to do similar things
(d) Abstraction              (iv) Create new classes from existing class

Codes :
      (a)   (b)  (c)   (d)

View solution

Q. Which of the following is/are correct with reference to Abstract class and interface ?

(a) A class can inherit only one Abstract class but may inherit several interfaces.
(b) An Abstract class can provide complete and default code but an interface has no code.

View solution

Q. Consider the following conditions :

(a) The solution must be feasible, i.e. it must satisfy all the supply and demand constraints.
(b) The number of positive allocations must be equal to m+n-1, where m is the number
of rows and n is the number of columns.
(c) All the positive allocations must be in independent positions.

The initial solution of a transportation problem is said to be non-degenerate basic feasible solution if it satisfies :

View solution

Q. Big-O estimates for the factorial function and the logarithm of the factorial function i.e. n! and log n! is given by

View solution

Q. Match the following:

List-I                                       List-II
a. Classification           i. Principal Component Analysis
b. Clustering                 ii. Branch and Bound
c. Feature Extraction   iii. K-nearest neighbour
d. Feature Selection   iv. K-means

Codes:
      a    b    c    d

View solution

Q. Merge sort makes two recursive calls. Which statement is true after these two recursive calls finish, but before the merge step?

View solution

Q. Searching for an element in the hash table requires O(1) time for the ............... time, whereas for direct addressing it holds for the ............. time.

View solution

Q. An algorithm is made up of 2 modules M1 and M2. If time complexity of  modules M1 and M2 are h(n) and g(n) respectively, the time complexity of the algorithm is

View solution

Q. What is the maximum number of parenthesis that will appear on the stack at any one time for parenthesis expression given by

( ()     (())         (()) )

View solution

Q. Suppose that the splits at every level of Quicksort are in proportion 1-β to β, where 0<β≤0.5 is a constant. The number of elements in an array is n. The maximum depth is approximately

View solution

Q. The minimum number of nodes in a binary tree of depth d (root is at level 0) is

View solution

Q. The efficient data structure to insert/delete a number in a stored set of numbers is

View solution

Q. Consider the following statements:

(i) A graph in which there is a unique path between every pair of vertices is a tree.
(ii) A connected graph with e = v – 1 is a tree.
(iii) A graph with e = v – 1 that has no circuit is a tree.

Which of the above statements is/are true?

View solution