Programming using Java Hands On - Control Structures

Programming using Java Hands On - Control Structures | Print Message

Print Message

Write a progam to display a message "Welcome to object oriented programming"

Sample Output 1:

Welcome to object oriented programming

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

Comments

Must Read:

Software Engineering Concepts Configuration Management And Version Control Post-Quiz

Software Engineering Concepts Software Maintenance Test Your Understanding

Number Pattern

/* @ToDo Number Pattern 1 1 2 1 2 3 1 2 3 4 1 2 3 4 5 */ #include <iost...

RDBMS Data Definition Language | Create Sales_info table

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

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

Count Binary Strings

1. You are given a number n. 2. You are required to print the number of binary strings of length n with no consecutive 0's. Note: In this problem, you are given a number n. All we need to print is the number of binary strings of length n with no consecutive 0's For example: Sample Input: 3 Sample Output: 5 How 5? We have a total of eight binary numbers for length 3, out of which we have 5 numbers in which there are no consecutive zeros. Input Format A number n Output Format A number representing the number of binary strings of length n with no consecutive 0's. Constraints 0 < n <= 45 Sample Input 6 Sample Output 21 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); int n = sc.nextInt(); int dp[][] = new int[n+1][2]; dp[1][0] = 1; dp[1][1] ...

Zig Zag Pattern

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

Pyramid

/* To Print 1 2 2 3 3 3 4 4 4 4 5 5 5 5 5 */ #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 = 1 ; i <= n ; i ++){ for ( int j = 1 ; j <= i ; j ++){ ...

RDBMS Data Definition Language | Purge Distributor table Truncate

RDBMS Data Definition Language Purge Distributor table Truncate The mobile management wants to purge all the records from the “Distributor “table. Write an SQL statement to purge all the records from the distributor table without allowing rollback activity. Evaluation Result: Result Description Summary of tests +------------------------------+ | 1 tests run / 1 test passed | +------------------------------+

Get's Answer

Search This Blog