Your score will be displayed while taking the exam itself. After finishing the ONLINE EXAM press index or => to go to the other etests. ALL THE BEST!

1. There are 10 items in a box, out of which 3 are defective. 2 balls are taken one after the other. what is the probability that both of them are defective?

   1.   ?    1/15
   2.   ?    2/35
   3.   ?    4/90
   4.   ?    None of the Given Answers

2. which is not a memory management scheme?
   

   1.   ?    buddy system
   2.   ?    swapping
   3.   ?    monitors
   4.   ?    paging

3. CSMA/CD is used in

   1.   ?    Token ring
   2.   ?    FDDI
   3.   ?    Ethernet
   4.   ?    None of the Given Answers

4. In TCP/IP header , checksum contains

   1.   ?    Sum of all the words
   2.   ?    Ones complement of the data
   3.   ?    Ones complement of the sum of all the words
   4.   ?    Ones complement of the sum in ones complement

5. which is a good way of representing varaibles in recursion
   

   1.   ?    Static varaibles
   2.   ?    Local variables
   3.   ?    Global variables
   4.   ?    None of the Given Answers

6. func() {
   static int i = 10;
   printf("%d",i);
   i++;
   }
   
   what is the value of i if the function is called twice ?

   1.   ?    12
   2.   ?    11
   3.   ?    13
   4.   ?    14

7. In a memory chip 4k size and 16bit words to be stored. No of address and data lines reqd.

   1.   ?    16 data and 12 address
   2.   ?    12 data and 12 address
   3.   ?    16 data and 16 address
   4.   ?    None of the Given Answers

8. ARP
   
   

   1.   ?    MAC to IP
   2.   ?    IP to MAC
   3.   ?    IP to ARP
   4.   ?    None of the Given Answers

9. parse tree s -> s + s ; s -> s * s ; s -> a find the no of parse trees for a+a*a+a
   

   1.   ?    4
   2.   ?    5
   3.   ?    6
   4.   ?    None of the Given Answers

10. A choclate of size nXn is given and is to be made into pices of size 1x1. At a time both horizontal and a vertical cut is done. Find the order of complexity

    1.   ?    0(n2)
    2.   ?    o(nlogn)
    3.   ?    o(logn)
    4.   ?    None of the Given Answers