Answer:
160 pages
Explanation:
Required
The number of pages
Let the number of pages be x.
So, on day 1; we have:
After day 1, there are: left ----------------- i.e x - 1/4x
On day 2, we have:
At this point, we have:
---- pages left
The summation of all must equal x, the book pages
Simplify the left-hand side
Collect like terms
Simplify
Multiply by 2
Answer:
35, 25, 50, 75, 95
Explanation:
List of five track numbers that will cause all three algorithms to visit the same tracks in the same order are -
35
25
50
75
95
Please go to attachment for the diagram how these 5 tracks will be traversed by various algorithms.
All the algorithms traverse in the order 35 -> 25 -> 50 -> 75 -> 95
Answer:
Check the explanation
Explanation:
#// do comment if any problem arises
//code
#include <stdio.h>
#include <ctype.h>
#include <string.h>
#include <stdlib.h>
void read(FILE *input, char array[10][61])
{
// read all 10 strings
for (int i = 0; i < 10; i++)
fgets(array[i], 60, input);
}
void remove_newline(char array[10][61])
{
for (int i = 0; i < 10; i++)
{
array[i][strlen(array[i]) - 1] = '\0';
}
}
void smallest(char array[10][61])
{
int s = 0;
for (int i = 1; i < 10; i++)
{
if (strlen(array[s]) > strlen(array[i]))
s = i;
}
printf("\nSmallest strnig: %s\n", array[s]);
}
void upper(char array[10][61])
{
for (int i = 0; i < 10; i++)
{
int n = strlen(array[i]);
for (int j = 0; j < n; j++)
{
array[i][j] = toupper(array[i][j]);
}
}
}
int main()
{
char filename[30];
// array of 10 strings
char array[10][61];
printf("Enter filename: ");
gets(filename);
// open file
FILE *input = fopen(filename, "r");
// read into array
read(input, array);
// close file
fclose(input);
// remove newline
remove_newline(array);
printf("Contents of file:\n");
for (int i = 0; i < 10; i++)
printf("%s\n", array[i]);
// print smallest string
smallest(array);
// uppercase
upper(array);
// print again
printf("\nContents of file after converting to uppercase:\n");
for (int i = 0; i < 10; i++)
printf("%s\n", array[i]);
}
kindly check the attached image below to see the Output:
