✅ Wipro Elite NLTH Announcement

Start Date: Reg. will start in a week
Last date: 5th Jan 2021
Online Exam: 11th–17th Jan 2021

Batch: 2021 Passout
Eligibilty: B.E/B.Tech/5yrs Integ-M.Tech
Branch: CS/IT/Circuital

CTC: INR 3.50 lpa & 6.75 lpa

Syllabus:
Quant(16)+Log(16)+Ver(16)=16*3=48Mins
Essay(1)+Coding(2)=(20+60)Mins

- via Prepflix
Telegram: @programming_and_coding
#Update 2

47. Nested Star-Hash Pyramid

#####*#####
####*#*####
###*###*###
##*#####*##
#*#######*#
*#########*

#include<stdio.h>
#include<conio.h>

void main()
{
int n = 5, r, c;
clrscr();

for (r = 1; r <= 6; r++, n--)
{
// first pyramid
for (c = 1; c <= n; c++)
{
printf(" #");
}

// second pyramid
for (c = 1; c <= r; c++)
{
if (c == 1)
{
printf(" *");
}
else
{
printf(" #");
}
}

// third pyramid
for (c = r; c > 1; c--)
{
if (c == 2)
{
printf(" *");
}
else
{
printf(" #");
}
}

// fourth pyramid
for (c = n; c >= 1; c--)
{
printf(" #");
}

printf("\n");
}
getch();
}
@programming_and_coding

48. Reverse star pyramid

* * * * * * * * *
* * * * * * *
* * * * *
* * *
*

#include<stdio.h>
#include<conio.h>

void main()
{
int i, j, k;
clrscr();

for (i = 5; i >= 1; i--)
{
for (j = 5; j > i; j--)
{
printf(" ");
}

for (k = 1; k < (i * 2); k++)
{
printf("* ");
}

printf("\n");
}
getch();
}
@programming_and_coding

49. Rhombus Pattern

1 1
2 2
3 3
4 4
5 5
4 4
3 3
2 2
1 1

#include<stdio.h>
#include<conio.h>

void main()
{
int num, r, c, sp, n;
clrscr();

printf("Enter the number : ");
scanf("%d", &num);

for (r = 1; r <= num; r++)
{
for (sp = num - r; sp >= 1; sp--)
printf(" ");

printf("%d", r);

for (sp = r * 2; sp > 1; sp--)
printf(" ");

printf("%d", r);
printf("\n");
}

for (r = 1, n = num - 1; r < num; r++, n--)
{
for (sp = r; sp >= 1; sp--)
printf(" ");

printf("%d", n);

for (sp = n * 2; sp > 1; sp--)
printf(" ");

printf("%d", n);
printf("\n");
}
getch();
}
@programming_and_coding

50. Square kite pattern

1
2 2
3 3
4 4
3 3
2 2
1

#include<stdio.h>
#include<conio.h>

void main()
{
int i, j, k;
clrscr();

for (i = 1; i <= 4; i++)
{
for (j = 4; j >= (i - 1) * 2 - 1; j--)
printf(" ");
printf("%d", i);
for (j = 2; j <= (i - 1) * 4; j++)
printf(" ");
if (i > 1)
printf("%d", i);
printf("\n");
}
for (i = 3; i >= 1; i--)
{
for (j = 4; j >= (i - 1) * 2 - 1; j--)
printf(" ");
printf("%d", i);
for (j = 2; j <= (i - 1) * 4; j++)
printf(" ");
if (i > 1)
printf("%d", i);
printf("\n");
}
getch();
}
@programming_and_coding

51. Triangle with only border

#include<stdio.h>
#include<conio.h>

*
* *
* *
* *
* *
* *
* * * * * *

void drawTriangle(char border, char filler, int length)
{
int start = 2;
int base = 4;
int i, sp, j, b;
for (i = start; i <= length; i++)
{
for (sp = 0; sp <= length - i; sp++)
{
printf(" ");
}
if (i > start)
{
printf("%c ", border);
}
if (i > start)
{
for (b = base; b <= i; b++)
{
printf("%c ", filler);
}
}
printf("%c \n", border);
}

for (j = base; j < length + base; j++)
{
printf("%c ", border);
}
printf("\n");
}

void main()
{
int length = 6;
clrscr();
drawTriangle('*', ' ', length);
getch();
}
@programming_and_coding

52. Program to accept number and print it's factorial.

#include<stdio.h>
#include<conio.h>
void main()
{
int i, fact=1, n;
clrscr();
printf("Enter number : ");
scanf("%d", &n);

for(i=1; i<=n; i++)
{
fact = fact*i;
}
printf("Factorial is: %d", fact);
getch();
}
@programming_and_coding

53. Program to accept number and print if it is prime number or not.

#include<stdio.h>
#include<conio.h>
void main()
{
int i, n;
clrscr();
printf("Enter number : ");
scanf("%d", &n);

for(i=2; i<=n/2; i++)
{
if(n%i==0)
{
printf("Number is not Prime");
getch();
break;
}
}
printf("Number is Prime");
getch();
}
@programming_and_coding

54. Program to print 'n' prime numbers.

#include<stdio.h>
#include<conio.h>
#include<process.h>
void main()
{
int i, j, flag=1, n;
clrscr();
printf("Enter number : ");
scanf("%d", &n);

for(i=2; i<=n; i++)
{
flag=1;
for(j=2; j<=i/2; j++)
{
if(i%j==0)
{
flag=0;
break;
}
}
if(flag==1)
printf("%d\n", i);
}
getch();
}
@programming_and_coding

55. Program to accept a number and print Fibonacci sequence.

#include<stdio.h>
#include<conio.h>
void main()
{
int pre=1, cur=1, temp, i, n;
//pre means previous number
//cur means current number
clrscr();
printf("Enter number : ");
scanf("%d", &n);
printf("%d\t%d", pre, cur);

for(i=3; i<=n; i++)
{
temp = cur;
cur = pre + cur;
pre = temp;
printf("\t%d", cur);
}
getch();
}
@programming_and_coding