All categories

2 years ago

Which of the following should be clicked to open Backstage View?

Computers and Technology

2 answers:

lora16 [44]2 years ago

7 0

Answer:

File tab

Explanation:

source https://www.computerhope.com/jargon/b/backstage-view.htm

baherus [9]2 years ago

7 0

Answer:

the File Tab

Explanation:

You might be interested in

While in slide show mode, if you are not careful you can close the application by clicking the x on the menu bar

sergejj [24]

When in slide show mode, the menu bar and that "x" are not visible.

5 0

3 years ago

Read 2 more answers

write a 2d array c program that can capture marks of 15 students and display the maximum mark, the sum and average

bekas [8.4K]

Answer:

#include <stdio.h>

int MaxMark(int* arr, int size) {

int maxMark = 0;

if (size > 0) {

maxMark = arr[0];

}

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

if (arr[i] > maxMark) {

maxMark = arr[i];

}

return maxMark;

}

int SumMarks(int* arr, int size) {

int sum = 0;

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

sum += arr[i];

}

return sum;

}

float AvgMark(int* arr, int size) {

int sum = SumMarks(arr, size);

return (float)sum / size;

}

int main()

{

int student0[] = { 7, 5, 6, 9 };

int student1[] = { 3, 7, 7 };

int student2[] = { 2, 8, 6, 1, 6 };

int* marks[] = { student0, student1, student2 };

int nrMarks[] = { 4, 3, 5 };

int nrStudents = sizeof(marks) / sizeof(marks[0]);

for (int student = 0; student < nrStudents; student++) {

printf("Student %d: max=%d, sum=%d, avg=%.1f\n",

student,

MaxMark(marks[student], nrMarks[student]),

SumMarks(marks[student], nrMarks[student]),

AvgMark(marks[student], nrMarks[student]));

}

return 0;

}

Explanation:

Here is an example using a jagged array. Extend it to 15 students yourself. One weak spot is counting the number of marks, you have to keep it in sync with the array size. This is always a problem in C and would better be solved with a more dynamic data structure.

If you need the marks to be float, you can change the types.

3 0

3 years ago

Anyone can help me with this?

dybincka [34]

Answer:

Find Largest and Smallest Number in an Array Example

This Java Example shows how to find largest and smallest number in an

array.

public class FindLargestSmallestNumber {

public static void main(String[] args) {

//array of 10 numbers

int numbers[] = new int[]{32,43,53,54,32,65,63,98,43,23};

//assign first element of an array to largest and smallest

int smallest = numbers[0];

int largetst = numbers[0];

for(int i=1; i< numbers.length; i++)

{

if(numbers[i] > largetst)

largetst = numbers[i];

else if (numbers[i] < smallest)

smallest = numbers[i];

}

System.out.println("Largest Number is : " + largetst);

System.out.println("Smallest Number is : " + smallest);

}

Output of this program would be

Largest Number is : 98

Smallest Number is : 23

Explanation:

5 0

2 years ago

g Points The critical section cannot be executed by more than one process at a time. false true Save Answer Q3.28 Points The cod

Ira Lisetskai [31]

Answer: Hello your question lacks some details attached below is the missing detail

answer :

a) True , B) False C) True D) True

Explanation:

a) True ; The critical section cannot be executed by more than one process at a time

b) False : The code does not satisfy the progress condition, because while loops are same hence no progress

c ) True : The code satisfies the bounded waiting condition, because of the waiting condition of the while loop

d) True : No matter how many times this program is run, it will always produce the same output, this is because of the while loop condition

7 0

3 years ago

Which type of cause and effect organizer would be best for alisha to understand how crude oil becomes gasoline?

sukhopar [10]

The answer is 100% B. Flow chart.

5 0

3 years ago

Read 2 more answers