Answer:
The correct answer is B. Free software.
Explanation:
Free software is a term used for software that the holder can use, copy, read, modify and distribute with or without modification at will. Software that falls under this category includes software that is not protected by copyright laws or software that is licensed to be used in this way.
Motives for developing free software can be technical, economic or social. What is significant for developers is the desire to develop as producers of programs by learning from other producers. The desire to help others is also a major motive.
Use the drop-down menus to select the software term being described. The is what the user interacts with when operating a computer. The is the most important computer software. The is the software located within the hardware.
Answer:
1.) A. application software
2.) C. operating system
3.) B. basic input/output system
Answer:
All of his are correct :)
Explanation:
What is the purpose of a report?
A. To organize data into a table
B. To display data returned from a query in a specially formatted way
C. To design a custom form to create a new table
D. To search for specific information in a table
Answer:
B. To display data returned from a query in a specially formatted way
Write a program that declares a two-dimensional array named myFancyArray of the type double. Initialize the array to the following values: 23 14.12 17 85.99 6.06 13 1100 0 36.36 90.09 3.145 5.4 1. Create a function that will return the sum of all elements in the array. Call this function from main and print out the result. 2. Create a function that will use a nested loop to display all the elements in the array to the screen. Call this function from main.
Answer:
This solution is provided in C++
#include <iostream>
using namespace std;
double sumFancyArray(double myarr[][6]){
double sum = 0.0;
for(int i = 0;i<2;i++) {
for(int j = 0;j<6;j++){
sum+=myarr[i][j];
}}
return sum;
}
void printFancyArray(double myarr[][6]){
for(int i = 0;i<2;i++) {
for(int j = 0;j<6;j++){
cout<<myarr[i][j]<<" ";
}
}
}
int main(){
double myFancyArray[2][6] = {23, 14.12, 17,85.99, 6.06, 13, 1100, 0, 36.36, 90.09, 3.145, 5.4};
cout<<sumFancyArray(myFancyArray)<<endl;
printFancyArray(myFancyArray);
return 0;
}
Explanation:
This function returns the sum of the array elements
double sumFancyArray(double myarr[][6]){
This initializes sum to 0
double sum = 0.0;
This iterates through the row of the array
for(int i = 0;i<2;i++) {
This iterates through the column
for(int j = 0;j<6;j++){
This adds each element
sum+=myarr[i][j];
}}
This returns the sum
return sum;
}
This method prints array elements
void printFancyArray(double myarr[][6]){
This iterates through the row of the array
for(int i = 0;i<2;i++) {
This iterates through the column
for(int j = 0;j<6;j++){
This prints each array element
cout<<myarr[i][j]<<" ";
}
}
}
The main starts here
int main(){
This declares and initializes the array
double myFancyArray[2][6] = {23, 14.12, 17,85.99, 6.06, 13, 1100, 0, 36.36, 90.09, 3.145, 5.4};
This calls the function that returns the sum
cout<<sumFancyArray(myFancyArray)<<endl;
This calls the function that prints the array elements
printFancyArray(myFancyArray);
return 0;
}
When you are ready to print your document, what tab and command should you choose from the menu?
File, Print
File, Open
Home, Print
Home, New
Answer:
File, Print UWU
Explanation:
Answer:
file,print i took the test a while ago
Explanation:
Suppose that we want to enhance the processor used for Web serving. The new processor is 10 times faster on computation in the Web serving application than the original processor. Assuming that the original processor is busy with computation 40% of the time and is waiting for I/O 60% of the time, what is the overall speedup gained by incorporating the enhancement
Answer:
The overall speedup gained by incorporating the enhancement is 1.563
Explanation:
Using Amdahl's Law;
The overall speedup [tex](N) =\dfrac{1}{(1-P) + ( \dfrac{P}{n})}[/tex]
where;
P = Fraction Enhanced for Old Processor
n = speedup enhancement as a result of the new processor
P = 40% = 0.40 and n = 10
∴
The overall speedup (N) is:
[tex]=\dfrac{1}{(1-0.4) + ( \dfrac{0.4}{10})}[/tex]
[tex]=\dfrac{1}{(0.6) + ( 0.04)}[/tex]
[tex]=\dfrac{1}{0.64}[/tex]
= 1.563
Thus, the overall speedup gained by incorporating the enhancement is 1.563
After reading through the code, what will happen when you click run?
Answer:
B.) Laurel will try to collect treasure when there is not any and it causes an error
Explanation:
Laurel is at the top right corner of the map. When you click run, laurel moves 1 step ahead. This spot is right above the coordinate of the very first diamond. There is no treasure at this spot.
Therefore, when the next command calls for collecting, there will be an error, as there is no treasure at the spot right above the first diamond.
what is output? x=-2 y=-3 print (x*y+2)
Answer:
=8
Aaaaaaaaaansjxjdjsaaaaaaa
Explanation:
-2*-3=6+2=8
Write a program that gets a list of integers from a user. First, the user should be asked to enter the number of integers to be stored in a list. Then your program should ask for these integers and store them in the list. Finally, the program should ask the user to enter a sentinel value that will be used to search through the integers in the list which are greater than the sentinel value. For example: If the input is: 7 50 60 140 200 75 100 172 70 the output is: 140 200 75 100 172 The 7 indicates that there are seven integers in the list, namely 50 60 140 200 75 100 172. The 70 indicates that the program should output all integers greater than 70, so the program outputs 140 200 75 100 172. You should use methods in addition to the main method. getListValues to get and store the values from the user printListValuesGreaterThanSentinal to print the values found to be greater than the sentinel value.
Answer:
#include <iostream>
using namespace std;
void insert(int *arr, int num);
int n;
void returnGT(int arr[]);
int main(){
cout<< "Enter the number of integers: "<<endl;
cin>>n;
int num[n];
insert(num, n);
returnGT(num);
}
void insert(int *arr, int num){
for (int i = 0; i < num; i++){
cout<< "Enter item "<< i + 1 << " : ";
cin>> arr[i];
}
}
void returnGT(int arr[]){
int sentinel;
cout<< "Enter sentinel: ";
cin>> sentinel;
for (int i = 0; i < n; i++){
if (arr[i] > sentinel){
cout<< arr[i] << " ";
}
}
}
Explanation:
The C++ source code defines an array of integer values, the program prompts for user input for the array size and the sentinel value to fill the array with input values and output integer values greater than the sentinel.
help me please .
and thank you ..
Explanation:
y'+2y = 5-e^(-4x), y(0)=-11
Use Euler's Method with a step size of h = 0.1 to find approximate values of the solution as x= 0.1, 0.2, 0.3, 0.4, and 0.5. Compare them to the exact values of the solution at these points.
Answer:
see attached
Explanation:
A differential equation solver says the exact solution is ...
y = 5/2 -14e^(-2x) +1/2e^(-4x)
The y-values computed by Euler's method will be ...
y = ∆x·y' = 0.1(5 - e^(-4x) -2y)
The attached table performs these computations and compares the result. The "difference" is the approximate value minus the exact value. (When the step size is decreased by a factor of 10, the difference over the same interval is decreased by about that same factor.)
Create a program that will output the sum of the prime numbers ( 2 - 100). A prime number is a number greater than 1 that cannot be formed by multiplying two smaller natural numbers. some prime numbers are: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37... Example: Find the total sum of prime numbers from 1 - 100 The total sum is 1060. Verify your answers.
Answer:
The attached file is a C program that does much of what you want. It does not output the the sum of the primes, but lists the primes. The output is simple enough to change. This program builds quite easily with GCC.
I don't know what language you're using, so I'm just providing a piece of code I've written that might help you out.
Also:
There are a few tricks in searching for prime numbers. Here are some that I always like to take into account.
1) With the exception of 2 and 3, all primes are one away from a multiple of six
2) When testing a number for divisibility, you only have to test up as far as its square root.
3) You don't need to test for divisibility by composite numbers. Only prime factors are needed. Any composite numbers smaller than x will be multiples of primes smaller than x.
So you can very rapidly find primes with a loop that starts at 6, and goes up to whatever limit you want, incrementing by 6. Let's call the number of that loop x. You then only have to test if the x - 1 is prime and if x + 1 is prime. That eliminates 2/3 of the iterations needed. Also, when you find primes, put them in an array. I would start by creating an array with the numbers 2 and 3 already in it (those being the only two primes that are not adjacent to a multiple of six). Then each number tested only needs to be checked for divisibility by numbers in that array that are less than or equal to the square root of the number being tested. If the number is composite, then it is only divisible by something larger than its square root if it is also divisible by something smaller than its square root.
With all of this big blurb written, and some hard-to-read C code attached, if you're just looking to write something quick to do your homework, and don't care about it being efficient, you can just do something like this javascript style example:
var n, tally = 0, list = [], isPrime;
for(n = 2; n < 100; n++){
isPrime = 1;
for(m = 0; m < list.length && list[m] <= Math.sqrt(n) && isPrime; m++){
if(n % list[m] == 0) isPrime = 0;
}
if(isPrime){
list[list.length] = n;
tally += n;
}
}
console.log('sum of primes: ' + tally);
I haven't run that code, so do watch out for any errors I missed. Good luck!
Consider the following declaration: (1, 2) double currentBalance[91]; In this declaration, identify the following: a. The array name b. The array size Copyright 2018 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. WCN 02-200-203 8 Exercises | 593 c. The data type of each array component d. The range of values for the index of the array e. What are the indices of the first, middle, and the last elements
Answer:
Following are the solution to the given choices:
Explanation:
Given:
double currentBalance[91];//defining a double array
In point a:
The name of the array is= currentBalance.
In point b:
91 double values could be saved in the array. It requires 8bytes to hold a double that if the array size is 91*8 = 728
In point c:
Each element's data type is double.
In point d:
The array index range of values is between 0 and 90 (every array index starts from 0 and ends in N-1, here N=91).
In point e:
To access first element use currentBalance[0], for middle currentBalance[91/2] , for last currentBalance[90]
write a technical term for following statements
1.The method applied to increase the life of computer and its assets.
2.The power regulating device this supplies constant power to the computer from its backup system.
3.The software used to scan, locate and detect the disk for viruses.
Answer:
1. Hardware Maintenance
2. Uninterrupted Power Supply (UPS)
3. Antivirus software
Explanation:
Antivirus software, or Anti-virus software (also known as AV software), otherwise called anti malware, is a PC program used to forestall, distinguish, and eliminate malware.
Antivirus software was initially evolved to identify and eliminate PC infections, thus the name. Be that as it may, with the expansion of different sorts of malware, antivirus software began to give security from other PC dangers. Specifically, current antivirus software can shield clients from: noxious program criminals.
A few items additionally incorporate security from other PC dangers, for example, tainted and noxious URLs, spam, trick and phishing assaults, online identity (privacy), web based financial assaults, social engineering techniques, advanced persistent threat (APT).
You have been asked to write a program that involves animals. Some animals are herbivores. Within this program, any animal that is not a herbivore is a carnivore. Which set of class definitions is most appropriate for this program
Incomplete question. The options:
class Animal :
class Herbivore(Animal):
class Carnivore(Herbivore) :
class Animal (Herbivore, Carnivore) :
class Herbivore :
class Carnivore
class Animal
class Herbivore (Animal) :
class Carnivore (Animal) :
class Animal:
class Carnivore (Animal) :
class Herbivore (Carnivore) :
Answer:
class Animal
class Herbivore (Animal) :
class Carnivore (Animal) :
The part of the operating system that
manages (part of the memory
hierarchy is called the
a.)memory disk
b.)memory space
c.)memory manager
d.)address table
Answer:
C.
Explanation:
Memory Management can be defined as a management process in computer science which helps in managing and controlling computer memory. This process also allocates blocks to several programs running in order to improve overall system. Memory management is located in hardware, OS, and applications.
This program also assits OS by providing additional assisstance such as it helps to remove unused data of memory, etc. Some examples of memory manager are cacheman, WinRam, etc.
Therefore, option C is correct.
(20 points). Some matrixes have very special patterns, for example, in the following matrix, the numbers in the first row are equal to the number of their respective column; the numbers in the first column are equal to the square of the number of their respective row; when the row number equals to the column number, the elements are equal to 1; the rest elements are the sum of the element just above them and the one to their left. Write a user-defined function program in the program, you need to use while loops), and then use the function you write to create the following matrix (show the command you use). 1 4 9 16 2 1 10 26 3 4 1 27 4 5 8 13 9 22 1 23
Answer:
#include <iostream>
using namespace std;
void matrix(){
int row = 5, col = 6;
int myarr[row][col];
for (int i = 0; i < 5; i++){
for (int x = 0; x < 6; x++){
if (i == 0){
myarr[i][x] = (x+1)*(x+1);
}else if ( x == 0){
myarr[i][x] = (i+1)*(i+1)*(i+1);
} else if ( i == x){
myarr[i][x] = (i+1);
} else{
myarr[i][x] = myarr[i-1][x] + myarr[i][x-1];
}
}
}
for (int i = 0; i < 5; i++){
for (int x = 0; x < 6; x++){
cout<< myarr[i][x] << " ";
}
cout<< "\n";
}
}
int main(){
matrix();
}
Explanation:
The C++ source code defines a two-dimensional array that has a fixed row and column length. The array is a local variable of the function "matrix" and the void function is called in the main program to output the items of the array.
How is DHTML different than semantic HTML?
Answer choices:
A group of web-related technologies.
Uses HTML tags to indicate the role a piece of text plays.
Creates websites with interactivity and animations.
Creates websites that adapt to different screen sizes.
Answer:
DHTML -> "A Group of web related technologys" and "creates websites with interactivity and animations"
HTML -> "creates websites that adapt to different screen sizes" and "uses HTML tags to indicate the rolea piece of text plays"
Which of the following can help organize your email messages? Select all that apply.
A. flagging actionable emails
B. adding folders for specific projects
C. filtering out spam or newsletters
D. marking all emails as unread
Answer: A and B
Explanation: I took the test and got it right
The steps which can help organize your email messages are:
B. Adding folders for specific projects C. Filtering out spam or newslettersAccording to the given question, we are asked to show the proper steps which a user can take in order to organize his email messages.
As a result of this, we can see that the steps which can help a user to organize his email messages are to add folders for specific projects so that he can easily access them and to filter out spam or newsletters from important mail.
Therefore, the correct answers are options B and C
Read more here:
https://brainly.com/question/2594338
long-term memory used by the computer:
Which of the following is true about binary search. A. It uses binary numbers in its algorithm B. It is slower than sequential search C. It can be implemented using a recursive algorithm D. It does works for both sorted and unsorted arrays. E. None of the above.
Answer:
A. It uses binary numbers in its algorithm
Explanation:
A Binary search is a type of algorithm designed to look through only a sorted array of data for a particular item.
It is more efficient (faster) than sequential search since the algorithm doesn't have to look up the entire array of data, but simply repeatedly divide in half the section of the array that could contain the searched item.
what command in cisco IOS allows the user to see the routing table
Answer:
show ip route [[ipAddress [mask]] [bgp | connected | mpls [ipAddress] [ipAddress/PrefLen] [ipAddress mask] [detail] | isis | ospf | static | summary | multicast |unicast]
Explanation:
the show ip route command will show the entire ip route table. If you put in no arguments it will display them all.
Identify the data model used in each scenario.
A database of contestants in a dog show where each dog, owner, and competition is identified by a primary key
A database that stores detailed information on the taxonomy of living things found in a geographical area, including the categories of kingdom, phylum, class, order, family, genus, and species
A database used to catalog types of architecture, geographical features, and sociological characteristics in various parts of the world
A database used to cross-reference actors who have performed in various movies with directors, writers, and other support staff for those movies
Answer:
Relational databaseObject-oriented databaseHierarchical databaseNetwork databaseExplanation:
The relational database has always been recognized or identified as well as using the primary key. The object database would be where the documentation has always been displayed as such an object. This same hierarchical database would be a type of database these have links to something else with either a connection. Network database does indeed have a cross-reference where this component should be pass to some other.The cost of a postsecondary education increases with the length of time involved in the program.
True
False
False it stays the same hope this helps :)
Requests to retrieve data written in a language such as SQL are called…
A. Data
B.queries
Add a clause for identifying the sibling relationship. The predicate on the left handside of the rule should be sibling(X, Y), such that sibling(alice, edward) should be true, and X, Y do not need to be different.
Answer:
following are the solution to this question:
Explanation:
For Siblings (X,Y);
Alice(X),
Edward(Y),
parent(Edward,Victoria,Albert) //Albert is the father F
parent(Alice,Victoria,Albert) //Victoria is the Mother M
Therefore,
X is siblings of Y when;
X is the mother M and father is F, and Y is the same mother and father as X does, and satisfing the given condition.
It can be written as the following prolog rule:
Siblings_of(X,Y):
parents(X,M,F)
parents(Y,M,F)
Siblings_of(X,Y): parents(X,M,F), parents(Y,M,F)
|? - sibling_of(alice,edward).
yes
|? - Sibling_of(alice,X).
X=Edward
|? - Sibling_of(alice,alice).
yes
Topic: Pseudo-codes
Example 5
A shop sells books, maps and magazines. Each item is identified by a unique 4 –
digit code. All books have a code starting with a 1, all maps have a code starting
with a 2 and all magazines have a code beginning with a 3. The code 9999 is used
to end the program.
Write an algorithm using pseudocode which input the codes for all items in stock
and outputs the number of books, maps and magazine in stock. Include any
validation checks necessary.
(NOTE: A 4-digit code implies all books have a code lying between 1000 and
1999, all maps have a code lying between 2000 and 2999 and all magazines a code
lying between 3000 and 3999. Anything outside this range is an error)
Answer:
//program_start
//variable_inicialization
books = 0
maps = 0
magazines = 0
//End variable_inicialization
//operation_selection_routine
display "Select operation: (I) for input item to stock, (O) for output items in stock
operation = read_keyboard_input
IF (operation = "I")
goto input_routine
ELSE IF (operation = "O")
goto output_routine
ELSE
display "Incorrect option, try again"
goto operation_selection_routine
ENDIF
//End operation_selection_routine
//input_routine
display "Insert item code to add to stock"
input_code = read_keyboard_input
IF (input_code >= 1000 & input_code < 2000)
IF (input_code NOT duplicated_in_stock)
add_to_stock (input_code)
books = books + 1
display "Book added"
ELSE
display "Item Code is already present in stock"
ENDIF
ELSE IF (input_code >= 2000 & input_code < 3000)
IF (input_code NOT duplicated_in_stock)
add_to_stock (input_code)
maps = maps + 1
display "Map added"
ELSE
display "Item Code is already present in stock"
ENDIF
ELSE IF (input_code >= 3000 & input_code < 4000)
IF (input_code NOT duplicated_in_stock)
add_to_stock (input_code)
magazines = magazines + 1
display "Magazine added"
ELSE
display "Item Code is already present in stock"
ENDIF
ELSE IF (input_code = 9999)
goto program_end
ELSE
display "Incorrect option, try again"
goto input_routine
ENDIF
goto operation_selection_routine
//End input_routine
//output_routine
display "Items in stock"
display "Number of books: " + books
display "Number of maps: " + maps
display "Number of magazines: " + magazines
goto operation_selection_routine
//End output_routine
//program_end
display "Terminating stock program"
stop_program
Explanation:
Pseudo code is a way to design an algorithm using normal words and terms, that are not specific to any programming language. It is easier to understand how the program works and once finished, can be translated to the desired programming language.
This algorithm uses 5 blocks of code:
*variable_inicialization, where item counters are initially set to zero.
*operation_selection_routine, where the program request user input to select if the user will add an item or show existing items in stock. If an incorrect option is given, it will repeat this same routine.
*input_routine, the program will request the four digit code to add, and will check if it is not already present (to avoid duplicated items), and if the item code belongs to a book, map or magazine, increasing the corresponding item counter. Also, if the code is 9999 it will go to the program_end routine, otherwise it will display an error message and request a new item code. After a valid item code it will return to the operation_selection_routine.
*output_routine, it will display on screen the number of items for each category. Then, returns to the operation_selection_routine.
*program_end, it will simply display a goodbye message and terminate the program.
Write two public static methods in the U6_L4_Activity_Two class. The first should have the signature swap(int[] arr, int i, int j) and return type void. This method should swap the values at the indices i and j of the array arr (precondition: i and j are both valid indices for arr). The second method should have the signature allSwap(int[] arr) and return type void. The precondition for this method is that arr has an even length. The method should swap the values of all adjacent pairs of elements in the array, so that for example the array {3, 5, 2, 1, 8, 10} becomes {5, 3, 1, 2, 10, 8} after this method is called.
Answer:
public static void swap(int[] arr, int i, int j) {
if(i >=0 && i <=arr.length-1 && j >=0 && j<=arr.length-1){
int hold = arr[i];
arr[i] = arr[j];
arr[j] = hold;
}
}
public static void allSwap(int[] arr) {
if (arr.length % 2 == 0){
for(int i=0; i<arr.length; i+=2){
int hold = arr[i+1];
arr[i+1] = arr[i];
arr[i] = hold;
}
} else{
System.out.println("array length is not even.");
}
}
Explanation:
The two functions, swap and allSwap are defined methods in a class. The latter swaps the item values at the specified index in an array while the second accepts an array of even length and swap the adjacent values.
Write a java program to read an array of positive numbers. The program should find the difference between the alternate numbers in the array and find the index position of the smallest element with largest difference. If more than one pair has the same largest difference consider the first occurrence.
Answer:
int s;
int[] num= new int[s];
Scanner sc = new Scanner(System.in);
System.out.printIn("Enter array size");
size = sc.nextInt();
for (i = 0; i < s; i++){
num[i] = sc.nextInt();
}
int[] difference;
int count = 0;
for (i = 0; i < num.length(); i= i + 2){
if (num[i] > num[i+1]){
difference[count] = num[i] -num[i+1];
}else{
difference = num[i+1] - num[i];
}
}
int max = 0;
for (int i : difference) {
if ( i > max){
max = i;
}
}
int result = Arrays.stream(difference).boxed().collect(Collectors.toList().indexOf(max);
System.out.printIn(result);
Explanation:
The Java source code uses procedural method to execute a task. The program prompts for user inputs for the array size and the items in the array. Assuming the array has an even length, the adjacent items of the array are subtracted and stored in another array called difference. The index of the maximum value of the difference array is printed on screen.
What reforms were made by the British government in India after the war of independence? write any three
PLEASE I NEED HELP AS FAST AS YOU CAN
Answer:
1. Indian Council Act
2. Morely-Minto Reforms
3. Rowlatt Act
Explanation:
Following the unsuccessful war of independence in Indian often referred to as the Indian Rebellion of 1857. There were various reforms established by the British government before the actual independence of India in 1947. Some of the reforms include:
1. Indian Council Act: this was established in 1861 under the regime of Lord Canning. The purpose is to contemplate an association of Indians with the administration at a higher level.
2. Morely-Minto Reforms: this was established in 1909 under the reign of Lord Minto II. The purpose is to Separate electorates to widen the gulf between Hindús and Muslims.
3. Rowlatt Act: this was established in 1919 under the administration of L. Chelmsford. These reforms favor the extraordinary powers given to suppress the freedom struggle with General Dyer as the Commandant.
Write a C++ program that tests whether the array has four consecutive numbers with the same values. bool isConsecutive(int values[], int size) In the main() program you should prompt the user to enter a series of integers and display if the series contains four consecutive numbers with the same value. Your program should first prompt the user for the number of integers in the list or number of values in the series. Assume the maximum array size is 20. No global variables may be used Use a function prototype for said function The function can not do any cin or cout The main() function will do all the cin and cout You may assume the list contains positive integers only Sample runs (bolded text is output) : Enter the number of values: 6 Enter a value: 3 Enter a value: 4 Enter a value: 5 Enter a value: 5 Enter a value: 5 Enter a value: 5 The list has consecutive four numbers! Enter the number of values: 9 Enter a value: 3 Enter a value: 4 Enter a value: 5 Enter a value: 50 Enter a value: 5 Enter a value: 6 Enter a value: 5 Enter a value: 5 Enter a value: 6 The list has no consecutive fours numbers!
Answer:
#include <iostream>
using namespace std;
bool isConsecutive(int values[], int size){
bool r = false;
int count=0;
for(int i=0;i<size;i++){
if(values[i]==values[i+1]){
count++;
if(count==3)
r=true;
}
else{
count=0;
}
}
return r;
}
int main() {
// Write C++ code here
int size;
cout<<"enter the number of integer in list"<<endl;
cin>>size;
int arr[size];
for(int i=0;i<size;i++){
cout<<"enter the value of number"<<endl;
cin>>arr[i];
}
bool result= isConsecutive(arr,size);
if(result){
cout<<"The list has consecutive fours numbers!"<<endl;
}
else{
cout<<"The list has no consecutive fours numbers!"<<endl;
}
return 0;
}
Explanation:
Above program is written in C++ language.
All bold-faced words and letters are C++ keywords.