Lab Assignment 5

Nested Loops

CSE110: Programming Language I

No of Tasks Points to Score

12 120

Submit the coding tasks (Task 1 - 8) on buX and the handwritten tasks (Task 9 - 12) to your ST /
Lab Instructors in the beginning of the next lab class.
1. Write a Java program to take a positive integer N (where N > 0) as user input and print
the first N prime numbers starting from 2. Your code should check all the positive
integers starting from 2 and determine whether they are prime or not until N prime
numbers are found.

Sample Input 1:
5
Sample Output 1:
2
3
5
7
11
Sample Input 2:
7
Sample Output 2:
2
3
5
7
11
13
17

2. Write a Java code of a program that reads the value of N (where N > 0) from the user and
calculates the value of y if the expression of y is as follows:

𝑦 = − (1) − (1 + 2) − (1 + 2 + 3) − . . . . − (1 + 2 + 3 + . . . + 𝑁)

Sample Input:
The value of N: 2
Sample Output:
The value of y: -4

Sample Input:
The value of N: 4
Sample Output:
The value of y: -20
3. Write a Java program that will keep taking even positive integer numbers as inputs from
the user and print the number of divisors of those numbers until it gets an odd number
and then stops.

Sample Input & Output: (The purple numbers are input)

Enter Number: 44
44 has 6 divisors
Enter Number: 30
30 has 8 divisors
Enter Number: 8
8 has 4 divisors
Enter Number: 4
4 has 3 divisors
Enter Number: 6
6 has 4 divisors
Enter Number: 20
20 has 6 divisors
Enter Number: 24
24 has 8 divisors
Enter Number: 5

4. Read an integer N that is the number of test cases that follow. Each test case contains two
integers X and Y. Print one output line for each test case that is the sum of Y odd
numbers from X including it if is the case. For example:
For the input 4 5, the output must be 45, that is: 5 + 7 + 9 + 11 + 13
For the input 7 4, the output must be 40, that is: 7 + 9 + 11 + 13

Sample Input Sample Output

2 21
4 24
3
11
2

Explanation: Here, the 2 means there are two test cases. For each test case you
have to take two inputs (X, Y) and print the sum of Y odd numbers starting
from X.
5. Take the length and width of a rectangle from the user and create the rectangle according
to the output below. Your output should match the specified output.

Sample Input #1 Sample Input #2

4 3
6 5

Output Output
1234 123
1234 123
1234 123
1234 123
1234 123
1234

6. Take the height of a right-justified right triangle from the user and create the triangle
according to the output below. Your output should match the specified output.

Sample Input #1 Sample Input #2

4 3

Output Output
1 1
12 12
123 123
1234

7. Take the height of an isosceles triangle from the user and create the triangle according to
the output below. Your output should match the specified output.

Sample Input #1 Sample Input #2

4 3
 Output Output

1 1
123 123
12345 12345
1234567

8. Write a Java program that will ask for a range (a starting number and an ending number)
from the user and print all the Armstrong numbers between that range.
[Armstrong Number: An Armstrong number is a number whose sum of digits raised to
the power the number of digits equals to that number.
For example, 371 is an Armstrong number because 33 + 73 + 13 = 371, here the total
number of digits in 371 is 3 ]

Sample Input 1:
Start: 300
End: 500

Sample Output 1:
Armstrong numbers:
370 ->
371
407
Sample Input 2:
Start: 100
End: 200
Sample Output 2:
Armstrong numbers:
153
 9. Trace the following code, create a tracing table and write the outputs.

1 public class T1{

2 public static void main(String args[]){
3 int x = 0, y = 0;
4 int sum = 0;
5 while (x < 4){
6 y = x - 3;
7 while (y < 3){
8 sum = (sum % 3) + x - y * 3 ;
9 System.out.println(sum);
10 y = y + 1;
11 }
12 if (x > 5){
13 x++;
14 }
15 else{
16 x += 2;
17 }
18 }
19 }
20 }
 10. Trace the following code, create a tracing table and write the outputs.

1 public class T2 {
2 public static void main(String args[]) {
3 int x = 0, i = 0, sum = 0;
4 i = 1;
5 x = 2;
6 sum = 0;
7 while (i < 20){
8 x = x + i;
9 sum = sum + x + 1;
10 System.out.println(sum);
11 if (x > 5){
12 i += 2;
13 }
14 else {
15 i += 3;
16 }
17 }
18 sum = sum + i;
19 System.out.println(sum);
20 }
21 }
 11. Trace the following code, create a tracing table and write the outputs.
1 public class T3
2 {
3 public static void main(String args[])
4 {
5 int x = 0, y = 0;
6 int sum = 0;
7 while (x < 10){
8 y = x - 3;
9 y = 40;
10 while (y > 22){
11 if ((sum > 30) && (sum < 40)){
12 sum = sum + x * 2 ;
13 }
14 else if ((sum > 40) && (sum < 50)){
15 sum = sum + x * 3;
16 }
17 else {
18 sum = sum + 23;
19 }
20 System.out.println(sum);
21 y = y - 10;
22 }
23 x += 2;
24 }
25 }
26 }
 12. Trace the following code, create a tracing table and write the outputs

1 public class T4
2 {
3 public static void main(String args[])
4 {
5 int x = 0, p = 0, sum = 0;
6 p = 1;
7 x = 2;
8 double q;
9 sum = 0;
10 while (p < 12){
11 q = x + p-(sum+7/3)/3.0%2 ;
12 sum = sum + (++x) + (int)q;
13 System.out.println(sum++);
14 if (x > 5){
15 p += 4/2;
16 }
17 else {
18 p += 3%1;
19 }
20 }
21 sum = sum + p;
22 System.out.println(sum);
23 }
24 }