.
 Vyom World.com  . Let's Touch the Sky Together!  
.
. . . . . . .

Home
VyomWorld.com Home
Free Magazines!
VyomLinks.com Home
JobsAssist.com Home
Vyom Network
Contact Us
Jobs & Careers
Resume Submitter
Placement Papers
IT Companies Directory
Computer Jobs
Interview Questions
Online Exams
Vyom Career eMag.
Fun
Send FREE SMS!
SMS Jokes
Source Codes Library
Source Codes Home
ASP Source Codes
C Source Codes
C++ Source Codes
COBOL Source Codes
Java Source Codes
Pascal Source Codes
Submit Source Codes
GATE
GATE an Overview
GATE Preparation
Study Materal
GRE
GRE an Overview
GRE Questions
GRE Preparation
GRE Universities
TOEFL Preparation
TOEFL Resources
GMAT Preparation
GMAT Resources
MBA Preparation
MBA Resources
Networking Concepts
Networking Concepts
Testing Preparation
Testing Resources
Webmasters
Free Traffic Builder
Webmaster Articles
Web Hosting
Tutorials
Hardware Tutorial
1500 Free eBooks New!
FREE Publications
Vyom Career eMag.
.
Get 9,000+ Interview Questions & Answers in an eBook.


  • 9,000+ Interview Questions
  • All Questions Answered
  • 5 FREE Bonuses
  • Free Upgrades

    Get it now!

  • Get 9,000+ Interview Questions with Answers in an eBook


    Home » Placement Papers » Oracle Placement Papers » Oracle Placement Paper

    New Click here to Download 2012 Latest placement papers of this company New


    Oracle Placement Paper





    Oracle Paper
    * Some questions are compiler based i.e. given code snippet will compile or not, if not the reason.
    * some question are from the prfix/postfix inc/dec operation based code snippets.
    * More than 3 question are based on the sorting algorithms.
    * some questions are from the pointers based.
    * Code snippets involving memory allocation function.
    * All the questions are from c 
    Some of the question ,i remember, are the following
    1. 
    #include <stdio.h>
    #define sqr(x) (x*x)
    int main()
    {
    int x=2;
    printf("value of x=%d",sqr(x+1));
    }

    What is the value of x?
    a)4 b)5 c)None d)can not compile
    Ans: 5 
    2. what is the wrong in the following program?
    #define LBRACKET {
    #define RBRACKET }
    #define MAIN main
    int MAIN()
    LBRACKET 
    int x=2;
    printf("%d",x);
    RBRACKET 
    a) This program will compile
    b) compilation error 
    3.
    #include <stdio.h>
    int main()
    {
    int x=4;
    {
    {
    {
    int x=2;
    printf("%d",x);
    }
    }
    }
    }
    a) 4 b)2 c)Nesting not allowed d)dependent on the compiler
    4. Go through the following code sinippet
    char a[20];
    a="Hello Orcale Test";
    will this compile?
    a) Compilation Error b) Strings are allowed in c but cannot be assigned directly.
    c) dependent on compiler
    d) will work fine.
    5. the expression a+b*c should be conveted to +a*bc. Using tree structure,
    Which traversal is the correct one?
    a) Postfix traversal b) prefix traversal c) infix traversal d)None
    6. what about brk, sbrk
    a) system calls b) function calls c) user defined functions 
    7. Why the use of alloca() is discouraged?
    8. Macros support multiple arguments ?
    9. the header file 
    a) contains only compiler directives and extern variables
    b) contail only structures and unitions
    c) a & b
    10. what about "char *(*(*a[])())();"





    : oracle paper***

    1. An index is automatically generated with the following 
    constraints. 
    a. Check 
    b. Not null 
    c. Primary key 
    d. Foreign key 
    2. Select mod(16,3) from emp; 
    a. 1 
    b. 2 
    c. 3 
    d. Error in the stmt 
    3. The data dictionary view to see the list of constraints enabled 
    on a 
    table is 
    a. user_tables 
    b. user_table_constraints 
    c. user_constraints 
    d. There is no dictionary view available for the same 
    4. Identify the pseudocolumns 
    a. rowid 
    b. sysdate 
    c. rowval 
    d. dual 
    5. select deptno, count(empno) from emp 
    where count(empno)>=5 
    group by deptno; 
    identify the line no which contains the error 
    a. 1 
    b. 2 
    c. 3 
    d. 1,3 
    6. choose the group function that can be used with any data type 
    a. sum() 
    b. min() 
    c. avg() 
    d. all 
    7. which of the following sequence is true 
    a. WHERE,HAVING,GROUPBY,ORDERBY 
    b. GROUPBY, WHERE, HAVING, ORDERBY 
    c. ORDERBY,GROUPBY,WHERE,HAVING 
    d. NONE OF THE ABOVE 
    8. which of the proper keyword to deallocate memory 
    a. free 
    b. delete 
    c. clear 
    d. remove 
    9. what is the index no of the last element of an array with 29 
    elements 
    a. 29 
    b. 28 
    c. 0 
    d. programmer defined 

    10. what is the final value of x when the code for(int 
    x=0;x<10;x++) is 
    run? 
    a. 10 
    b. 9 
    c. 0 
    d. 1 
    11. what is the data type of FILE? 
    a. integer 
    b. union 
    c. pointer 
    d. structure 
    12. if "a" is an array of 5*5 dimension, a[2][4] is same as 
    a. **(a+2+4) 
    b. *(a+2) + *(a+4) 
    c. **(a+2)+4 
    d. *(*a+2)+4) 
    13. what is the output of .. 
    #include<stdio.h> 
    void main() 

    char buffer[10]={"Genesis"}; 
    printf("%d",&buffer[4]-(buffer)); 

    a. 3 
    b. 4 
    c. 0 
    d. illegal pointer subtraction 
    14. what is the output for 
    #include<stdio.h> 
    main() 

    static int a[]={5,10,15,20}; 
    int * ptr=a; 
    int ** ptr_ptr=&ptr; 
    printf("\n %d",**ptr_ptr++); 

    a. 5 
    b. 10 
    c. 15 
    d. 6 
    15. what is the value of expr.. 
    1+2/3*4+1 
    a. 2 
    b. 3 
    c. 4 
    d. 4.666666 
    e. 5 
    16. identify the relationship between the many employees 
    working 
    in a dept.. 
    a. one to one 
    b. one to many 
    c. many to one 
    d. many to many 
    17.there was a table given and it was asked which normal form does 
    it 
    follows.. 
    18. the process of including some controlled redundancy for 
    the 
    sake of performance 
    is known as 
    a. normalization 
    b. Cartesian product 
    c. Denormalization 
    d. None 
    19. in a doubley linked list 
    a. the last node contains the address of the first node 
    b. each node contains the address of previous and next node 
    c. each node contains the address of previous node 
    d. none 
    20. in a queue each node contains 
    a. the address of previous node 
    b. address of next node 
    c. address of both the previous and next node 
    d. none of the above 






    oracle paper
    br>
    The test was of 1 hour 30 ques. g apti and 30 of 
    technical.......some 
    ques. of g apti were very lengthy so don't end up in solving 
    them.....time was less......some 15 ques. from arithmetic......and 
    rest 
    15 
    logical,statement interpretation,arrangement,tense 
    correction......and 
    like 
    that...... 
    i am enclosing here the 2 C questions : 
    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........ 
    here is the techincal paper : 
    plz try to solve them urself by trying on comp. 
    1. const int MAX=10; 
    main() 
    {enum a {a,b,MAX}; 
    print MAX; 

    2. enum object is a const which can only be assigned a value at 
    initialization or a variable which can be assigned any value in 
    the 
    middle of 
    the program? 
    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 
    5. main() 
    {char str[]="Geneius"; 
    print (str); 

    print(char *s) 
    {if(*s) 
    print(++s); 
    printf("%c",*s); 

    6. what does the function fcloseall() does ? 
    7. main() 
    {printf("Genius %d",fun(123)); 

    fun(int n) 
    {return (printf("%d",n)); 

    8. difference between definition and declaration. 
    9. find the error? 
    fun() 
    {int i=10; 
    if(i<10) 
    return 2.0; 
    else 
    return 3.0; 

    10. int a=9,b=5,c=3,d; 
    d=(b-c)<(c-a) ? a : b; 
    print d 
    11. 1+2/3*4+1=? 
    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; 

    14. what is an array ? 
    15. printf("\" NITK %%SURAHKAL%% !\""); 
    16. difference between scanf and gets in case of string input 
    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 
    20. can a database table exist without a primary key ? 
    21. whether higher normal forms better than lower forms as far 
    redundancy is concerned ? 
    22. file is at which level 
    ans. conceptual level 
    23. what is a foreign key 




    ORACLE

    Oracle at BIT...well i cleared the written but the interview was 
    really rigourous...it was in 4 rounds....with streching upto 8 
    hrs 
    per candidate who was selelcted....Oracle took a total of 10 
    people(9 BEs and 1 MCA) 

    The oracle paper was difficult to remember... 

    but i can give brief outline as to what could be studied...The 
    Technical consisted of C,Pl/SQL and JAVA....go through Ivan 
    Bayross for Pl/SQL and Pointers in C by Kanetkar....some of the 
    qs 
    were directly from there..... 

    u may also do DBMS concepts.....as to what is Data 
    Modelling,Transactions, Distributed Databases 

    In my interview.....first we had a short test on C Programming 
    where in i 
    was given C programs to write on PREORDER Tree traversal and 
    Conversion of 
    Infix to Postfix expression...the interview followed where they 
    grilled me 
    on Java and C preprocessors from head to toe...but was unable to 
    clear the 
    second round of interview 




    ORACLE
    ------


    section 2:


    1. what is sparese matrices?. give (at least) two methods for implemetation
    rather than two dimentional array.
    2.what are cheap locks/latches?.
    3.what is two phase locking?. Name two locks.
    4. What are volatile variables in C?. What is their significance ?.
    5. will these two work in same manner
    #define intp int *
    typedef int * inpp;
    6. what are binary trees?. what is its use?.
    7. 

    section 3 :

    A). write header file containing functions used, etc (C),
    problem is to maitain a Queue. user has to give size and type of Queue.
    This problem is like this I don't remember exactly.
    B). C++
    1. What is polymorphism?
    2. What is Inheritence?.
    3. Mention four Object Oriented Programming Languages?>
    4. Mention basic concepts of OOP.
    5. What are messages in OOP?.
    6. What is garbase collection?.
    7.what is object?.
    8. what is a class?.

    Section 4:

    1. expand the following:
    a.SEI b. ISO
    2. what are different levels of SEI?.
    3. What is significance of ISO?>
    4. Expand the following:
    a. WWW
    b. HTTP
    c. HTML
    d. TCP/IP
    5. what is Black box testing?.
    6. explain the following:
    1. white box testing
    2. white box testing
    3. boundary testing
    4 stress
    5. negative
    6. system
    7. unit
    8.module
    9.destructive



    New Click here to Download 2012 Latest placement papers of this company New




    Looking for Job? Upload your resume here for MAXIMUM Exposure!

    Get 15 Freshers Jobs everyday!

    We work hard to collect each & every job for you. From all possible sources, the most exhaustive and authentic Freshers Jobs Information.

    You don't need anything else!
    Get Freshers Jobs in your mail:


    .

    Recently Updated: New Placement Papers added.
    Vyom Network : Web Hosting | Dedicated Server | Free SMS, GRE, GMAT, MBA | Online Exams | Freshers Jobs | Software Downloads | Programming & Source Codes | GRE Preparation | Jobs, Discussions | Software Listing | Free eBooks | Free eBooks | Free Business Info | Interview Questions | Free Tutorials | International Business Information | IAS Preparation | Jokes, Songs, Fun | Free Classifieds | Free Recipes | FAQs | Free Downloads | Bangalore Info | Tech Solutions | Project Outsourcing, Web Hosting | GATE Preparation | MBA Preparation | SAP Info | Excellent Mobiles | Software Testing | Interview Questions | Freshers Jobs | Server Insiders | File Extension Directory

    Copyright ©2003-2012 Vyom Technosoft Pvt. Ltd., All Rights Reserved. Read our Privacy Policy
    Page URL: http://www.vyomworld.com/placementpapers/oracle-placement-paper-12.asp