Oracle  Placement Paper   Technical - C & C++   -11 Jul 2003

Oracle  Placement Paper   Technical - C & C++   -11 Jul 2003


  • Posted by  FreshersWorld 
    7 Jan, 2012

     

    Campus Interview Conducted in Surathkal on 11th July -2003

      Test was of 1 hour 30 questions. g aptitude and 30 of technical.......some questions. of  aptitude 
       were very lengthy so don't end up in solving them.....time was less......some 15 questions. from 
       arithmetic......and rest 15 logical,statement interpretation,arrangement,tense correction......and
       like that...... 

    1. Given a square matrix which consists only of 1 and 0......find which rows,which cols and which  diagonals consist entirely of 1's. 

    2. Given an array of integers find all possible combinations of the numbers whose sum equal to 90..... 
      ans : knapsack problem (in data structures - aho ullman) 

    Note : for them solution was not the criteria.......but the approach was important......the solution
    should be generalised and optimized........optimization was given the top priority........  

                         Technical Papers

    1. const int MAX=10; 
        main() 
         {        
           enum a {a,b,MAX}; 
           print MAX;
         }
         ans. 2   

    2. enum variable is a const variable which can only be assigned a value at initialization or a non const variable which can be assigned any value in the middle of the program? 
      ans. const variable   

    3. void *p; what operation cannot be performed on p?  ans : arithmetic operation unless it is properly typecasted   

    4. char **p="Hello"; 
             print p,*p,**p 
        ans. Hello (null) 
         warning: suspicious pointer conversion 

    5. main() 
        {     
          char str[]="Geneius";
          print (str);
        }  
          print(char *s) 
            { 
             if(*s)
             print(++s);
             printf("%c",*s); 
             }
      ans. suiene 

    6. what does the function fcloseall() does ?  
       ans. fcloseall() closes all open streams except stdin,stdout,stderr,stdprn and stdaux   

    7. main() 
        {      
           printf("Genius %d",fun(123)); 
         }   
           fun(int n)
            {    
              return (printf("%d",n));                                                                 
            } 
          ans. 123genius3   

    8. difference between definition and declaration. ans. definition once while declaration more than  once 

    9. find the error?
       main()
        {
          void fun(); 
          fun(); 
        }
        void fun() 
           {
          int i=10; 
          if(i<10) 
          return 2.0; 
          return 3.0; 
          }       
        ans. no error but warning 

    10. int a=9,b=5,c=3,d; 
      d=(b-c)<(c-a) ? a : b;
      print d
      ans 5

    11. 1+2/3*4+1=? Ans. 2  

    12. In C++, a variable can be defined wherever needed whereas not in C     

    13. main() 
         {   
          int i=4;
          fun(i=i/4); 
          print i; 
         }  
       fun(int i) 
         {
         return i/2; 
         } 
       ans 1 

    14. what is an array ? 
      ans. contiguous collection of memory occupied by similar data types 

    15. printf("\"NITK %%SURAHKAL%% !\""); 
        ans. "NITK %SURATHKAL% !" 

    16. difference between scanf and gets in case of string input  ans. scanf does not accepts white space while gets does   

    17.  table t1 m rows and x cols table t2 n rows and y cols 
        in t1*t2 rows? cols=? 
        ans. m*n ,x+y  

    18.  symbol of realtionship between 2 entities? 

    19.  which one cannot come in data modelling  a. customer b. student c. office d. speed  ans speed   

    20. can a database table exist without a primary key ? 

    21. whether higher normal forms better than lower forms as far redundancy is concerned ?  ans. higher   

    22. file is at which level  ans. conceptual level   

    23. what is a foreign key  ans. primary key in some other table  

2009-2016 downloadmela.com. All rights reserved.