8. What is the result of the following program execution with the data and operations givenin main( ).void pop){ int item;if(Top == -1){ cout<<"The stack is Empty"<using namespace std;#define MAXSIZE 10void push(int);void pop();void traverse();int stack[MAXSIZE];int Top=-1;int main(){ int x;рop();push(5); push(10); push(20);push(30); push(40);push(55);traverse();pop(); pop();pop); traverse();x=7;push(x); push(x*2);push(3+x);traverse();х-2*(х-1);push(x); push(x*2);push(3+x);traverse();push(100);traverse(); push(101);return 0;else{ item = stack[Top];Тор - Тор-1;}void traverse()int i;if(Top == -1){cout<<"The Stack is Empty"<

Answer is The Stack is Empty 5 10 20 30 40 55 5 10 20 5 10 20 7 14 10 5 10 20 7 14 10 100

8. What is the result of the following program execution with the data and operations gi in main( ). void pop() { int item; if(Top == -1) { cout<<"The stack is Empty"< sing namespace std; define MAXSIZE 10 oid push(int); oid pop(); oid traverse(); at stack[MAXSIZE]; nt Top=-1; nt main() { item = stack[Top]; Тор 3 Тop-1; } } int x; pop(); push(5); push(10); push(20); push(30); push(40);push(55); traverse(); void traverse() { int i; if(Top == -1) { cout<<"The Stack is Empty"<

8. What is the result of the following program execution with the data and operations gi in main( ). void pop() { int item; if(Top == -1) { cout<<"The stack is Empty"< sing namespace std; define MAXSIZE 10 oid push(int); oid pop(); oid traverse(); at stack[MAXSIZE]; nt Top=-1; nt main() { item = stack[Top]; Тор 3 Тop-1; } } int x; pop(); push(5); push(10); push(20); push(30); push(40);push(55); traverse(); void traverse() { int i; if(Top == -1) { cout<<"The Stack is Empty"<

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

stacks and queues. program must be able to handle all test cases without causing an exception Note that this problem does not require recursion to solve (though you can use that if you wish).
solution for subpart 3
Consider the following statements: stackType<int> stack; int x; Suppose that the input is: 14 53 34 32 13 5 -999 Show what is output by the following segment of code: cin >> x; while (x != -999) { if (x % 2 == 0) { if (!stack.isFullStack()) stack.push(x); } else cout << "x = " << x << endl; cin >> x; } cout << "Stack Elements: "; while (!stack.isEmptyStack()) { cout << " " << stack.top(); stack.pop(); } cout << endl;
CASE STUDY One of the well-known stack applications is palindrome checker. A palindrome is a word, phrase, number or sequence of words that reads the same backwards as forwards. Example: racecar Question 1 Referring to above case study, using Stack STL implementation with appropriate functions, develops a complete Palindrome program in C++. Refer to sample output below. Your program is then should be able to determine whether the word given is a palindrome or not. SAMPLE OUTPUT :: Palindrome Program :: :: Palindrome Program :: Enter total character: 5 Enter total character: 4 Enter character : f o o d Your word : food Reverse order: doof Palindrome : No Enter character : m ada m Your word : madam Reverse order: madam Palindrome : Yes Thank you for using this program. Thank you for using this program.
PLEASE USE GİVEN ALGORİTHM #include <stdio.h>#include <stdlib.h>#include <string.h> typedef struct LINKED_STACK_NODE_s *LINKED_STACK_NODE; typedef struct LINKED_STACK_NODE_s{LINKED_STACK_NODE next;void *data;} LINKED_STACK_NODE_t[1]; typedef struct LINKED_STACK_s{LINKED_STACK_NODE head;int count;} LINKED_STACK_t[1], *LINKED_STACK; typedef struct{int R;int C;} POS_t[1], *POS; LINKED_STACK stack_init();void stack_free(LINKED_STACK stack);void stack_push(LINKED_STACK stack, void *data);void *stack_pop(LINKED_STACK stack);void *stack_top(LINKED_STACK stack);int is_empty(LINKED_STACK stack); int is_empty(LINKED_STACK stack){return stack->head == NULL;} LINKED_STACK stack_init(){LINKED_STACK stack = (LINKED_STACK)malloc(sizeof(LINKED_STACK_t));if (stack == NULL){printf("\nproblem with initializing stack\n\n");return NULL;}stack->head = NULL;stack->count = 0;return stack;} void stack_free(LINKED_STACK stack){while (is_empty(stack) ==…
given code lab4 #include <stdio.h>#include <stdlib.h> /* typical C boolean set-up */#define TRUE 1#define FALSE 0 typedef struct StackStruct{int* darr; /* pointer to dynamic array */int size; /* amount of space allocated */int inUse; /* top of stack indicator - counts how many values are on the stack */} Stack; void init (Stack* s){s->size = 2;s->darr = (int*) malloc ( sizeof (int) * s->size );s->inUse = 0;} void push (Stack* s, int val){/* QUESTION 7 *//* check if enough space currently on stack and grow if needed */ /* add val onto stack */s->darr[s->inUse] = val;s->inUse = s->inUse + 1;} int isEmpty (Stack* s){if ( s->inUse == 0)return TRUE;elsereturn FALSE;} int top (Stack* s){return ( s->darr[s->inUse-1] );} /* QUESTION 9.1 */void pop (Stack* s){if (isEmpty(s) == FALSE)s->inUse = s->inUse - 1;} void reset (Stack* s){/* Question 10: how to make the stack empty? */ } int main (int argc, char** argv){Stack st1; init (&st1);…
A stack is very useful in situations when data have to be stored and then retrieved in the —- order. A) same B) reverse C) ascending D) descending
solution for subpart 4
Assume class StackType has been defined to implement a stack data structure as discussed in your textbook (you may also use the stack data structure defined in the C++ STL). Write a function that takes a string parameter and determines whether the string contains balanced parentheses. That is, for each left parenthesis (if there is any) there is exactly one matching right parenthesis later in the string and every right parenthesis is preceded by exactly one matching left parenthesis earlier in the string. e.g. abc(c(x)d(e))jh is balanced whereas abc)cd(e)(jh is not. The function algorithm must use a stack data structure to determine whether the string parameter satisfies the condition described above. Edit Format Table 12pt v Paragraph v |BIU A v ev T? WP O words ....
Suppose that you want to create the following program: void copyStack(std::stack<int> &srcStack, std::stack<int> &dstStack); This operation copies the elements of srcStack in the same order onto dstStack. Consider the following statements: Int main() { Std::stack<int> stack1; Std::stack<int> stack2; … copyStack(stack1, stack2); The function copyStack(stack1, stack2); copies the elements of stack1 onto stack2 in the same order. That is, the top element of stack1 is the top element of stack2, and so on. The old contents of stack2 are destroyed and stack1 is unchanged. Note that std::stack<int> is a C++ standard library stack object type. Complete the following program void copyStack(std::stack<int> &srcStack, std::stack<int> &dstStack) { // check if srcStack is empty -> error message is printed and return // remove all the elements of dstStack // create a temporary stack tempStack for…
IN C In this question we get a stack of chars. The implementation is given in a separate file. You should not make assumptions about the exact implementation details.You may only use the following functions to access the stack. typedef struct { // not known } stack_t; // creates a new stack stack_t* stack_create(); // pushes a given item to the stack void stack_push(stack_t* s, char item); // removes the top element from the stack and returns it // Pre condition: stack is not empty char stack_pop(stack_t* s); // checks if the stack is empty bool stack_is_empty(stack_t* s); // frees the stack void stack_free(stack_t* s); a) Write a function that gets a stack of chars and returns the number of elements in it. When the function returns, the stacks must be in their initial state. // returns the size of the stackint stack_size(stack_t* s) b) Write a function that gets two stacks of chars and checks if they are equal (i.e., have the same elements in the same order). When the…
program Linked List: modify the following program to make a node containing data values of int, char, and string. #include <iostream> using namespace std; struct node { int data; struct Node *next; }; struct Node* head = nullptr;//or Null or 0; void insert(int new_data) { struct Node* new_node=(struct Node*) new(struct Node); new_mode->data=new_data; new_mode->next=head; head=new_node; } void display() { struct Node* ptr; ptr=head; while(ptr ! = NULL) { cout<<ptr->data<<""; ptr=ptr->next; } } int main() { insert{2}; display{}; return0; }