Data Structures Algorithms-II MCQs

Page No. 75

__________ is a data structure used to collect a system of cuts for solving min-cut problem.


aGomory-Hu tree


bGomory-Hu graph


cDancing tree


dAA tree


View Answer Gomory-Hu tree

The weight of the cut is not equal to the maximum flow in a network.


atrue


bFalse


ceither A. or B.


d None of these


View Answer False

_____________ is a family of combinatorial optimization problems in which a graph is partitioned into two or more parts with constraints.


anumerical problems


bgraph partition


cnetwork problems


dcombinatorial problems


View Answer graph partition

What is the running time of Karger’s algorithm to find the minimum cut in a graph?


aO(E)


bO(|V|2)


cO(V)


dO(|E|)


View Answer O(|V|2)

What is the minimum number of cuts that a graph with ‘n’ vertices can have?


an+1


bn(n-1)


cn(n+1)/2


dn(n-1)/2


View Answer n(n+1)/2

______________ separates a particular pair of vertices in a graph.


aline


barc


ccut


dflow


View Answer cut

Minimum cut algorithm comes along with the maximum flow problem.


aTrue


bFalse


ceither A. or B.


d None of these


View Answer True

___________ is a partition of the vertices of a graph in two disjoint subsets that are joined by atleast one edge.


aMinimum cut


bMaximum flow


cMaximum cut


dGraph cut


View Answer Minimum cut

hich algorithm is used to solve a minimum cut algorithm?


aGale-Shapley algorithm


bFord-Fulkerson algorithm


cStoer-Wagner algorithm


d Prim’s algorithm



Vertex coloring and chromatic number are one and the same.


aTrue


bFalse


ceither A. or B.


d None of these


View Answer False

Goto Page No.

Page 75 of 149

Alphabetical MCQs Categories

Here below You find all kind of categories of MCQs in alphabetical order.


"Comprehensive Collection of MCQs: Alphabetically Organized by Subject"

"Discover an extensive collection of multiple-choice questions (MCQs) neatly categorized by subject from A to Z. This resource is designed for anyone eager to explore various topics in a straightforward and organized manner. Whether you're a student preparing for exams, an educator seeking supplementary materials, or simply curious about different subjects, this compilation offers a convenient way to learn and assess your knowledge. With questions arranged alphabetically, navigation is effortless, allowing you to delve into subjects of interest at your own pace. Engage, learn, and expand your understanding with this accessible and comprehensive repository of MCQs!"


BolPakistan

bolpakistan.com.pk includes Job Mcqs and Pak Mcqs is the Top Largest Mcqs Forum in World, in which you can read Mcqs of All Subjects, PPSC test preparation, FPSC, NTS and PPSC PAST PAPERS, PPSC PAST MCQS. A Collection of Repeated MCQs for JOBs seekers.

Copyright © 2024, Designed & Developed by BolPakistan