|
CS301
|
The Total Number Of Nodes On 10Th Level Of A Perfect Binary Tree Are
|
256
|
512
|
1024
|
Cant Be Determined
|
D
|
|
CS301
|
__________ Only Removes Items In Reverse Order As They Were Entered
|
Stack
|
Queue
|
Both Of These
|
None Of These
|
A
|
|
CS301
|
In Sequential Access Data Structure Accessing Any Element In The Data Structure Takes Different Amount Of Time.
Tell Which One Of The Following Is Sequential Access Data Structure
|
Arrays
|
Lists
|
Both Of These
|
None Of These
|
B
|
|
CS301
|
If A Tree Has 50 Nodes Then The Total Edges/Links In The Tree Will Be
|
55
|
51
|
50
|
49 N-1= 49
|
D
|
|
CS301
|
If There Are N Internal Nodes In A Binary Tree Then What Will Be The No. Of External Nodes In This Binary Tree?
|
N -1
|
N +1
|
N+2
|
N
|
B
|
|
CS301
|
Which Formula Is The Best Approximation For The Depth Of A Heap With N Nodes?
|
Log (Base 2) Of N
|
The Number Of Digits In N (Base 10) E.G. 145 Has Three Digits
|
The Square Root Of N
|
N
|
A
|
|
CS301
|
Tree Data Structure Is A
|
Linear
|
Non Linear
|
Circular
|
None Of Above
|
B
|
|
CS301
|
A Binary Tree With 24 Internal Nodes Has External Nodes
|
22
|
23
|
25
|
48
|
C
|
|
CS301
|
An Array Is A Group Of Consecutive Related Memory Locations
|
True
|
False
|
|
|
A
|
|
CS301
|
To Get The Memory Address Of A Variable We Use
|
&
|
%
|
*
|
$
|
A
|
|
CS301
|
Four Statements About Trees Are Below. Three Of Them Are Correct. Which One Is Incorrect?
|
Trees Are Recursively Defined Multi-Dimensional Data Structures Tree
|
The Order Of A Tree Indicates A Maximum Number Of Children Allowed At Each Node Of The
|
A Search Tree Is A Special Type Of Tree Where All Values (I.E. Keys) Are Ordered
|
If Tree1s Size Is Greater Than Tree2s Size Then The Height Of Tree1 Must Also Be Greater Than Tree2s Height
|
D
|
|
CS301
|
Each Entry Which Points To A Null Value In A Singly Linked List Is Known As
|
Node
|
First Node
|
Last Node
|
Head Node
|
C
|
|
CS301
|
Consider A Max Heap Represented By The Following Array; 40 30 20 10 15 16 17 18 4 After Inserting A Nodes With Value 35.Which Of Following Is The Updated Max Heap?
|
40 30 20 10 15 16 17 8 4 35
|
40 30 20 10 35 16 17 8 4 15
|
40 35 20 10 30 16 17 8 4 15
|
40 35 20 10 15 16 17 18 4 30
|
A
|
|
CS301
|
A Binary Tree With N Internal Nodes Has Links Links To Internal Nodes And __________ Links To External Nodes
|
N+1 2N N-1
|
N+1 N-1 2N
|
2N N-1 N+1
|
N-1 2N N+1
|
C
|
|
CS301
|
Non Recursive Calls Are Faster Than The Recursive Calls
|
True
|
False
|
|
|
A
|
|
CS301
|
Which One Of The Following Is True About Recursion?
|
Recursion Extensively Uses Stack Memory
|
Threaded Binary Trees Use The Concept Of Recursion
|
Recursive Function Calls Consume A Lot Of Memory
|
Iteration Is More Efficient Than Iteration
|
A
|
|
CS301
|
A Queue Where The De-Queue Operation Depends Not On Fifo Is Called A Priority Queue
|
True
|
False
|
|
|
A
|
|
CS301
|
The Expression Ab+C* Is Called?
|
Prefix Expression
|
Postfix Expression
|
Infix Expression
|
None Of These
|
B
|
|
CS301
|
Each Node In Doubly Link List Has
|
1 Pointer
|
2 Pointers
|
3 Pointers
|
4 Pointers
|
B
|
|
CS301
|
The Tree Data Structure Is A
|
Linear Data Structure
|
Non-Linear Data Structure
|
Graphical Data Structure
|
Data Structure Like Queue
|
B
|