Data Structures Algorithms-II MCQs

Page No. 140

Problems that cannot be solved by any algorithm are called?


atractable problems


bintractable problems


cundecidable problems


ddecidable problems


View Answer undecidable problems

_________ is the class of decision problems that can be solved by non-deterministic polynomial algorithms.


a NP


bP


cHard


dComplete


View Answer NP

The sum and composition of two polynomials are always polynomials.


atrue


bfalse


cA & B


d None of the above


View Answer true

Problems that can be solved in polynomial time are known as?


aintractable


b tractable


cdecision


dcomplete


View Answer tractable

The worst-case efficiency of solving a problem in polynomial time is?


aa) O(p(n))


bO(p( n log n))


cO(p(n2))


dO(p(m log n))


View Answer a) O(p(n))

How many Hamiltonian paths does the following graph have?


a1


b2


c3


d4


View Answer 1

What is the time complexity for finding a Hamiltonian path for a graph having N vertices (using permutation)?


aO(N!)


bO(N! * N)


cO(log N)


dO(N)


View Answer O(N! * N)

For a graph of degree three, in what time can a Hamiltonian path be found?


aO(0.251n)


bO(0.401n)


c O(0.167n)


dO(0.151n)


View Answer O(0.251n)

Who invented the inclusion-exclusion principle to solve the Hamiltonian path problem?


aKarp


bLeonard Adleman


cAndreas Bjorklund


dMartello


View Answer Andreas Bjorklund

In graphs, in which all vertices have an odd degree, the number of Hamiltonian cycles through any fixed edge is always even.


atrue


bfalse


cA & B


d None of the above


View Answer true

Goto Page No.

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