Placement Papers: GlobalEdge Paper 2008
Doorsteptutor material for CTET/Paper-2 is prepared by world's top subject experts: get questions, notes, tests, video lectures and more- for all subjects of CTET/Paper-2.
- A binary tree of height h, h > 0 has
- at least h and atmost 2 ⚹ h − 1 elements in it.
- at least 2h and atmost (2h) + 1 elementz in it.
- at least 2h − 1 and atmost h2 elements in it.
- at least h and atmost (2h) -1 elements in it.
- Ans: d
- Thrashing is
- flooding of pages in the memory.
- increase in removal of pages from memory.
- increase in page faults leading to decrease in CPU utilization.
- removal of unused pages from memory making space for new ones.
- Ans: c
- Recursive Descent parser is a type of
- Bottom up parser.
- Top Down parser.
- None of these.
- Bottom down parser.
- Ans: b
- alloca () allocates memory from
- Heap.
- Reserved memory.
- Data segment.
- Stack.
- Ans: d
- What is the octal equivalent of decimal (5468) .
- 12360.
- 12560.
- None of these.
- 12650.
Ans: c