Data Structures Algorithms-II MCQs

Page No. 65

Which of the following is false about the Kruskal’s algorithm?


aIt is a greedy algorithm

✖


bIt constructs MST by selecting edges in increasing order of their weights

✖


cIt can accept cycles in the MST

✓


d It uses union-find data structure

✖



Kruskal’s algorithm is a ______


adivide and conquer algorithm

✖


bdynamic programming algorithm

✖


cgreedy algorithm

✓


dapproximation algorithm

✖


View Answer greedy algorithm

Kruskal’s algorithm is used to ______


aKruskal’s algorithm is used to ______

✓


b find single source shortest path

✖


cfind all pair shortest path algorithm

✖


dtraverse the graph

✖



Kruskal’s algorithm is used to ______


a find minimum spanning tree

✓


bfind single source shortest path

✖


cfind all pair shortest path algorithm

✖


d traverse the graph

✖



Which of the following is false about Prim’s algorithm?


a It is a greedy algorithm

✖


b It constructs MST by selecting edges in increasing order of their weights

✓


cIt never accepts cycles in the MST

✖


d It can be implemented using the Fibonacci heap

✖



Prim’s algorithm can be efficiently implemented using _____ for graphs with greater density.


ad-ary heap

✓


b linear search

✖


cfibonacci heap

✖


dbinary search

✖


View Answer d-ary heap

Prim’s algorithm is also known as __________


aDijkstra–Scholten algorithm

✖


b Borůvka’s algorithm

✖


cFloyd–Warshall algorithm

✖


dDJP Algorithm

✓


View Answer DJP Algorithm

Consider the graph shown below.


a (4-3)(5-3)(2-3)(1-2)

✖


b(4-3)(3-5)(5-1)(1-2)

✖


c (4-3)(3-5)(5-2)(1-5)

✖


d (4-3)(3-2)(2-1)(1-5)

✓



Kruskal’s algorithm is best suited for the sparse graphs than the prim’s algorithm.


aTrue

✓


b False

✖


cA & B

✖


dNone of these

✖


View Answer True

Prim’s algorithm resembles Dijkstra’s algorithm.


aTrue

✓


bFalse

✖


cA & B

✖


dNone of these

✖


View Answer True

Goto Page No.

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