Wipro Aptitude Test - Technical Questions 2

Technical

1. What sorting algos have their best and worst case times equal ?

Ans. O(nlogn) for  mergesort  and heap sort

2. What page replacement algorithm has minimum number of page faults ?

Ans. Optimality algorithm

3.  What is the use of virtual base class in c++

     Ans. Multiple lines between derived classes. 

4. Assignment operator targets to _____

     Ans. l-value

5. A byte addressable computer has memory capacity of 2 power m Kbytes and can perform 2 power n operations an              
     instruction involving three operands and one operator needs maximum of___________ bits

Ans. 3m + n

6. In round robin scheduling, if time quantum is too large then it degenerates to

Ans. FCFS

7. What data structures you should use for dictionary searching and it  should be capable of doing spell check also ?

                Ans: Hashing 

8. What is the value of 121 base 4 + 84 base 16 ? 

        Ans :  2130

9. When the fn. is called where the return address is stored?

                Ans. stack

10.  C program code

        int zap (int n)

       {

        if (n<=1)then zap=1;

        else  zap=zap(n-3)+zap(n-1);

       }

       then the call zap(6) gives the values of zap

       [a] 8  [b]  9  [c] 6  [d]  12  [e] 15

       Ans: b

11.  Virtual memory size depends on

           [a] address lines    [b] data bus

           [c] disc space       [d] a & c    [e] none 

         Ans :  a

12. Critical section is   

      Ans: statements which are accessing shared resources

13. In which layer ROUTING is performed ?

          Ans.  Network Layer

14.  What is the output of the following  code snippet

main()

{

   printf(5+”Fascimile”);

}

Ans. mile

15. Which one has no L-Value

A   a[i]         B.  i         C.  2             D.  *(a+i)

Ans . C

16.     Which is true for binary search ?

    A Traversal scheme                                B. Greedy algorithm

    C. Divide and conquer algorithm             D. none of these

     Ans. C

17.      What is the protocol used for getting the physical address by supplying  IP address of a node ?

A.  ARP         B.  RARP         C. BOOTP         D. DHCP

      Ans. A

18. Which is not an OS?

a)      Win 3.1        b)      Win 95 

c)      Win 98       d)      Win 2000

Ans. a

19. Tcp/ip is

    a) connectionless            b) connection oriented            c) both a & b           d) none

    Ans:  b

20. A sorting algorithm which can prove to be a best time algorithm in one case and a worst time algorithm in worst case is

     (a) Quick Sort         (b) Heap Sort     (c) Merge Sort         (d) Insert Sort

    Ans. (a)