|
CS502
|
The Heap Order Property Stated That In A __________ For Every Node X The Key In The Parent Is Smaller Than Or Equal To The Key In X
|
(Max) Heap
|
(Min) Heap
|
Na
|
Na
|
B
|
|
CS502
|
Dijkestra’S Single Source Shortest Path Algorithm Works If All Edges Weights Are Non-Negative And There Are Negative Cost Cycles
|
True
|
False
|
Na
|
Na
|
B
|
|
CS502
|
Define The Of An Element To Be One Plus The Number Of Elements That Are Smaller
|
Degree
|
Rank
|
Frequency
|
Weight
|
B
|
|
CS502
|
__________ Modeling Technique Is More Appropriate For Data Warehousing
|
Dimensional
|
Physical
|
Entity Relationship
|
None
|
A
|
|
CS502
|
For Chain Matrix Multiplication We Can Not Use Divide And Conquer Approach Because
|
We Do Not Know The Optimum K
|
We Use Divide And Conquer For Sorting Only
|
We Can Easily Perform It In Linear Time
|
Size Of Data Is Not Given
|
A
|
|
CS502
|
This Is Written As “F(N) E O(G(N))” That Is F(N) And G(N) Are Asymptotically Equivalent. This Means That They Have Essentially The Growth Rates For Large N
|
Different
|
Same
|
Na
|
Na
|
B
|
|
CS502
|
Using Ascii Standard The String Abacdaacac Will Be Encoded With 32 Bytes
|
True
|
False
|
Na
|
Na
|
B
|
|
CS502
|
The Recurrence Relation Of Tower Of Hanoi Is Given Below
|
? 1 If N =1
|
T N =?
|
-133( )
|
2 (T N- +1) 1If N>1
|
A
|
|
CS502
|
The Growth Of Master Files And Magnetic Tapes Exploded Around The Mid
|
1960
|
1970
|
1980
|
1990
|
A
|
|
CS502
|
Given A Finite Sequence Of Values A1 A2 . . . An Their Sum A1 + A2 + . . . + An Is Expressed In Summation Notation As Sigma (I=1 --> N)Ai
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
Naturally Evolving Architecture Occurred When An Organization Had A Approach To Handling The Whole Process Of Hardware And Software Architecture?
|
Good
|
Relaxed
|
Not Relaxed
|
None
|
B
|
|
CS502
|
Scan The Array. Whenever Two Consecutive Items Are Found That Are Out Of Order Swap Them. Repeat Until All Consecutive Items Are In Order. It Is Called ___________
|
Insertion Sort
|
Bubble Sort
|
Selection Sort
|
None
|
B
|
|
CS502
|
Dijkestra’S Single Source Shortest Path Algorithm Works If All Edges Weights Are Nonnegative And There Are Negative Cost Cycles
|
True
|
False
|
Na
|
Na
|
B
|
|
CS502
|
In Digraph G=(V E) ;G Has Cycle If And Only If
|
The Dfs Forest Has Forward Edge
|
The Dfs Forest Has Back Edge
|
The Dfs Forest Has Both Back And Forward Edge
|
Bfs Forest Has Forward Edge
|
B
|
|
CS502
|
__________ Of The Courses In The Computer Science Program Deal With Efficient Algorithms And Data Structures
|
Many
|
Some
|
Only One
|
None
|
A
|
|
CS502
|
Sieve Technique Applies To Problems Where We Are Interested In Finding A Single Item From A Larger Set Of __________
|
N Items
|
Phases
|
Pointers
|
Constant
|
A
|
|
CS502
|
Dynamic Programming Algorithms Need To Store The Results Of Intermediate Sub-Problems
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
What Is Generally True Of Adjacency List And Adjacency Matrix Representations Of Graphs?
|
Lists Require Less Space Than Matrices But Take Longer To Find The Weight Of An Edge (V1 V2)
|
Lists Require Less Space Than Matrices And They Are Faster To Find The Weight Of An Edge (V1 V2)
|
Lists Require More Space Than Matrices And They Take Longer To Find The Weight Of An Edge (V1 V2)
|
Lists Require More Space Than Matrices But Are Faster To Find The Weight Of An Edge (V1 V2)
|
B
|
|
CS502
|
In The Clique Cover Problem For Two Vertices To Be In The Same Group They Must Be__________Each Other
|
Apart From
|
Far From
|
Near To
|
Adjacent To
|
D
|
|
CS502
|
Merge Sort Requires Extra Array Storage
|
True
|
False
|
Na
|
Na
|
A
|