1- given the definition of the class 'StackArray' to implement a stack using arrays. Complete the implementation of methods- push, pop, and peek. public class StackArray { int[] s=new int[5]; int top=-1; public boolean isempty( ){ return top == -1; } public boolean isfull( ){ return top == s.length-1; } public void push(int e) { } public int pop( ) { } public int peek( ) { } } 2- Write Java code to: a: Create a Deque object containing all integers from 1 to 20. b: Display the front and rear elements c: Display all elements in reverse order.

1- given the definition of the class 'StackArray' to implement a stack using arrays. Complete the implementation of methods- push, pop, and peek. public class StackArray { int[] s=new int[5]; int top=-1; public boolean isempty( ){ return top == -1; } public boolean isfull( ){ return top == s.length-1; } public void push(int e) { } public int pop( ) { } public int peek( ) { } } 2- Write Java code to: a: Create a Deque object containing all integers from 1 to 20. b: Display the front and rear elements c: Display all elements in reverse order.

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 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.
Book: Java Software Structures Author: John Lewis; Joe Chase Javascript 1. Create a generic type java interface StackADT<T>with the following methods: a.public void push(T element);//Push an element at the top of a stack b.public T pop();//Remove and return an element from the top of a stack c.public T peek();//return the top element without removing it d.public booleanisEmpty();//Return True if a stack is emptye.public int size();//Return the number of elements in a stack f.public String toString();//Print all the elements of a stack 2. Define ArrayStack<T>class which will implementStackADT<T>interface 3. Use your ArrayStack<T>class to compute a postfix expression, for instance, 3 4 * will yield12;3 4 6 + *will yield 30 etc. During computing a postfix expression: a.While you perform a push operation, if the stack is full, generate an exception b.While you perform a pop operation, if the stack is empty, generate an exception c.If two operands are not available…
Consider the following class: 1. public class Example 2. { 3. public void addPair(String a, String b) 4. { 5. ArrayList<String> list = new ArrayList<>(); 6. 7. list.add(a); 8. list.add(b); 9 . 10. //Stack and Heap at this point 11. } 12. } Draw the Stack and Heap Diagram at the indicated point, after the call addPair("Lugano","Zurich") for a previously created object of type Example.
please convert this into c++ import java.util.Iterator;import java.util.NoSuchElementException; public class Queue<Item> implements Iterable<Item> { private int n; // number of elements on queue private Node first; // beginning of queue private Node last; // end of queue // helper linked list class private class Node { private Item item; private Node next; } /** * Initializes an empty queue. */ public Queue() { first = null; last = null; n = 0; } /** * Returns true if this queue is empty. * * @return {@code true} if this queue is empty; {@code false} otherwise */ public boolean isEmpty() { return first == null; } /** * Returns the number of items in this queue. * * @return the number of items in this queue */ public int size() { return n; } /** * Returns the number of items in this queue. * * @return the…
Implement the array based sorted integer list below in ascending order. class myList{ // sorted integer list class int *ptr; // storage body int size; // storage size int length; // length of list public: myList(int); // constructor ~myList(){free(ptr);} // destructor bool empty(){return length==0;} // empty or not bool full(){return length==size;} // full or not int length(){return length;} // get length void insert(int); // insert a value in ascending order int get();…
Modify the Java class for the abstract stack type shown belowto use a linked list representation and test it with the same code thatappears in this chapter. class StackClass {private int [] stackRef;private int maxLen,topIndex;public StackClass() { // A constructorstackRef = new int [100];maxLen = 99;topIndex = -1;}public void push(int number) {if (topIndex == maxLen)System.out.println("Error in push–stack is full");else stackRef[++topIndex] = number;}public void pop() {if (empty())System.out.println("Error in pop–stack is empty"); else --topIndex;}public int top() {if (empty()) {System.out.println("Error in top–stack is empty");return 9999;}elsereturn (stackRef[topIndex]);}public boolean empty() {return (topIndex == -1);}}An example class that uses StackClass follows:public class TstStack {public static void main(String[] args) {StackClass myStack = new StackClass();myStack.push(42);myStack.push(29);System.out.println("29 is: " + myStack.top());myStack.pop();System.out.println("42 is:…
don't use others answers java 1. Write a generic static method that takes a Stack of any type element as a parameter, pops each element from the stack, and prints it. It should have a type parameter that represents the Stack’s element type.
Define a stack class called DLStack, in such a way that it can store any type of data. All data in a DLStack must be stored in a DoublyLinkedList instance. Implement the following member methods: push – Pushes a new element into the stack. pop – Removes the top element from the stack. top – Retrieves the top element from the stack. IsEmpty – Returns true if the stack is empty, and false otherwise. Note: These operations should add or remove the element from the head of the DoublyLinkedList instance. Q1) Implement the following non-member function which reverses a given string. String reversal must be done using stack-based logic. void ReverseString(string &); Q2) Implement the following function which determines whether a given string is the reverse of the second one; for example “test string” is the reverse of “gnirts tset”. Reverse detection must be done using stack-based logic. bool IsReverse(const string &, const string &);…
java program: Implement generic class ArrayStack as discussed in the lectures having following methods: constructor, push, pop, peek, isEmpty, copy constructor, reallocate (private method). Also add following methods to this class: size: returns number of elements in the stack. contains: Search an element in the stack. If found returns true, else returns false. clear: Deletes all elements of the stack and make it empty stack. Implement generic class ArrayQueue as discussed in the lectures having following methods: constructor, copy constructor, offer, poll, peek, isEmpty, reallocate(private), iterator. Inner class Iter that implements interface Iterator having methods: constructor, hasNext, next. Also add following methods to the ArrayQueue class: size: returns number of elements in the queue. contains: Search an element in the stack. If found returns true, else returns false. clear: Deletes all elements of the stack and make it empty stack. Write a class called PalindromeChecker…
java: Implement the class Node public class Node { private char data; private Node nextNode; //implements default constructor //implements parameterize constructor take integer as input in parameter a assign that integer to data and assign null to nextNode //implement setters and getters } Implement the class Stack having one member having type Node public class Stack { private Node top; public void push (); public Node pop (); public Boolean isEmpty(); return true if stack is empty // implements all its function and write time complexity of its function
Java 1. Implement ArrayUnorderedList<T> class which will extend ArrayList<T> by defining the following additional methods(i) public void addToFront(T element); //Adds the specified element to the front of the list.(ii) public void addToRear(T element); //Adds the specified element to the rear of the list.(iii) public void addAfter(T element, T target); //Adds the specified element after the specified target element.a. Create an object of ArrayUnorderedList<T> class and perform some add, remove, and search operations and finally print the entire Stack.
Java programming Please implement the Book search(Object e). This method returns the object being search if not found return null Initial code to be completed: public class CollectionBooks { private ArrayList<Book> books; public CollectionBooks() { books = new ArrayList<Book>(); } public void add(String book,int bookId) { Book b=new Book(book,bookId); books.add(b); } public void printAll() { for(Book b:books){ System.out.println("Book Id: "+b.getId()); System.out.println("Book Name: "+b.getName()); } } public int count(){ return books.size(); } public Book search(Object e){ //your code here } public void remove(int index) { books.remove(index); }}