Programming using Java Hands On - Control Structures

Programming using Java Hands On - Control Structures | Convert Numbers into Months

Convert Numbers into Months

Ram is very weak in converting the numbers into months. But his friends often tease him by asking him to do that. To solve his problem a close friend of him, suggested to meet IIT students, who were very good at programming. Help ram to resolve his problem.

Note : 
Range of inputs is 1 to 12.
If the input given is beyond the range display error message as given in the sample output.

Sample Input 1:

Sample Output 1:

February

Sample Input 2:

Sample Output 2:

No month for the number 15

Convert Numbers into Months Ram is very weak in converting the numbers into months. But his friends often tease him by asking him to do that. To solve his problem a close friend of him, suggested to meet IIT students, who were very good at programming. Help ram to resolve his problem. Note : Range of inputs is 1 to 12. If the input given is beyond the range display error message as given in the sample output. Sample Input 1: 2 Sample Output 1: February Sample Input 2: 15 Sample Output 2: No month for the number 15


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

Comments

Must Read:

Logic Development | Object Oriented Programming Pre Quiz

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

RDBMS Data Definition Language | Drop Mobile Specification table (parent)

RDBMS Data Definition Language Drop Mobile Specification table (parent) Refer the following schema and drop Mobile Specification table. (Hint: To drop parent table all associate tables need to be dropped or Use 'cascade constraints' command) Evaluation Result: Result Description Summary of tests +------------------------------+ | 1 tests run / 1 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...

Get's Answer

Search This Blog