|
CS301
|
________ Is A Linear List Where ________ And ________ Take Place At The Same End . This End Is Called The ________ What Would Be The Correct Filling The Above Blank Positions?
|
(I) Queue (Ii) Insertion (Iii) Removals (Iv) Top
|
(I) Stack (Ii) Insertion (Iii) Removals (Iv) Bottom
|
(I) Stack (Ii) Insertion (Iii) Removals (Iv) Top
|
(I) Tree (Ii) Insertion (Iii) Removals (Iv) Top
|
C
|
|
CS301
|
If The Bottom Level Of A Binary Tree Is Not Completely Filled Depicts That The Tree Is Not A
|
Expression Tree
|
Threaded Binary Tree
|
Complete Binary Tree
|
Perfectly Complete Binary Tree
|
C
|
|
CS301
|
Consider The Following Postfix Expression S And The Initial Values Of The Variables. S = A B - C + D E F - + ^ Assume That A=3 B=2 C=1 D=1 E=2 F=3 What Would Be The Final Output Of The Stack?
|
-1
|
1
|
0
|
2
|
B
|
|
CS301
|
The Easiest Case Of Deleting A Node From Bst Is The Case In Which The Node To Be Deleted __________
|
Is A Leaf Node
|
Has Left Subtree Only
|
Has Right Subtree Only
|
Has Both Left And Right Subtree
|
A
|
|
CS301
|
In A Perfectly Balanced Tree The Insertion Of A Node Needs __________
|
One Rotation
|
Two Rotations
|
Rotations Equal To Number Of Levels
|
No Rotation At All
|
A
|
|
CS301
|
Class Is A User Defined__________
|
Data Type
|
Memory Reference
|
Value
|
None Of The Given Options
|
A
|
|
CS301
|
Consider The Following Infix Expression: X – Y * A + B / C
Which Of The Following Is A Correct Equivalent Expression(S) For The Above?
|
X Y -A * B +C /
|
X *Y A - B C / +
|
X Y A * - B C / +
|
X Y A * - B/ + C
|
C
|
|
CS301
|
In C What Is The Operation That You Can Not Do With Primitive Types?
|
Assign A Value To Primitive Type Using A Literal
|
Declare Primitive Types To Be Constant Using The Const Keyword
|
Create A New Instance Of Primitive Type With New Keyword
|
None Of These
|
C
|
|
CS301
|
A Linear Data Structure Is The Data Structure In Which Data Elements Are Arranged In A Sequence Or A Linear List. Which Of The Following Is Non Linear Data Structure?
|
Arrays
|
Linklists
|
Binary Search Trees
|
None Of These
|
C
|
|
CS301
|
A Kind Of Expressions Where The Operator Is Present Between Two Operands Called __________Expressions
|
Postfix
|
Infix
|
Prefix
|
None Of The Above
|
B
|
|
CS301
|
If There Are N External Nodes In A Binary Tree Then What Will Be The No. Of Internal Nodes In This Binary Tree?
|
N -1
|
N +1
|
N+2
|
N
|
A
|
|
CS301
|
When We Have Declared The Size Of The Array It Is Not Possible To Increase Or Decrease It During The __________Of The Program
|
Declaration
|
Execution
|
Defining
|
None Of The Abov
|
B
|
|
CS301
|
In___________ We Try To Have A Precise Problem Statement
|
Analysis
|
Design
|
Coding
|
None Of The Given
|
A
|
|
CS301
|
If There Are N Elements In An Array Then The Number Of Maximum Steps Needed To Find An Element Using Binary Search Is
|
N
|
N^2
|
Nlog2N
|
Log2N
|
D
|
|
CS301
|
A Compound Data Structure Is The Data Structure Which Can Have Multiple Data Items Of Same Type Or Of Different Types. Which Of The Following Can Be Considered Compound Data Structure?
|
Arrays
|
Linklists
|
Binary Search Trees
|
All Of The Given Options
|
D
|
|
CS301
|
The Main Reason Of Using Heap In Priority Queue Is
|
Improve Performance
|
Code Is Readable
|
Less Code
|
Heap Cant Be Used In Priority Queues
|
A
|
|
CS301
|
Suppose That A Selection Sort Of 100 Items Has Completed 42 Iterations Of The Main Loop. How Many Items
Are Now Guaranteed To Be In Their Final Spot (Never To Be Moved Again )
|
21
|
41
|
42
|
43
|
C
|
|
CS301
|
If There Are 23 External Nodes In A Binary Tree Then What Will Be The No. Of Internal Nodes In This Binary Tree?
|
21
|
22
|
23
|
24
|
B
|
|
CS301
|
In An Array We Can Store Data Elements Of Different Types
|
True
|
False
|
|
|
B
|
|
CS301
|
Reference Is Not Really An Address It Is __________
|
A Synonym
|
An Antonym
|
A Value
|
A Number
|
A
|