Time Left - 05:00 mins

NIELIT Scientist –B Daily Quiz - 1 (Algorithms)

Attempt now to get your rank among 501 students!

Question 1

Six files F1,F2,F3,F4,F5 and F6 have 100, 200, 50, 80, 120, 150 records respectively. In what order should they be stored so as to optimize act. Assume each file is accessed with the same frequency

Question 2

Consider the following program fragment
if(a>b)
if(b>c)
s1;
else s2;
s2 will be executed if

Question 3

Which of the following statements is true for Branch – and – Bound search?

Question 4

Let, and be asymptotically non-negative functions. Which of the following is correct?

Question 5

Big-O estimates for the factorial function and the logarithm of the factorial function i.e. n! and log n! is given by
  • 501 attempts
  • 4 upvotes
  • 5 comments
Apr 4GATE & PSU CS