Data Structures and Algorithms-I MCQs

Page No. 48

Space complexity for an adjacency list of an undirected graph having large values of V (vertices) and E (edges) is __________


aO(V)


bO(E*E)


cO(E)


dO(E+V)


View Answer O(E)

For the given conditions, which of the following is in the correct order of increasing space requirement?
i) Undirected, no weight
ii) Directed, no weight
iii) Directed, weighted
iv) Undirected, weighted


aii iii i iv


bi iii ii iv


civ iii i ii


di ii iii iv


View Answer ii iii i iv

Time complexity to find if there is an edge between 2 particular vertices is _________


aO(V)


bO(E)


cO(1)


dO(V+E)


View Answer O(V)

For some sparse graph an adjacency list is more space efficient against an adjacency matrix.


aTrue


bFalse


cNone of the given options


deither true either false


View Answer True

Space complexity for an adjacency list of an undirected graph having large values of V (vertices) and E (edges) is ___________


aO(E)


bO(V*V)


cO(E+V)


dO(V)


View Answer O(E+V)

What would the time complexity to check if an undirected graph with V vertices and E edges is Bipartite or not given its adjacency matrix?


aO(E*E)


bO(V*V)


cO(E)


dO(V)


View Answer O(V*V)

All trees with n vertices consists of n-1 edges.


aTrue


bFalse


cNone of the given options


deither true either false


View Answer True

What is the number of vertices of degree 2 in a path graph having n vertices, here n>2.


an-2


bn


c2


d0


View Answer n-2

All paths and cyclic graphs are bipartite graphs.


aTrue


bFalse


cNone of the given options


deither true either false


View Answer False

How many of the following statements are correct?
i) All cyclic graphs are complete graphs.
ii) All complete graphs are cyclic graphs.
iii) All paths are bipartite.
iv) All cyclic graphs are bipartite.
v) There are cyclic graphs which are complete.


a1


b2


c3


d4


View Answer 2

Goto Page No.

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