Answer:
Here is c program:
#include<stdio.h>
#include<conio.h>
void main()
{
//Variable declaration
//array to hold 6 values you can change this as needed
float nums[6];
//integer i is for loop variable
int i;
//to hold maximum value
float max=0.0;
//clear screen
clrscr();
//iterate 6 times you can change as per your need
for(i=0;i<6;i++)
{
printf("Enter a number:");
scanf("%f",&nums[i]);
//check if entered value is greater than previous value
//if it is greater then assign it
if(nums[i]>max)
max = nums[i];
}
//print the value
printf("The largest number entered was %f",max);
getch();
}
Explanation:
Answer:
Commands: commands are also known as "programs" and the program is a set of rules that performs a specific task which is executed by a computer.
Unix is an operating system. that supports multi-tasking and multi-user functionality. Unix is most widely used in all forms of computing systems such as desktop, laptop, and servers. It provides a Graphical user interface similar to windows.
The Unix operating system there are various commands. The list of five Unix commands can be given as:
1) cal
2) date
3) banner
4) who
5) whoami
1)cal:
The cal command stands for calender. It displays the date.
Syntax:
$ cal
or
$ cal [[month] year]
Example:
$ cal 10 2019
2)date:
The date command stands for date and time. It displays the system date and time.
Syntax:
$date
or
$ date[+format]
Example:
$ date +%d/%m/%y
3) banner
The banner command stands for display the text in to a large size.
Syntax:
$banner message
Example:
$banner Unix
4) who
The who command stands for display the list of users currently logged in.
Syntax:
$who
or
$who [option] … [file][arg1]
Example:
$who
5) whoami
The whoami command stands for display the user id of the currently logged-in user.
Syntax:
$whoami
Example:
$whoami
Explanation:
1)cal command display the current month and year.
2)date command display system date and time.
3)banner command display text in large size.
4)who command display the user name who currently login.
5)whoami command display user id.
Answer:
The GREEDY Algorithm
Explanation:
Based on the situation given in question, the Greedy algorithm shall give the optimal solution to professor
Suppose that the cities are at locations0 =x0< x1< . . . < x
We shall use the induction method to prove that G is the optimal solution valid for numbers less than n
We assume another solution Z which we initially consider to be optimum as well, based on that when Z fills the tank, it fills it to full level
Let us state the values in case of n intervals. Given below, we say that g1 is the first stop and z1 is also the first stop.
This can be written as ;
G=g1, g2, . . . , gk
Z=z1, z2, . . . , zk’
Here k’ <= k and k < n
Let I be an idex where for the first time gi is not equal to zi
Considering t= maxi Zi
Z′=g1, z2, z3, . . . , zk′
Now since z2, z3, . . . , zk′ should be an optimal stopping pattern for the problem otherwise we have chosen Z, with smaller gas filling (not feasible)
Using induction hypothesis we conclude thatg2, . . . , gk is an optimal stopping pattern, which is based on greedy algorithm
The choices are a) credible website B)search log c) Boolean operator d) online database.
The answer is, d. Online database. There are already numerous online digital tools that can aid research. Examples are readcube, mendeley, google scholar. It helps you save and organize researches as well as automatically give bibliographies according to your need like APA and MLA. These tools can hold and save different information that researchers need.
