Data Structures and Algorithms-I MCQs

Page No. 49

Number of vertices with odd degrees in a graph having a eulerian walk is ________


a0


bCan’t be predicted


c2


deither 0 or 2


View Answer either 0 or 2

Given a plane graph, G having 2 connected component, having 6 vertices, 7 edges and 4 regions. What will be the number of connected components?


a1


b2


c3


d4


View Answer 2

The number of possible undirected graphs which may have self loops but no multiple edges and have n vertices is ________


a2((n*(n-1))/2)


b2((n*(n+1))/2)


c2((n-1)*(n-1))/2)


d2((n*n)/2)


View Answer 2((n*n)/2)

What is the maximum number of edges present in a simple directed graph with 7 vertices if there exists no cycles in the graph?


a21


b7


c6


d49


View Answer 6

What is the maximum possible number of edges in a directed graph with no self loops having 8 vertices?


a28


b64


c256


d56


View Answer 56

Assuming value of every weight to be greater than 10, in which of the following cases the shortest path of a directed weighted graph from 2 vertices u and v will never change?


aadd all values by 10


bsubtract 10 from all the values


cmultiply all values by 10


din both the cases of multiplying and adding by 10



All Graphs have unique representation on paper.


aTrue


bFalse


ceither true either false


dNone of the mentioned


View Answer False

Floyd Warshall Algorithm used to solve the shortest path problem has a time complexity of __________


aO(V*V)


bO(V*V*V)


cO(E*V)


dO(E*E)


View Answer O(V*V*V)

What is the number of unlabeled simple directed graph that can be made with 1 or 2 vertices?


a2


b4


c5


d9


View Answer 4

A graph having an edge from each vertex to every other vertex is called a ___________


aTightly Connected


bStrongly Connected


cWeakly Connected


dLoosely Connected


View Answer Tightly Connected

Goto Page No.

Page 49 of 53

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