Scribd
Upload
20 views

Learning Licence Generation Java Programmer

Java

Uploaded by

A Rahman Hussain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
20 views

Learning Licence Generation Java Programmer

Java

Uploaded by

A Rahman Hussain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 7
_ Problem Statement This question aims to test your knowledge of Collections, String, Wrapper Class, and LocalDate functions. Implement as per the given requirement. A leading MNC in india wants to develop an application that will automate the process of generating a Learner Licer With help of this process a Person can after applying with er phone num State, and district. So, implement the | for few states. € details ne, DOB, first na elow requirement as Requirement ovided. The automation pre number, expiry date of L lass Diagram: =e ils = new ArrayList<>()s (person. get008()); sssage = “Learner License can‘t be generated as age iz less than 1s add(errortessage)s Home = person.getFirstnane() +” * + person.getLastname()s renseDetails.add(fullName) ; seDetails .add(Long. toString(oge)); ing> newiap = stateCodeDetails() leOfThePerson = null; ‘mapElenent : nevlap.entrySet()) { = (String) mapElenent.getKey()3 jePerson = ((String) mapElenent.getValue()); Person == null) { icenseDetails = new Arraylist<>(); 0 "Your state not found in our 0B, So the LL can’t be generated"; ndd(errortiessage); eCode = person.getdistrict()-substring(®, 2); eer creo cnevcrson noo + slserictcode.tobppercase() #2" Long.valleopeeaem ails .add(learnerLicenseliunber); = person. get008().plusvears(40)s = year4a.toString(); sils.add( validity) 5 sage = “Your driving test » seDetails.add(successtiessage) Problem Statement we An atray of integers is given where each member represents the maximum number of steps that can be made forward from that member, Write a Program to print the minimurn number of ly hops required to reach the end of the arr ly, Starting Assume all the memb from first element wre greater than lor equal to 0. If te 1 member is 0, then no forward movement is alldwed through that WMpuUt and Output Format Read the input from standard ir PUL ANd print the Output hy Mmber of dem, do the input is the ssofithe array where aS the array elemients separated by space) ee ‘then no forward movement is allowed through that. Input and Output Format: _ Read the input from standard input and print the output to standard output, > 1 First line in the input is the number of elements of the array where | s€cond line has the array elements separated by space, Print “infinite” if fast element Is unreachable , minimum number of Jumps otherwise Explanation Minimum hops > Seo S32 01: 16: 44 Hours Minutes Seconds 2 hops[i]=Integer .mAX_VALUE; 2 else if(a[i]}>=size-i-1) 24 hops[iJ=1; 25 else{ minzInteger .MAX_VALUE} for(int j-i*1jj

You might also like