
Cyberian.pk posted an update in the group CS502 : Fundamentals of Algorithms 1 week ago
The process of ___________ ends when you are left with such tiny pieces remaining that it is trivial to solve them. CS502
Divide and Conquer Strategy

Cyberian.pk posted an update in the group CS502 : Fundamentals of Algorithms 1 week ago
For the sieve technique we solve the problem,
Select correct option:
recursively
mathematically
precisely
accurately
The sieve technique works in ___________ as follows
Select correct option:
phases
numbers
integers
routines
Slow sorting algorithms run in,
Select correct option:
T(n^2)
T(n)
T( log n)
A (an) _________ is a leftcomplete binary tree…[Read more] 
Cyberian.pk posted an update in the group CS502 : Fundamentals of Algorithms 1 week ago
Question # 2 of 10 ( Start time: 06:19:38 PM ) Total Marks: 1
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
Select correct option:leftcomplete
rightcomplete
tree nodes
tree leavesQuestion # 3 of 10 ( Start time: 06:20:18 PM ) Total Marks: 1
Sieve Technique can be…[Read more] 
Cyberian.pk posted an update in the group CS502 : Fundamentals of Algorithms 1 week ago
Which may be stable sort:
Select correct option:
Bubble sort
Insertion sort
Both of above
Selection sortIn the analysis of Selection algorithm, we eliminate a constant fraction of the array with each phase; we get the convergent _______________ series in the analysis,
Select correct option:
linear
arithmetic
geometric
exponentIn Quick sort…[Read more]

Cyberian.pk posted an update in the group CS502 : Fundamentals of Algorithms 1 week ago
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
Question # 2 of 10 Total M a r k s: 1
Which sorting algorithm is faster
O (n log n)
O n^2

Cyberian.pk posted an update in the group CS502 : Fundamentals of Algorithms 1 week ago
Question # 1 of 10 ( Start time: 08:17:23 AM ) Total M a r k s: 1
The number of nodes in a complete binary tree of height h is
Select correct option:
2^(h+1) – 1
2 * (h+1) – 1
2 * (h+1)
((h+1) ^ 2) – 1Question # 2 of 10 ( Start time: 08:18:46 AM ) Total M a r k s: 1
A (an) _________ is a leftcomplete binary tree that conforms to the heap order…[Read more] 
Cyberian.pk posted an update in the group CS502 : Fundamentals of Algorithms 1 week ago
We do sorting to,
keep elements in random positions
keep the algorithm run in linear order
keep the algorithm run in (log n) order
keep elements in increasing or decreasing order
Slow sorting algorithms run in,
T(n^2)
T(n)
T( log n)
T(n log n)
One of the clever aspects of heaps is that they can be stored in arrays without using…[Read more]

Cyberian.pk posted an update in the group CS502 : Fundamentals of Algorithms 1 week ago
We do sorting to,
keep elements in random positions
keep the algorithm run in linear order
keep the algorithm run in (log n) order
keep elements in increasing or decreasing order
In Sieve Technique we donot know which item is of interest
True
False
A (an) _________ is a leftcomplete binary tree that conforms to the
heap…[Read more]

Cyberian.pk posted an update in the group CS502 : Fundamentals of Algorithms 1 week ago
The analysis of Selection algorithm shows the total running time is indeed ________in n,
Select correct option:arithmetic
geometric
linear
orthogonalHow many elements do we eliminate in each time for the Analysis of Selection algorithm?
Select correct option:n / 2 elements
(n / 2) + n elements
n / 4 elements
2 n elements…[Read more] 
Cyberian.pk posted an update in the group CS502 : Fundamentals of Algorithms 1 week ago
For the sieve technique we solve the problem,
Select correct option:
recursively
mathematically
precisely
accurately
The sieve technique works in ___________ as follows
Select correct option:
phases
numbers
integers
routines
Slow sorting algorithms run in,
Select correct option:
T(n^2)
T(n)
T( log n)
A (an) _________ is a leftcomplete binary tree…[Read more] 
Cyberian.pk posted an update in the group CS502 : Fundamentals of Algorithms 1 week ago
Question # 1 of 10 ( Start time: 06:18:58 PM ) Total Marks: 1
We do sorting to,
Select correct option:keep elements in random positions
keep the algorithm run in linear order
keep the algorithm run in (log n) order
keep elements in increasing or decreasing orderQuestion # 2 of 10 ( Start time: 06:19:38 PM ) Total Marks: 1
Heaps can be…[Read more] 
Cyberian.pk posted an update in the group CS502 : Fundamentals of Algorithms 1 week ago
1_Algorithm is a mathematical entity, which is independent of a specific machine and operating system.
True
2_In Selection problem, the Sieve technique ___________
Adds some more input items each time (not sure)3_Median is not useful measure of central tendency of given input set especially when the distribution of values is highly…[Read more]

Cyberian.pk posted an update in the group CS502 : Fundamentals of Algorithms 1 week ago
The running time of an algorithm would not depend upon the optimization by the compiler but that of an implementation of the algorithm would depend on it.
Select correct option:
In ____________ we have to find rank of an element from given input.
Select correct option:
An algorithm is a mathematical entity that is dependent…[Read more]

Cyberian.pk posted an update in the group CS502 : Fundamentals of Algorithms 1 week ago
1 When writing pseudo code, those _______are omitted that detract from the main ideas of the algorithm.Details
Details ANS
2 In plane sweep approach of solving geometric problems, a ________is swept across the plane.
plan ANS3 If the indices passed to merge sort algorithm are not equal, then algorithm may…[Read more]

Cyberian.pk posted an update in the group CS502 : Fundamentals of Algorithms 1 week ago
Question # 10 of 10 ( Start time: 09:09:52 PM ) Total Marks: 1
Before sweeping a vertical line in plane sweep approach, in start sorting of the points is done in increasing order of their _______coordinates.
Select correct option:
X*
Y
Z
X & Y
Question # 1 of 10 ( Start time: 09:12:05 PM ) Total Marks: 1
To find maximal points in…[Read more]

Cyberian.pk posted an update in the group CS502 : Fundamentals of Algorithms 1 week ago
CS502 Fundamentals of Algorithms Quiz No. 1, File 2
Question # 1 of 10 ( Start time: 09:46:15 PM ) Total Marks: 1
In Selection algorithm, we assume pivot selection takes theta __________ running time.
Select correct option:
n ( answer)
n2
n3
log(n)Question # 2 of 10 ( Start time: 09:47:10 PM ) Total Marks: 1
The function f(n)=n(logn+1)/2…[Read more] 
Cyberian.pk posted an update in the group CS502 : Fundamentals of Algorithms 1 week ago
CS502 Fundamentals of Algorithms Quiz No. 1, File 3
Question # 1 of 10 ( Start time: 10:09:04 PM ) Total Marks: 1
If input “n” is odd, the median will be _________
Select correct option:
(n+1)/ 2 (Answer)
n/2Question # 2 of 10 ( Start time: 10:09:04 PM ) Total Marks: 1
When writing pseudo code, those _______are omitted that detract from the mai…[Read more] 
Cyberian.pk posted an update in the group CS502 : Fundamentals of Algorithms 1 week ago
CS502 Fundamentals of Algorithms Quiz No. 1, File 5 Question # 1 of 10 ( Start time: 10:37:05 PM ) Total Marks: 1
Pseudo code of algorithms are to be read by ___________.
Select correct option:
People ok
RAM
Computer
CompilerQuestion # 2 of 10 ( Start time: 10:37:35 PM ) Total Marks: 1
If we associate (x, y) integers pair to cars where x…[Read more] 
Cyberian.pk created the doc CS502 Solved Quiz by Moaaz in the group CS502 : Fundamentals of Algorithms 3 months, 3 weeks ago

Cyberian.pk posted an update in the group CS502 : Fundamentals of Algorithms 3 months, 3 weeks ago
You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T ? CS502
In Kruskal’s algorithm, at any time, the subset of edges A forms a single tree. CS502
Traversing a graph means visiting __________ in the graph. CS502  Load More
Public Group
active 1 week agoAnalyzing the worstcase running time of an algorithm as a function of input size, solve recurrence relations, Basics of Divide and Conquer strategy, Understand the concepts of Dynamic programming, Understand the concepts of Greedy Algorithm, Understand the concepts of Graph traversing, Understand the concepts of MST and their algorithms, Understand the algorithms for computing shortest path, Basics of Complexity theory.