Answer:
A compiled language is a programming language whose implementations are typically compilers and not interpreters. In this language, once the program is compiled it is expressed in the instructions of the target machine. There are at least two steps to get from source code to execution. While, an interpreted language is a programming language whose implementations execute instructions directly and freely, without previously compiling a program into machine-language instructions. While in this language, the instructions are not directly executed by the target machine. There is only one step to get from source code to execution.
I hope this helps.
Answer:
#include <stdio.h>
#include <ctype.h>
void printHistogram(int counters[]) {
int largest = 0;
int row,i;
for (i = 0; i < 26; i++) {
if (counters[i] > largest) {
largest = counters[i];
}
}
for (row = largest; row > 0; row--) {
for (i = 0; i < 26; i++) {
if (counters[i] >= row) {
putchar(254);
}
else {
putchar(32);
}
putchar(32);
}
putchar('\n');
}
for (i = 0; i < 26; i++) {
putchar('a' + i);
putchar(32);
}
}
int main() {
int counters[26] = { 0 };
int i;
char c;
FILE* f;
fopen_s(&f, "story.txt", "r");
while (!feof(f)) {
c = tolower(fgetc(f));
if (c >= 'a' && c <= 'z') {
counters[c-'a']++;
}
}
for (i = 0; i < 26; i++) {
printf("%c was used %d times.\n", 'a'+i, counters[i]);
}
printf("\nHere is a histogram:\n");
printHistogram(counters);
}
Answer:
The correct answer to the following question will be "It is a discrete random variable".
Explanation:
A variable that assumes algebraic expressions defined by a randomized occurrence result, is a Random variable.
- There are several potential or possible values for a single randomized variable.
- A discrete random variable's chances for each value is between 0 (zero) and 1 (One), as well as the total amount among all possible outcomes, is equitable to 1.
So, a Discrete random variable is the right answer.
Answer: -1 usually represents infinity.
Explanation:
It would keep going forever and not be able to stop without manually stopping it.
Answer:
Iteration
Explanation:
The insertion sort is based on repetition of comparing one data array (or element in a list) with the others at its left to reorganize it, normally following a size criteria (from small to big or the other way around).
At each iteration, the algorithm takes one element and compares it one by one to the others until it fit the specified criteria. Later on, it creates a space, moving the other elements, to insert it. Later, it goes to the next element and the iteration repeats all the way through. It has some advantages over other sorting algorithms because it is easy to deploy and program it in many different languages, but at the same time it can be terribly slow when sorting large amount of data.
