Algorithm 1: Question 2.11 numbers = [1, 2, 3, 4, 5];2 stack = new Stack();3 queue new Queue();4 foreach number n of numbers do5if (n mod 2) = 0) then| stack.push(n);elsequeue.enque(n);678end910 end11 while !stack.isEmpty() doqueue.enque (stack.pop());1213 end14 while !queue.is Empty() do15 println(queue.deque());16 endi. What is the expected output of this algorithm?ii. What is the runtime complexity of this algorithm considering N to be the lengthof numbers?iii. What is the space complexity of this algorithm considering N to be the lengthof numbers?iv. Can numbers be declared as a Set? Why/Why not?

Required: Algorithm 1: Question 2.1 number = [1, 2, 3, 4, 5]; stack = new Stack(); queue = new…

Algorithm 1: Question 2.1 1 numbers [1,2,3,4,5); 2 stack-new Stack(); 3 queue = new Queue(); 4 foreach number n of numbers do if (n mod 2)=0 then stack.push(n); else queue.enque(n); 6 9 end 10 end 11 while !stack.isEmpty() do queue.enque(stack.pop()); 12 13 end 15 16 end 14 while !queue.is Empty() do println(queue.deque()); i. What is the expected output of this algorithm? ii. What is the runtime complexity of this algorithm considering N to be the length of numbers? iii. What is the space complexity of this algorithm considering N to be the length of numbers? iv. Can numbers be declared as a Set? Why/Why not?

Algorithm 1: Question 2.1 1 numbers [1,2,3,4,5); 2 stack-new Stack(); 3 queue = new Queue(); 4 foreach number n of numbers do if (n mod 2)=0 then stack.push(n); else queue.enque(n); 6 9 end 10 end 11 while !stack.isEmpty() do queue.enque(stack.pop()); 12 13 end 15 16 end 14 while !queue.is Empty() do println(queue.deque()); i. What is the expected output of this algorithm? ii. What is the runtime complexity of this algorithm considering N to be the length of numbers? iii. What is the space complexity of this algorithm considering N to be the length of numbers? iv. Can numbers be declared as a Set? Why/Why not?

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 21SA

See similar textbooks

Similar questions

void stack::do(){ for(int i=0li<=topindex/2;i++){ T temp=entry[i]; entry[i]=entry[topindex-i-1]; entry[topindex-1-i]=temp;} } Assume the stack is array based. What is this method do? a. swap the first item with last item b. doesn't do any thing c. replace each item with next item value d. reverse the stack
Q7. Which values will be contained in the queue and the stack after the two while loops? Queue queue = new Queue (10); Stack stack = new Stack(25); for (int i = 1; i
Evaluate the following statement using stack :T = fib (3) ; Where fib ( ) defined as follows : int fib(int n){ if ((n == 0 ) || (n ==1))return n;elsereturn fib(n-1) + fib(n-2);}
Queue abcQ = new Queue (); Queue out = new Queue (); //statements to insert value 1, 2, 3, 4, 5 into abcQ for (int i = 0; i < 5; i++) { int a = Integer.parseInt (abcQ.dequeue ().tostring ()); int b = Integer.parseInt (abcQ.dequeue ().tostring ()); abcQ.enqueue (a); abcQ.enqueue (b); out.enqueue (a + b); for (int i = 0; i < 5; i++) System.out.print (abcQ.dequeue () + " "); System.out.println ("\n") ; for (int i = 0; i < 5; i++) System.out.print (out.dequeue () + " "); (- ks)
Find the output of the following program code if the following values have been inserted into abcQ: 1 2 4 5
C# How would you modify this to correctly add the item based on priority? List<Item> queue = new List<Item>(); public void Enqueue(Item newItem) { queue.Add(newItem); }
java data structure Queue: Q4: A program performs the following operations on an empty queue Q: Q.enqueue(24) Q.enqueue(74) Q.enqueue(34) Q.first() Q.dequeue() Q.enqueue(12) Q.dequeue() Please show the queue contents at the end of these operations. Clearly show the front of the queue.
Q: While implementing a queue using Array what type of a problem occurs when inserting and deleting an item takes place at constant time
Q1: Answer A and B A: By using stack as data structure, find the postfix expression corresponding to the infix expression: 1+(5-3*4)+9/3^2 B: Draw the state of the queue (with size 4) after the following sequence of Enque and Deque operations : Enque (1); Deque; Deque Enque (2); Enque(3); size() peek() Deque(); Enque(5); Enque(4); Deque() Deque();
Given the following stack A = {29,18,10,15,20,9,5,13,2,4,15) Create a queue by taking the elements from the top of the stack and adding them to the queue.
A stack has following variables initialized, answer question 5 &6 using these values int size = 7; int top = —1; int [ ] arr = new int [size] ; Q5. What will be value of the top variable when the stack is empty? Q6. What will be value of the top variable when the stack is full?
0:00 I ZVV 58 Stack s - new Stack(); s. push(10); s. push(20); s. push(30); s. push(40); // stack created with elements- 10 20 30 40 59 60 61 62 63 64 65 sum(s); 66 public static void sum(stack s){ Integer sum = 0; stack tmp = new Stack(); // move the stack to new stack, it will be in reverse orde // simultaneously sum the elements while (Is.isEmpty())( tmp.push(s.pop(); sum t tmp.peek(); 67 68 69 70 71 72 73 74 sum t= tmp.peek (); 74 75 // move to original stack while (Itmp.isEmpty()){ s.push(tmp.pop()); system.out.println("sum= "+sum.tostring()); OUTPUT- 10 pushed into stack 20 pushed into stack 30 pushed into stack 40 pushed into stack 40 pushed into stack 30 pushed into stack 20 pushed into stack 10 pushed into stack 10 pushed into stack 20 pushed into stack 30 pushed into stack 40 pushed into stack Sum= 100 Sum of 10, 2O, 30, 40 = 100 I hope it helps. For any doubt, feel free to ask in comments, and give upvote if u get the answer.