|
CS301
|
For Compiler A Postfix Expression Is Easier To Evaluate Than Infix Expression?
|
True
|
False
|
|
|
A
|
|
CS301
|
Consider The Function X As Under
Int X (Int& Value)
{
Return Value;
}
Now A And B Are Integers In A Calling Function. Which One Of The Following Is A Valid Call To The Above Function
X
|
A = X (B) ;
|
A = X (&B) ;
|
A = X (*B) ;
|
None Of The Given Options
|
B
|
|
CS301
|
We Implement The Heap By __________
|
Threaded Tree
|
Avl Tree
|
Complete Binary Tree
|
Expression
|
C
|
|
CS301
|
Which One Of The Following Algorithms Is Most Widely Used Due To Its Good Average Time
|
Bubble Sort
|
Insertion Sort
|
Quick Sort
|
Merge Sort
|
C
|
|
CS301
|
There Is/Are __________ Case/S For Rotation In An Avl Tree
|
1
|
2
|
3
|
4
|
D
|
|
CS301
|
For A Perfect Binary Tree Of Height H Having N Nodes The Sum Of Heights Of Nodes Is
|
N – (H – 1)
|
N – (H + 1)
|
N – 1
|
N – 1 + H
|
B
|
|
CS301
|
An Array Is A Group Of Consecutive Related Memory Locations
|
True
|
False
|
|
|
A
|
|
CS301
|
We Have A Circular Array Implementation Of The Queue Class With Ten Items In The Queue Stored At Data[2] Through Data[11]. The Capacity Is 42 I.E. The Array Has Been Declared To Be Of Size 42. Where Does The Push Member Function Place The New Entry
|
Data[1]
|
Data[2]
|
Data[11]
|
Data[12]
|
D
|
|
CS301
|
A Subscript Of An Array May Be An Integer Or An Integer Expression
|
True
|
False
|
|
|
A
|
|
CS301
|
We Can Add Elements In Queue From ___________
|
Front
|
Rear
|
From Both Rare And Front
|
None Of These
|
B
|
|
CS301
|
A Complete Binary Tree Of Height Has Nodes Between 16 To 31
|
2
|
3
|
4
|
5
|
C
|
|
CS301
|
Which Of The Given Option Is Not A Factor In Union By Size
|
Maintain Sizes (Number Of Nodes) Of All Trees And During Union
|
Make Smaller Tree The Subtree Of The Larger One
|
Make The Larger Tree The Subtree Of The Smaller One
|
Implementation: For Each Root Node I Instead Of Setting Parent[I] To -1 Set It To -K If Tree Rooted At I Has K
Nodes
|
C
|
|
CS301
|
In A Min Heap Preculatedown Procedure Will Move Smaller Value And Bigger Value
|
Left Right
|
Right Left
|
Up Down
|
Down Up
|
C
|
|
CS301
|
A Binary Tree With 45 Internal Nodes Has ___________ Links To External Nodes
|
44
|
45
|
46
|
90
|
C
|
|
CS301
|
A Complete Binary Tree Is A Tree That Is ___________ Filled With The Possible Exception Of The Bottom Level
|
Partially
|
Completely
|
Incompletely
|
Partly
|
B
|
|
CS301
|
Is A Binary Tree Where Every Node Has A Value Every Nodes Left Subtree Contains Only Values Less Than Or Equal To The Nodes Value And Every Nodes Right Subtree Contains Only Values That Are Greater Then Or Equal ?
|
Strictly Binary Tree
|
Binary Search Tree
|
Avl Tree
|
All Of These
|
B
|
|
CS301
|
Let Heap Stored In An Array As H = [50 40 37 32 28 22 36 13]. In Other Words The Root Of The Heap Contains The Maximum Element. What Is The Result Of Deleting 40 From This Heap
|
[50 32 37 13 28 22 36]
|
[37 28 32 22 36 13]
|
[37 36 32 28 13 22]
|
[37 32 36 13 28 22]
|
A
|
|
CS301
|
The Difference Between A Binary Tree And A Binary Search Tree Is That
|
A Binary Search Tree Has Two Children Per Node Whereas A Binary Tree Can Have None One Or Two Children Per Node
|
In Binary Search Tree Nodes Are Inserted Based On The Values They Contain
|
In Binary Tree Nodes Are Inserted Based On The Values They Contain
|
None Of These
|
A
|
|
CS301
|
Which Of The Following Is Not True Regarding The Maze Generation?
|
Randomly Remove Walls Until The Entrance And Exit Cells Are In The Same Set
|
Removing A Wall Is The Same As Doing A Union Operation
|
Remove A Randomly Chosen Wall If The Cells It Separates Are Already In The Same Set
|
Do Not Remove A Randomly Chosen Wall If The Cells It Separates Are Already In The Same Set
|
C
|
|
CS301
|
Which One Of The Following Is Not An Example Of Equivalence Relation?
|
Electrical Connectivity
|
Set Of People
|
<= Relation
|
Set Of Pixels
|
C
|