Data Structures Algorithms-II MCQs
Page No. 94
Which of the following statement about 0/1 knapsack and fractional knapsack problem is correct?
✖
✖
✖
✓
What is the objective of the knapsack problem?
✓
✖
✖
✖
Fractional knapsack problem is solved most efficiently by which of the following algorithm?
✖
✖
✓
✖
Fractional knapsack problem is also known as __________
✖
✓
✖
✖
✖
✖
✖
✓
What is the running time of the Huffman encoding algorithm?
✖
✖
✓
✖
The type of encoding where no character code is the prefix of another character code is called?
✖
✓
✖
✖
An optimal code will always be present in a full tree.
✓
✖
✖
✖
What will be the cost of the code if character ci is at depth di and occurs at frequency fi?
✖
✖
✓
✖
From the following given tree, what is the computed codeword for ‘c’?
✖
✖
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