|
CS301
|
In The Linked List Implementation Of The Stack Class Where Does The Push Member Function Places The New Entry On The Linked List?
|
At The Head
|
At The Tail
|
After All Other Entries That Are Greater Than The New Entry
|
After All Other Entries That Are Smaller Than The New Entry
|
A
|
|
CS301
|
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
|
0 2 4
|
0 2
|
2 4
|
A
|
|
CS301
|
Deleting A Leaf Node In Binary Search Tree Involves Setting Pointer/S Of That Node’S Parent As Null
|
1
|
2
|
3
|
4
|
A
|
|
CS301
|
If One Pointer Of The Node In A Binary Tree Is Null Then It Will Be A/An
|
External Node
|
Root Node
|
Inner Node
|
Leaf Node
|
A
|
|
CS301
|
Highest Operators Precedence Is Of The Following Operator
|
Plus
|
Minus
|
Multiply
|
Exponentiation
|
C
|
|
CS301
|
Compiler Uses Which One Of The Following In Function Calls
|
Stack
|
Queue
|
Binary Search Tree
|
Avl Tree
|
A
|
|
CS301
|
Void F(Int I Int &K) {I = 1;K = 2; } Suppose That A Main Program Has Two Integer Variables X And Y Which Are Given The Value 0. Then The Main Program Calls F(X Y); What Are The Values Of X And Y ?
|
Both X And Y Are Still 0
|
X Is Now 1 But Y Is Still 0
|
X Is Still 0 But Y Is Now 2
|
X Is Now 1 And Y Is Now 2
|
C
|
|
CS301
|
Which Of The Following Is A Non Linear Data Structure?
|
Linked List
|
Stack
|
Queue
|
Tree
|
D
|
|
CS301
|
Doubly Linked List Always Has One Null Pointer
|
True
|
False
|
|
|
B
|
|
CS301
|
In A Selection Sort Of N Elements How Many Times The Swap Function Is Called To Complete The Execution Of The Algorithm?
|
N-1
|
N Log N
|
N2
|
1
|
A
|
|
CS301
|
While Building Huffman Encoding Tree The New Node That Is The Result Of Joining Two Nodes Has The Frequency
|
Equal To The Small Frequency
|
Equal To The Greater
|
Equal To The Sum Of The Two Frequencies
|
Equal To The Difference Of The Two Frequencies
|
C
|
|
CS301
|
Consider The Following Tree.
How Many Of The Nodes Have At Least One Sibling?
|
8
|
7
|
6
|
5
|
C
|
|
CS301
|
In An Avl Tree To Delete A Parent With Two Childs In A Straight Line Following Rotations Will Be Required
|
Single
|
Double
|
Triple
|
None
|
B
|
|
CS301
|
Is The Stack Characteristic But Was Implemented Because Of The Size Limitation Of The Array
|
Isfull() Isempty()
|
Pop() Push()
|
Isempty() Isfull()
|
Push() Pop()
|
C
|
|
CS301
|
From The Following; Which On Is The Correct Syntax Of An Array Declaration: Array Size Is 5 And It Is Of Float Data Type?
|
Float [5] Name;
|
Name[5] Float;
|
Float Name[5];
|
None Of The Given Options
|
D
|
|
CS301
|
“+” Is A ___________Operator
|
Unary
|
Binary
|
Ternary
|
None Of The Above
|
B
|
|
CS301
|
See The Below Code And Fill The Appropriate Answer For? Void Fastlnorder(Treenod+P) {While((P+Nextinorder(P)) !+ ? ) Cout << P->Getinfo();}
|
Dummy
|
Rootnode
|
Lth
|
Rth
|
A
|
|
CS301
|
A Solution Is Said To Be Efficient If It Solves The Problem Within Its Resource Constraints I.E. Hardware And Time
|
True
|
False
|
|
|
A
|
|
CS301
|
We Convert The __________ Pointers Of Binary To Threads In Threaded Binary Tree
|
Left
|
Right
|
Null
|
None Of The Given Options
|
C
|
|
CS301
|
Consider A Binary Tree Represented By The Following Array: A B C D E F G I Is It A Strictly Binary Tree ?
|
True
|
False
|
|
|
B
|