Placement Papers: GlobalEdge Paper 2008

Download PDF of This Page (Size: 105K)

Examrace Placement Series prepares you for the toughest placement exams to top companies.

  1. A binary tree of height h, h > 0 has

    1. at least h and atmost 2 * h − 1 elements in it.

    2. at least 2h and atmost (2h) + 1 elementz in it.

    3. at least 2h − 1 and atmost h2 elements in it.

    4. at least h and atmost (2h) -1 elements in it.

    Ans: d

  2. Thrashing is

    1. flooding of pages in the memory.

    2. increase in removal of pages from memory.

    3. increase in page faults leading to decrease in CPU utilization.

    4. removal of unused pages from memory making space for new ones.

    Ans: c

  3. Recursive Descent parser is a type of

    1. Bottom up parser.

    2. Top Down parser.

    3. None of these.

    4. Bottom down parser.

    Ans: b

  4. alloca () allocates memory from

    1. Heap.

    2. Reserved memory.

    3. Data segment.

    4. Stack.

    Ans: d

  5. What is the octal equivalent of decimal (5468).

    1. 12360.

    2. 12560.

    3. None of these.

    4. 12650.

Ans: c