QUESTION 4 PRACTICAL EXERSIZE
create a list of the types of computers and write a key characteristic down for each of them. For example LAPTOP- portable computer. ​

Answer:

Are you talking about the bruce willis is superman basically? Because if so i don't think so because that is a future event that hasn't happened yet also that film sucks.

Explanation:

Answer:

The object creation should be Arcade myArc("Games Ablaze",5);

Explanation:

Required

Why does the program generate an error?

The class definition is correctly defined and implemented;

The methods in the class are also correctly defined and implemented.

The error in the program is from the main method i.e.

int main() {  

       Arcade myArc('ames Ablaze, 5);  

       myArc.Print();  

   }

In the class definition;

Variable name was declared as string and variable rating was declared as integer

This means that, a string variable or value must be passed to name and an integer value or variable to rating.

Having said that:

Arcade myArc(Games Ablaze, 5); passes Games Ablaze as a variable to th function.

Game Ablaze is an incorrect string declaration in C++ because of the space in between Game and Ablaze

Also, no value has been assigned to the variable (assume the variable definition is correct).

This will definitely raise an error.

To correct the error, rewrite the object creation as:

Arcade myArc("Games Ablaze",5); where "Game Ablaze" is passed as string

Answer:

false

Explanation:

function should contain more codes

Need a better discription of the question to finalize an answer.

Answer:

Here the answer is given as follows,

Explanation:  

The real-life situation of a deadlock resolution where a role is played by the victim is given as follows:  

Example: An example of such a situation are often a one-way lane where the flow of traffic is merely in a method. Thus, on just one occasion, the flow of traffic can enter one direction only. Each entrance/exit gate is often considered a resource. during this case, if two cars are coming from both the entrances and that they are often considered as two tasks, then one among the cars must copy or we will say hand over its resource in order that the opposite car gets the prospect to first cross the lane or we will say the opposite task gets executed.  

 a)  Victim: The steps which describe how a victim is chosen are given as follows :  

   The task which is terminated so as to interrupt things of deadlock is taken into account because of the victim.

There are often a variety of job pools that will be under a deadlock situation and therefore the victim is usually a low-priority task in order that the performance isn't affected that much and termination of this task doesn't cause any effect on the opposite jobs.

the main positive effect of selecting and terminating a victim is that things of deadlock are resolved and every one of the tasks can execute now.

The negative effect is that the task that's chosen because the victim is terminated and is executed at the previous. This whole process for choosing a victim then terminating it then restarting it again may consume some longer also.

b)  An easy deadlock priority is often set. this suggests that the victim’s task or the task is often terminated so as to interrupt the deadlock and other jobs can finish executing. After this, the task which is terminated are often later restarted and every one of the tasks can then execute without a deadlock.

 c) When employment gets terminated, the knowledge associated with it's stored. Are often This is often done in order that the work can be restarted again and therefore the information in it's not lost. Since the progress of the victim is stopped. Thus, the sole thanks to complete the victim’s task would be to start out it again. But before restarting the task, this must be considered that the victim’s task doesn't cause any deadlock within the system.  

Answer:

Perimeter:

{ \tt{perimeter = 2(l + w)}}

Circumference:

{ \tt{circumference = 2\pi \: r}}

Just input the codes in the notepad

Answer:

d. d1− = 10, d1+ = 0

Explanation:

Given

3X1 + 4X2 +d1− − d1+ = 36

X1 = 6

X2 = 2

Required

Possible values of d1- and d1+

We have:

3X1 + 4X2 +d1− − d1+ = 36

Substitute values for X1 and X2

3 *6 + 4 * 2 + d1- - d1+ = 36

18 + 8 + d1- - d1+ = 36

Collect like terms

d1- - d1+ = 36 - 18 - 8

d1- - d1+ = 10

For the above equation to be true, the following inequality must be true

d1- > d1+

Hence,

(d) is correct

Because:

10 > 0

Answer:

The internet allows you to connect with people and information around the world. The internet is more broad and could include searching things up or message-based websites. Emails is more specific, with it being when you send someone a message (called an email) on a mail website (that allows you to get messages from other people, websites, etc.)

Explanation:

In my answer.

Answer and Explanation:

Deadlock occurs when two operating systems on the same computer are hindering each other's execution, getting blocked, waiting for each one to run first. This can happen when a preemption has not occurred, when a mutual exclusion has occurred, or when one of the systems causes the other to not execute.

File manager is software that allows a computer user to create directories and organize files inside and outside of them.

Process is the term used to determine the functioning of computer software. When a software is started, it uses its own programming code to perform a specific activity.

Multiprogramming is the term used for the moment when an operating system allows the user to run more than one software at the same time. For this to happen, the computer needs to have a high processing capacity, to handle the effort of running several software simultaneously.

Software Classification is the process that determines the composition and different aspects that make up a software. In this way, it is possible to understand the usefulness and programming of this software.

Virtual memory is the use of secondary memory for caching. This allows the user to share files more securely and quickly, in addition to alleviating the problems that limited memory presents.

Answer:

The responsibilities you have are Use characters other than just AZ. If passwords are chosen from the letters AZ, there are only 26 possibilities for each character. Adding digits expands the number of possibilities to 36. Using both uppercase and lowercase letters plus digits expands the number of possible characters to 62

Explanation:

Hoped this helped you :3

Answer:

The program in C++ is as follows:

#include <bits/stdc++.h>

using namespace std;

int main(){

string sentence,word="";

getline (cin, sentence);

vector<string> for_reverse;

for (int i = 0; i < sentence.length(); i++){

 if (sentence[i] == ' ')  {

  for_reverse.push_back(word);

  word = "";  }

 else{    word += sentence[i];}  }

for_reverse.push_back(word);

sentence="";

for (int i = for_reverse.size() - 1; i > 0; i--){

 sentence+=for_reverse[i]+" ";}

sentence+=for_reverse[0];

cout<<sentence<<endl;

return 0;

}

Explanation:

This declares sentence and word as strings; word is then initialized to an empty string

string sentence,word="";

This gets input for sentence

getline (cin, sentence);

This creates a string vector to reverse the input sentence

vector<string> for_reverse;

This iterates through the sentence

for (int i = 0; i < sentence.length(); i++){

This pushes each word of the sentence to the vector when space is encountered

 if (sentence[i] == ' ')  {

  for_reverse.push_back(word);

Initialize word to empty string

  word = "";  }

If the encountered character is not a blank space, the character is added to the current word

 else{    word += sentence[i];}  }

This pushes the last word to the vector

for_reverse.push_back(word);  

This initializes sentence to an empty string

sentence="";

This iterates through the vector

for (int i = for_reverse.size() - 1; i > 0; i--){

This generates the reversed sentence

 sentence+=for_reverse[i]+" ";}

This adds the first word to the end of the sentence

sentence+=for_reverse[0];

Print the sentence

cout<<sentence<<endl;

Answer:

travel

Explanation:

One real world example of a singly-linked list would be travel. Imagine that you want to take a trip to your nearest neighbor state. To do so you would need to take a 2 buses and a train, but you can't just take any or in any order you wish. You first need to take the first bus at your current location, get off at the train station, take that train to the final stop, get off and take the bus to the final destination. Meaning there is a sequence of connected events that you must follow in order to get to your destination and the same opposite sequence of events to get back. This is exactly like a singly-linked list.

Answer:

d. The system of water spray pipes did not have sufficient water supply

Explanation:

The Union Carbide India Ltd. was chemical factory situated at Bhopal that produces various pesticides, batteries, plastics, welding equipment, etc. The plant in Bhopal produces pesticides. In the year 1984, on the night of 2nd December, a devastating disaster occurred on the Bhopal plant which killed millions of people due to the leakage of the poisonous, methyl isocyanate. This disaster is known as Bhopal Gas tragedy.

Soon after the gas pipe exploded, the fire brigade started spraying water into the air to [tex]\text{knock down}[/tex] the cloud of the gases in the air but there was not sufficient amount of water in the water sprays and so it was not effective.

Thus the correct answer is option (d).

Answer:

The right answer is "Hardware crash".

Explanation:

Thus the above is the right solution.

Answer:

(i) C is increased (S, B same)

Explanation:

Cache are items which are stored in the computer at a hidden place. These are sometimes unwanted and they may hinder the speed and performance of the device. They exist to bridge speed gap.

Answer:

2 is the ans

Explanation:

bye bye, gonna go to studyy

[tex]\sf\purple{Collaborative \:consumption}[/tex] is joining together as a group to use a specific product more efficiently.

[tex]\bold{ \green{ \star{ \orange{Hope\:it\:helps.}}}}⋆[/tex]

Answer:

SELECT TripName

FROM AllTrips

WHERE Trip NOT LIKE ‘NH%'

Explanation:

Required

Fill in the blanks

The table name is not stated; so, I assumed the table name to be AllTrips.

The explanation is as follows:

This select the records in the TripName column

SELECT TripName

This specifies the table where the record is being selected

FROM AllTrips

This states the fetch condition

WHERE Trip NOT LIKE ‘NH%'

Note that:

So, the clause NOT LIKE 'NH%' will return records that do not begin with NH

Answer:

The pseudo-code describes steps in an algorithm or another system in plain language. Pseudo-Code is often designed for human reading rather than machine reading with structural conventions of a normal language of programming.

Natural languages consist of phrases, usually declarative phrases, with a sequence of information.

Explanation:

1 Account

2 online

3 access

4 password

5 internet

6 email

Answer:

a) P(B,A,B), P(x,y,z)

=> P(B,A,B) , P(B,A,B}  

Hence, most general unifier = {x/B , y/A , z/B }.

b. P(x,x), Q(A,A)  

No mgu exists for this expression as any substitution will not make P(x,x), Q(A, A) equal as one function is of P and the other is of Q.

c. Older(Father(y),y), Older(Father(x),John)

Thus , mgu ={ y/x , x/John }.

d) Q(G(y,z),G(z,y)), Q(G(x,x),G(A,B))

=> Q(G(x,x),G(x,x)), Q(G(x,x),G(A,B))  

This is not unifiable as x cannot be bound for both A and B.

e) P(f(x), x, g(x)), P(f(y), A, z)    

=> P(f(A), A, g(A)), P(f(A), A, g(A))  

Thus , mgu = {x/y, z/y , y/A }.

Explanation:  

Unification: Any substitution that makes two expressions equal is called a unifier.  

a) P(B,A,B), P(x,y,z)  

Use { x/B}  

=> P(B,A,B) , P(B,y,z)  

Now use {y/A}  

=> P(B,A,B) , P(B,A,z)  

Now, use {z/B}  

=> P(B,A,B) , P(B,A,B}  

Hence, most general unifier = {x/B , y/A , z/B }  

b. P(x,x), Q(A,A)  

No mgu exists for this expression as any substitution will not make P(x,x), Q(A, A) equal as one function is of P and the other is of Q  

c. Older(Father(y),y), Older(Father(x),John)  

Use {y/x}  

=> Older(Father(x),x), Older(Father(x),John)  

Now use { x/John }  

=> Older(Father(John), John), Older(Father(John), John)  

Thus , mgu ={ y/x , x/John }  

d) Q(G(y,z),G(z,y)), Q(G(x,x),G(A,B))  

Use { y/x }  

=> Q(G(x,z),G(z,x)), Q(G(x,x),G(A,B))

Use {z/x}  

=> Q(G(x,x),G(x,x)), Q(G(x,x),G(A,B))  

This is not unifiable as x cannot be bound for both A and B  

e) P(f(x), x, g(x)), P(f(y), A, z)  

Use {x/y}  

=> P(f(y), y, g(y)), P(f(y), A, z)  

Now use {z/g(y)}  

P(f(y), y, g(y)), P(f(y), A, g(y))  

Now use {y/A}  

=> P(f(A), A, g(A)), P(f(A), A, g(A))  

Thus , mgu = {x/y, z/y , y/A }.

Answer:

See Explanation

Explanation:

The function is not given. So, I will provide general explanation.

A function is defined as:

return-type function-name(argument-lists)

For instance, an int function that has 1 argument is:

int Myfunc(int num)

num is the argument of the function Myfunc

So, an example of a function with two arguments is:

int Myfunc(int num, string name)

So, examine the function in the complete question; then count the number of arguments to determine if the answer is true or false.

Answer:

Saved In order to be used as a primary key, which of these characteristics must an attribute possess with respect to a single instance of the entity:

There must be a maximum of one attribute instance.

There must be many instances of the attribute.

There must be at most one entity instance that each attribute instance describes.

There must be at least one instance of the attribute.

A singular attribute is also known as a unique attribute. True

Saved Relationship names and types of relationship maxima or minima that each could have are listed below. True

Explanation:

Answer:

The program in C++ is as follows

#include <iostream>

using namespace std;

int main(){

   int n1, n2, n3, largest, smallest;

   cin>>n1>>n2>>n3;

   if(n1 >= n2 && n1>=n3){        largest = n1;    }

   else if(n2 >= n1 && n2>=n3){        largest = n2;    }

   else{        largest = n3;    }

   if(n1 <= n2 && n1<=n3){        smallest = n1;    }

   else if(n2 <= n1 && n2<=n3){        smallest = n2;    }

   else{        largest = n3;    }

   cout<<"Smallest: "<<smallest<<endl;

   cout<<"Largest: "<<largest<<endl;

   return 0;

}

Explanation:

Declare all variables

   int n1, n2, n3, largest, smallest;

Get input for the three numbers

   cin>>n1>>n2>>n3;

Check if n1 is the largest

   if(n1 >= n2 && n1>=n3){        largest = n1;    }

Check if n2 is the largest

   else if(n2 >= n1 && n2>=n3){        largest = n2;    }

Otherwise, n3 is the largest

   else{        largest = n3;    }

Check if n1 is the smallest

   if(n1 <= n2 && n1<=n3){        smallest = n1;    }

Check if n2 is the smallest

   else if(n2 <= n1 && n2<=n3){        smallest = n2;    }

Otherwise, n3 is the smallest

  else{        largest = n3;    }

Print the smallest

   cout<<"Smallest: "<<smallest<<endl;

Print the largest

   cout<<"Largest: "<<largest<<endl;

Answer:

1. It has a clear objective.

2. It's useful to your audience.

3. It's well-rehearsed.

4. Your presentation deck uses as little text as possible.

5. Your contact information is clearly featured.

6. It includes a call-to-action.

Explanation:

Answer: Pulldown menus

Explanation:

Pulldown menus refer to the graphical control element, that is identical to a list box, which enables user to be bake to select one value from a list.

They're regarded as the menu of options that will appear when an item is selected with a mouse. In this case, the item that the user selected will show at the top of the display screen, while the menu appears will show below it.

Therefore, Alex should use the pulldown menus to hide the long list of hypertext links so that it appears only in response to a tap of a major heading in the navigation list.

Answer:

const MAXNR=150;

let candidates = {};

for(let i=2; i<=MAXNR; i++) {

   candidates[i] = true;

}

for(let p=2; p <= MAXNR; p++) {

   if (candidates[p]) {

       process.stdout.write(`${p} `);

       // Now flag all multiples of p as false

       i=2;

       while(p*i <= MAXNR) {

           candidates[p*i] = false;

           i++;

       }

   }

}