Capgemini ADAPT 2022 - StackException Problem Solution using Java
Capgemini ADAPT 2022 - StackException Problem Solution using Java

In this post, we will try to give a solution to an important problem of Capgemini ADAPT 2022. The solution to the Problem is – StackException Problem Solution using Java.

However, the solutions are provided for learning purposes only. Candidates must submit their own code during attending the Sprints.

StackException Problem Description – Capgemini ADAPT:


Create a class UserStack, the class should have an integer array of size 10 declared within it.

The class should have the following methods:

  1. push(int data) to add the data to the array, if the array is full the method should throw FullStackException and pass the relevant message to the constructor.
  2. pop() which removes the last int from the array and returns the same, if the array is empty the method should throw EmptyStackException and pass the relevant message to the constructor.
  3. display() which displays the contents of the array and if the array is empty the method should throw EmptyStackException and pass the relevant message to the constructor.

StackException Problem Solution:


import java.io.*;

import java.util.*;

import java.text.*;

import java.math.*;

import java.util.regex.*;

 

public class Source {

public static void main(String args[]) throws Exception {

Scanner sc = new Scanner (System.in);

UserStack us = new UserStack();

int c = sc.nextInt();

try{

if(c==1)

{

while (sc.hasNext()){

int data = sc.nextInt();

us.push(data);

}

}

else if(c == 2){

while(sc.hasNext()){

int data1 = sc.nextInt();

us.push(data1);

}

us.diplay();

for(int i = 0; i < 10; i++)

us.pop();

}

}catch(FullStackException e){

System.out.print(e.getMessage());

}

catch(EmptyStackException e){

System.out.println(e.getMessage());

}

}

}

class UserStack{

public UserStack(){};

int aray1[] = new int[10];

public static int index = 0;

public void push(int data) throws FullStackException{

if(index==9)

throw new FullStackException(“Stack overflow”);

array1[index] = data;

index++;

}

public int pop() throws EmptyStackException

{

if(index == 0)

throw new EmptyStackException(“Stack empty”);

return array1[–index];

}

public void display(){

for(int i = 0; i < index; i++)

System.out.println(array1[i]);

}

}

class EmptyStackException extends Exception{

public EmptyStackException(String message){

super(message);

}

}

class FullStackException extends Exception{

public FullStackException(String msg){

super(msg);

}

}


Top Companies + Batchwise Hiring Drive:


TOP COMPANIES HIRING DRIVEBATCHWISE HIRING DRIVES
1. TCS OFF-CAMPUS DRIVES1. 2018 BATCH
2. INFOSYS OFF-CAMPUS DRIVES2. 2019 BATCH
3. COGNIZANT OFF-CAMPUS DRIVES3. 2020 BATCH
4. WIPRO OFF-CAMPUS DRIVES4. 2021 BATCH
5. CAPGEMINI OFF-CAMPUS DRIVES5. 2022 BATCH

To Stay Up-to-date, Follow us on Social Media:


1.      Join our Telegram Channel:Click Here
2.      Like us on Facebook:Click Here
3.      Follow us on Instagram:Click Here
4.      Follow us on LinkedIn:Click Here
5.      Follow us on Google News:Click Here

ADAPT Different Coding Solutions:


  1. Largest Array Solution – Click Here
  2. Batsman & Bowler Solution – Click Here
  3. Instruments Problem Solution – Click Here
  4. Check Two Person Are Same – Click Here
  5. Medicine App ADAPT Solution – Click Here
  6. String Combination Capgemini ADAPT Solution – Click Here
  7. Remove” X”inString Problem Solution – Click Here
  8. Customer and Invoice ADAPT Problem Solution – Click Here
  9. Book and Author Problem Solution – Click Here
  10. Highest Feedback Problem Solution – Click Here
  11. Registered Customer Problem Solution in Java – Click Here
  12. Product of Digits Problem Solution – Click Here
  13. Change Using Minimal Coins/Notes Solution in Java – Click Here
  14. Contact App 2.0 Problem Solutions using Java – Click Here
  15. Count Character Frequency Problem Solution using Java – Click Here

Capgemini ADAPT Sprint 1 (Bus Reservation Solutions):


  • 1. Capgemini ADAPT Sprint 1 Bus Reservation System – DisplayCustomerInAscendingOrder Problem Solution
  • 2. Capgemini ADAPT Sprint 1 Bus Reservation System – DisplayCustomerByFirstName Problem Solution
  • 3. Capgemini ADAPT Sprint 1 Bus Reservation System – SortByCustomerId Problem Solution
  • 4. Capgemini ADAPT Sprint 1 Solution Java | LSAByCustomerName Problem Solution
  • 5. Capgemini ADAPT Sprint 1 Case Study Solution Java | BSAByCustomerId Problem Solution

Capgemini ADAPT Sprint 2 (Bus Reservation System):


  • 1. Capgemini ADAPT Sprint 2 Case Study (Bus Reservation System) Solution | HAS-A-Relationship Solution Java
  • 2. Capgemini ADAPT Sprint 2 Case Study (Bus Reservation System) Solution OOPs-Para-Constructor Java
  • 3. Capgemini ADAPT Sprint 2 Bus Reservation System (CRUDOperations) Problem Solution

ADAPT Sprint 3 Solutions – Capgemini (Toy Rental A):


Online Shopping A Solutions Using Java:


  • 1. Capgemini ADAPT 2022 Online Shopping A – Display Products Solution using JAVA – Click Here
  • 2. Capgemini ADAPT 2022 Online Shopping A – Products by Category Solution using JAVA – Click Here
  • 3. Capgemini ADAPT 2022 Online Shopping A – Customer Array Solution using JAVA – Click Here
  • 4. Capgemini ADAPT 2022 Online Shopping A – Search Customers by Name Solution using JAVA – Click Here
  • 5. Capgemini ADAPT 2022 Online Shopping A – Search Customers by City Solution using JAVA – Click Here
  • 6. Online Shopping A – Customer & Address Class Solution | Capgemini ADAPT 2022 Solutions – Click Here