CS 502–DESIGN & ANALYSIS OF ALGORITHMS QUIZ NO.2A 26-6-2022- 1310 Pages Solved Study Guruz MEGA File
CS 502 – DESIGN & ANALYSIS OF ALGORITHMS QUIZ 2A|26-6-2022 Quiz|MEGA FILE for 95-100 percent Marks by Study Guruz
Download LINK:
CS502 DESIGN AND ANALYSIS OF ALGORITHMS 1310 Pages MEGA FILE FOR QUIZ AND MID TERM
https://www.mediafire.com/file/rqtzkb...
PLEASE WATCH THE VIDEO FOR THE PASSWORDS FOR MEGA FILE AND ANSWERS OF CURRENT CS502 QUIZ.
SOLUTION FOR CURRENT CS604 QUIZ 2A IS ALSO GIVEN AT START OF MEGA FILE.
1. Which method is preferable for dealing with chain matrix multiplication?
A. Graph Theory
B. Greedy Approach
C. Divide and Conquer Strategy
D. Dynamic Programming Formulation(SG Answer)
2. Suppose we have 4 matrices A, B , C, D . What is correct expansion of m[1,2] in chain matrix multiplication?
A. m[1,2] = m[1, 1] +m[2, 2] + p0 • p1 . p2
B. m(1. 2] - m(1, 1] +m[2. 2] +P0 • p1 . P3(SG Answer)
C. m[1.2] m[1.2] +m[2. 2] + p0 . p1 • p2
D. m(1,2] = m|1,1] +m[1.2] + p0 • p1 • p2
3. In chain matrix multiplication, if there are n items, there are ways in which outer most pair of parentheses can placed.
A. n+l
B. 2n
C. n-l(SG Answer)
D. n^2
4. Heap sort is a/an and sorting algorithm.
A. In-place. not stable one(SG Answer)
B. Notm-place stable one
C. In-place, stable one
D. Notm-place not stable one
5. A problem exhibits optimal structure if an optimal solution to the problem contains within it optimal solution to_______.
A. first problem
B. half problems
C. last problem
D. sub-problems(SG Answer)
6. If matrix A of dimension p x q is multiplied with matrix B of dimension q x r; then each entry in resultant matrix takes time.
A. O(qxr)
B. O(q) (SG Answer)
C. 0(1)
D. O(pxq)
7. Consider three matrices X, Y, Z of dimensions 1x2:2x3;3x4 respectively. The number of multiplications of X(YZ) is:
A. 32
B. 26
C. 32
D. 16(SG Answer)
8. When a recursive algorithm revisits the same problem over and over again, we say that the optimization problem has________sub-problems.
A. Overlapping(SG Answer)
B. Optimized
C. Over costing
D. Three
9. Counting sort assumes that the numbers to be sorted are in the range
A. k to n where k is small
B. k Io n where n is large
C. 1 to k where k is small(SG Answer)
D. k to n where n is small
10. What is the worst-case time of a quick sort which happens rarely?
A. O(n)
B. O(log n)
C. O(n2)(SG Answer)
D. O(n log n)
SUBSCRIBE YOUTUBE CHANNEL STUDY GURUZ
LIKE US ON FACEBOOK STUDY GURUZ
VISIT US ON WEB WWW.STUDYGURUZ.COM
TEXT US ON WHATSAPP +92 302 7533163
CS502 LATEST quiz, CS502 MID TERM,CS502 MEGA FILE, CS502 QUIZ FILE,
VU Grand Quiz,
Grand Quiz Solution,
mid term grand quiz 2021,
Virtual University,
Assignment Solution,
Communication skills,
STUDY GURU VIRTUAL UNIVERSITY,
VIRTUAL UNIVERSITY,
Final term Solved MCQs
VU ASSIGNMENT, VU QUIZ, VU QUIZ, VU MIDTERM AND FINAL EXAM, MEGA FILES, PREVIOUS PAPERS,
DISCLAIMER:
This Channel Does Not Promote Any Illegal Content, All Contents Provided By This Channel Is Meant For EDUCATIONAL Purpose Only. Copyright Disclaimer Under Section 107 Of The Copyright Act 1976, Allowance Is Made For Fair Use For Purposes Such As Criticism, Comment, News Reporting, Teaching, Scholarship, And Research. Fair Use Is A Use Permitted By Copyright Statute That Might Otherwise Be Infringing. Non-Profit, Educational Or Personal Use Tips The Balance In Favor Of Fair Use.
Music credits : https://www.bensound.com