PREP
DOOR
Explore
Mock Test
All India Test
Test Package
Topic-wise Test
Android App
X Close
Home
Profile
Explore
PrepDoor
New
My Assets
Crypt Hunt
Word List
Login |
Register
Select an option to search:
GPL Search
Google Custom Search
PSU Papers
Company Papers
Companies Fact
Online Test
Prep Tool
MBA Question
Gate Question
IES Question
Exam Papers:
TCS
Infosys
Wipro
IBM
Accenture
Patni
CTS
Sapient
Aricent
HCL
Syntel
3i Infotech
L&T Infotech
Capgemini
ITC Infotech
You need to enable javascript to view this page properly.
Company
All
CIL
ECIL
EIL
ONGC
SAIL
All
C Programming
Computer Fundamentals
Data Structure
DBMS
Operating System
Software Engineering
Technical
Loading
19.
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
20.
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
21.
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
22.
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
20.
When converting binary tree into extended binary tree, all the original nodes in binary tree are
A. internal nodes on extended tree
B. external nodes on extended tree
C. vanished on extended tree
D. None of above
asked in
CIL 2011 CSE
View Comments [0 Reply]
Discuss
Report
21.
A binary tree can easily be converted into q 2-tree
A. by replacing each empty sub tree by a new internal node
B. by inserting an internal nodes for non-empty node
C. by inserting an external nodes for non-empty node
D. by replacing each empty sub tree by a new external node
asked in
CIL 2011 CSE
View Comments [0 Reply]
Discuss
Report
32
1 ...
‹‹
2
3
4
5
6
››
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