Скачать или смотреть CS502 – DESIGN & ANALYSIS OF ALGORITHMS QUIZ 2 Fall 2021 | Study Guruz MEGA File | 95-100 % Marks

CS502 – DESIGN & ANALYSIS OF ALGORITHMS QUIZ 2 Fall 2021 | MEGA File & Current Quiz| 95-100 percent Marks by Study Guruz

Download LINK:
CS502 – DESIGN & ANALYSIS OF ALGORITHMS STUDY GURUZ 826 Pages CS502-MEGA FILE WITH TODAY QUIZ AND HANDOUTS FOR QUIZ

https://www.mediafire.com/file/747z62...

**********************************************************************************************************************
||| NOTE: PASSWORD OF .RAR FILE IS GIVEN IN VIDEO, SO PLEASE WATCH THE VIDEO FOR CONCEPT & PASSWORD|||
********************************************************************************************************************
FOR MORE HELP SUBSCRIBE OUR CHANNEL AND VISIT WWW.STUDYGURUZ.COM

CS 502 – DESIGN & ANALYSIS OF ALGORITHMS

Fall 2021 Quiz NO. 2 5-03-2022
Solution given in Video

1. Adding any edge Io a free tree create a unique

A. Cycle(SG ANSWER)
B. Vertex
C. Edge
D. Strong component

2. Computing the strongly connected components of a digraph is a/an________________ of the problem to determine whether a digraph is strongly connected or not.

A. optimization
B. generalization(SG ANSWER)
C. size
D. connection

3. Timestamp structure of is used in determining the strong components of a digraph.

A. DFS(SG ANSWER)
B. Both DFS & BFS
C. BFS
D. MSI

4. A digraph is strongly connected under what condition?

A. A digraph is strongly connected if for at least one pair of vertex u. v e V u can reach v and vice versa
B. A digraph is strongly connected if for every pair of vertices u: v o V, u can reach v and vice versa(SG ANSWER)
C. A digraph is strongly connected if for every pair of vertices u; v c V. u can reach v.
D. A digraph is strongly connected it at least one third pan ol vertices u. v e V u can reach v and vice versa

5. As the Kruskal's algorithm runs, the edges in viable set A induce a on the vertices.

A. Forest
B. Graph
C. Set(SG ANSWER)
D. tree

6. Overall Running time of Prim's algorithm is

A. O((V+E)logE)
B. O((V+E)logV) (SG ANSWER)
C. O(ElogV)
D. O(ElogE)

7. In Bellman-Ford Algorithm, relaxation applies to every edge of the graph and repeat this time.

A. E-1
B. E+ 1
C. V-1(SG ANSWER)
D. V+1

8. A topological sort of a DAG is a ordering of the vertices of the DAG such that for each edge (u, v), u appears before v in the ordering.

A. Linear(SG ANSWER)
B. Non Linear
C. Parallel
D. Sequence

9. From given algorithms which one considered as best for finding the shortest-path:

A. Dijkslra's algorithm(SG ANSWER)
B. BFS
C. Bellman Ford algorithm
D. DFS

10. A free tree with n vertices have exactly edges.

A. n-1(SG ANSWER)
B. n+ 1
C. n
D. 1

9. For 2D Maxima problem, Plane Sweep algorithm first of all

A. Output the elements
B. Pushes all points on stack
C. Delete some points
C. Sorts all points (SG ANSWER)

10. The sieve technique works where we have to find________item(s) from a large input.

D. Similar
E. Single (SG ANSWER)
F. Two
G. Three

1. In algorithm, you hope that by choosing a local optimum at each step, you will end up at a global optimum.


D. Greedy (SG ANSWER)


2. Identify a TRUE statement about Knapsack.
D. The Knapsack problem belongs to the domain of optimization proems(SG ANSWER)

3. In Activity Selection, we say that two activities are non-interfering if their start-finish interval __________overlap.

D. Do not(SG ANSWER)


4. What will be value of the matrices product (A-j A2)A3 ? if A-j = 5*3 A2 = 3*7 A3 = 7*2.

A. 180(SG ANSWER)

5. In Fractional Knapsack problem, one is allowed to take fraction of an item for
C. Both, fraction of the weight and value(SG ANSWER)


6. A/an____________ is one in which you want to find, not just a solution, but the best solution.
A. NP Complete problem
B. Optimization Problem(SG ANSWER)
7. Time complexity of Dynamic Programming based algorithm for computing the minimum cost of Chain Matrix Multiplication is. N cube

A. n~2 (n square)
B. log n
C. n
D. n*3 (n cube) (SG ANSWER)

8. A graph is__________ if every vertex can reach every other vertex.
A. Acyclic
B. Cycle
C. Connected(SG ANSWER)
D. Loop


9. Which one of the following problems can be solved using dynamic problem?
A. Matrix chain multiplication problem (SG ANSWER)

10. In a digraph, the number of edges coming out of a vertex is called the ____________ of that vertex.
A. Complete degree
B. In-degree
C. Node
D. Out-degree (SG ANSWER)

STUDY GURUZ SOLVED MEGA FILE
UPTO Fall 2021 QUIZ 2
FOR MORE PRACTICE EXAM/QUIZ PLEASE VISIT
PLEASE SUBSCRIBE US ON YOUTUBE
   / studyguruz  

PLEASE WATCH THE VIDEO TO GET THE FILE PASSWORD AS FILE IS PASSWORD PROTECTED AND PASSWORD IS GIVEN IN VIDEO.
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