Here is an algorithm for calling a friend on the Telephone: Step Operation 1. Dial the phone and wait for either an answer or a busy signal 2. If the line is not busy then do Steps 3 and 4 3. Talk as long as you want 4. Hang up the phone, you are done 5. Otherwise (the line is busy) 6.Wait exactly 1 minute 7. Go back to Step 1 and try again During execution, this algorithm could get into a situation in which, as in the deadlock The problem, no useful work can ever get done. Describe the problem, explain why it occurs, and suggest how it could be solved.

1)consider the following code snippet: #ifndef book_h#define book_hconst double max_cost = 1000.0; class book{public: book(); book(double new_cost); void set_cost(double new_cost); double get_cost() const; private: double cost; }; double calculate_terms(book bk); #endifwhich of the following is correct? a)the header file is correct as given. b)the definition of max_cost should be removed since header files should not contain constants. c)the definition of book should be removed since header files should not contain class definitions. d)the body of the calculate_terms function should be added to the header file.

Martha is designing a single-player game. her manager suggests that she plan the design to incorporate future modifications. which principle of game design relates to planning for future modifications?

Which option allows you to view slides on the full computer screen?