Data Structures Algorithms-II MCQs
Page No. 93
What will be the recurrence relation of the following code?
✖
✖
✓
✖
Solve the following recurrence using Master’s theorem. T(n) = 16T (n/4) + n
✖
✖
✖
✓
Solve the following recurrence using Master’s theorem. T(n) = T (n/2) + 2n
✖
✖
✓
✖
Solve the following recurrence using Master’s theorem. T(n) = 4T (n/2) + n2
✖
✖
✓
✖
✖
✖
✖
✓
The main time taking step in fractional knapsack problem is ___________
✖
✖
✓
✖
The result of the fractional knapsack is greater than or equal to 0/1 knapsack.
✓
✖
✖
✖
✓
✖
✖
✖
Fractional knapsack problem can be solved in time O(n).
✓
✖
✖
✖
Time complexity of fractional knapsack problem is ____________
✓
✖
Here below You find all kind of categories of MCQs in alphabetical order.
"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.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