Veritas Model Papers

Embed Size (px)

Citation preview

  • 8/2/2019 Veritas Model Papers

    1/5

  • 8/2/2019 Veritas Model Papers

    2/5

    4. General questions on binary trees, transversals

    5. General questions on graphs and their representation.

    Typical Questions on Operating Systems

    1. Demand paging, page faults, replacement algos, thrashing, etc

    2. Paged segmentation and segment paging

    In this section, case studies are presented are presented before the candidate to percieve his reaction and

    his/her communication skills are tested. IBM expects teamwork and teamspirit from the candidates and their

    answers should reflect this attitude

    Typical question is

    You are a project manager of a big multinational project. There is a person X, assigned to you who has the

    best technical skills required for the project, even better than you. But he wishes to be the project manager

    ,which the management does not permit, due to which he threatens to quit. All others in the group are not as

    competent. Talk yourself out of this situation pretending that the interviewer is the disgruntled employee and

    explain the necessary action.

    Veritas Test Paper / IIT Kanpur / 01-08-03

    ------------------------------------------

    /*Objective Questions: 30 questions*/

    Time duration: 30 minutes.

    1. What is the output of the following operation?

    0x7e00e9 % 0x7

    2. What does a sticky bit do and why?

    3.

    /* Question is how many processes are created when this program is run */

    int main(){forkthem(5);}

    void forkthem(int n){if (n>0){fork();forkthem(n-1);}else return;}

    4. preorder and inorder was given, asked which of the options was postorder

    /* Please complete */

    5. Which of the following representations do not need braces or parenthesis

  • 8/2/2019 Veritas Model Papers

    3/5

    - prefix, postfix & infix;

    6. Give the grammar - E -> E*E | E+E | n,is it ambiguous? left recursive? none?

    7. given the following code in two threads, what will be the range of possible values of n?

    /* First Thread */sum = 0;for(i = 1;i

  • 8/2/2019 Veritas Model Papers

    4/5

  • 8/2/2019 Veritas Model Papers

    5/5

    int f(int i){return ((--i>1)? f(i) - f(i-1):0);}

    3. Find whether the following programs have any compilation errors?

    Part A------#define SRP1 struct record *typedef struct record * SRP2;

    SRP1 p1, p2;SRP2 p3, p4;

    swap(){SRP2 temp1, temp2;

    temp1 = p1;p1 = p3;p3 = temp1;temp2 = p2;p2 = p4;p4 = temp2;}

    Part B------#define EIGHT 08

    main()

    {int nine;char *string="abcdefgh"nine= EIGHT;printf("%d",string[nine]);}