 A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

#### Important Notice!

Dear users, compscibits.com is now permanently moved to compsciedu.com. Please update all your links and bookmarks accordingly. Soon, the site will be accessible through URL compsciedu.com only.

 61. Six files Fl, F2, F3, F4, F5 and F6 have 100,200,50,80, 120, 150 number of records respectively. In what order should they be stored so as to optimize access time? Assume each file is accessed with the same frequency. a. Fl, F2, F3, F4, F5, F6 b. F2, F6, F5, Fl, F4, F3 c. F3, F4, FI, F5, F6, F2 d. Ordering is immaterial as all files are accessed with the same frequency

 62. 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 a. f (n) + g (n) b. f (n) x g (n ) c. min (f (n) ,g (n) ) d. max (f (n) ,g (n))

 63. The order of an algorithm that finds whether a given Boolean function of 'n' variables, produces a 1 is a. linear b. constant c. exponential d. logarithmic

 64. The running time of an algorithm is given by T(n) = T(n - 1) + T(n - 2) - T(n - 3), if n > 3 n, otherwise. a. n b. log n c. n+1 d. None of these

 65. A text is made up of the characters a, b, c, d, e each occurring with the probability .12, .4, .15, .08 and .25 respectively. The optimal coding technique will have the average length of a. 1.78 b. 2.03 c. 2.15 d. 3.01

 66. 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 a. n b. log n c. n+1 d. n-1

 67. The concept of order (Big O) is important because a. it can be used to decide the best algorithm that solves a given problem b. it determines the maximum size of a problem that can be solved in a given system, in a given amount of time c. all of the above d. none of these