Data Structures Algorithms-II MCQs

Page No. 71

In what time can an augmented path be found?


aO(|E| log |V|)

✖


bO(|E|)

✓


cO(|E2)

✖


dO(|E|2 log |V|)

✖


View Answer O(|E|)

A simple acyclic path between source and sink which pass through only positive weighted edges is called?


aaugmenting path

✓


bcritical path

✖


c residual path

✖


dmaximum path

✖


View Answer augmenting path

Under what condition can a vertex combine and distribute flow in any manner?


aIt may violate edge capacities

✖


bIt should maintain flow conservation

✓


cThe vertex should be a source vertex

✖


dThe vertex should be a sink vertex

✖



The first step in the naïve greedy algorithm is?


aanalysing the zero flow

✓


bcalculating the maximum flow using trial and error

✖


cadding flows with higher values

✖


dreversing flow if required

✖



Does Ford- Fulkerson algorithm use the idea of?


aNaïve greedy algorithm approach

✖


bResidual graphs

✓


cMinimum cut

✖


dMinimum spanning tree

✖


View Answer Residual graphs

Which algorithm is used to solve a maximum flow problem?


aPrim’s algorithm

✖


bKruskal’s algorithm

✖


c Dijkstra’s algorithm

✖


dFord-Fulkerson algorithm

✓



What is the source?


aVertex with no incoming edges

✓


bVertex with no leaving edges

✖


cCentre vertex

✖


dVertex with the least weight

✖



A network can have only one source and one sink.


a False

✖


b True

✓


ceither A. or B.

✖


d None of these

✖


View Answer True

What does Maximum flow problem involve?


afinding a flow between source and sink that is maximum

✓


bfinding a flow between source and sink that is minimum

✖


cfinding the shortest path between source and sink

✖


dcomputing a minimum spanning tree

✖



What is the efficiency of Gale-Shapley algorithm used in stable marriage problem?


aO(N)

✖


bO(N log N)

✖


cO(N2)

✓


dO(log N)

✖


View Answer O(N2)

Goto Page No.

Page 71 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