2. Based on the class structure below: import java.util.Stack; public class StackDemo3 { public static void main(String [) args) { Stack stackOfCards = new Stack<>(); stackofCards.push ("Jack"); stackofCards.push ("Queen"); stackofCards.push("King"); stackofCards.push ("Ace"); } By using the above class definition, write a program statement for each of the following operations. a) Check if the Stack is empty b) Find the size of Stack c) Search for an element. The search() method returns the 1-based position of the element from the top of the stack. It returns -1 if the element was not found in the stack.

2. Based on the class structure below: import java.util.Stack; public class StackDemo3 { public static void main(String [) args) { Stack stackOfCards = new Stack<>(); stackofCards.push ("Jack"); stackofCards.push ("Queen"); stackofCards.push("King"); stackofCards.push ("Ace"); } By using the above class definition, write a program statement for each of the following operations. a) Check if the Stack is empty b) Find the size of Stack c) Search for an element. The search() method returns the 1-based position of the element from the top of the stack. It returns -1 if the element was not found in the stack.

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

const int MAX = 10000; class enum errorCode (underflow, overflow, success); class Stack ( public: Stack () ({ count = 0; } errorCode top(int &) const; errorCode pop (); errorCode push (int) const; private: int count; on int entry[MAX]; Write the following functions that do not belong to the class: (a) Function int size(Stack &s) leaves the Stack s unchanged and returns a count of the number of entries in the Stack, (b) Function void deleteAll(Stack &s, stackEntry x) deletes all occurrences (if any) of x from s and leaves the remaining entries in s in the same relative order.
Array-Based Stack: a JavaImplementation
Evaluate the following statement using stack : t = power ( 2,3 ) ; Where power( ) defined as follows : int power ( int b , int h ) { int y ; if ( h == 0 ) return 1 ; else { y = power( b , h-1 ); return b*y ; } }
Stack:#ifndef STACKTYPE_H_INCLUDED#define STACKTYPE_H_INCLUDEDconst int MAX_ITEMS = 5;class FullStack// Exception class thrown// by Push when stack is full.{};class EmptyStack// Exception class thrown// by Pop and Top when stack is emtpy.{};template <class ItemType>class StackType{public:StackType();bool IsFull();bool IsEmpty();void Push(ItemType);void Pop();ItemType Top();private:int top;ItemType items[MAX_ITEMS];};#endif // STACKTYPE_H_INCLUDED Queue:#ifndef QUETYPE_H_INCLUDED#define QUETYPE_H_INCLUDEDtemplate<class T>class QueType{public:QueType();QueType(int);~QueType();void MakeEmpty();bool IsEmpty();bool IsFull();void Enqueue(T);void Dequeue(T&);T Front();private:int front;int rear;T *info;int maxQue;};#endif // QUETYPE_H_INCLUDED
Multiple choice in data structures void stack::do(){ for(int i=0li<=topindex/2;i++){ T temp=entry[i]; entry[i]=entry[topindex-i-1]; entry[topindex-1-i]=temp;} } What is this method do? a. swap the first item with last item b. replace each item with next item value c. doesn't do any thing d. reverse the stack
Question3. Using the Stack class implemented in JAVA, write a JAVA code to do the following: a. Create an array of integers containing the following elements: 5, -1, 7,8,9,4,15 b. Create an empty stack (call it nums) and push all the array elements onto the stack. c. Using a temporary stack to reverse the content of the stack nums then print it. d. Display all odd elements from the stack nums.
A Stack is a data structure for storing a list of elements in a LIFO (last in, first out) fashion. Design a class called Stack with three methods. void Push(object obj)object Pop()void Clear() We should be able to use this stack class as follows:var stack = new Stack();stack.Push(1);stack.Push(2);stack.Push(3);Console.WriteLine(stack.Pop());Console.WriteLine(stack.Pop());Console.WriteLine(stack.Pop()); The output should be 3, 2, 1
Problem 2: Assume that the methods push(), pop() and isEmpty() methods are defined as they should be in a Stack class. Assume further that the Stack class has a no argument constructor. Write a method that uses the constructor and the methods push(), pop() and isEmpty() for removing and returning the bottom element of a given stack. Note: make sure that you don't include unnecessary spaces in your answers! public T popBottom(Stack stack) { Stack tempStack = new Stack(); Tx = null; if (!stack.isEmpty()) { x = stack.pop(); } while (!stack.isEmpty()) { #04 ; x = stack.pop(); } while (!tempStack.isEmpty()) { #05 ; } return x; }
Step1: Write Stack Java Interface Step 2: Create an ArrayStack class that implements the interface methods
Question 2 You have been provided with the following elements 10 20 30 40 50 ● . ● ● Write a Java program in NetBeans that creates a Stack. Your Java program must use the methods in the Stack class to do the following: Add the above elements into the Stack Display all the elements in the Stack Get the top element of the Stack and display it to the user i. ii. iii.
Working with Stacks 1. Create a method on the Stack class that determines whether a given value occurs consecutively in the stack. bool Stack::isConsecutive( const T & data ) const; Example: isConsecutive(…) function Result Stack isConsecutive (5) true top->(1) (1) (5) (3) (5) (5) (2) isConsecutive (3) false top->(1) (1) (5) (3) (5) (5) (5) (2) 2. Create a method on the Stack class that reverses the values on the stack. void Stack::reverse(); Example: reverse() function Stack original Result: Stack reversed reverse () top->(1) (1) (5) (3) (5) (5) (2) top->(2) (5) (5) (3) (5) (1) (1) reverse () top->(1) (1) (5) (3) (5) (5) (5) (2) top->(2) (5) (5) (5) (3) (5) (1) (1)
Suppose we want to create a stack class that can store objects of any Java class. What would be the best technique to use? Make Stack a generic class: public class Stack O Use overloaded methods Use a generic method Create a static method Create different versions of the Stack class for each object type