DSBS-FN-31.01.2024
Authored by CCC info@ccc.training
English
Professional Development
Used 1+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
15 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
2 mins • 1 pt
Which one of the following array elements represents a binary min heap?
2.
MULTIPLE CHOICE QUESTION
2 mins • 1 pt
What will be the position of 5, when a max heap is constructed on the input elements 5, 70, 45, 7, 12, 15, 13, 65, 30, 25?
3.
MULTIPLE CHOICE QUESTION
2 mins • 1 pt
Which of the following algorithms is the best approach for solving Huffman codes?
4.
MULTIPLE CHOICE QUESTION
2 mins • 1 pt
Fractional knapsack problem is solved most efficiently by which of the following algorithm?
5.
MULTIPLE CHOICE QUESTION
2 mins • 1 pt
Fractional knapsack problem is also known as __________
6.
MULTIPLE CHOICE QUESTION
2 mins • 1 pt
What is the objective of the knapsack problem?
7.
MULTIPLE CHOICE QUESTION
2 mins • 1 pt
The main time taking step in fractional knapsack problem is ___________
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Microsoft
or continue with
%20(1).png)
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?
