GeeksforGeeks

For a magnetic disk with concentric circular tracks, the seek latency is not linearly proportional to the seek distance due to
(A) non-uniform distribution of requests
(B) arm starting and stopping inertia
(C) higher capacity of tracks on the periphery of the platter
(D) use of unfair arm scheduling policies

Part-2 (it,cse,mca)
1. Which of the following regular expressions denotes zero or more instances of an a or b? a) a l b b) (ab)* c) (a l b)* d) a* l b

2. Hamming codes are used for error detection and correction. If the minimum Hamming distance is m, then the number of error correctable is

a)Equal to m b)Less than m/2 c)Equal to 2m d)Greater than m
3. Schottky damping is resorted to in TTL gates

a)To reduce propagation delay b)To increase noise margins c)To...

What is the possible number of reflexive relations on a set of 5 elements?
(A) 210 (B) 215 (C) 220 (D) 225

25 persons are in a room. 15 of them play hockey, 17 of them play football and 10 of them play both hockey and football. Then the number of persons playing neither hockey nor football is:
(A) 2
(B) 17
(C) 13
(D) 3

Find the Odd Man Out among the following:
a) MYSQL
b) ORACLE
c) POSTGRESQL
d) UNIX

What is the probability that divisor of 10^99 is a multiple of 10^96?
(A) 1/625 (B) 4/625 (C) 12/625 (D) 16/625

Which of the following is not an infinite loop ?

a.

while(1){
  ....
  }

b.

  for(;;){
    ...
  }

c.

   x = 0;
   do{
     /*x unaltered within the loop*/
     ...
   }while(x == 0);

d.

  # define TRUE 0
  ...
  while(TRUE){
     ....
  }

consider the following program

main()
{
 int a[5]={1,3,6,7,0};
 int *b;
 b=&a[2];
}

the value of b[-1] is
a.1
b.3
c.-6
d.none

Consider a data type with 8 bit memory storage. What is the largest primary number that can be stored?

Find the Odd Man Out among the following
a)HTTP
B)FTP
c)SAP
d)SMTP

1. In a complete binary tree, the parent of any node at index i can be determined by
a. .2i
b. 2i+1
c. i/2
d. i^2-1

2. Which of these is the correct big -Oh expression for 1+2+3+...+n?
a. O(log n)
b. O(n)
c. O(n log n)
d. O(n^2)