|
CS502
|
Quick Sort Is
|
Stable And In Place
|
Not Stable But In Place
|
Stable And Not In Place
|
Some Time In Place And Snd Some Time Stable
|
B
|
|
CS502
|
The Sieve Technique Is A Special Case Where The Number Of Subproblems Is
|
3
|
2
|
Just 1
|
0
|
C
|
|
CS502
|
If In A Dfs Forest Of Digraph G = (V E) F[U] = F[V] For An Edge (U V) ? E Then The Edge Is Called
|
Back Edge
|
Forward Edge
|
Cross Edge
|
Tree Edge
|
A
|
|
CS502
|
Is It Possible To Sort Without Making Comparisons?
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
Non-Optimal Or Greedy Algorithm For Money Change Takes__________
|
O(K)
|
O(Kn)
|
O(2K)
|
O(N)
|
A
|
|
CS502
|
Although It Requires More Complicated Data Structures Prims Algorithm For A Minimum Spanning Tree Is Better Than Kruskals When The Graph Has A Large Number Of Vertices
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
Maximum Number Of Vertices In A Directed Graph May Be |V2|
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
Using Ascii Standard The String Abacdaacac Will Be Encoded With 160 Bits
|
True
|
False
|
Na
|
Na
|
B
|
|
CS502
|
Suppose We Have Three Items As Shown In The Following Table And Suppose The Capacity Of The Knapsack Is 50 I.E. W = 50. Item Value Weight 1 60 10 2 100 20 3 120 30 The Optimal Solution Is To Pick
|
Items 1 And 2
|
Items 1 And 3
|
Items 2 And 3
|
None Of These
|
D
|
|
CS502
|
The Huffman Algorithm Finds An Exponential Solution
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
Given A Set A Of N Distinct Numbers And An Integer K 1 = K = N Output The Element Of A Of Rank K.This Problem Is Of Type
|
Merge Sort
|
Selection Sort
|
Maximal
|
None
|
B
|
|
CS502
|
Thus The Smallest Key Is In The Root In A___________ ; In The ___________The Largest Is In The Root
|
Max Heap Min Heap
|
Min Heap Max Heap
|
Max Heap Max Heap
|
Min Heap Min Heap
|
B
|
|
CS502
|
Which Is True Statement In The Following
|
Kruskal Algorithm Is Multiple Source Technique For Finding Mst
|
Kruskal’S Algorithm Is Used To Find Minimum Spanning Tree Of A Graph Time Complexity Of This Algorithm Is O(Ev)
|
Both Of Above
|
Kruskals Algorithm (Choose Best Non-Cycle Edge) Is Better Than Prims (Choose Best Tree Edge) When The Graph Has Relatively Few Edges
|
D
|
|
CS502
|
Random Access Machine Or Ram Is A/An
|
Mathematical Model
|
Machine Build By Al-Khwarizmi
|
Mechanical Machine
|
Electronics Machine
|
A
|
|
CS502
|
If A Problem Is In Np It Must Also Be In P
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
Memorization Is?
|
To Store Previous Results For Future Use
|
To Avoid This Unnecessary Repetitions By Writing Down The Results Of Recursive Calls And Looking Them Up Again If We Need Them Later
|
To Make The Process Accurate
|
None Of The Above
|
B
|
|
CS502
|
Merge Of Two Lists Of Size M/2 To A List Of Size M Takes T(M) Time Which We Will Just Write As M
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
Can An Adjacency Matrix For A Directed Graph Ever Not Be Square In Shape?
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
The Huffman Algorithm Finds A Polynomial Solution
|
True
|
False
|
Na
|
Na
|
B
|
|
CS502
|
It Requires More Complicated Data Structures Prims Algorithm For A Minimum Spanning Tree Is Better Than Kruskals When The Graph Has A Large Number Of Vertices
|
True
|
False
|
Na
|
Na
|
A
|