Answer:
RAM
Explanation:
RAM or Random Access Memory is a volatile storage memory which means if a power is turned off and turned on again it will be clear, that is why, if we do not save our work and a power failure occurs, our data is lost. It is where all our running programs are located while we are working. There is another memory, which is ROM(Read Only Memory). This is a non-volatile storage and saved work is stored in ROM.
Answer:
This program is written in C++. The explanation of the code is given below in the explanation section.
Explanation:
#include <iostream>
using namespace std;
//factorial calculation
int fact(int n) {
if (n == 0 || n == 1)
return 1;
else
return n * fact(n - 1);
}
int main() {
int n, r, comb; /* n represent number of people (population), r represent the number of selection from population and combination represent number of ways or combination */
cout<<"Enter n : ";// prompt user to enter population i.e. total number of people
cin>>n;//store into n
cout<<"\nEnter r : ";//prompt user to enter number of selection from population
cin>>r;
comb = fact(n) / (fact(r) * fact(n-r));// calcuate combination- number of differnt ways to form a committe
cout << "\nCombination : " << comb; //show the result
return 0;
}
Answer:
give some instructions for iot device
Explanation:
on how to go about something that you would be able to control physically
Answer:
Record:
"Contains information related to a specific person or other entity"
Report:
"Is generated by running a query"
<u>"Can be in the form of a table or a graph"</u>
Querie:
"Is used to retreieve information from a database"
"Can contain filters"
<u>"Appears horizontally in a table"</u>
Explanation:
THE ONES THAT I UNDERLINED ARE THE ONES IM UNSURE ABOUT
Answer:
O( n ) of the 100 element array, where "n" is the item location index.
Explanation:
From the meaning of the word "sequential", the definition of this algorithm should be defined. Sequential donotes a continuously increasing value or event, like numbers, increasing by one in an arithmetic progression.
A list in programming is a mutable data structure that holds data in indexed locations, which can be accessed linearly or randomly. To sequentially access a location in a list, the algorithm starts from the first item and searches to the required indexed location of the search, the big-O notation is O( n ), where n is the index location of the item searched.