MANCOSA: BCOM (INFORMATION AND TECHNOLOGY MANAGEM PROJECT 4: INFORMATICS 1B QUESTION 1 Refer to the operations below: Add (10 + 5) Add (4+8) Add (7*2) Add (90 – 3) - Print list Print peek Remove an item from the list Print list 1.1 Implement the operations above into a Queue structure called q1. ..2 Implement the operations above into a Stack structure called s1.

MANCOSA: BCOM (INFORMATION AND TECHNOLOGY MANAGEM PROJECT 4: INFORMATICS 1B QUESTION 1 Refer to the operations below: Add (10 + 5) Add (4+8) Add (7*2) Add (90 – 3) - Print list Print peek Remove an item from the list Print list 1.1 Implement the operations above into a Queue structure called q1. ..2 Implement the operations above into a Stack structure called s1.

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 3PE

See similar textbooks

Similar questions

4.3 Refer to the code fragment below and convert the following Queue structure into a Stack structure. You should create a reference called S1 for the stack structure. Code: Queue Q1 = new LinkedList (); Q1.add("Sandra"); Q1.add (15); Q1.add (200); Q1.add ('#'); Q1. remove (); System.out.println(Q1); System.out.println(Q1.peek()); Q1.add("Mary"); System.out.println(Q1);
10.12 It is possible for one linear structure to be more general than another.(a) Can a Queue be implemented using a Stack? What is the level of complexity of each Queue operation? (b) Can a Stack be implemented using a Queue? What are the various Stack techniques' complexities? 10.13 Explain how we could efficiently build a Queue as a pair of Stacks, known as a "stack pair." (Hint: Consider one of the stacks to be the head of the queue and the other to be the tail.)
(2) Answer the following questions concerning lists, stacks, and queues Please be thorough with explanatio! (d) Suppose you are implementing a list of stacks. Let's say you decide to implement both the general list (the list of stacks) and each individual stack using a double linked list. Assume that there are currently N stacks in the list, and each stack has a maximum of K items, where N and K are both large. You are going to iterate through the general list and apply a single operation to each stack as you encounter it. Now answer the following four questions, using big-Theta notation: What is the average-case time complexity of pushing one additional item into each stack? What is the worst-case time complexity of pushing one additional item into each stack? What is the average-case time complexity of popping one item from each stack? What is the worst-case time complexity of popping one additional item from each stack? (For pops, if the stack is empty, you can assume that the pop…
2. 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 a queue
1. a) Using the stack diagram, convert the following infix expression to a postfix expression. A* (B – C + D) – E / F b) Referring to question 1 (a), give the value of postfix expression by using the stack concept if provided: A=2, B=3, C=8, D=10, E=10 and F=2
Question 1Refer to the operations below:Add (10 + 5)Add (4+8)Add (7*2)Add (90 – 3)Print listPrint peekRemove an item from the listPrint list1.1 Implement the operations above into a Queue structure called q1.1.2 Implement the operations above into a Stack structure called s1.
10.12 There is a possibility that one linear structure is more universal than another.(a) Can a Stack be used to implement a Queue? What is the degree of difficulty of each Queue operation? (b) Can a Queue be used to implement a Stack? What are the complexity of the various Stack techniques? 10.13 Describe how we may efficiently construct a Queue as a pair of Stacks, referred to as a "stack pair." (Hint: Think of one stack as the head of the queue and the other as the tail.) 10.12 There is a possibility that one linear structure is more universal than another.(a) Can a Stack be used to implement a Queue? What is the degree of difficulty of each Queue operation? (b) Can a Queue be used to implement a Stack? What are the complexity of the various Stack techniques? 10.13 Describe how we may efficiently construct a Queue as a pair of Stacks, referred to as a "stack pair." (Hint: Think of one stack as the head of the queue and the other as the tail.) 10.12 There is a possibility that…
Stack, Queue and Deque5.1. Understand the basic operations for Stack, Queue and DequeExample: Suppose that Queue q is implemented by a circular array data with the size 3. Please drawthe state of the Queue q and circular array data after each of the following steps.1) Queue q = new Queue();2) q.enqueue(5);3) q.enqueue (2);4) q.enqueue (9);
Imagine a stack of dishes, literally. The stack may collapse if it becomes too tall.Therefore, when the prior stack above a certain threshold in real life, we probably start a new stack. Create a data structure called SetOfStacks to resemble this. When a stack's capacity is reached, a new stack should be created and added to the SetOfStacks. SetOfStacks. SetOfStacks with push(). In other words, pop() should return the same values as it would if there were only one stack. It should operate exactly like a single stack.TAKE ACTIONCreate a function called popAt(int index) that does a pop operation on a certain substack.
Consider the following code segment , The variable q is an object of type Queue, the variable s is an object of type Stack. peek method looks at the first element in the queue without removing it. the remove method removes the first element from the queue. add method adds an element to the and of the queue or add an element to the top of the stack. pop method removes an element from the top of the stack What would be the content of the variable q (8 numbers) after we complete the second while loop in the code for (int i = 30; i <= 40; i ++) { if(i % 3 == 0) q.add(i); } while (!q.isEmpty()) { s.add(q.peek()); s.add(q.peek()); q.remove(); } while (!s.isEmpty()) { q.add(s.pop()); }
4. a) Using the stack diagram, convert the following infix expression to a postfix expression. A + B / C * (D – E) b) Referring to question 4 (a), give the value of postfix expression by using the stack concept if provided: A=13, B=20, C=4, D=30, E=25
(2) Answer the following questions concerning lists, stacks, and queues: Please be thorough with explanation! (e) Suppose you are implementing a list of stacks. Let's say you decide to implement both the general list (the list of stacks) and each individual stack using a vector. Assume that there are currently N stacks in the list, and each stack has a maximum of K items, where N and K are both large. You are going to iterate through the general list and apply a single operation to each stack as you encounter it. Now answer the following four questions, using big-Theta: What is the average-case time complexity of pushing one additional item into each stack? What is the worst-case time complexity of pushing one additional item into each stack? What is the average-case time complexity of popping one item from each stack? What is the worst-case time complexity of popping one additional item from each stack? (For pops, if the stack is empty, you can assume that the pop itself is a…