Skip to main content

Programming using Java Running case study - Requirement 1 / 6 | State Board of Cricket Council –V1.0 *

 

State Board of Cricket Council –V1.0 *

State Board of Cricket Council

 State Board of Cricket Council (SBCC) is one of the leading cricket selection academies in the state. They are in need of an automated system that should manipulate the player details provided and also find the players who have secured star rating between a specific range from the database.

You being their software consultant have been approached to develop a pilot java application which can be used by the admin for the above mentioned requirement.

UserInterface.java

package com.sbcc.main;
import com.sbcc.model.*;

import java.util.*;
import java.lang.*;

import com.sbcc.skeletonvalidator.SkeletonValidator;

public class UserInterface {
    public static Player pl;

    public static void main(String[] args) {
        // CODE SKELETON - VALIDATION STARTS
        // DO NOT CHANGE THIS CODE

        SkeletonValidator validator = new SkeletonValidator();

        // CODE SKELETON - VALIDATION ENDS

        // Please start your code from here
        Scanner sc = new Scanner(System.in);
        //Player pl=new Player();
        int choice=0;
        while(choice!=3){
            System.out.println("1. Create player\n2. Display player details\n
            3. Exit\nEnter your choice");
            choice=sc.nextInt();
        
            if(choice==1){
                System.out.println("Enter the player id");
                String id=sc.next();
                sc.nextLine();
                System.out.println("Enter the player name");
                String name=sc.nextLine();
                //sc.nextLine();
                System.out.println("Enter the number of matches played");
                int matches = sc.nextInt();
                sc.nextLine();
                System.out.println("Enter the total runs scored");
                int runs=sc.nextInt();
                sc.nextLine();
                System.out.println("Enter the playing zone");
                String zone=sc.nextLine();
                pl = new Player(id,name,matches,runs,zone);
                
            }
            if (choice==2){
                //pl=new Player();
                System.out.println("Player id: "+pl.getPlayerId());
                System.out.println("Player Name: "+pl.getPlayerName());
                System.out.println("Matches Played: "+pl.getMatchesPlayed());
                System.out.println("Total runs scored: "+pl.getRunScored());
                System.out.println("Playing Zone: "+pl.getPlayingZone());
                
            } 
            if(choice==3){
                System.out.println("Thank you for using SBCC application\n");
                System.exit(0);
            }
        }

        
    }

}


Player.java

package com.sbcc.model;



/*The class and methods should be declared as public 
and all the attributes should be declared as private.*/

public class Player {
    private String playerId;
    private String playerName;
    private int matchesPlayed;
    private int runScored;
    private String playingZone;
    
    public Player(String playerIdString playerNameint matchesPlayed,
     int runScoredString playingZone){
        this.playerId=playerId;
        this.playerName=playerName;
        this.matchesPlayed=matchesPlayed;
        this.runScored=runScored;
        this.playingZone=playingZone;
    }
    public Player(){
        //this(playerId, playerName, matchesPlayed, runScored, playingZone);
    }
    
    public void setPlayerId(String playerId){
        this.playerId=playerId;
    }
    public String getPlayerId(){
        return playerId;
    }
    
    public void setPlayerName(String playerName){
        this.playerName=playerName;
    }
    public String getPlayerName(){
        return playerName;
    }
    
    public void setMatchesPlayed(int matchesPlayed){
        this.matchesPlayed=matchesPlayed;
    }
    public int getMatchesPlayed(){
        return matchesPlayed;
    }
    
    public void setRunScored(int runScored){
        this.runScored=runScored;
    }
    public int getRunScored(){
        return runScored;
    }
    
    public void setPlayingZone(String playingZone){
        this.playingZone=playingZone;
    }
    public String getPlayingZone(){
        return playingZone;
    }

    // Include all attributes, getters, setters and constructors 
    as specified in the requirement document
    
        
}



Comments

Must Read:

Climb Stairs With Variable Jumps

 1. You are given a number n, representing the number of stairs in a staircase. 2. You are on the 0th step and are required to climb to the top. 3. You are given n numbers, where ith element's value represents - till how far from the step you       could jump to in a single move.        You can of course jump fewer number of steps in the move. 4. You are required to print the number of different paths via which you can climb to the top. Input Format A number n .. n more elements Output Format A number representing the number of ways to climb the stairs from 0 to top. Constraints 0 <= n <= 20 0 <= n1, n2, .. <= 20 Sample Input 10 3 3 0 2 1 2 4 2 0 0 Sample Output 5 Solution: import java.io.*; import java.util.*; public class Main {     public static void main(String[] args) throws Exception {         // write your code here         Scanner sc = new Scanner(System.in);   ...

Data Formats ( XML & JSON ) XML AND JSON XML AND JSON | Quiz 1

Data Formats ( XML & JSON )  XML AND JSON  XML AND JSON Quiz 1  

RDBMS Data Definition Language | Alter - Add CHECK constraint to Mobile_Master

RDBMS  Data Definition Language  Alter - Add CHECK constraint to Mobile_Master Refer the following schema and add a constraint CHK_WARRANTY in Mobile_Master table to ensure that the warranty in years is greater than zero. Evaluation Result: Result Description Summary of tests +------------------------------+ | 3 tests run / 3 test passed | +------------------------------+

Zig Zag Pattern

  /* @ToDo     Zig Zag Pattern         *               *                *       *       *       *        *               *               *        */ #include   <iostream> using   namespace   std ; int   main (){       #ifndef  ONLINE_JUDGE          freopen ( "../asset/input.txt" , "r" , stdin );          freopen (...

RDBMS Data Definition Language | Create Buses table

 efer the below schema and create the buses table. Column Name Datatype Size Constraint Constraint name Bus_no Number 11 Primary key PK_BUSES Bus_name Varchar2 20   Type Varchar2 20   Total_seats Number 11   Avail_seats Number 11     Result Description Summary of tests +------------------------------+ | 3 tests run / 3 test passed | +------------------------------+

RDBMS Data Definition Language | Create Distributor table

  Write a query to create Distributor table with constraints mentioned.  Refer the below schema  Result Description Summary of tests +------------------------------+ | 3 tests run / 3 test passed | +------------------------------+

Zero One Knapsack | Recursion

 1. You are given a number n, representing the count of items. 2. You are given n numbers, representing the values of n items. 3. You are given n numbers, representing the weights of n items. 3. You are given a number "cap", which is the capacity of a bag you've. 4. You are required to calculate and print the maximum value that can be created in the bag without       overflowing it's capacity. Note: Each item can be taken 0 or 1 number of times. You are not allowed to put the same item again and again. Input Format A number n v1 v2 .. n number of elements w1 w2 .. n number of elements A number cap Output Format A number representing the maximum value that can be created in the bag without overflowing it's capacity Constraints 1 <= n <= 20 0 <= v1, v2, .. n elements <= 50 0 < w1, w2, .. n elements <= 10 0 < cap <= 10 Sample Input 5 15 14 10 45 30 2 5 1 3 4 7 Sample Output 75 Solution: import java.io.*; import java.util.*; public class Main...

Coin Change Permutations

 1. You are given a number n, representing the count of coins. 2. You are given n numbers, representing the denominations of n coins. 3. You are given a number "amt". 4. You are required to calculate and print the number of permutations of the n coins using which the       amount "amt" can be paid. Note 1: You have an infinite supply of each coin denomination i.e. same coin denomination can be                    used for many installments in payment of "amt" Note 2: You are required to find the count of permutations and not combinations i.e.                   2 + 2 + 3 = 7 and 2 + 3 + 2 = 7 and 3 + 2 + 2 = 7 are different permutations of same                    combination. You should treat them as 3 and not 1. Input Format A number n n1 n2 .. n number of elements A number amt Output Format A number representing the cou...

Accenture Mock Quiz | Part 1

Question  1 Incorrect Marked out of 1.00 Remove flag Question text Select the true statement ? Select one: a.  Inheritance forms a is-a part of relationship between classes.   b.  Aggregation is the stronger form of Inheritance. c.  Aggregation forms the is-a type of relationship between classes. d.  Aggregation forms a is-a part of relationship between classes. Composition is the stronger form of Aggregation. Feedback The correct answer is: Aggregation forms a is-a part of relationship between classes. Composition is the stronger form of Aggregation. Question  2 Correct Marked out of 1.00 Flag question Question text What is the diagram that depicts the interaction between objects by arranging the objects in time sequence ? Select one: a.  Use Case Diagram b.  Sequence Diagram   c.  Component Diagram d.  Activity Diagram Feedback The correct answer is: Sequence Diagram Question  3 Incorrect Marked out of 1.00 Flag question...

Subscribe to Get's Answer by Email