Data Structures and Algorithms-I MCQs

Page No. 44

What is the time complexity to insert an element into the direct address table?


aO(n)


bO(logn)


cO(nlogn)


dO(1)


View Answer O(1)

What is the search complexity in direct addressing?


aO(n)


bO(logn)


cO(nlogn)


dO(1)


View Answer O(1)

When is it appropriate to use direct addressing?


aWhen the array is comparatively large


bWhen the universe U of keys is reasonably small


cWhen the universe U of keys is reasonably large


dWhen the array is comparatively small



What is direct addressing?


aDistinct array position for every possible key


bFewer array positions than keys


cFewer keys than array positions


dDistinct array positions for keys based on priority



Which of the following ways can be used to represent a graph?


aAdjacency List and Adjacency Matrix


bIncidence Matrix


cAdjacency List, Adjacency Matrix as well as Incidence Matrix


dNo way to represent



A graph with all vertices having equal degree is known as a __________


aMulti Graph


bRegular Graph


cSimple Graph


dComplete Graph


View Answer Regular Graph

For which of the following combinations of the degrees of vertices would the connected graph be eulerian?


a1,2,3


b2,3,4


c2,4,5


d1,3,5


View Answer 1,2,3

For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?


av=e


bv = e+1


cv + 1 = e


dv = e-1


View Answer v = e+1

Which of the following is true?


aA graph may contain no edges and many vertices


bA graph may contain many edges and no vertices


cA graph may contain no edges and no vertices


dA graph may contain no vertices and many edges



What is the maximum number of edges in a bipartite graph having 10 vertices?


a24


b21


c25


d15


View Answer 25

Goto Page No.

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