|
CS301
|
Here Is An Array Of Ten Integers: 5 3 8 9 1 7 0 2 6 4 The Array After The First Iteration Of The Large Loop In A Selection Sort (Sorting From Smallest To Largest)
|
0 3 8 9 1 7 5 2 6 4
|
2 6 4 0 3 8 9 1 7 5
|
2 6 4 9 1 7 0 3 8 5
|
0 3 8 2 6 4 9 1 7 5
|
A
|
|
CS301
|
Which One Of The Following Is Known As "Last-In First-Out" Or Lifo Data Structure?
|
Linked List
|
Stack
|
Queue
|
Tree
|
B
|
|
CS301
|
Which Of The Following Statement Is True About Dummy Node Of Threaded Binary Tree?
|
This Dummy Node Never Has A Value
|
This Dummy Node Has Always Some Dummy Value
|
This Dummy Node Has Either No Value Or Some Dummy Value
|
This Dummy Node Has Always Some Integer Value
|
C
|
|
CS301
|
Suppose That The Class Declaration Of Someclass Includes The Following Function Prototype. Bool Lessthan( Someclass Anotherobject );
Which Of The Following Tests In The Client Code Correctly Compares Two Class Objects Alpha And Beta?
|
If (Alpha < Beta)
|
If (Alpha.Lessthan(Beta))
|
If (Lessthan(Alpha Beta))
|
If (Lessthan(Alpha).Beta)
|
B
|
|
CS301
|
In A Program A Reference Variable Say X Can Be Declared As
|
Int &X ;
|
Int *X ;
|
Int X ;
|
None Of The Given Options
|
A
|
|
CS301
|
Each Operator In A Postfix Expression Refers To The Previous __________ Operand(S)
|
1
|
2
|
3
|
4
|
B
|
|
CS301
|
Bst Is A Structure
|
Linear
|
Non Linear
|
Circular
|
None Of Above
|
B
|
|
CS301
|
The Maximum Number Of External Nodes (Leaves) For A Binary Tree Of Height H Is ___________
|
2^H
|
2^H +1
|
2^H -1
|
2^H +2
|
A
|
|
CS301
|
Suppose A Is An Array Containing Numbers In Increasing Order But Some Numbers Occur More Than Once When Using A Binary Search For A Value The Binary Search Always Finds __________
|
The First Occurrence Of A Value
|
The Second Occurrence Of A Value
|
May Find First Or Second Occurrence Of A Value
|
None Of The Given Options
|
A
|
|
CS301
|
If A Complete Binary Tree Has N Number Of Nodes Then Its Height Will Be
|
Log2 (N+1) -1
|
2N
|
Log2 (N) - 1
|
2N - 1
|
A
|
|
CS301
|
Parameters In Function Call Are Passed Using
|
Stack
|
Queue
|
Binary Search Tree
|
Avl Tree
|
A
|
|
CS301
|
The Operation For Removing An Entry From A Stack Is Traditionally Called
|
Delete
|
Peek
|
Pop
|
Remove
|
C
|
|
CS301
|
The Arguments Passed To A Function Should Match In Number Type And Order With The Parameters In The Function Definition
|
True
|
False
|
|
|
A
|
|
CS301
|
Which Of The Following Statement Is Correct About Union?
|
To Perform Union Of Two Sets We Merge The Two Trees By Making The Root Of One Tree Point To The Root Of The Other
|
To Perform Union Of Two Sets We Merge The Two Trees By Making The Leaf Node Of One Tree Point To The Root Of The Other
|
Perform Union Of Two Sets Merging Operation Of Trees In Not Required At All
|
None Of The Given Options
|
A
|
|
CS301
|
Which Of The Following Abstract Data Types Are Not Used By Integer Abstract Data Type Group?
|
Short
|
Int
|
Float
|
Long
|
C
|
|
CS301
|
Union Is A Time Operation
|
Constant
|
Polynomial
|
Exponential
|
None Of The Given Options
|
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
|
If A Max Heap Is Implemented Using A Partially Filled Array Called Data And The Array Contains N Elements (N > 0) Where Is The Entry With The Greatest Value?
|
Data[0]
|
Data[N-1]
|
Data[N]
|
Data[2*N+1]
|
A
|
|
CS301
|
If Both Pointers Of The Node In A Binary Tree Are Null Then It Will Be A/An
|
Inner Node
|
Leaf Node
|
Root Node
|
None Of The Given Options
|
B
|
|
CS301
|
The Definition Of Transitivity Property Is
|
For All Element X Member Of S X R X
|
For All Elements X And Y X R Y If And Only If Y R X
|
For All Elements X Y And Z If X R Y And Y R Z Then X R Z
|
For All Elements W X Y And Z If X R Y And W R Z Then X R Z
|
C
|