Define StackQueue as an abstract data type containing the operations of both stack and queue. In StackQueue, the top of StackQueue is the same as the front of the StackQueue. Based on the program below, write down the output. If StackQueue X contains numbers {1, 2, 3, 4}, where 1 is the front/top, the print format "print(X)" is “(front/top) 1 2 3 4 (rear)". StackQueue *A, *B; A = malloc(sizeof(StackQueue)); B = malloc(sizeof(StackQueue)); push(A, 11); push(A, 111); push(A, 1111); push(A, 11111); print(A); // part (a) enqueue(B, topandpop(A)); enqueue(B, top(A)); enqueue(B, dequeue(B)); print(B); // part (b) enqueue (A, dequeue(B) + top(A)); push(A, dequeue(A) + popandtop(B)); print(A); // part (c) What are the output for part (a), part (b) and part (c)?

Define StackQueue as an abstract data type containing the operations of both stack and queue. In StackQueue, the top of StackQueue is the same as the front of the StackQueue. Based on the program below, write down the output. If StackQueue X contains numbers {1, 2, 3, 4}, where 1 is the front/top, the print format "print(X)" is “(front/top) 1 2 3 4 (rear)". StackQueue A, B; A = malloc(sizeof(StackQueue)); B = malloc(sizeof(StackQueue)); push(A, 11); push(A, 111); push(A, 1111); push(A, 11111); print(A); // part (a) enqueue(B, topandpop(A)); enqueue(B, top(A)); enqueue(B, dequeue(B)); print(B); // part (b) enqueue (A, dequeue(B) + top(A)); push(A, dequeue(A) + popandtop(B)); print(A); // part (c) What are the output for part (a), part (b) and part (c)?

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

in java, Two abstract data types are the ordered list and the unordered list. Explain how these two ADTs are similar and how they differ. To answer this question, assume that you do not know how they are implemented (that is, whether they are implemented using an array or a linked list).
Please implement the following problem in C++: Although a queue is "best" implemented with a list, it can be implemented with a vector if you take into account the starting position of the queue. For example, if five elements are pushed onto the queue, the start of the queue is at position zero and the end is at position 4. If we, then, pop two elements, the start would be at position 2 and the end at position 4. The two "popped" elements are not really removed from the vector, and that avoids the O(N) time problem for the pop function.Implement a class which uses a vector to store the queue. Be mindful of performance, such that if the queue is empty, the size of the underlying vector is "reset."
Write a Java public static general function which doesn't belong to the Stack class, isGreaterThan that determines if one stack is greater than another stack. If the summation of every other item(starting at the top) from one stack is greater than the summation of every other item(starting at the top) from another, return true, otherwise, return false. After you call this method, both stacks should stay the same as they are called before. Receives: a Stack type argument S1 and another Stack type argument S2 Postcondition: If the summation of every other item (starting at the top) from S1 is greater than the summation of every other item (starting at the top) from S2, return true, otherwise, return false. Both S1 and S2 should stay the same as they are called before. public static boolean isGreaterThan(Stack S1, Stack S2)
Java Consider the following class definition for an array-based stack implementation:pubic class Stack { private int[] m_array; private int m_index; public Stack(int cap) { m_array = new int[cap]; m_index = 0; } public void push(int v) { if (m_index == m_array.length) throw new RuntimeException("push attempted on a full stack"); else { m_array[m_index] = v; m_index++; } }} Follow the steps below to create a class SpecialStack with required instance variables and methods.a. Make sure that the SpecialStack class inherits from Stack. b. Declare two private instance variables: a boolean variable m_multiply, and an int variable m_number.c. Create a constructor that takes three parameters: an int cap, a boolean multiply, and an int number.d. The constructor should call the constructor of the super class and initialize the instance variables properly.e. Override the push method so it verifies if m_multiply is…
Write a program for Stack (Array-based or linked list-based) in Python. Test the scenario below with the implementation and with the reasoning of the answer. Make comments with a short description of what is implemented. Include source codes and screen-captured outputs. Stack: Given an empty stack in which the values A, B, C, D, E, F are pushed on the stack in that order but can be popped at any time, give a sequence of push and pop operations which results in pop()ed order of BADECF
Answer the given question with a proper explanation and step-by-step solution. Hello team, Need some help with problems below using the langauge JAVA. I need to modify the CalcParser class provided below. I need this to produce a string containing commands to evaluate the expression on a stack machine. For example, if you give the command java CalcParser 1+2*3, the output should be a sequence of stack commands such as this: push 1.0 push 2.0 push 3.0 multiply add 7.0 For the command java CalcParser (1+2)*3, on the other hand, it should print a sequence like this: push 1.0 push 2.0 add push 3.0 multiply 9.0 CODE:public class CalcParser { private CalcLexer lexer; private String errorMessage = null; private double value; public CalcParser(String s) { lexer = new CalcLexer(s);errorMessage = lexer.getErrorMessage();if (errorMessage != null) return; value = parseExpression();if (errorMessage != null) return; match(CalcLexer.EOLN_TOKEN);if (errorMessage != null) return; } public String…
Suppose that we are asked to run the program and when our program reaches to line 23, weare also asked to take a snapshot of our program’s run-time stack. So, please draw full ARIsof the all subprograms which are placed in the stack at line 23.
Implement a program in C++ that has the following three parts and each does the following: Implements in C++ a Stack ADT (save the file as StackADT.h) Implements all the necessary methods (behavior) of a Stack (save the file as StackADT.cpp) Implements in C++ a main function (the client or application program) that creates and uses Stack objects (save the file as StackMain.cpp). This main function should be able to do the following: It should be able to read a given text file as input, It should be able to get each input value from the input file (one word at a time) and store it (push) on the Stack object until it stores all the words from the input file. It should be able to retrieve an item from the stack and display it on the screen, and then delete (pop) that item from the stack, and repeat until it retrieves all the items from the stack object. NOTE: Please make sure you debug, run, test and see the program working correctly before submitting. Submit the files…
Write a C++ program to implement the Stack operations using array.The class Stack with the following attributes. Data type Attributes int size int* elements int* popElements int top Create default constructor and a parameterized constructor with size as an argument Stack(int size) In the constructor allocate the memory for elements[] array by the given size and for popElements[] by 100 then initialize the top as -1.In the class Stack define the following methods. Method Description isEmpty() This method returns true if the stack is empty. Otherwise returns false. push() The method pushes the given data to the elements stack. popToPush() This method pop the data from the elements stack and pushes it to the popElements stack. If the elements stack becomes empty print "Stack is empty" and display the data of the popElements stack. display() This method displays the data of the popElements stack. In the main method get the data for the stack from the user.…
Modify the Java class for the abstract stack type shown belowto use a linked list representation and test it with the same code thatappears in this chapter. class StackClass {private int [] stackRef;private int maxLen,topIndex;public StackClass() { // A constructorstackRef = new int [100];maxLen = 99;topIndex = -1;}public void push(int number) {if (topIndex == maxLen)System.out.println("Error in push–stack is full");else stackRef[++topIndex] = number;}public void pop() {if (empty())System.out.println("Error in pop–stack is empty"); else --topIndex;}public int top() {if (empty()) {System.out.println("Error in top–stack is empty");return 9999;}elsereturn (stackRef[topIndex]);}public boolean empty() {return (topIndex == -1);}}An example class that uses StackClass follows:public class TstStack {public static void main(String[] args) {StackClass myStack = new StackClass();myStack.push(42);myStack.push(29);System.out.println("29 is: " + myStack.top());myStack.pop();System.out.println("42 is:…
Write a code in C language that will create graphs and write them to a file in a particular format. The program should be able to accept a number of vertices, create an cycleusing adjacency list data structure and finally output the graph. Where N is the number of vertices in the graph with V vertices and E edges. P[] = Pointer for each vertex V, 1 <= V <= N denoting the starting point in E[] of the list ofvertices adjacent to vertex V. That is, the vertices adjacent to vertex V are indicated inlocations E[P[V]], E[P[V]+1], ..., E[P[V+1]-1].E[] = list of distinct graph edges (length = 2E)Give the asymptotic running timeRun your code for various values of n and time itCreate a table showing the running times for various values.Create a graph of the running times vs various values. Use a linear scale on theaxis.
In the C++ example shown in Section 8.2.3, how much stack space is used by a variable oftype int?