Skip to main content

Programming using Java Hands On - Control Structures | Highest Placement

 

Highest Placement

SRV college wants to recognize the department which has succeeded in getting the maximum number of placements for this academic year. The departments that have participated in the recruitment drive are CSE,ECE, MECH. Help the college find the department getting maximum placements. Check for all the possible output given in the sample snapshot

Note : If any input is negative, the output should be "Input is invalid".  If all department has equal number of placements, the output should be "None of the department has got the highest placement".

Sample Input 1:

Enter the no of students placed in CSE:90
Enter the no of students placed in ECE:45
Enter the no of students placed in MECH:70
Sample Output 1:
Highest placement
CSE

Sample Input 2:
Enter the no of students placed in CSE:55
Enter the no of students placed in ECE:85
Enter the no of students placed in MECH:85
Sample Output 2:
Highest placement
ECE
MECH

Sample Input 3:
Enter the no of students placed in CSE:0
Enter the no of students placed in ECE:0
Enter the no of students placed in MECH:0
Sample Output 3:
None of the department has got the highest placement


Sample Input 4:
Enter the no of students placed in CSE:10
Enter the no of students placed in ECE:-50
Enter the no of students placed in MECH:40
Sample Output 4:
Input is Invalid 


Highest Placement SRV college wants to recognize the department which has succeeded in getting the maximum number of placements for this academic year. The departments that have participated in the recruitment drive are CSE,ECE, MECH. Help the college find the department getting maximum placements. Check for all the possible output given in the sample snapshot Note : If any input is negative, the output should be "Input is invalid". If all department has equal number of placements, the output should be "None of the department has got the highest placement". Sample Input 1: Enter the no of students placed in CSE:90 Enter the no of students placed in ECE:45 Enter the no of students placed in MECH:70 Sample Output 1: Highest placement CSE Sample Input 2: Enter the no of students placed in CSE:55 Enter the no of students placed in ECE:85 Enter the no of students placed in MECH:85 Sample Output 2: Highest placement ECE MECH Sample Input 3: Enter the no of students placed in CSE:0 Enter the no of students placed in ECE:0 Enter the no of students placed in MECH:0 Sample Output 3: None of the department has got the highest placement Sample Input 4: Enter the no of students placed in CSE:10 Enter the no of students placed in ECE:-50 Enter the no of students placed in MECH:40 Sample Output 4: Input is Invalid

 
Result Description
Summary of tests
 *Note: All the test cases might not have same weightage
+------------------------------+
|  7 tests run/ 7 tests passed |
+------------------------------+

Labels:

Comments

Post a Comment

Popular posts from this blog

Display of Provisional Answer Keys and Question Paper with Recorded Responses for Answer Key Challenge | JEE (Main) 2021 Session 4 for Paper 1 (B.E./B.Tech.)

The JEE (Main) - 2021 Session - 4 was conducted throughout the country and abroad on 26, 27, 31 August and 1 September 2021 for Paper 1 (B.E./B.Tech.) in the Computer Based Test (CBT) mode. The National Testing Agency has uploaded the Provisional Answer Keys for Paper 1 (B.E./B.Tech.) along with the Question Paper with Recorded Responses on the website https://jeemain.nta.nic.in for candidates to challenge. The procedure (as enclosed) for the challenge of Answer Key may be used. The candidates, who are not satisfied with the answer key, may challenge the same by paying a fee of ₹ 200/- (Rupees Two Hundred only) per question challenged as a non-refundable processing fee. This facility is available from 06 September 2021 to 08 September 2021 (up to 10:00 A.M.). The payment of the processing fee may be made through, Debit card/Credit Card/Net Banking/Paytm upto 08 September 2021 (upto 11:00 A.M.). No challenge will be entertained without receipt of the processing fee. The Challenges will ...
Post a Comment
Read more

Print Permutations

 1. You are given a string str. 2. Complete the body of printPermutations function - without changing signature - to calculate and print all permutations of str. Use sample input and output to take idea about permutations. Note -> The online judge can't force you to write the function recursively but that is what the spirit of question is. Write recursive and not iterative logic. The purpose of the question is to aid learning recursion and not test you. Input Format A string str Output Format Permutations of str in order hinted by Sample output Constraints 0 <= str.length <= 7 Sample Input abc Sample Output abc acb bac bca cab cba Solution: import java.io.*; import java.util.*; public class Main {     public static void main(String[] args) throws Exception {         Scanner sc = new Scanner(System.in);         String str = sc.nextLine();         printPermutations(str,"");     }     pu...
Post a Comment
Read more

JoSAA

JoSAA- JEE counselling Read below to know about JoSAA and related procedures... Q. What is JoSAA? A. J oSAA is an acronym for “Joint Seat Allocation Authority”. It is constituted by the Ministry of HRD to oversee joint seat allocation for the IITs, NITs, IIITs and other GFTIs. It consists of representatives from the Joint Admission Board (JAB) (for IITs) and the Central Seat Allocation Board (CSAB) (for NITs, IIITs (Triple-I-Ts) and Other-GFTIs). JoSAA is the ONLY authorized agency responsible for joint seat allocation, click here to know more... Q. Is there any other agency for conducting the seat allocation to IITs and NITs? A. No agency other than JoSAA is responsible for joint seat allocation for IITs and NIT+ Institutes. Candidates seeking information/assistance from any agency/agent other than JoSAA shall be doing so at their own risk and cost. To read more... Q. What is CSAB? A. CSAB is an acronym for “Central Seat Allocation Board”. It is an agency co...
Post a Comment
Read more