Star Pattern in the form of valley

 // *      *

// **    **
// ***  ***
// ********

#include<stdio.h>
int main()
{
    int a,b,c,d,e;
printf("Enter the Number till you want to print the Pattern:\n");
scanf("%d",&a);
for ( b = 0; b < a; b++)
 {
   for(c=0; c<b+1; c++)
    {
        printf("*");
    }
      for(d=0;d<(2*a-2*c); d ++)
        {
            printf(" ");
        }
           for (e=0;e<=b;e++)
           {
               printf("*");
            }
   
    printf("\n");
 }
return 0;
}

Comments

Post a Comment

Popular posts from this blog

Maths Unit 1 ( Theory )

Image
 -------------------  Introduction and history of data science------------------------------------ Introduction to Data Science: Data Science is an interdisciplinary field that involves extracting insights and knowledge from structured and unstructured data. It combines various disciplines such as statistics, mathematics, computer science, and domain knowledge to analyze and interpret data, uncover patterns, make predictions, and drive data-driven decision-making. Data scientists use a combination of techniques, tools, and algorithms to collect, clean, transform, and analyze large volumes of data. They apply statistical modeling, machine learning, data visualization, and other analytical methods to extract valuable information from data and generate actionable insights. History of Data Science: The roots of Data Science can be traced back to several disciplines and technological advancements over the years. Here is a brief history of some key milestones: 1. Statistics and Math...
Read more

Intelligence System notes part 2

UNIT - 2    --- Beam Search  Beam search is a heuristic search algorithm used in various fields, including natural language processing and machine translation, to find the most likely sequence of outputs given a set of possible choices. It explores multiple paths simultaneously, keeping track of the most promising options at each step. The algorithm is named "beam search" because it narrows down the search space by focusing on a fixed number of candidates, called the beam width. Here's how beam search works: 1. **Initialization:** The algorithm begins with an initial input or seed, which could be a partial sequence or an empty sequence. It also initializes a set of candidates with the beam width. 2. **Expansion:** The algorithm expands each candidate by generating all possible next steps or choices. These choices can vary depending on the problem domain. For example, in machine translation, the choices may correspond to different words or phrases that can be inserted next...
Read more

code for find the determinant of 3x3 matrix

  a1 = int ( input ( "Enter R11: " )) a2 = int ( input ( "Enter R12: " )) a3 = int ( input ( "Emter R13: " )) a4 = int ( input ( "Emter R21: " )) a5 = int ( input ( "Emter R22: " )) a6 = int ( input ( "Emter R23: " )) a7 = int ( input ( "Emter R31: " )) a8 = int ( input ( "Emter R32: " )) a9 = int ( input ( "Emter R33: " )) b =( a1 )*( a5 * a9 - a8 * a6 ) c =(- 1 )*( a2 )*( a4 * a9 - a7 * a6 ) d =( a3 )*( a4 * a8 - a7 * a5 ) e = b + c + d if        a1 == int ( a1 ):      print ( "The determinant of the given matrix is:" , e ) elif   a2 == int ( a2 ):      print ( "The determinant of the given matrix is:" , e ) elif   a3 == int ( a3 ):      print ( "The determinant of the given matrix is:" , e ) elif   ...
Read more