Pls Help A table is a_______of rows and columns that provides a structure for presenting data

In object-oriented development, why is it necessary to use drivers and stubs in testing?

HACTEHA [7]

Answer: In object-oriented approach for the development of operating system requires stub and driver as essential part for the creation of proper interaction of the object oriented components with the external system.They help in testing of the module.

Stub is the unit that acts as a piece of code which fills in the place of the missing section in the system. The functions of the system module is tested by stub .

Driver is the part that helps in citing the system modules under the testing conditions.It is the piece of code that creates the calling function simulation.

5 0

4 years ago

The program evaluation and review technique (PERT) is __________. a. a network-based technique in which there is a single time e

xenn [34]

Answer:

The correct answer to the following question is "Option b".

Explanation:

PERT is a methodology that organizations follow to evaluate and reflect the behavior within a venture, as well as to demonstrate the flow of occurrences within a project. It is indeed a tool for evaluating it calculating the duration needed to complete a job within and without the timelines.

It acts as a strategic method for the study, description, and integration of occurrences also demonstrates the tasks and trade-offs within a project.
PERT's primary purpose or objective is to cut costs and time required to execute a project.

3 0

3 years ago

This project must target a Unix platform and execute properly on our CS1 server.

sweet-ann [11.9K]

Answer:

hope this helps ,if it did pls do consider giving brainliest

Explanation:

// Java program for implementation of FCFS scheduling

import java.text.ParseException;

class GFG {

// Function to find the waiting time for all

// processes

static void findWaitingTime(int processes[], int n,

int bt[], int wt[]) {

// waiting time for first process is 0

wt[0] = 0;

// calculating waiting time

for (int i = 1; i < n; i++) {

wt[i] = bt[i - 1] + wt[i - 1];

}

// Function to calculate turn around time

static void findTurnAroundTime(int processes[], int n,

int bt[], int wt[], int tat[]) {

// calculating turnaround time by adding

// bt[i] + wt[i]

for (int i = 0; i < n; i++) {

tat[i] = bt[i] + wt[i];

}

//Function to calculate average time

static void findavgTime(int processes[], int n, int bt[]) {

int wt[] = new int[n], tat[] = new int[n];

int total_wt = 0, total_tat = 0;

//Function to find waiting time of all processes

findWaitingTime(processes, n, bt, wt);

//Function to find turn around time for all processes

findTurnAroundTime(processes, n, bt, wt, tat);

//Display processes along with all details

System.out.printf("Processes Burst time Waiting"

+" time Turn around time\n");

// Calculate total waiting time and total turn

// around time

for (int i = 0; i < n; i++) {

total_wt = total_wt + wt[i];

total_tat = total_tat + tat[i];

System.out.printf(" %d ", (i + 1));

System.out.printf(" %d ", bt[i]);

System.out.printf(" %d", wt[i]);

System.out.printf(" %d\n", tat[i]);

}

float s = (float)total_wt /(float) n;

int t = total_tat / n;

System.out.printf("Average waiting time = %f", s);

System.out.printf("\n");

System.out.printf("Average turn around time = %d ", t);

}

// Driver code

public static void main(String[] args) throws ParseException {

//process id's

int processes[] = {1, 2, 3};

int n = processes.length;

//Burst time of all processes

int burst_time[] = {10, 5, 8};

findavgTime(processes, n, burst_time);

}

// Java program to implement Shortest Job first with Arrival Time

import java.util.*;

class GFG {

static int[][] mat = new int[10][6];

static void arrangeArrival(int num, int[][] mat) {

for (int i = 0; i < num; i++) {

for (int j = 0; j < num - i - 1; j++) {

if (mat[j][1] > mat[j + 1][1]) {

for (int k = 0; k < 5; k++) {

int temp = mat[j][k];

mat[j][k] = mat[j + 1][k];

mat[j + 1][k] = temp;

}

static void completionTime(int num, int[][] mat) {

int temp, val = -1;

mat[0][3] = mat[0][1] + mat[0][2];

mat[0][5] = mat[0][3] - mat[0][1];

mat[0][4] = mat[0][5] - mat[0][2];

for (int i = 1; i < num; i++) {

temp = mat[i - 1][3];

int low = mat[i][2];

for (int j = i; j < num; j++) {

if (temp >= mat[j][1] && low >= mat[j][2]) {

low = mat[j][2];

val = j;

}

mat[val][3] = temp + mat[val][2];

mat[val][5] = mat[val][3] - mat[val][1];

mat[val][4] = mat[val][5] - mat[val][2];

for (int k = 0; k < 6; k++) {

int tem = mat[val][k];

mat[val][k] = mat[i][k];

mat[i][k] = tem;

}

// Driver Code

public static void main(String[] args) {

int num;

Scanner sc = new Scanner(System.in);

System.out.println("Enter number of Process: ");

num = sc.nextInt();

System.out.println("...Enter the process ID...");

for (int i = 0; i < num; i++) {

System.out.println("...Process " + (i + 1) + "...");

System.out.println("Enter Process Id: ");

mat[i][0] = sc.nextInt();

System.out.println("Enter Arrival Time: ");

mat[i][1] = sc.nextInt();

System.out.println("Enter Burst Time: ");

mat[i][2] = sc.nextInt();

}

System.out.println("Before Arrange...");

System.out.println("Process ID\tArrival Time\tBurst Time");

for (int i = 0; i < num; i++) {

System.out.printf("%d\t\t%d\t\t%d\n",

mat[i][0], mat[i][1], mat[i][2]);

}

arrangeArrival(num, mat);

completionTime(num, mat);

System.out.println("Final Result...");

System.out.println("Process ID\tArrival Time\tBurst" +

" Time\tWaiting Time\tTurnaround Time");

for (int i = 0; i < num; i++) {

System.out.printf("%d\t\t%d\t\t%d\t\t%d\t\t%d\n",

mat[i][0], mat[i][1], mat[i][2], mat[i][4], mat[i][5]);

}

sc.close();

}

7 0

3 years ago

There are 10 red apples and 12 green apples in a basket. If Vinta randomly selects 3 apples from the basket, what is the probabi

denpristay [2]

Answer:

12/22

Explanation:

As there are 22 apples in total and 12 green it is 12/22.

5 0

4 years ago

OBJECTIVE This project will familiarize you with the use of pthreads, pthread mutexes and pthread condition variables. Your prog

zysi [14]

Answer:

Check the explanation

Explanation:

/*

This program will simulate a tunnel with a limit of how many cars may move through it,

and will also simulate the cars going north and south-bound through the tunnel. We will

use pthreads, pthread mutexes, and pthread condition variables to simulate this.

*/

#include <iostream>

#include <fstream>

#include <sstream>

#include <string>

#include <unistd.h>

#include <stdio.h>

#include <stdlib.h>

#include <unistd.h>

#include <pthread.h>

#include <string.h>

#include <signal.h>

#include <sys/types.h>

using namespace std;

#define MAXTHREADS 128

static int maxCarsInTunnel;

static int maxNCarsInTunnel;

static int maxSCarsInTunnel;

static int totalNCars;

static int totalSCars;

static int currentCarsInTunnel;

static int currentNCarsInTunnel;

static int currentSCarsInTunnel;

static int numCarsWaiting;

static pthread_mutex_t lockAccess = PTHREAD_MUTEX_INITIALIZER;

static pthread_cond_t cond = PTHREAD_COND_INITIALIZER;

void *northCar(void *arg);

void *southCar(void *arg);

struct car {

int carNo;

int travelTime;

bool waited;

};

int main() {

pthread_t cartid[MAXTHREADS];

int storage = 0;

cin >> maxCarsInTunnel;

cin >> maxNCarsInTunnel;

cin >> maxSCarsInTunnel;

cout << "Maximum number of cars in the tunnel: " << maxCarsInTunnel << endl;

cout << "Maximum number of northbound cars: " << maxNCarsInTunnel << endl;

cout << "Maximum number of southbound cars: " << maxSCarsInTunnel << endl;

unsigned int arrival_time;

char direction;

unsigned int traversal_time;

struct car argList;

while (cin >> arrival_time >> direction >> traversal_time) {

sleep(arrival_time);

argList.travelTime = traversal_time;

argList.waited = false;

if (direction == 'N') {

totalNCars++;

argList.carNo = totalNCars;

pthread_create(&cartid[storage], NULL, northCar, (void *) &argList);

}

else if (direction == 'S') {

totalSCars++;

argList.carNo = totalSCars;

pthread_create(&cartid[storage], NULL, southCar, (void *) &argList);

}

storage++;

}

for (int i = 0; i < storage; i++) {

pthread_join(cartid[i], NULL);

}

cout << totalNCars << " northbound car(s) crossed the tunnel." << endl;

cout << totalSCars << " southbound car(s) crossed the tunnel." << endl;

cout << numCarsWaiting << " car(s) had to wait." << endl;

return 0;

}

void *northCar(void* arg) {

int tunnelTime;

int carNum;

bool wait;

struct car *argptr;

argptr = (struct car *) arg;

tunnelTime = argptr->travelTime;

carNum = argptr->carNo;

wait = argptr->waited;

pthread_mutex_lock(&lockAccess);

cout << "Northbound car # " << carNum << " arrives at the tunnel." << endl;

while (currentNCarsInTunnel >= maxNCarsInTunnel || currentCarsInTunnel >= maxCarsInTunnel) {

if (wait == false) {

wait = true;

numCarsWaiting++;

}

pthread_cond_wait(&cond, &lockAccess);

}

currentNCarsInTunnel++;

currentCarsInTunnel++;

cout << "Northbound car # " << carNum << " enters the tunnel." << endl;

pthread_cond_signal(&cond);

pthread_mutex_unlock(&lockAccess);

sleep(tunnelTime);

pthread_mutex_lock(&lockAccess);

cout << "Northbound car # " << carNum << " exits the tunnel." << endl;

currentNCarsInTunnel--;

currentCarsInTunnel--;

pthread_cond_broadcast(&cond);

pthread_mutex_unlock(&lockAccess);

}

void *southCar(void* arg) {

int tunnelTime;

int carNum;

bool wait;

struct car *argptr;

argptr = (struct car *) arg;

tunnelTime = argptr->travelTime;

carNum = argptr->carNo;

wait = argptr->waited;

pthread_mutex_lock(&lockAccess);

cout << "Southbound car # " << carNum << " arrives at the tunnel." << endl;

while (currentSCarsInTunnel >= maxSCarsInTunnel || currentCarsInTunnel >= maxCarsInTunnel) {

if (wait == false) {

wait = true;

numCarsWaiting++;

}

pthread_cond_wait(&cond, &lockAccess);

}

currentSCarsInTunnel++;

currentCarsInTunnel++;

cout << "Southbound car # " << carNum << " enters the tunnel." << endl;

pthread_cond_signal(&cond);

pthread_mutex_unlock(&lockAccess);

sleep(tunnelTime);

pthread_mutex_lock(&lockAccess);

cout << "Southbound car # " << carNum << " exits the tunnel." << endl;

currentSCarsInTunnel--;

currentCarsInTunnel--;

pthread_cond_broadcast(&cond);

pthread_mutex_unlock(&lockAccess);

}

Kindly check the attached images below to see the code screenshot and code output.

8 0

4 years ago

Pls Help A table is a_______of rows and columns that provides a structure for presenting data​

Pls Help A table is a_______of rows and columns that provides a structure for presenting data