subject
Computers and Technology, 22.07.2020 03:01 plum65

The University of Northern Florida has hired you to write an algorithm to schedule their final exams. Each semester, the university offers n different classes. There are r different rooms on campus and k different time slots in which exams can be offered. You are given two arrays E[1 .. n] and C[1 .. r], where E[i] is the number of students enrolled in the ith class, and C[j] is the number of seats in the jth room. At most one final exam can be held in each room during each time slot. Class i can hold its final exam in room j only if E[i] < C[j]. Describe and analyze an efficient algorithm to assign a room-time slot pair to each class (or report correctly that no such assignment is possible).

ansver
Answers: 2

Other questions on the subject: Computers and Technology

image
Computers and Technology, 23.06.2019 13:00, alexacarillo
In excel - calculate the actual increase/decrease from first quarter to the second quarter then subtract subtract first quarter value from second quarter total then divide result by first quarter value
Answers: 1
image
Computers and Technology, 23.06.2019 21:30, quintonps12
Which of the following includes the three primary network access technologies? dsl, cable modem, broadband lan, wan, man voip, uc, iptv tcp/ip, ftp, dhcp
Answers: 2
image
Computers and Technology, 23.06.2019 22:00, rocksquad9125
Take a critical look at three gui applications you have used—for example, a spreadsheet, a word-processing program, and a game. describe how well each conforms to the gui design guidelines listed in this chapter.
Answers: 3
image
Computers and Technology, 24.06.2019 16:00, codycollier
To fill (copy) a cell across or down, point to the of the cell and drag. top left corner top right corner bottom left corner bottom right corner
Answers: 3
You know the right answer?
The University of Northern Florida has hired you to write an algorithm to schedule their final exams...

Questions in other subjects:

Konu
Computers and Technology, 10.11.2020 01:00
Konu
Mathematics, 10.11.2020 01:00
Konu
Mathematics, 10.11.2020 01:00
Konu
Mathematics, 10.11.2020 01:00