Bihar STET Computer Science – Data Structures & Algorithms SET-1

Questions 91-95 of 100

0% completed (0/100 answered)
Your score 0/100 0 answered
Correct 0 Incorrect 0 Unanswered 100 Accuracy 0%

Question 91

MCQ · Single Correct 1 mark

What is the main property of a prefix-free code?

Answers for question 91

Question 92

MCQ · Single Correct 1 mark

Which dynamic programming problem asks for the minimum number of scalar multiplications needed to multiply a chain of matrices?

Answers for question 92

Question 93

MCQ · Single Correct 1 mark

What is the time complexity of the standard dynamic programming solution for LCS of strings of lengths m and n?

Answers for question 93

Question 94

MCQ · Single Correct 1 mark

Which problem is optimally solved by a greedy strategy based on value-to-weight ratio when fractions of items are allowed?

Answers for question 94

Question 95

MCQ · Single Correct 1 mark

Why does the usual greedy ratio strategy not always solve 0/1 Knapsack optimally?

Answers for question 95
Scroll to Top