Data Structures Algorithms-II MCQs

Page No. 67

What is running time of Dijkstra’s algorithm using Binary min- heap method?


aO(V)

✖


b O(VlogV)

✖


cO(E)

✖


d O(ElogV)

✓


View Answer O(ElogV)

The maximum number of times the decrease key operation performed in Dijkstra’s algorithm will be equal to ___________


aTotal number of vertices

✖


bTotal number of edges

✓


cNumber of vertices – 1

✖


dNumber of edges – 1

✖


View Answer Total number of edges

How many times the insert and extract min operations are invoked per vertex?


a1

✓


b2

✖


c3

✖


d 0

✖


View Answer 1

How many priority queue operations are involved in Dijkstra’s Algorithm?


a1

✖


b 3

✓


c 2

✖


d4

✖


View Answer 3

Dijkstra’s Algorithm cannot be applied on ______________


aDirected and weighted graphs

✖


bGraphs having negative weight function

✓


cUnweighted graphs

✖


d Undirected and unweighted graphs

✖



What is the time complexity of Dijikstra’s algorithm?


aO(N)

✖


bO(N3)

✖


cO(N2)

✓


dO(logN)

✖


View Answer O(N2)

Which of the following is the most commonly used data structure for implementing Dijkstra’s Algorithm?


aMax priority queue

✖


bStack

✖


cCircular queue

✖


dMin priority queue

✓


View Answer Min priority queue

Dijkstra’s Algorithm is used to solve _____________ problems.


aAll pair shortest path

✖


bSingle source shortest path

✓


cNetwork flow

✖


dSorting

✖



A graph is said to have a negative weight cycle when?


a The graph has 1 negative weighted edge

✖


bThe graph has a cycle

✖


c The total weight of the graph is negative

✓


dThe graph has 1 or more negative weighted edges

✖



Bellmann Ford Algorithm is an example for ____________


aDynamic Programming

✓


bGreedy Algorithms

✖


cLinear Programming

✖


dBranch and Bound

✖


View Answer Dynamic Programming

Goto Page No.

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