CS502
|
Forward Edge Is ___________
|
(U V) Where U Is A Proper Descendent Of V In The Tree
|
(U V) Where V Is A Proper Descendant Of U In The Tree
|
(U V) Where V Is A Proper Ancestor Of U In The Tree
|
None Of The Given
|
B
|
CS502
|
In The Clique Cover Problem For Two Vertices To Be In The Same Group They Must Be Adjacent To Each Other
|
True
|
False
|
Na
|
Na
|
A
|
CS502
|
What General Property Of The List Indicates That The Graph Has An Isolated Vertex?
|
There Is Null Pointer At The End Of List
|
The Isolated Vertex Is Not Handled In List
|
Only One Value Is Entered In The List
|
There Is At Least One Null List
|
B
|
CS502
|
Edge (U V) Is A Forward Edge If
|
U Is A Proper Descendant Of V In The Tree
|
V Is A Proper Descendant Of U In The Tree
|
Both Of These
|
None Of These
|
B
|
CS502
|
In Quick Sort Constants Hidden In T(N Log N) Are
|
Large
|
Medium
|
Small
|
Not Known
|
C
|
CS502
|
A P X Q Matrix A Can Be Multiplied With A Q X R Matrix B. The Result Will Be A P X R Matrix C. There Are (P . R) Total Entries In C And Each Takes ___________ To Compute
|
O (Q)
|
O (1)
|
O (N^2)
|
O (N^3)
|
A
|
CS502
|
What Algorithm Technique Is Used In The Implementation Of Kruskal Solution For The Mst?
|
Greedy Technique
|
Divide And Conquer Technique
|
Dynamic Programming Technique
|
The Algorithm Combines More Than One Of The Above Techniques
|
A
|
CS502
|
Medians Are Useful As A Measures Of The __________ Of A Set
|
Mode
|
Average
|
Probability
|
Central Tendency
|
D
|
CS502
|
Al-Khwarizmi Died ___________ C.E.
|
Around 900
|
Around 840
|
Around 740
|
Around 700
|
B
|
CS502
|
In Counting Sort Once We Know The Ranks We Simply ___________ Numbers To Their Final Positions In An Output Array
|
Delete
|
Copy
|
Mark
|
Arrange
|
B
|
CS502
|
The Relationship Between Number Of Back Edges And Number Of Cycles In Dfs Is
|
Both Are Equal
|
Back Edges Are Half Of Cycles
|
Back Edges Are One Quarter Of Cycles
|
There Is No Relationship Between No. Of Edges And Cycles
|
D
|
CS502
|
One Example Of In Place But Not Stable Algorithm Is
|
Merger Sort
|
Quick Sort
|
Continuation Sort
|
Bubble Sort
|
B
|
CS502
|
Slow Sorting Algorithms Run In
|
O(N^2)
|
O(N)
|
O( Log N)
|
O(N Log N)
|
A
|
CS502
|
The Runtime Of Entire Plane-Sweep Algorithm Is O(N Log N)
|
True
|
False
|
Na
|
Na
|
A
|
CS502
|
Best And Worst Case Times Of An Algorithm May Be Same
|
True
|
False
|
Na
|
Na
|
A
|
CS502
|
Function Is Given Like 4N^4+ 5N^3+N What Is The Run Time Of This
|
Theata(N^4)
|
Theata(N^3)
|
Theata(4N^4+ 5N^3)
|
Theata(4N^4+ 5N^3)
|
A
|
CS502
|
The Difference Between Prims Algorithm And Dijkstra S Algorithm Is That Dijkstra S Algorithm Uses A Different Key
|
True
|
False
|
Na
|
Na
|
A
|
CS502
|
The Word Algorithm Comes From The Name Of The Muslim Author __________
|
Ibne-Ul Hasem
|
Abu Ja’Far Mohammad Ibn Musa Al- Khowarizmi
|
Jaber Bin Hayan
|
None
|
B
|
CS502
|
If Algorithm A Has Running Time 7N^2 + 2N + 3 And Algorithm B Has Running Time 2N^2 Then
|
Both Have Same Asymptotic Time Complexity
|
A Is Asymptotically Greater
|
B Is Asymptotically Greater
|
None Of Others
|
A
|
CS502
|
What Type Of Instructions Random Access Machine (Ram) Can Execute?
|
Algebraic And Logic
|
Geometric And Arithmetic
|
Arithmetic And Logic
|
Parallel And Recursive
|
C
|