Programming using Java Hands On - Control Structures

Programming using Java Hands On - Control Structures | Print Username

Print Username

Jeffy, who is going to complete the higher education in this year needs to create a simple application which accept the name of a person and welcome them with a message along with their name. She wants to read the data using the class "Scanner". Implement this scenario using Java.

Sample Input 1:

Enter the name:

Johson

Sample Output 1:

Welcome Johnson.

Sample Input 2:

Enter the name:

Stain Polson

Sample Output 2:

Welcome Stain Polson.

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

Comments

Must Read:

Reverse a Number

/* @ToDo Reverse a Number 7325 => 5237 12345 => 54321 */ #include <iostream> using namespace std ; int main (){ #ifndef ONLINE_JUDGE freopen ( "../asset/input.txt" , "r" , stdin ); freopen ( "../asset/output.txt" , "w" , stdout ); #endif // Code here!! int n ; cin >> n ; int num = 0 ; while ( n > 0 ){ num = ( num * 10 ) + ( n % 10 ); n /= 10 ; } cout << nu...

RDBMS Data Definition Language | Alter-Rename the field

RDBMS Data Definition Language Alter-Rename the field Write a query to change the field name Distributor_name to Distributor_Full_name in Distributor table. Evaluation Result: Result Description Summary of tests +------------------------------+ | 3 tests run / 3 test passed | +------------------------------+

Count Encodings

1. You are given a string str of digits. (will never start with a 0) 2. You are required to encode the str as per following rules 1 -> a 2 -> b 3 -> c .. 25 -> y 26 -> z 3. You are required to calculate and print the count of encodings for the string str. For 123 -> there are 3 encodings. abc, aw, lc For 993 -> there is 1 encoding. iic For 013 -> This is an invalid input. A string starting with 0 will not be passed. For 103 -> there is 1 encoding. jc For 303 -> there are 0 encodings. But such a string maybe passed. In this case print 0. Input Format A string str Output Format count of encodings Constraints 0 < str.length <= 10 Sample Input 123 Sample Output 3 Solution: import java.io.*; import java.util.*; public class Main { ...

Min Cost In Maze Traversal

1. You are given a number n, representing the number of rows. 2. You are given a number m, representing the number of columns. 3. You are given n*m numbers, representing elements of 2d array a, which represents a maze. 4. You are standing in top-left cell and are required to move to bottom-right cell. 5. You are allowed to move 1 cell right (h move) or 1 cell down (v move) in 1 motion. 6. Each cell has a value that will have to be paid to enter that cell (even for the top-left and bottom- right cell). 7. You are required to traverse through the matrix and print the cost of path which is least costly. Input Format A number n A number m e11 e12.. e21 e22.. .. n * m number of elements Output Format The cost of least costly path. Constraints 1 <= n <= 10^2 1 <= m <= 10^2 0 <= e1, e2, .. n * m elements <= 1000 Sample Input 6 6 0 1 4 2 8 2 4 3 6 5 0 4 1 2 4 1 4 6 2 0 7 3 2 2 3 1 5 9 2 4 2 7 0 8 5 1 Sample Output 23 Solution: import java.io.*; import...

RDBMS Data Definition Language | Alter -Modify the field type

Write a query to change the field type weight varchar(20) in Mobile_specification table to number(10). Result Description Summary of tests +------------------------------+ | 3 tests run / 3 test passed | +------------------------------+

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 | +------------------------------+

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...

Software Engineering Concepts Basics Of Testing Pre-Quiz

Software Engineering Concepts Basics Of Testing Pre-Quiz | Software Engineering Concepts Basics Of Testing Pre-Quiz | Software Engineering Concepts Requirement Analysis Post-Quiz Software Engineering Concepts Requirement Analysis Test Your Understanding Software Engineering Concepts Requirement Analysis Pre-Quiz Software Engineering Concepts Software Maintenance Test Your Understanding Software Engineering Concepts Software Maintenance Post-Quiz Software Engineering Concepts Software Maintenance Pre-Quiz Software Engineering Concepts Software Engineering Fundamentals Post-Quiz Software Engineering Concepts Software Engineering Fundamentals Pre-Quiz Algorithm Analysis and Design Concepts Data Structure and Algorithms Post-Quiz Software Engineering Concepts Configuration Management And V...

Inverted Pattern

/* @ToDo Inverted Pattern 1 2 3 4 5 1 2 3 4 1 2 3 1 2 1 */ #include <iostream> using namespace std ; int main (){ #ifndef ONLINE_JUDGE freopen ( "../asset/input.txt" , "r" , stdin ); freopen ( "../asset/output.txt" , "w" , stdout ); #endif // Code here!! int n ; cin >> n ; for ( int i = 0 ; i < n ; i ++){ for ( int j = 1 ; j <= n - i ; j ++) ...

Get's Answer

Search This Blog