a. Given a Queue and Stack size of 5. Consider FRONT=2, REAR=4 for queue and initially 3 Data in Stack. Now, find the final status of FRONT & REAR for Queue and update values of Stack after below operations sequentially: i. 2 data insert/push i. 2 data delete/pop. iii. 3 data insert/push iv. 1 data delete/pop

a. Given a Queue and Stack size of 5. Consider FRONT=2, REAR=4 for queue and initially 3 Data in Stack. Now, find the final status of FRONT & REAR for Queue and update values of Stack after below operations sequentially: i. 2 data insert/push i. 2 data delete/pop. iii. 3 data insert/push iv. 1 data delete/pop

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

QUESTION 3 Which of the following is true about linked list implementation of stack? In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from the beginning. O b. In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end. O c. In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from the beginning. O d. None of the above
... QUESTION 1 A palindrome is a string that reads the same both forward and backward. For example, the string "madam" is a palindrome. Write a function, isPalindrome, check whether a string is a palindrome using stack and queue. No credit will be given if you are not using stack and queue. When compares each letter, you need to convert each letter to capital letter. Use toupper() Lo convert each letter to capital. Assume that the following object has created. queue q; stack s; Use the following function declaration. bool isPalindrome (string s) For the toolbar, press ALT+F10 (PC) or ALT+FN+F10 (Mac). Paragraph Arial 10pt 夕次 T Te 三三山図田用图由田田田田 (1) L Click Save and Submit to saue and submit. Click Save All Answers to soave all ansuwers.
In Go Lang 4. Program stack. For the following code, answer the following questions. Assume we are putting everything for our function calls on the stack. · Show what a stack frame/activation record for main() looks like · Show what the stack frame/activation record for the 2nd call to ctTarg look like? (Yes, this means you can skip the other stack frames) · We note that targ does not change value in any recursive call. Why doesn't the compiler just store targ once in one block of memory big enough to store a string? int ctTarg(string* list, int len, string targ) { if (len <= 0) return 0; if (*list == targ) return 1 + ctTarg(list + 1, len - 1, targ); return ctTarg(list + 1, len - 1, targ); } int main() { string pets[] = {"cat", "dog", "mouse", "cat"}; cout << ctTarg(pets, 4, "cat") << endl; }
Structures... Overview Plans Resources Status and follow-up Question 3 Consider the following statements: stackType stack; int x; Suppose that the input is: 14 45 34 23 105-999 Show what is output by the following segment of code: stack.push(5); cin >> x; while (x != -999) { if (x % 2 == 0) { if (!stack.isFullStack()) stack.push(x); else cout > X; cout << "Stack Elements: "; while (Istack.isEmptyStack()) cout << "" << stack.top(); stack.pop(); cout << endl: rch 99+
1. What happens when the 11th item is added to a stack or queue? 2. What is the number of the next item, after the 11th, that would cause the same process you just described (in Question 1) to occur? 3. Assume you have 5 items in a stack and 5 items in a queue. Thinking about the underlying structure (i.e. the array) holding the data, what happens when you remove one item from the stack and one item from the queue? import java.util.EmptyStackException; public class ArrayStack implements Cloneable { private int[ ] data; private int manyItems; public ArrayStack( ) { final int INITIAL_CAPACITY = 10; manyItems = 0; data = (int[]) new int[INITIAL_CAPACITY]; } public ArrayStack(int initialCapacity) { if (initialCapacity < 0) throw new IllegalArgumentException ("initialCapacity too small " + initialCapacity); manyItems = 0; data = (int[]) new int[initialCapacity]; } public ArrayStack clone( ) { // Clone an ArrayStack. ArrayStack answer; try { answer = (ArrayStack) super.clone(…
3. Define a function named stackToQueue. This function expects a stack as an argument. The function builds and returns an instance of LinkedQueue that contains the items in the stack. The function assumes that the stack has the interface described in Chapter 7, "Stacks." The function's postconditions are that the stack is left in the same state as it was before the function was called, and that the queue's front item is the one at the top of the stack. Use this Python template: class Queue:'''TODO: Remove the "pass" statements and implement each methodAdd any methods if necesssaryDON'T use any builtin queue class to store your items'''def __init__(self): # Constructor functionpassdef isEmpty(self): # Returns True if the queue is empty or False otherwisepassdef len(self): # Returns the number of items in the queuepassdef peek(self): # Returns the item at the front of the queuepassdef add(self, item): # Adds item to the rear of the queuepassdef pop(self): # Removes and returns the item…
Need help in Stack/Queue Which of the following statements are correct about the time complexity of the operations of Queue implementations? If not, why? (ex. if 1 is incorrect, write fixed version, like dynamic array is used for implementation) If a circular array is used for implementation, the dequeue operation has a time complexity of O(n). If an array is used for the implementation with the first element in the queue always stored in index 0 of the array, the time complexity of the dequeue operation is O(n). If an array is used for the implementation with the first element in the queue always stored in index 0 of the array, the worst-case time complexity of the enqueue operation is O(n).
TRUE or FALSE? Answer the following question and state the reason why: In a dynamic stack, the node that was popped is deleted. In a dynamic stack, the pointer top stays at the head after push operation. STL function top returns a reference to element at the top of the stack. STL empty function will yield a value of true if the stack has elements.
Question 3 a. "Queues and stacks are used in many real-life situations". In your own words, clearly distinguish between queues and stacks; and give one example of real-life situations in which each of them is used. b. In an array-based implementation of a stack, which end of the contents of the array represent the bottom of the stack and why? c. If the size of circular queue K is 4 with indices number from 0 to 3 what would be the state of the queue after the following set of 8 operations below. Show in a diagram the state of queue K after each of the 8 operations. K. enqueue (“F"), K. enqueue (“R"), K. dequeue(), K. enqueue (“P"), dequeue(), K.front(), K. enqueue (“Z"), K. enqueue (“G") d. Why are insertions and deletions at the logical end of the array more efficient than insertions and deletions in the interior of the array?
A stack of integer elements is implemented as an array. The index of the topelement is kept in position 0 in the array, and the stack elements are stored in stack[1], …,stack[stack[0]].1. How does this implementation fare when assessed against the idea of an array as ahomogeneous collection of data elements?2. How would this implementation change the stack specification?3. How would it change the implementation of the functions?
Problem 2. In Project 6 you are required to use pthreads condition variables and mutexes to synchronize accesses to shared variables in your priority queue implementation. Ben Bitdiddle wants to try (on his own) to do it using semaphores instead. As in Project 6, the “next" operation returns the highest-priority item in the queue; if the queue is empty, it blocks until the queue becomes non-empty. The “insert" operation places an item in the queue, and if the queue went from empty to non-empty, it signals any waiting threads. Ben's implementation uses a (global) semaphore to count the number of items in the queue, and uses the Bryant and O'Hallaron "P()" and "V()" wrapper functions (see text) to decrement and increment it. He declares a global sem_t list_size and initializes it with sem_init(&list_size,0,0). The global variable list_head points to the first item in the list and is initially NULL. a. In Ben's first attempt, the pq_next() function does this: P(list_size); // block until…
Select the statements that apply to the use of the frame pointer. EBP is often called the base pointer or frame pointer because it holds the base address of the stack frame. EBP does not changes value during the procedure. EBP need not be restored to its original value when a procedure returns. A procedure can explicitly access stack parameters using constant offsets from EBP.