DSBS-FN-30.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
The first step in the naïve greedy algorithm is?
2.
MULTIPLE CHOICE QUESTION
2 mins • 1 pt
Suppose you have coins of denominations 1,3 and 4. You use a greedy algorithm, in which you choose the largest denomination coin which is not greater than the remaining sum. For which of the following sums, will the algorithm produce an optimal answer?
3.
MULTIPLE CHOICE QUESTION
2 mins • 1 pt
Dijkstra’s Algorithm is the prime example for ___________
4.
MULTIPLE CHOICE QUESTION
2 mins • 1 pt
With what data structure can a priority queue be implemented?
5.
MULTIPLE CHOICE QUESTION
2 mins • 1 pt
What is the time complexity to insert a node based on key in a priority queue?
6.
MULTIPLE CHOICE QUESTION
2 mins • 1 pt
Which of the following is not an advantage of a priority queue?
7.
MULTIPLE CHOICE QUESTION
2 mins • 1 pt
Descending priority queue can be implemented using ______
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?
