The university has hired you to write an algorithm to schedule their final exams. each quarter, the university offers n different classes. there are r different rooms on campus and t different time slots in which exams can be offered. you are given two arrays e[1..n] and s[1..r] where e[i] is the number of students enrolled in the ith class, and s[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] < s[j].

a. (9 pts) write an algorithm to assign a room and a time slot to each class (or report correctly that no such assignment is possible).

b. (3 pts) provide time complexity analysis.

c. (3 pts) explain why your algorithm is correct.

answer:

true

c

explanation:

answer:

// here is code in C++.

#include <bits/stdc++.h>

using namespace std;

//main function

int main()

{

  // variable

 int n;

 cout<<"enter a number:";

 // read the input

 cin>>n;

 // find the square root of the absolute value

 float square_root=sqrt(abs(n));

 // print the square_root

 cout<<"square root of "<<n<<" is: "<<square_root<<endl;

  return 0;

}

Explanation:

Read a number from user and assign it to "n".Then find its absolute value with abs() function.Then calculate the square root of the absolute value with sqrt() function.Print the square root of the number.

Output:

enter a number:-17

square root of -17 is: 4.12311

                                                         This is easy

                                                     sinserly Natalie 7 grader (this is not that hard)

answer:

D is the anseer

Explanation:

answer:

sorry but I am just answering the questions because I need points

Explanation:

thank u