Sample papers >>  
More Papers >>                                 Recruitment Pattern
WIPRO  - Question paper - 08    Conducted On -- 16-May-2004   

Tachnical
1. fastest growing os for intel pc----linux
2. In database what is validity of the stored data data integrity,mining,processing or independence
3. method of connecting two physically seperate lan by using internet(private network)
 4. which is true for cellular mobile comm(regardinguplimk and downlink freq)
 5.mening of l value and r value
 6.effect of a program(program was put the largest value in the last array position)
  7.out put
      int i=7
     printf("%d\n",i++*i++);
 8.17 +(21-6)*2 returns(47)
 9.if funtion t is called what is printed void r(int x ,int y, int &z)
     {
      cout <<"r:x="<<x<<"y=",,y
      <<"z=",,z,,endl;
       x=x+1;
       z=y+x;
     }
   void t()
 {
  int a,b ,x;
  a=20;
  b=25;
  x=250;
  r(a,b,x);
  r(x,a,b);
  cout<<"t:a"<<a<<"b="<<b
 <<"x="<<x<<endl;
}

 10. Assume a particular cpu works properlywith 100 mhz clock. what happens if clock is increasedto1000 mhz.
11. About library function call & system call
12 What does USB stands for (universal serial bus)
13. ISDN (integrated services devices network)
 14. in windows file menu can be invoked by(alt f keys)
  15.  int lion(int x)
        // x is positive int
       {
        while (x!=10 && x%2==0)
       x+=2;
      return x;
     }
    int tiger (int x)
    {
    do 
    {
    x+=2;}
    while (x!=10 && x%2==0);
    return x;
   }
( for which values of x is it true that lion(x) euqals tiger(x)
( for all even integers less than 10)
16.The opration of constructing a heap out of an un rodered arrayis o(1),o(n log n),o(n), o(n^2)
 17.algo A and B solve the same prob. A is in O(n^2) B is o(n) which is true all i/p A is faster ; some i/p A is faster; for no i/p A is faster; for some i/p B is faster.
18.what r the three components of os
19.what is boot PROM
20.rank the following in term of acces speed: main memory,magnetic disk, registers, cache.

 Copyright © 2004 Freshersworld.com, All rights reserved.