|
CS502
|
Is An Application Of Information & Data
|
Intelligence
|
Education
|
Knowledge
|
Power
|
C
|
|
CS502
|
Heaps Can Be Stored In Arrays Without Using Any Pointers; This Is Due To The __________ Nature Of The Binary Tree
|
Left-Complete
|
Right-Complete
|
Tree Nodes
|
Tree Leaves
|
A
|
|
CS502
|
Divide-And-Conquer Is As Breaking The Problem Into A Small Number Of
|
Smaller Sub Problems
|
Pivot
|
Sieve
|
Solutions
|
A
|
|
CS502
|
What Type Of Instructions Random Access Machine Can Execute?
|
Geometric And Arithmetic
|
Algebraic And Logic
|
Arithmetic And Logic
|
Parallel And Recursive
|
C
|
|
CS502
|
The Problem With The Brute-Force Algorithm Is That It Uses __________ In Pruning Out Decisions
|
Intelligence
|
No Intelligence
|
Na
|
Na
|
B
|
|
CS502
|
In Prim’S Algorithm The Additional Information Maintained By The Algorithm Is The Length Of The Shortest Edge From Vertex V To Points Already In The Tree
|
True
|
False
|
Na
|
Na
|
B
|
|
CS502
|
__________ Is A Graphical Representation Of An Algorithm
|
Segma Notation
|
Thita Notation
|
Flowchart
|
Asymptotic Notation
|
C
|
|
CS502
|
The Edit Distance Between Food And Money Is
|
At Most Four
|
At Least Four
|
Exact Four
|
Wrong
|
A
|
|
CS502
|
The Term Coloring Came Form The Original Application Which Was In Map Drawing
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
Floor And Ceilings __________ A Pain To Deal With
|
Are Not
|
Are
|
Sometime
|
None
|
B
|
|
CS502
|
Assume That A[1..I - 1] Have Already Been Sorted. Insert A[I] Into Its Proper Position In This Sub Array. Create This Position By Shifting All Larger Elements To The Right
|
Selection Sort
|
Bubble Sort
|
Merge Sort
|
Insertion Sort
|
D
|
|
CS502
|
The Recurrence Relation Of Tower Of Hanoi Is Given Below T(N)={1 If N=1 And 2T(N-1) If N >1 In Order To Move A Tower Of 5 Rings From One Peg To Another How Many Ring Moves Are Required?
|
10
|
16
|
31
|
32
|
D
|
|
CS502
|
Consider The Following Algorithm:
Factorial (N){ If (N=1) Return 1 Else Return (N * Factorial(N-1)) } Recurrence For The Following Algorithm Is:
|
T(N) = T(N-1) +1
|
T(N) = Nt(N-1) +1
|
T(N)= T(N-1) +N
|
T(N)=T(N(N-1)) +1
|
D
|
|
CS502
|
A __________ Is A Left-Complete Binary Tree That Conforms To The Heap Order
|
Bst
|
Avl Tree
|
Perfect Tree
|
Heap
|
D
|
|
CS502
|
What Is The Solution To The Recurrence T(N) = T(N/2)+N
|
O(Logn)
|
O(N)
|
O(Nlogn)
|
O(N^2)
|
A
|
|
CS502
|
Which Of The Following Sorting Algorithms Is Stable? (I) Merge Sort (Ii) Quick Sort (Iii) Heap Sort (Iv) Counting Sort
|
Only I
|
Only Ii
|
Both I And Ii
|
Both Iii And Iv
|
A
|
|
CS502
|
Dijkestra S Single Source Shortest Path Algorithm Works If All Edges Weights Are Negative And There Are No Negative Cost Cycles
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
In Particular Is It Possible To Solve The Selections Problem In O(N) Time?
|
No
|
Yes
|
Yes. However The Solution Is Far From Obvious
|
Na
|
C
|
|
CS502
|
A P × Q Matrix A Can Be Multiplied With A Q × R Matrix B. The Result Will Be A P × R Matrix C. There Are (P . R) Total Entries In C And Each Takes ___________ To Compute
|
O (Q) (P= 84)
|
O (1)
|
O (N^2)
|
O (N^3)
|
A
|
|
CS502
|
Given A Set Of N Points P = {P1 P2 . . . Pn} In 2-Space A Point Is Said To Be ___________ If It Is Not Dominated By Any Other Point In P
|
Maximal
|
Mininal
|
Average
|
None
|
A
|