GPL - Technical & Aptitude Question Paper | PSU |

X Close

You need to enable javascript to view this page properly.

Company

- All
- CIL
- ECIL
- EIL
- ONGC
- SAIL

All

Loading

25.

In a Heap tree
A. Values in a node is greater than every value in left sub tree and smaller than right sub tree
B. Values in a node is greater than every value in children of it
C. Both of above conditions applies
D. None of above conditions applies

asked in CIL 2011 CSE

View Comments [0 Reply] Discuss Report
26.

The in order traversal of tree will yield a sorted listing of elements of tree in
A. Binary trees
B. Binary search trees
C. Heaps
D. None of above

asked in CIL 2011 CSE

View Comments [0 Reply] Discuss Report
27.

In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called
A. Leaf
B. branch
C. path
D. thread

asked in CIL 2011 CSE

View Comments [0 Reply] Discuss Report
28.

An algorithm that calls itself directly or indirectly is known as
A. Sub algorithm
B. Recursion
C. Polish notation
D. Traversal algorithm

asked in CIL 2011 CSE

View Comments [0 Reply] Discuss Report
29.

Which of the following sorting algorithm is of divide-and-conquer type?
A. Bubble sort
B. Insertion sort
C. Quick sort
D. All of above

asked in CIL 2011 CSE

View Comments [0 Reply] Discuss Report
30.

The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
A. ABFCDE
B. ADBFEC
C. ABDECF
D. ABDCEF

last reply by CpjJwWHV • 10 years ago • asked in CIL 2011 CSE

View Comments [7 Reply] Discuss Report

40 1 ...‹‹3 45 6 7 ››

High Frequency Word List with Mnemonics

GPL Dictionary is fast way to learn words with mnemonics.
It contains high frequency word list which are mostly asked in various examinations.
It is dedicated for student appearing for PSUs, GRE, UPSC or any other exams in which vocabulary test is taken.
User can save their own mnemonics (key and link).

Check Now