Data Structures Algorithms-II MCQs

Page No. 83

Which graph is also known as biclique?


aHistogram

✖


bComplete Bipartite

✓


cCartesian

✖


dTree

✖


View Answer Complete Bipartite

How many edges does a n vertex triangle free graph contains?


an2

✖


bn2 + 2

✖


cn2 / 4

✓


dn3

✖


View Answer n2 / 4

Which term defines all the complete bipartite graph that are trees?


aSymmetric

✖


bAnti – Symmetric

✖


cCircular

✖


dStars

✓


View Answer Stars

Which type of graph has all the vertex of the first set connected to all the vertex of the second set?


aBipartite

✖


bComplete Bipartite

✓


cCartesian

✖


dPie

✖


View Answer Complete Bipartite

In recursion, the condition for which the function will stop calling itself is ____________


aBest case

✖


bWorst case

✖


cBase case

✓


dThere is no such condition

✖


View Answer Base case

Which of the following problems can’t be solved using recursion?


a Factorial of a number

✖


bNth fibonacci number

✖


c Length of a string

✖


dProblems without base case

✓



Recursion is a method in which the solution of a problem depends on ____________


a Larger instances of different problems

✖


bLarger instances of the same problem

✖


cSmaller instances of the same problem

✓


d Smaller instances of different problems

✖



Which of the following recursive formula can be used to find the factorial of a number?


afact(n) = n * fact(n)

✖


bfact(n) = n * fact(n+1)

✖


cfact(n) = n * fact(n-1)

✓


dfact(n) = n * fact(1)

✖



In general, which of the following methods isn’t used to find the factorial of a number?


aRecursion

✖


b Iteration

✓


c Dynamic programming

✖


dNon iterative / recursive

✖


View Answer Iteration

Which of the following recurrence relations can be used to find the nth fibonacci number?


aF(n) = F(n) + F(n – 1)

✖


bF(n) = F(n) + F(n + 1)

✖


c F(n) = F(n – 1)

✖


dF(n) = F(n – 1) + F(n – 2)

✓



Goto Page No.

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