int pop(struct stack *ps) {----- X;if (ps->top== -1) {printf("--exit(1);}else {}X =ps->top}return x;}void push(struct stack *ps, int x){if (ps->top == STACKSIZE - 1) {}printf(".exit(1);}else {ps->top = ps->--while (}void insert(node* head, int x) {node *p = (NODEPTR) malloc(sizeof(struct node));p->data = x;p->next = NULL;node *cur head;---) {if (cur->next == NULL){}x;break;-");-"); Question1) Push five integer values into a stack.2) Pop all values from the stack then store the popped values in a linked list and print iton the screen. However, some parts of the code are missing (indicated byThe following code implements the following:Complete the missing parts.#define STACKSIZE 5struct stack{int items [STACKSIZE];_top;};struct node {int data;_next;};typedef struct node*void push(struct stack, int);int pop(struct stack *);void insert(node *head, int);int main(void) {s.top=for (int i = 0; i < 5; i++){int num;printf("Enter a Number \n");scanf (%d, &num);push(--s;}int x = pop(------);printf("First value is deleted \n");head->next =node *head = (NODEPTR) malloc(sizeof(struct node));;head->data = x;➖➖➖➖➖➖}return 0;}//end of mainfor (int i = 1; i < 5; i++){x = pop (------);insert (head, x);printf("%d is deleted \n", x););Page 2 of 5

Question 1) Push five integer values into a stack. 2) Pop all values from the stack then store the popped values in a linked list and print it on the screen. However, some parts of the code are missing (indicated by Complete the missing parts. #define STACKSIZE 5 struct stack { The following code implements the following: int items [STACKSIZE]; _top; }; struct node { int data; _next; }; typedef struct node* void push(struct stack, int); int pop(struct stack *); void insert(node *head, int); int main(void) { s.top= for (int i = 0; i < 5; i++) { int num; printf("Enter a Number \n"); scanf (%d, &num); push(- } int x = pop(----------➖➖➖➖➖➖➖); printf("First value is deleted \n"); node *head = (NODEPTR) malloc(sizeof(struct node));; head->data = x; head->next = -------- for (int i = 1; i < 5; i++) { x = pop (- ); insert (head, x); printf("%d is deleted \n", x); } return 0; }//end of main );

Question 1) Push five integer values into a stack. 2) Pop all values from the stack then store the popped values in a linked list and print it on the screen. However, some parts of the code are missing (indicated by Complete the missing parts. #define STACKSIZE 5 struct stack { The following code implements the following: int items [STACKSIZE]; _top; }; struct node { int data; _next; }; typedef struct node* void push(struct stack, int); int pop(struct stack ); void insert(node head, int); int main(void) { s.top= for (int i = 0; i < 5; i++) { int num; printf("Enter a Number \n"); scanf (%d, &num); push(- } int x = pop(----------➖➖➖➖➖➖➖); printf("First value is deleted \n"); node *head = (NODEPTR) malloc(sizeof(struct node));; head->data = x; head->next = -------- for (int i = 1; i < 5; i++) { x = pop (- ); insert (head, x); printf("%d is deleted \n", x); } return 0; }//end of main );

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

TOPICS: LIST/STACK/QUEUE Write a complete Java program about Appointment schedule(anything). Your program must implements the linked list The program should have the following basic operations of list, which are: a) Add first, in between and last b) Delete first, in between and last c) Display all data The program should be an interactive program that allow user to choose type of operation.
Multiple choice in data structures void doo(node<int>*root){ if(root !=0) { node<int>*p=root; while(root->next!=0) root=root->next; p->data=root->data; } What is this code do? a. swap the first item with the last item in the linked list b. set the first item in the linked list as the last item c. doesn't do anything because the root parameter is passed by value d. change the root item in the binary tree with the farthest leaf item
C# Reverse the stack - This procedure will reverse the order of items in the stack. This one may NOT break the rules of the stack. HINTS: Make use of more stacks. Arrays passed as parameters are NOT copies. Remember, this is a procedure, not a function. public void ReverseStack(){ }
Stack: Stacks are a type of container with LIFO (Last In First Out) type of working, where a new element is added at one end and (top) an element is removed from that end only. Your Stack should not be of the fixed sized. It should be able to grow itself. So using the class made in task 1, make a class named as Stack, having following additional functionalities: bool empty() : Returns whether the Stack is empty or not. Time Complexity should be: O(1) bool full() : Returns whether the Stack is full or not. Time Complexity should be: O(1)int size() : Returns the current size of the Stack. Time Complexity should be: O(1)Type top () : Returns the last element of the Stack. Time Complexity should be: O(1) void push(Type) : Adds the element of type Type at the top of the stack. Time Complexity should be: O(1) Type pop() : Deletes the top most element of the stack and returns it. Time Complexity should be: O(1) Write non-parameterized constructor for the above class. Write Copy…
Activity no. 24 Description: This activity is to implement Stack in Linked List. Required Materials: 1. Computer set or Laptop Required Time: as specified Procedure: Create a program that will do the following: 1. Push to stack numbers in a list. 2. Pop the last number you push to the list. 3. Display the top element. Required Output: 1. Source Code 2. Program Output 3. Draw the flow of data you created.
C# Reverse the stack - This procedure will reverse the order of items in the stack. This one may NOT break the rules of the stack. HINTS: Make use of more stacks. Arrays passed as parameters are NOT copies. Remember, this is a procedure, not a function. This would occur in the NumberStack class, not the main class. These are the provided variables: private int [] stack;private int size; Create a method that will reverse the stack when put into the main class.
3- Write a program that randomly generates 10 numbers (between 1 and 8), inserts into queue and then finds how many distinct elements exist in the queue. Example 1: Example 2: Queue: 2 40 3 3 2 18 4 18 18 3 Queue: 1 1 4 33 16 16 4 16 4 Output: 5 Output: 4 Notes: • You must use ONLY queue data structure. Don't use other different data structures like string or normal (pure) array or stack or array list. • Don't write any other method in the Qeueu class. All methods must be written in the main program.
10 - final question If you create a new empty stack and push the values 1, 2, and 3 in that order, and call pop on the stack once, Which value will be returned? а. 1 b. 2 С. 3
When a stack is created, what are the initial values in the elements array?
2-) In a double linked list, the structure of a node is defined as follows: struct node { int employeeNo; char name[20]; struct node *next; structnode *prev; }node; the nodes in the list are sorted according to employeeNo in ascending order (from smaller to larger ). Write a function to insert a node with a given name and employeeNo into the list so that the list will remain the sorted. employeeNo değerine göre kiüçükten büyüğe sıralanmış bir çift bağlı liste olsun. Verilen bir isim ve employeeNo değerine sahip düğümü listeye sıra bozulmayacak şekilde ekleyen bir fonksyion yazınız.
C++ ProgrammingActivity: Queue Linked List Explain the flow of the code not necessarily every line, as long as you explain what the important parts of the code do. The code is already correct, just explain the flow. SEE ATTACHED PHOTO FOR THE PROBLEM #include "queue.h" #include "linkedlist.h" class SLLQueue : public Queue { LinkedList* list; public: SLLQueue() { list = new LinkedList(); } void enqueue(int e) { list->addTail(e); return; } int dequeue() { int elem; elem = list->removeHead(); return elem; } int first() { int elem; elem = list->get(1); return elem;; } int size() { return list->size(); } bool isEmpty() { return list->isEmpty(); } int collect(int max) { int sum = 0; while(first() != 0) { if(sum + first() <= max) { sum += first();…
15 - final question When you call pop on a stack, the element is removed from the stack relative to the other elements. а. Тор b. Bottom