Insert locks into the following two functions for stack operations assuming the two functions are executed in two threads. int Push(int stack[ ], int *top, int new_element){ stack[top]= new_element; top++; return 0; } int Pop(int stack[ ], int *top, int *top_element){ if (top>0) { top_element= stack[top]; top--; return 0; } else return -1; \\ empty stack }

Insert locks into the following two functions for stack operations assuming the two functions are executed in two threads. int Push(int stack[ ], int top, int new_element){ stack[top]= new_element; top++; return 0; } int Pop(int stack[ ], int top, int *top_element){ if (top>0) { top_element= stack[top]; top--; return 0; } else return -1; \\ empty stack }

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 1TF

See similar textbooks

Similar questions

Write a program in C to insert or delete characters in a buffer. You need to use stack operations to maintain operations for a buffer in a text editor. The program implements the following operations using two stacks that are represented using linked list: Create an empty buffer createBuffer() Insert a character at the cursor position insert() Get the character at the cursor position char get() Delete and return the character at the cursor char delete() Move the cursor k position to the left void left (int k) Move the cursor k positions to the right void right(int k) Requirements: You need to implement the Stack ADT using either Array or Linked list implementation for the following operations in a file named “stack.h”: Stack initialize() boolean IsEmpty (Stack) character pop (Stack) Stack push(Stack and character) character top (Stack) size(Stack) The driver program interface can be either menu-based driven application that displays…
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.
stack permutation of the numbers 0, 1, ..., n-1 is a permutation obtained as the sequence of numbers output by a stack after the original numbers have been processed left-to-right through a stack (via legal push and pop operations). For example, 0, 3, 2, 1 is a stack permutation of 0, 1, 2, 3 obtained by the sequence of operations: push, pop, push, push, push, pop, pop, pop. However, the permutation 1, 3, 0, 2 is not a stack permutation of 0, 1, 2, 3 Which of the following sequences are not stack permutations of 0,1,2,3,4,5,6,7,8,9? There could be more than one answer: select all those that you think are correct. There is a penalty for incorrect choices. Group of answer choices 4, 6, 8, 7, 5, 3, 2, 9, 0, 1 4, 3, 2, 1, 0, 9, 8, 7, 6, 5 2, 5, 6, 7, 4, 8, 9, 3, 1, 0 0, 4, 6, 5, 3, 8, 1, 7, 2, 9
Write a code/algorithm, which takes two sorted integer stacks ‘intstack_1’ and ‘intstack_2’ (with minimum value on ‘top’ and the maximum value at the bottom) as input. The algorithm should output a single sorted stack ‘result_stack’ of all the values (with the minimum value on ‘top’ and the maximum value at the bottom). The algorithm should fulfill the following constraints: Only stack operations are allowed, and they are already implemented (pop, push, top, isEmpty, isFull etc.). No other data structure is allowed except stack. The algorithm must work correctly for input stacks of different sizes. [Hint: you will have to use an additional stack.]
Passing Arguments to a FunctionThe sample program in Example 5.4 shows how the stack frame is used to passarguments to a function.The code simply creates some local stack variables, fillsthem with values, and passes them to a function called callex().The callex() function takes the supplied arguments and prints them to the screen.Example 5.4 Stack and Passing Parameters to a Function/* stack2.c */#include <stdlib.h>#include <stdio.h>int callex(char *buffer, int int1, int int2){/* This prints the input variables to the screen:*/printf("%s %d %d\n",buffer,int1, int2);return 1;}int main(int argc, char **argv){Stack Overflows • Chapter 5 173 char buffer[15]="Hello Buffer"; /* a 15-byte character bufferwith12 characters filled/*int int1=1, int2=2; /* two four-byte integers */callex(buffer,int1,int2); /*call our function*/return 1; /*leaves the main function*/}You need to compile this example in MSVC in a console application inRelease mode or in GCC without optimizations. Example…
Given: typedef struct point2d {double x;double y;}Point2D; typedef struct pt2link { Point2D* payload; Struct pt2link* next; } PtLink, *pPtLink Writting C code to: a. Create a stack ADT module to manage Point2D data. The module should handle stack creation, push, pop, peek, reporting the stack contents and stack destruct b. Create a queue ADT module to manage Point2D data. The module should handle queue creation, enqueuing, dequeuing, peek (look at the next value to be dequeued), reporting the queue contents and queue destruct
A SpecialStackTM is a stack modified to support the following two operations: PUSHCLEAR(v) successively pops consecutive items from the top of the stack that are less than u, then pushes v onto the stack. POP() deletes the item at the top of the stack. Assume these operations are implemented using a singly-linked list. PUSHCLEAR(v) iter- ates through the linked list to pop the applicable items and then adds v to the beginning. POP() deletes the first item. (a) Describe the ordering of values on the stack. (b) Explain how a single call to PUSHCLEAR(V) could take (n) time. (c) If we assume that every operation takes linear time, we get a naive bound of O(n²) on the total runtime. But this doesn't consider the fact that these expensive operations happen infrequently so let's analyze it more closely. Show that any sequence of n operations takes O(n) time. -
Explain thoroughly the answers to the following questions: What are the most common operations of a stack? Explain each operation. What are the advantages and disadvantages of a stack? What are the different types of queues? Compare each variant to a simple queue?
1. For the code below, draw a picture of the program stack when the function partition() is called the first time. You only have to draw the part of the stack for quicksort() and partition(). # extracted from suquant's reply at # https://stackoverflow.com/questions/18262306/quicksort-with-python def partition(array, begin, end): pivot = begin for i in range(begin+1, end+1): if array[i] <= array[begin]: pivot += 1 array[i], array[pivot] = array[pivot], array[i] array[pivot], array[begin] = array[begin], array[pivot] return pivot def quicksort(array, begin, end): if begin >= end: return pivot = partition(array, begin, end) quicksort(array, begin, pivot-1) quicksort(array, pivot+1, end) # added calling code if __name__ == "__main__": mylist = [8, 2, 17, 4, 12] quicksort(mylist, 0, 4)
Write a program to insert or delete characters in a buffer. You need to use stack operations to maintain operations for a buffer in a text editor. The program implements the following operations using two stacks that are represented using linked list:  Create an empty buffer createBuffer()  Insert a character at the cursor position insert()  Get the character at the cursor position char get()  Delete and return the character at the cursor char delete()  Move the cursor k position to the left void left (int k)  Move the cursor k positions to the right void right(int k) Requirements: 1. You need to implement the Stack ADT using either Array or Linked list implementation for the following operations in a file named “stack.h”:  Stack initialize()  boolean IsEmpty (Stack)  character pop (Stack)  Stack push(Stack and character)  character top (Stack)  Integer. size(Stack) 2. The driver program interface can be either menu-based driven application that displays buffer operations,…
Write a program to insert or delete characters in a buffer. You need to use stack operations to maintain operations for a buffer in a text editor. The program implements the following operations using two stacks that are represented using linked list: Create an empty buffer createBuffer() Insert a character at the cursor position insert() Get the character at the cursor position char get() Delete and return the character at the cursor char delete() Move the cursor k position to the left void left (int k) Move the cursor k positions to the right void right(int k) Requirements: You need to implement the Stack ADT using either Array or Linked list implementation for the following operations in a file named “stack.h”: Stack initialize() boolean IsEmpty (Stack) character pop (Stack) Stack push(Stack and character) character top (Stack) size(Stack) The driver program interface can be either menu-based driven application that displays buffer…
1. Describe how to implement a queue using two stacks and O(1) additional memory, so that the amortized time for any enqueue or dequeue operation is O(1). The only access you have to the stacks is through the standard subroutines Push and Pop.