Skip to main content

Pattern 1 | Java

Problem Statement:

Write a program to draw the following pattern of NxN(where N is the input):

* * * * *

* * * * *

* * * * *

* * * * *

* * * * *

(here, N=5)

THE CODE


Output:


Here, the input is 8

Simplification:
In the above problem, two for loops are used:
1. The first for loop is having i as counter variable with initial value of 1 and ending value of 10 with an updation statement i++.
2. The second for loop is having j as counter variable with initial value of 1 and ending value of 10 with an updation statement j++.

The second for loop is used to print * in the respective column (the value of j represents the column number). It is having a print statement System.out.println("* ") to print * in each column(for convenience, I've added a space for better visibility of columns in the output).

The first for loop is used to define rows( the value of i represents the row number). It is having a print statement System.out.print() to change rows each time the second for loop completes.

Note:
System.out.println() is used to print on the next line whereas System.out.print() is used to print on the same line.

Labels:

Popular posts from this blog

Pattern 6 | Java | MyCodingNetwork | Alok Tripathi (Code 8)

Problem Statement: Write a program to make a square and mark out its diagonals. Accept the length as input from the user and give output in the following manner: And ( In simple words, we have printed stars (*) on the boundary positions of the matrix and on the centre positions of the matrix we have printed blank space( ) )   THE CODE: Sample Output: In the above program, two int variables r to accept the length of square as input. On line 7, following statement is used to accept the input from the user: int r = sc . nextInt ();   For taking the input Scanner class has been used, more about Scanner class Algorithm: Two for loops are defined: ·         First for loop with counter variable i has initial value 1, conditional statement i less than or equal to r and an updating statement i++ . ·         Inside the first loop there is a second for loop, with counter variable j has ini...
Discover More »

Exploring Uninformed Search in Artificial Intelligence: Basics and Applications

  In artificial intelligence (AI), search algorithms are essential for solving a variety of problems, from navigating a maze to scheduling tasks. Uninformed search, also known as blind search, is a fundamental category of search techniques where the algorithm has no additional information about the states beyond what is provided in the problem definition to guide the search. This page delves into the basics of uninformed search algorithms, their types, and their applications in AI. Understanding Uninformed Search Uninformed search algorithms explore the search space without any guidance on which paths might lead to the goal more efficiently. They rely solely on the information available from the initial problem setup, such as the start state, goal state, and possible actions. This approach contrasts with informed search algorithms, which utilize heuristics to make more educated guesses about the best path to take. Types of Uninformed Search Algorithms   Several uninformed se...
Discover More »