What is a digital projector? How is it different from computer screen?

Answer:

c. 27

Explanation:

• In recursion method, a method calls itself until a condition becomes true and returned back. In mystery(), at first time, first is 0 and last is 4. Condition is checked and 0!=4 so else part is executed in which again mystery is called with first as 1 and last 4. This will go again and again until first=4.
• When first=4 it is also equal to last so if part is executed and alpha[4] is returned which is 9, now it comes alpha[3] +9 which is 8+9 =17 .
• It is returning values to its previous calls that is why it will reduce to alpha[0]+alpha[1]+alpha[2]+17 which is nothing but sum of all elements of a alpha
• Then, 1+4+5+8+9=27.

Answer:

A. declared

Explanation:

Before a structure can be used, it must be  declared.

For example:

// Structure definition

struct s{

int a;

char b;

};

// Structure instantiation

struct s  mystruct;

// This is where a structure instance called mystruct is created whose

// datatype is struct s.

mystruct.a = 10;

mystruct.b = 'c';

As we can see from the example definition precedes use for the structure.

Answer:

The answer is "O(n2)"

Explanation:

The worst case is the method that requires so many steps if possible with compiled code sized n. It means the case is also the feature, that achieves an average amount of steps in n component entry information.

• In the given code, The total of n integers lists is O(n), which is used in finding complexity.
• Therefore, O(n)+O(n-1)+ .... +O(1)=O(n2) will also be a general complexity throughout the search and deletion of n minimum elements from the list.

Answer:

d.#include deque

Explanation:

We have to include deque library in order to use a deque container and the syntax to include is #include<deque>.Deque is a double ended queue which is a sequence container and allows operations of contraction and expansion on both ends of the queue.Double ended queues are a special case of simple queue since in simple queue the insertion is from rear end and deletion is from front end but in deque insertion and deletion is possible at both ends rear and front.

Answer:

1.Computer Organization is how operational parts of a computer system are linked together. Computer architecture provides functional behavior of computer system. ... Computer organization provides structural relationships between parts of computer system.

2. An ISA, or Individual Savings Account, is a savings account that you never pay any tax on. It does come with one restriction, which is the amount of money you can save or invest in an ISA in a single tax year – also known as your annual ISA allowance.

3. The principle of equivalence of hardware and software states that anything that can be done with software can also be done with hardware and vice versa. This is important in designing the architecture of a computer. There are probably uncountable choices to mix and match hardware with software.

4.Computer systems consist of three components as shown in below image: Central Processing Unit, Input devices and Output devices. Input devices provide data input to processor, which processes data and generates useful information that's displayed to the user through output devices.

5.What is the (approximate) equivalent power of 2? The prefix giga means 109 in the SI (International System of Units) of decimal system. Now convert to binary definition. So, the 1 giga =230 bytes.

Answer:

See explaination

Explanation:

#include <iostream>

#include <string>

#include <stdio.h>

#include <cst dlib>

using namespace st d;

int main(int argc, char *argv[])

{

int airplane[13][6];

char airchar[13][6];

string ticket;

int row[2];

char seat;

//--------------------------------------------

for(int i = 0; i < 13; i++)

{

for(int j = 0; j < 6; j++)

{

airchar[i][j] = '*';

airplane[i][j] = 0;

}

}

//--------------------------------------------

for(;;)

{

cout<<"Rows 1 and 2 are first class (F C)"<<endl;

cout<<"Rows 3 through 7 are business class (B C)"<<endl;

cout<<"Rows 8 through 13 are economy class (E C)"<<endl;

cout<<endl;

cout<<"* - Available"<<endl;

cout<<"X - Occupied"<<endl;

cout<<endl;

cout<<" \t A\t B\t C\t D\t E\t F"<<endl;

cout<<"Row 1\t"<<airchar[0][0]<<"\t"<<airchar[0][1]<<"\t"

<<airchar[0][2]<<"\t"<<airchar[0][3]<<"\t"<<airchar[0][4]<<"\t"

<<airchar[0][5]<<endl;

cout<<"Row 2\t"<<airchar[1][0]<<"\t"<<airchar[1][1]<<"\t"

<<airchar[1][2]<<"\t"<<airchar[1][3]<<"\t"<<airchar[1][4]<<"\t"

<<airchar[1][5]<<endl;

cout<<"Row 3\t"<<airchar[2][0]<<"\t"<<airchar[2][1]<<"\t"

<<airchar[2][2]<<"\t"<<airchar[2][3]<<"\t"<<airchar[2][4]<<"\t"

<<airchar[2][5]<<endl;

cout<<"Row 4\t"<<airchar[3][0]<<"\t"<<airchar[3][1]<<"\t"

<<airchar[3][2]<<"\t"<<airchar[3][3]<<"\t"<<airchar[3][4]<<"\t"

<<airchar[3][5]<<endl;

cout<<"Row 5\t"<<airchar[4][0]<<"\t"<<airchar[4][1]<<"\t"

<<airchar[4][2]<<"\t"<<airchar[4][3]<<"\t"<<airchar[4][4]<<"\t"

<<airchar[4][5]<<endl;

cout<<"Row 6\t"<<airchar[5][0]<<"\t"<<airchar[5][1]<<"\t"

<<airchar[5][2]<<"\t"<<airchar[5][3]<<"\t"<<airchar[5][4]<<"\t"

<<airchar[5][5]<<endl;

cout<<"Row 7\t"<<airchar[6][0]<<"\t"<<airchar[6][1]<<"\t"

<<airchar[6][2]<<"\t"<<airchar[6][3]<<"\t"<<airchar[6][4]<<"\t"

<<airchar[6][5]<<endl;

cout<<"Row 8\t"<<airchar[7][0]<<"\t"<<airchar[7][1]<<"\t"

<<airchar[7][2]<<"\t"<<airchar[7][3]<<"\t"<<airchar[7][4]<<"\t"

<<airchar[7][5]<<endl;

cout<<"Row 9\t"<<airchar[8][0]<<"\t"<<airchar[8][1]<<"\t"

<<airchar[8][2]<<"\t"<<airchar[8][3]<<"\t"<<airchar[8][4]<<"\t"

<<airchar[8][5]<<endl;

cout<<"Row 10\t"<<airchar[9][0]<<"\t"<<airchar[9][1]<<"\t"

<<airchar[9][2]<<"\t"<<airchar[9][3]<<"\t"<<airchar[9][4]<<"\t"

<<airchar[9][5]<<endl;

cout<<"Row 11\t"<<airchar[10][0]<<"\t"<<airchar[10][1]<<"\t"

<<airchar[10][2]<<"\t"<<airchar[10][3]<<"\t"<<airchar[10][4]<<"\t"

<<airchar[10][5]<<endl;

cout<<"Row 12\t"<<airchar[11][0]<<"\t"<<airchar[11][1]<<"\t"

<<airchar[11][2]<<"\t"<<airchar[11][3]<<"\t"<<airchar[11][4]<<"\t"

<<airchar[11][5]<<endl;

cout<<"Row 13\t"<<airchar[12][0]<<"\t"<<airchar[12][1]<<"\t"

<<airchar[12][2]<<"\t"<<airchar[12][3]<<"\t"<<airchar[12][4]<<"\t"

<<airchar[12][5]<<endl;

cout<<endl;

cout<<"Enter Ticket type (F C, B C, or E C): ";

cin>>ticket;

cout<<"Desired Row: ";

cin>>row[0];

cout<<"Desired seat (A,B,C,D,E or F): ";

cin>>seat;

switch(seat)

{

case 'A':

case 'a':

row[0] = row[0] - 1;

row[1] = 1;

row[1] = row[1] - 1;

break;

case 'B':

case 'b':

row[0] = row[0] - 1;

row[1] = 2;

row[1] = row[1] - 1;

break;

case 'C':

case 'c':

row[0] = row[0] - 1;

row[1] = 3;

row[1] = row[1] - 1;

break;

case 'D':

case 'd':

row[0] = row[0] - 1;

row[1] = 4;

row[1] = row[1] - 1;

break;

case 'E':

case 'e':

row[0] = row[0] - 1;

row[1] = 5;

row[1] = row[1] - 1;

break;

case 'F':

case 'f':

row[0] = row[0] - 1;

row[1] = 6;

row[1] = row[1] - 1;

break;

}

if(ticket == "F C")

{

if(row[0]+1 == 1 || row[0]+1 == 2)

{

if(airplane[row[0]][row[1]] == 0)

{

airplane[row[0]][row[1]] = 1;

airchar[row[0]][row[1]] = 'X';

}

else if(airplane[row[0]][row[1]] == 1)

{

cout<<"Message: Seat "<<row[0] + 1<<seat<<" is already occupied"<<endl;

system("Pause");

}

}

else

{

cout<<"Wrong Class"<<endl;

system("Pause");

system("cls");

continue;

}

}

else if(ticket == "B C")

{

if(row[0]+1 == 3 || row[0]+1 == 4 || row[0]+1 == 5

|| row[0]+1 == 6|| row[0]+1 == 7)

{

if(airplane[row[0]][row[1]] == 0)

{

airplane[row[0]][row[1]] = 1;

airchar[row[0]][row[1]] = 'X';

}

else if(airplane[row[0]][row[1]] == 1)

{

cout<<"Message: Seat "<<row[0] + 1<<seat<<" is already occupied"<<endl;

system("Pause");

}

}

else

{

cout<<"Wrong Class"<<endl;

system("Pause");

system("cls");

continue;

}

}

else if(ticket == "E C")

{

if(row[0]+1 == 8 || row[0]+1 == 9 || row[0]+1 == 10

|| row[0]+1 == 11|| row[0]+1 == 12|| row[0]+1 == 13)

{

if(airplane[row[0]][row[1]] == 0)

{

airplane[row[0]][row[1]] = 1;

airchar[row[0]][row[1]] = 'X';

}

else if(airplane[row[0]][row[1]] == 1)

{

cout<<"Message: Seat "<<row[0] + 1<<seat<<" is already occupied"<<endl;

system("Pause");

}

}

else

{

cout<<"Wrong Class"<<endl;

system("Pause");

system("cls");

continue;

}

}

row[0] = 0;

row[1] = 0;

system("cls");

}

return 0;

}