Programming & Computer Science Answers

Suppose the sequential file ALE.TXT contains the information shown in Table 1.1. Write a program to use the file to produce the Table 1.2 in which the baseball teams are in descending order by the percentage of games won. Note : A batting average can be displayed in standard form with FormatNumber(ave, 3, vbFalse). Table 1.1 American League East games won and Lost in 2002. Team Won Lost Baltimore 67 95 Boston 93 69 New York 103 58 Tampa Bay 55 106 Toronto 78 84 Table 1.2 Final 2002 American League East standings. American League East Team Won Lost Percentage New York 103 58 0.640 Boston 93 69 0.574 Toronto 78 84 0.481 Baltimore 67 95 0.414 Tampa Bay 55 106 0.342

Consider a set 4 processes (P1,P2,P3,P4) with 3 units of R1, 4 units of R2, 3 units of R3 and 2 units of R4. Further, P1 holds 2 units of R1 and waits for 1 unit of R2. P2 waits for 2 units of R1 and holds 1 unit of R2, P3 holds 2 units of R3 and waits for 1 unit of R4, P4 holds 2 units of R3 and waits for 1 unit of R4. Construct the wait-for graph. Does the system have a deadlock? Justify your answer

// main.cpp -- this program provides an example of how a program can **use** //
// the Stack Abstract Data Type (ADT). The stack adt's public functions are //
// **declared** in stack.h and **implemented** in stack.cpp. //
// //
// The purpose of main.cpp is to thoroughly test the functions of the stack //
// adt. //
// //
//

#include <iostream> // these two lines allow the program to use the
using namespace std; // standard cin and cout inpu

// stack.cpp implements a stack abstract data type. Users of the stack can //
// perform the following operations: //
// //
// 1. void initialiseStack(Stack) - reset the stack to the empty state //
// 2. bool isEmpty(Stack) - test whether the stack is empty //
// 3. bool isFull(Stack) - test whether the stack is full //
// 4. void push(Stack, StackElement) - put another element onto the stack //
// 5. StackElement pop(Stack) - remove & return the top element //
// 6. StackElement peek(Stack) - return a copy of the top element //
// //
// Internally, this stack abstract data type is implemented as an array of //
// elements.

// stack.h declares the public functions implemented in the stack abstract //
// (the implementation file is stack.cpp). By including this file in their //
// code, users of the stack can access the following operations: //
// //
// 1. void initialiseStack(Stack) - reset the stack to the empty state //
// 2. bool isEmpty(Stack) - test whether the stack is empty //
// 3. bool isFull(Stack) - test whether the stack is full //
// 4. void push(Stack, StackElement) - put another element onto the stack //
// 5. StackElement pop(Stack) - remove & return the top element //
// 6. StackElement peek(Stack) - return a copy of the top element //
// //
// The implementation of this stack can be found in