Answer:
#include<stdio.h>
#include<string.h>
int main() {
int n;
FILE *fp = fopen("salaries.txt", "r");
double sumSalaries = 0;
double quarterlySalary1, quarterlySalary2, quarterlySalary3, quarterlySalary4;
while(!feof(fp)) {
fscanf(fp, "%lf", &quarterlySalary1);
fscanf(fp, "%lf", &quarterlySalary2);
fscanf(fp, "%lf", &quarterlySalary3);
fscanf(fp, "%lf", &quarterlySalary4);
sumSalaries = sumSalaries + quarterlySalary1+quarterlySalary2+quarterlySalary3+quarterlySalary4;
printf("Salary Sum %lf: \n", sumSalaries);
printf("Income Type: ");
if(sumSalaries > 200000 ){
printf("h");
}
else if(sumSalaries >= 15000 && sumSalaries<=200000){
printf("m");
}
else{
printf("l");
}
printf("\n");
}
fclose(fp);
return 0;
}
Explanation:
Solid-state drive (SSD) is the commonly used technology these days for hard drives .It has pretty advantages over hard disk drive(HDD) .
One advantage is ,its speed is unmatchable to HDD and the data is stored in microchips. Unlike HDD,which uses a mechanical arm with a read/write head to move around and read information from the right location on a storage platter ,it collects information directly from microchips .It is simply the oversized version of USB stick .More reliable and sustainable.
Answer:
These all are constructors.
<u>CONS</u>
(CONS A B)
makes a pair like this: (A . B)
In other words, A is the CAR of the pair; B is the CDR of the pair.
For example:
(CONS 4 5) ==> (4 . 5)
(CONS 4 '(5 6)) ==> (4 5 6)
[The pair (4 . (5 6)) is the same thing as (4 5 6)].
<u>APPEND </u>
(APPEND A B)
makes a new list by replacing the final nil in A with the list B. A and
B must be proper lists.
For example:
(APPEND '(4) '(5 6)) ==> (4 5 6)
This takes any amount of number and put in this order
<u>LIST </u>
In this ,it will return a list whose elements are value of arguments in the order as it appeared in the LIST.It can take any amount of parameters
For example,
(LIST 4) ==> (4)
(LIST 4 5) ==> (4 5)
(LIST 4 5 '(6 7)) ==> (4 5 (6 7))
(LIST (+ 5 6)(* 5 6)) ==> (8 9)
No it will actually help it
A unit of information equal to one billion {109} or, strictly 230 bytes
