Category Archives: Greedy Algorithm MCQ

This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Huffman Code”. 1. Which of the following algorithms is the best approach for solving Huffman codes? a) exhaustive search b) greedy algorithm c) brute force algorithm d) divide and conquer algorithm 2. How many printable characters does the ASCII character … Read more

This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Fractional Knapsack Problem”. 1. Fractional knapsack problem is also known as __________ a) 0/1 knapsack problem b) Continuous knapsack problem c) Divisible knapsack problem d) Non continuous knapsack problem 2. Fractional knapsack problem is solved most efficiently by which of … Read more