Placement Papers - CMC

1.   If we use front end processor for I/O operations then the load will be reduced on
     ans:cpu

2.   one question on DMA
     ans:DMA

3.   In list of 4 numbers the maximum number of comparisions to find the maximum and immediate maximum number

4.   Confuguration management does not consider about                     ans:hard ware devices.

5.  The most important factor of the coding: ans:readability.

6   Which of the following testing methods is used as a aceptency test
    ans:functional testing

7.  If the number of conditions in the decision table is n,the max number of
    ans:2 power n

8.  What is meant by swaping?

9.  If(node!=null)
     {
     write(node) A(left B,right D)
     traverse(right subtree) D(left E,right f)
     write(node)
     traverse(left subtree)}

10.  A question on Functional Dependencies which is not FD in the following?

11.  If T(x)=2T(x/2)+1 T(1)=1 and n is the power of 2 then T(x)=?
     ans:(2n-1)

 12. If we want to access the data and members of a class to the immediate derived class which access specifier is used?
     ans:protected

13. Two questions on Queries(sql) technical test is easy.u must attempt first data comparisons, then arithmetic, then datasufficiency.

14.  windows NT is:
     1. extension to windows 95 2)mutiprocessing system
     3. provides GUI 4)none of the above.   


CMC Aptitude questions in Barron\'s GRE
---------------------------------------
Page No. Question Nos.

11     5,6,7 - An instructor...

12     9,10,11 - Dormitories..., It\'s important..., The Census Bureau...

34     7,13,14,15,16 - My father..., All ...

37     25 - I\'m afraid...

40     17,18,19,20,21,22 - Mathematics...

41     25 - Television...

89     14 - Hobble

99     According to the passage... (RC)

273    30,31 - x,y,z are consecuive..., a/b-c = -5/c+b

408    1,2,3,4 - An office manager...

413    40,41 - As president...


438    7 - Wilbur is 6

439    8,9,10,11,12 - A project

441    5,6 - If Elaine..., Frank must...

444    24 - A meadow...

471    23,24 - In 1978...

473    8 to 16 (Analogy) Bleat: Sheep ...

494    23 - The current trend...

591    23 - Lillian, who...

    C Questions

  Read Exploring in c:(bitwise operators,precedence)                    
1.   main()
          {
           int x=10,y=5,p,q;
           p=x>9;
          q=x>3&&y!=3;
           printf("p=%d q=%d",p,q);
          }ans:1,1.

2.    main()
       {
         int x=11,y=6,z;
         z=x==5 || !=4;
         printf("z=%d",z);
        }ans:1

3     main()
       {
         int c=0,d=5,e=10,a;
         a=c>1?d>1||e>1?100:200:300;
         printf("a=%d",a);
        }ans:300

4     main()
       {
         int i=-5,j=-2;
         junk(i,&j);
         printf("i=%d,j=%d",i,j); 
        }
        unk(i,j)
         int i,*j
        {
          i=i*i;
          *j=*j**j;
        }
        ans:-5,4;

5    #define NO
      #define YES
      main()
       {
        int i=5,j;
        if(i>5)
           j=YES;
        else
           j=NO;
        printf("%d",j);
        }
       ans:Error message

6.     main()
        {
         int a=0xff;
         if(a<<4>>12)
           printf("leftist)
          else
           printf("rightist")
          }
          ans:rightist

7      main()
          {
            int i=+1;
            while(~i)
            printf("vicious circles")
           }
           ans:continuous loop.


8    One question on assigning two different structures; i.e structure1 variable1=structure1 variable2