Data Structures Algorithms-II MCQs

Page No. 101

What is the space complexity of the following dynamic programming implementation used to compute the nth fibonacci term?


aO(1)

✖


bO(n)

✓


cO(n2)

✖


dExponential

✖


View Answer O(n)

What is the time complexity of the following dynamic programming implementation used to compute the nth fibonacci term?


aO(1)

✖


bO(n)

✓


cO(n2)

✖


dExponential

✖


View Answer O(n)

Which technique is used by line 7 of the above code?


aGreedy

✖


bRecursion

✖


cMemoization

✓


dOverlapping subproblems

✖


View Answer Memoization

Which property is shown by line 7 of the above code?


aOptimal substructure

✓


bOverlapping subproblems

✖


cBoth overlapping subproblems and optimal substructure

✖


dGreedy substructure

✖


View Answer Optimal substructure

What will be the output when the following code is executed?


a34

✖


b55

✓


cCompile error

✖


d Runtime error

✖


View Answer 55

What is the space complexity of the following for loop method used to compute the nth fibonacci term?


aO(1)

✓


bO(n)

✖


cO(n2)

✖


dExponential

✖


View Answer O(1)

What is the time complexity of the following for loop method used to compute the nth fibonacci term?


aO(1)

✖


bO(n)

✓


cO(n2)

✖


dExponential

✖


View Answer O(n)

Consider the following code to find the nth fibonacci term:


aprevFib = curFib curFib = curFib

✖


bprevFib = nextFib curFib = prevFib

✖


cprevFib = curFib curFib = nextFib

✓


dprevFib = nextFib nextFib = curFib

✖



What is the space complexity of the recursive implementation used to find the nth fibonacci term?


aO(1)

✓


bO(n)

✖


cO(n2)

✖


d O(n3)

✖


View Answer O(1)

Which property is shown by the above function calls?


a Memoization

✖


bOptimal substructure

✖


cOverlapping subproblems

✓


dGreedy

✖



Goto Page No.

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