Answer: (1) Oracle VM Server
(2) VM Ware v Sphere
Explanation:
The oracle VM server and the VM ware v Sphere are the two hyper-visors that is used in the IT department by an organization for the purpose of high performance.
- The oracle VM (Virtual machine) server is one of the type of virtual machine that is used to run various types of operating system and oracle VM server is one of the open source technology that support Linux and window.
- The VM ware V sphere is one of the type of visualization based application which basically run the multiple OS based system by using the single machine. It is also helps in balancing the workload in the system.
According to the given question, the two given hyper-visors are used by the information technology department that helps in handling the critical functionality in an organization.
Therefore, The given answer s correct.
Answer:
Originally the word referred to a literal bread board, a polished piece of wood used for slicing bread. In the 1970s the solderless breadboard ( a.k.a. plugboard, a terminal array board) became available and nowadays the term "breadboard" is commonly used to refer to these.
Answer:
- #include <iostream>
- using namespace std;
- int main()
- {
- // declare and initialize popcorn name array
- string popcorn_name[7] = {"plain", "butter", "caramel", "cheese", "chocolate", "turtle", "zebra"};
- // declare and initialize sales array with 7 elements
- int sales[7];
-
- // A loop to prompt user to enter sales for each popcorn
- for(int i=0; i < 7; i++){
- cout<<"Enter number of sales for " + popcorn_name[i] + " :";
- cin>>sales[i];
- }
-
- // Find maximum sales
- int max = sales[0];
- int maxIndex = 0;
- for(int j=1; j < 7; j++){
- if(max < sales[j]){
- max = sales[j];
- maxIndex = j;
- }
- }
-
- // Find minimum sales
- int min = sales[0];
- int minIndex = 0;
- for(int k=1; k < 7; k++){
- if(min > sales[k]){
- min = sales[k];
- minIndex = k;
- }
- }
-
- // Print popcorn name and sales
- for(int l=0; l < 7 ; l++){
- cout<<popcorn_name[l]<<"\n";
- cout<<"Sales: "<< sales[l]<<"\n\n";
- }
-
- // Print popcorn name with maximum and minimum sales
- cout<<"Highest selling: "<< popcorn_name[maxIndex]<<"\n";
- cout<<"Lowest selling: "<<popcorn_name[minIndex]<<"\n";
- return 0;
- }
Explanation:
Create two arrays to hold the list of popcorn name and their sales (Line 5-8). Next prompt user to input the sales for each popcorn (Line 10-14). Get the maximum sales of the popcorn (Line 17-24) and minimum sales (Line 27-34). Print the popcorn name and sales (Line 37-40) and the popcorn name with highest and lowest selling (Line 43-44).
<h2>This function will land up in infinite function call</h2>
Explanation:
first time when the function gets invoked,
f(6,8), so k=6 & n=8, inside the function it checks k==n, ie. 6==8, returns false, then one more if is available, so 6>8 is check for , once again it is false and else loop is executed, the function is called recursively using f(k-n,n), that is f(6-8,8), it means f(-2,8) is passed.
Second time,
if(-2==8) is false, so if(-2>8) is again false and function f(-10, 8) is called
if(-10==8) is false, so if(-10>8) is again false and function f(-18,8) is called
if(-18==8) is false, so if(-18>8) is again false and function f(-26,8) is called
So this goes recursively and ends in an infinite function call.
