|
CS301
|
In Which Of The Following Tree Parent Nodes Has Key Greater Than Or Equal To Its Both Children?
|
Max Heap
|
Binary Search Tree
|
Threaded Binary Tree
|
Complete Binary Tree
|
D
|
|
CS301
|
While Joining Nodes In The Building Of Huffman Encoding Tree If There Are More Nodes With Same Frequency We Choose The Nodes
|
Randomly
|
That Occur First In The Text Message
|
That Are Lexically Smaller Among Others
|
That Are Lexically Greater Among Others
|
A
|
|
CS301
|
Class Foo
{
Public:
Void X(Foo F);
Void Y(Const Foo F);
Void Z(Foo F) Const;
Which Of The Three Member Functions Can Alter The Private Member Variables Of The Foo Object That Activates The Function?
|
Only X Can Alter The Private Member Variables Of The Object That Activates The Function
|
Only Y Can Alter The Private Member Variables Of The Object That Activates The Function
|
Only Z Can Alter The Private Member Variables Of The Object That Activates The Function
|
Two Of The Functions Can Alter The Private Member Variables Of The Object That Activates The Function
|
D
|
|
CS301
|
What Kind Of List Is Best To Answer Questions Such As What Is The Item At Position N?
|
Lists Implemented With An Array
|
Doubly-Linked Lists
|
Singly-Linked Lists
|
Doubly-Linked Or Singly-Linked Lists Are Equally Best
|
A
|
|
CS301
|
If A Complete Binary Tree Has Height H Then Its No. Of Nodes Will Be
|
Log (H)
|
2^(H+1)- 1
|
Log (H) - 1
|
2^H - 1
|
B
|
|
CS301
|
In Complete Binary Tree The Bottom Level Is Filled From __________
|
Left To Right
|
Right To Left
|
Not Filled At All
|
None Of The Given Options
|
A
|
|
CS301
|
Is A Data Structure That Can Grow Easily Dynamically At Run Time Without Having To Copy Existing Elements?
|
Array
|
List
|
Both Of These
|
None Of These
|
B
|
|
CS301
|
A Binary Relation R Over S Is Called An Equivalence Relation If It Has Following Property(S)
|
Reflexivity
|
Symmetry
|
Transitivity
|
All Of The Given Options
|
D
|
|
CS301
|
We Can Build A Heap In __________ Time
|
Linear
|
Exponential
|
Polynomial
|
None Of The Given Options
|
A
|
|
CS301
|
Which One Of The Following Is Not True Regarding The Skip List?
|
Each List Si Contains The Special Keys + Infinity And - Infinity
|
List S0 Contains The Keys Of S In Non-Decreasing Order
|
Each List Is A Subsequence Of The Previous One
|
List Sh Contains Only The N Special Keys
|
D
|
|
CS301
|
Consider A Min Heap Represented By The Following Array: 11 22 33 44 55
After Inserting A Node With Value 66.Which Of The Following Is The Updated Min Heap?
|
11 22 33 44 55 66
|
11 22 33 44 66 55
|
11 22 33 66 44 55
|
11 22 66 33 44 55
|
A
|
|
CS301
|
Avl Tree Is
|
Non Linear Data Structure Click Here For Detail
|
Linear Data Structure
|
Hybrid Data Structure (Mixture Of Linear And Non Linear)
|
None Of The Given Options
|
A
|
|
CS301
|
Addition Of New Items In Stack Make The Pointer ------------ By 2
|
Increment Bits
|
Increment Bytes
|
Decrement Bits
|
Decrement Bytes
|
D
|
|
CS301
|
Each Node In A Bst Has Pointers
|
1
|
2
|
3
|
4
|
B
|
|
CS301
|
For The Inorder Traversal Of Threaded Binary Tree We Introduced A Dummy Node. The Left Pointer Of The Dummy Node Is Pointing To The __________ Node Of The Tree
|
Left Most
|
Root
|
Right Most
|
Any Of The Given Node
|
A
|
|
CS301
|
Which Of The Following Can Be The Inclusion Criteria For Pixels In Image Segmentation
|
Pixel Intensity
|
Texture
|
Threshold Of Intensity
|
All Of The Given Options
|
D
|
|
CS301
|
Compiler Uses Which One Of The Following To Evaluate A Mathematical Equation
|
Binary Tree
|
Binary Search Tree
|
Parse Tree
|
Avl Tree
|
C
|
|
CS301
|
I Have Implemented The Queue With A Circular Array. If Data Is A Circular Array Of Capacity Elements And Last
Is An Index Into That Array What Is The Formula For The Index After Last?
|
(Last % 1) + Capacity
|
Last % (1 + Capacity)
|
(Last + 1) % Capacity
|
Last + (1 % Capacity)
|
C
|
|
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
|
Suppose You Implement A Heap (With The Largest Element On Top) In An Array. Consider The Different Arrays Below Determine The One That Cannot Possibly Be A Heap
|
7 3 6 4 2 5 1
|
7 6 4 3 5 2 1
|
7 3 6 2 1 4 5
|
7 6 5 4 3 2 1
|
A
|