aiapler sr ADro stark and may wse of the member of stae assume any knowledge of
ID: 3804842 • Letter: A
Question
aiapler sr ADro stark and may wse of the member of stae assume any knowledge of the implementation. ekryve. bur The following code segment lused for Exercises 19 and 20a is a is stack depending on the of the the At the end of the the items on of a stack, this code Printed Because of the logical properties You are output sequences of the values of the counter, the output determine whether the code could generate for (count 1: count 51 eount+ if cout eount elae atack Top stack Pop cout number 19. The following outyut is possible using a stack: 1 3 5 2 4 b, False c Not enough information to determine 20. The following output is possible using a stack: 1 3 5 4 2 a. True b. False c Not enough information to determine 21. Describe the accessing protocol of a queue at the abstract level. 22. Show what is written by the following segments of code, given that i item2, and item3 Que Type queue item 1: item2 0: item3 4: queue. Enqueue (item2) queue. Enqueue (item 1) Enqu the queue a. Rewrit b What WhatExplanation / Answer
19. The following output is possible using a stack: 1 3 5 2 4
The possibilities are either the element will be printed, or will be pushed to stack.
And finally, all the elements in the stack will be printed.
b. False. The possibility is: 1 is printed, 2 is pushed, 3 is printed, 4 is pushed,
5 is printed. Then finally, the elements in stack are 2, and 4 and will be printed,
in reverse order 4, 2. So, the output finally will be: 1, 3, 5, 4, 2.
Therefore, 1, 3, 5, 2, 4 is not possible.
20. The following output is possible using a stack: 1 3 5 4 2.
a. True. Using the same previous question explanation, the possibility is true.
21. Describe the accessing protocol of a queue at the abstract level.
The queue will be accessed in the First In First Out order. The elements inserted
first will be deleted first.
22. Show what is written by the following segments of code, given that item1, item2, and
item3 are int variables.
a. QueType queue;
item1 = 1;
item2 = 0;
item3 = 4;
queue.Enqueue(item2); //0 will be inserted to queue. So, queue contents are: 0.
queue.Enqueue(item1); //1 will be inserted to queue. So, queue contents are: 0, 1.
queue.Enqueue(item1 + item3); //1 + 4 = 5 is inserted to queue. So, queue contents are: 0, 1, 5.
queue.Dequeue(item2); //Probably, the deleted element is copied to item2. So, queue contents are: 1, 5.
//And item2 is updated to 0.
queue.Enqueue(item3 * item3); //4 * 4 = 16 is inserted to queue. So, queue contents are: 1, 5, 16.
queue.Enqueue(item2); //0 will be inserted to queue. So, queue contents are: 1, 5, 16, 0.
queue.Enqueue(3); //3 will be inserted to queue. So, queue contents are: 1, 5, 16, 0, 3.
queue.Dequeue(item1); //The element from the front of queue will be deleted and copied to item1.
//So, queue contents are: 5, 16, 0, 3, and item1 is updated to 1.
cout << item1 << endl << item2 << endl << item3 << endl; //This will print 1, 0, 4 each in their own lines.
while(!queue.IsEmpty()) //Each element in queue will be deleted, and printed.
{
queue.Dequeue(item1);
cout << item1 << endl;
}
So, here the output is: 5, 16, 0, 3.
Finally the output is:
1
0
4
5
16
0
3
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.