|
CS301
|
It Is Necessary Fro Huffman Encoding Tree To Be
|
Avl Tree
|
Binary Tree
|
Complete Binary Tree
|
None Of These
|
B
|
|
CS301
|
If A Binary Tree Has N + 1 External Nodes Then
|
It Has N Internal Nodes
|
It Has N-1 Internal Nodes
|
It Has N/2 Internal Nodes
|
It Has N+2 Internal Nodes
|
A
|
|
CS301
|
Suppose Currentnode Refers To A Node In A Linked List (Using The Node Class With Member Variables Called Data And Nextnode). What Statement Changes Currentnode So That It Refers To The Next Node?
|
Currentnode ++;
|
Currentnode = Nextnode;
|
Currentnode += Nextnode;
|
Currentnode = Currentnode->Nextnode;
|
D
|
|
CS301
|
Which Of The Following Statement Is Not Correct About Find Operation
|
It Is Not A Requirement That A Find Operation Returns Any Specific Name Just That Finds On Two Elements
Return The Same Answer If And Only If They Are In The Same Set
|
One Idea Might Be To Use A Tree To Represent Each Set Since Each Element In A Tree Has The Same Root
Thus The Root Can Be Used To Name The Set
|
Initially Each Set Contains One Element
|
Initially Each Set Contains One Element And It Does Not Make Sense To Make A Tree Of One Node Only
|
B
|
|
CS301
|
Which Of The Following Can Be Used To Reverse A String Value
|
Stack
|
Queue
|
Both Of These
|
None Of These
|
A
|
|
CS301
|
I Have Implemented The Queue With A Linked List Keeping Track Of A Front Pointer And A Rear Pointer. Which Of These Pointers Will Change During An Insertion Into An Empty Queue?
|
Neither Changes
|
Only Front Pointer Changes
|
Only Rear Pointer Changes
|
Both Change
|
B
|
|
CS301
|
Suppose N Is The Number Of Nodes In A Complete Binary Tree Then Maximum Steps Required For A Search Operation Are
|
Log2 (N+1) -1
|
Log2 (N+1)
|
Log2 (N) - 1
|
Log2 (N)
|
A
|
|
CS301
|
When A Complete Binary Tree Represented By An Array Then If Right Child Is At Position 5 Then Left Child Will Be At Position
|
2
|
3
|
4
|
6
|
C
|
|
CS301
|
Which One Of The Following Statements Is Correct?
|
Array Size Is Fixed Once It Is Created
|
?Link List Size Is Fixed Once It Is Created
|
Binary Search Tree Size Is?Fixed Once It Is Created
|
Avl Tree Size Is Fixed Once It Is Created
|
A
|
|
CS301
|
Which One Of The Following Is True About Iteration?
|
Iteration Extensively Uses Stack Memory
|
Threaded Binary Trees Use The Concept Of Iteration
|
Iterative Function Calls Consumes A Lot Of Memory
|
Recursion Is More Efficient Than Iteration
|
A
|
|
CS301
|
Below Is A Binary Search Tree. If We Delete The Value 50 Using The Algorithm We Discussed What Value Will Be In The Root Of The Remaining Tree?
|
50
|
60
|
70
|
80
|
D
|
|
CS301
|
Every Avl Is __________
|
Binary Tree
|
Complete Binary Tree
|
None Of These
|
Binary Search Tree
|
D
|
|
CS301
|
Which One Of The Following Statement Is Not Correct
|
In Linked List The Elements Are Necessarily To Be Contiguous
|
In Linked List The Elements May Locate At Far Positions In The Memory
|
In Linked List Each Element Also Has The Address Of The Element Next To It
|
In An Array The Elements Are Contiguous
|
B
|
|
CS301
|
Consider The Following Binary Search Tree (Bst) If Node A In The Bst Is Deleted Which Two Nodes Are The Candidates To Take Its Place?
|
J And I
|
H And E
|
D And E
|
L And M
|
D
|
|
CS301
|
Doubly Linked List Always Has One Null Pointer
|
True
|
False
|
|
|
B
|
|
CS301
|
Which Of The Following Is Not A Correct Statement About Table Adt
|
In A Table The Type Of Information In Columns May Be Different
|
A Table Consists Of Several Columns Known As Entities
|
The Row Of A Table Is Called A Record
|
A Major Use Of Table Is In Databases Where We Build And Use Tables For Keeping Information
|
B
|
|
CS301
|
Consider A Min Heap Represented By The Following Array: 3 4 6 7 5 10
After Inserting A Node With Value 1.Which Of The Following Is The Updated Min Heap?
|
3 4 6 7 5 10 1
|
3 4 6 7 5 1 10
|
3 4 1 5 7 10 6
|
1 4 3 7 5 10 6
|
D
|
|
CS301
|
Consider A Min Heap Represented By The Following Array: 3 4 6 7 5 After Calling The Function Deletemin().Which Of The Following Is The Updated Min Heap?
|
4 6 7 5
|
6 7 5 4
|
4 5 6 7
|
4 6 5 7
|
C
|
|
CS301
|
An Expression Tree Will Always Be A
|
Complete Binary Tree
|
Binary Search Tree
|
Heap Avl Tree
|
Non Of Then
|
B
|
|
CS301
|
Consider The Following Function: Void Test_A(Int N) {Cout << N << " "; If (N>0) Test_A(N-2); } What Is Printed By The Call Test_A(4)?
|
4 2
|
0 2 4
|
0 2
|
2 4
|
A
|