Answer:
The difference between While loop and Do - While loop are explained below.
Explanation:
- While loop : It is a looping procedure in which the statements inside the while loop are executed depending on the condition outside the while before starting the loop.
- If the condition is true then the code inside loop is executed otherwise not.
- Do - While loop: It is a looping procedure in which the statements inside the loop get executed and then the condition at the end of the loop is checked.
- This means even the condition is fails the statements inside the loop are executed once.
- Do while loop name itself suggests that "do the while and then check the condition".
Answer:
Terribly low storage space, limited to mathematics/computing, required entire rooms to use, and low information yield for hours of processing.
Explanation:
A Peer-to-peer network architecture would work best for Edward and Matthew.
Although they have the option of creating a Client-Server type of network architecture, the number of people that they are currently working with would cost them a lot more than a peer-to-peer architecture.
One of the advantages of using a Peer-to-peer network architecture for a small network would be the access of files between all computers in the network. Even if one of the computers will fail, the other computers will still have access to the different files and information they will need to keep the company moving forward.
Answer:
If all the character pairs match after processing both strings, one string in stack and the other in queue, then this means one string is the reverse of the other.
Explanation:
Lets take an example of two strings abc and cba which are reverse of each other.
string1 = abc
string2 = cba
Now push the characters of string1 in stack. Stack is a LIFO (last in first out) data structure which means the character pushed in the last in stack is popped first.
Push abc each character on a stack in the following order.
c
b
a
Now add each character of string2 in queue. Queue is a FIFO (first in first out) data structure which means the character inserted first is removed first.
Insert cba each character on a stack in the following order.
a b c
First c is added to queue then b and then a.
Now lets pop one character from the stack and remove one character from queue and compare each pair of characters of both the strings to each other.
First from stack c is popped as per LIFO and c is removed from queue as per FIFO. Then these two characters are compared. They both match
c=c. Next b is popped from stack and b is removed from queue and these characters match too. At the end a is popped from the stack and a is removed from queue and they both are compared. They too match which shows that string1 and string2 which are reverse of each other are matched.
