What is the minimum total weight of unscheduled tasks when there is one processor, no preemption is allowed, and there are 8 tasks with equal lengths (li) of 2, with given weights and deadlines as follows: 

Які знаки матимуть прирости

координат, якщо α

Які

два види поліморфізму реалізовано в C++?

Under what condition does a directed acyclic graph (DAG) have a unique topological ordering?

Consider two recursive algorithms A and B to solve a problem. The recurrences corresponding to their running times are

A. T(m) = 2T(m/2)+m²

B. T(m) = 8T(m/4)+10m²​

Which of these algorithms is faster (i.e., more efficient)?

What is the time complexity of the Floyd-Warshall all shortest path algorithm for a graph with V vertices? Select the tightest bound.

Якою буде відносна нев’язка

Consider the following statement: 

"In order to solve the recurrence T[n]=7·T[n/8]+n by the Master method, you will need to check the regularity condition."

Select every correct answer below (More than one choice could be selected. You may lose points for wrong selections). 

• Counting Sort is a comparison-based sorting algorithm.
• Counting Sort is inefficient when input elements are drawn from a small range.
• Counting Sort is a stable sorting algorithm.
• Counting Sort runs in linear time when the range of input values is not significantly larger than the number of elements.
• Counting Sort can efficiently sort floating-point numbers.
• Counting Sort has a worst-case time complexity of O(n log n) and this bound is tight.

How many of the following statements about Counting Sort are true?