5.2. Understand how to use adapter design pattern to implement the Stack, Queue and Deque by using LinkedList.Example: Suppose we have defined singly linked list class and stack interface, please define a linkedstack by implementing stack interface and using linked list class.Stack Methodsize()isEmpty()push(e)pop()top()Singly Linked List Methodlist.size()list.isEmpty()list.addFirst(e)list.removeFirst()list.first()1 public class LinkedStack implements Stack {private SinglyLinked List list = new SinglyLinked List<>(); // an empty listpublic LinkedStack() { }// new stack relies on the initially empty listpublic int size() { return list.size(); }public boolean isEmpty() { return list.isEmpty(); }public void push(E element) { list.addFirst(element); }public E top() { return list.first(); }public E pop() { return list.removeFirst(); }789}

Algorithm:Create a singly linked list (SinglyLinkedList) with methods for size, isEmpty, addFirst,…

5.2. Understand how to use adapter design pattern to implement the Stack, Queue and Deque by using Linked List. Example: Suppose we have defined singly linked list class and stack interface, please define a linked stack by implementing stack interface and using linked list class. Stack Method size() isEmpty() push(e) pop() top() 6 Singly Linked List Method list.size() 8 9} list.isEmpty() list.addFirst(e) list.removeFirst() list.first() public class LinkedStack implements Stack { private SinglyLinked List list = new SinglyLinked List<>(); // an empty list public LinkedStack() { } // new stack relies on the initially empty list public int size() { return list.size(); } public boolean isEmpty() { return list.isEmpty(); } public void push(E element) { list.addFirst(element); } public E top() { return list.first(); } public E pop() { return list.removeFirst(); }

5.2. Understand how to use adapter design pattern to implement the Stack, Queue and Deque by using Linked List. Example: Suppose we have defined singly linked list class and stack interface, please define a linked stack by implementing stack interface and using linked list class. Stack Method size() isEmpty() push(e) pop() top() 6 Singly Linked List Method list.size() 8 9} list.isEmpty() list.addFirst(e) list.removeFirst() list.first() public class LinkedStack implements Stack { private SinglyLinked List list = new SinglyLinked List<>(); // an empty list public LinkedStack() { } // new stack relies on the initially empty list public int size() { return list.size(); } public boolean isEmpty() { return list.isEmpty(); } public void push(E element) { list.addFirst(element); } public E top() { return list.first(); } public E pop() { return list.removeFirst(); }

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

Java Program: please choose an aswer:
One linear structure could be more applicable than another. (A) Can a Stack be used to implement a Queue? How complicated are the Queue operations individually? (b) Can a Stack be implemented using a Queue? What level of complexity do the different Stack techniques have?
Simple JAVA queue code implementation please help for any part, please be clear, thank you Given an interface for Queue- Without using the java collections interface (ie do not import java.util.List,LinkedList, Stack, Queue...)- Create an implementation of Queue interface provided- For the implementation create a tester to verify the implementation of thatdata structure performs as expected Wait in line – Queue (fifo)- Implement the provided Queue interface ( fill out the implementation shell)- Put your implementation through its paces by exercising each of the methods ina test harness- Add to your ‘BusClient’ the following functionality using your Queue-o Create (enqueue) 6 riders by name§ Iterate over the queue, print all riderso Peek at the queue / print the resulto Remove (dequeue) the head of the queue§ Iterate over the queue, print all riderso Add two more riders to the queueo Peek at the queue & print the resulto Remove the head & print the result§ Iterate over the…
Describe the variations between the restricted and unbounded stack implementations.
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…
solution for subpart 3
Alert dont submit AI generated answer.
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…