FLASH

Quiz

•

Computers

•

University

•

Practice Problem

•

Hard

K MOULIKA

Used 70+ times

FREE Resource

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

for(int i=1;i<=5;i++)
{
for(int j=1;j<=i;j++)
{
if(j==1|| i==j || i==5 )
{
printf("*");
}
else
printf(" ");
}
printf("\n");
}

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

for (i = 1; i <= rows; ++i) {
for (j = 1; j <= i; ++j) {
printf("* ");
}
printf("\n");
}

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

for (i = 5; i >= 1; --i) {
for (j = 1; j <= i; ++j) {
printf("%d ", j);
}
printf("\n");
}

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

for (i = 5; i >= 1; --i) {
for (space = 0; space < 5 - i; ++space)
printf(" ");
for (j = i; j <= 2 * i - 1; ++j)
printf("* ");
for (j = 0; j < i - 1; ++j)
printf("* ");
printf("\n");
}

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

for(i = 1; i <= 5; i++)
{
for(j = 1; j <= i; j++)
{
printf("");
}
printf("\n");
}
for(i = 5; i >= 1; i--)
{
for(j = 1; j <= i; j++)
{
printf( "");
}
printf("\n");
}

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

for(i=1; i<=5; i++)
{
for(j=1; j<=i; j++)
{

if(j % 2 == 1)
{
printf("1");
}
else
{
printf("0");
}
}
printf("\n");
}

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

for (i = 5; i >= 1; --i) {
for (j = 1; j <= i; ++j) {
printf("* ");
}
printf("\n");
}

Create a free account and access millions of resources

Create resources

Host any resource

Get auto-graded reports

Continue with Google

Continue with Email

Continue with Classlink

Continue with Clever

or continue with

Microsoft

Apple

Others

Already have an account?

Similar Resources on Wayground

10 questions

Arquitectura de computadoras

Quiz

•

University

10 questions

RAID

Quiz

•

University

10 questions

JSPS Competition Hackathon - Scratch Language - Grade 1

Quiz

•

2nd Grade - University

10 questions

Microcontroller

Quiz

•

11th Grade - University

14 questions

Input, output and storage de

Quiz

•

8th Grade - Professio...

15 questions

Assessment 08

Quiz

•

University

15 questions

Monday Week#2

Quiz

•

University

10 questions

Bases de datos

Quiz

•

University

Popular Resources on Wayground

5 questions

This is not a...winter edition (Drawing game)

Quiz

•

1st - 5th Grade

15 questions

4:3 Model Multiplication of Decimals by Whole Numbers

Quiz

•

5th Grade

25 questions

Multiplication Facts

Quiz

•

5th Grade

10 questions

The Best Christmas Pageant Ever Chapters 1 & 2

Quiz

•

4th Grade

12 questions

Unit 4 Review Day

Quiz

•

3rd Grade

10 questions

Identify Iconic Christmas Movie Scenes

Interactive video

•

6th - 10th Grade

20 questions

Christmas Trivia

Quiz

•

6th - 8th Grade

18 questions

Kids Christmas Trivia

Quiz

•

KG - 5th Grade

Discover more resources for Computers

26 questions

Christmas Movie Trivia

Lesson

•

8th Grade - Professio...

7 questions

Different Types of Energy

Interactive video

•

4th Grade - University

20 questions

Slopes and Slope-Intercept Form

Quiz

•

8th Grade - University

7 questions

Force and Motion

Interactive video

•

4th Grade - University

7 questions

Biomolecules (Updated)

Interactive video

•

11th Grade - University

20 questions

Winter/Holiday Trivia

Quiz

•

KG - University

10 questions

WINTER WIN Time - ELA - 12/9/2025

Quiz

•

KG - University

7 questions

Human Impact on Resources

Interactive video

•

4th Grade - University

FLASH

10 questions

for(int i=1;i<=5;i++)
{
for(int j=1;j<=i;j++)
{
if(j==1|| i==j || i==5 )
{
printf("*");
}
else
printf(" ");
}
printf("\n");
}

for (i = 1; i <= rows; ++i) {
for (j = 1; j <= i; ++j) {
printf("* ");
}
printf("\n");
}

for (i = 5; i >= 1; --i) {
for (j = 1; j <= i; ++j) {
printf("%d ", j);
}
printf("\n");
}

for (i = 5; i >= 1; --i) {
for (space = 0; space < 5 - i; ++space)
printf(" ");
for (j = i; j <= 2 * i - 1; ++j)
printf("* ");
for (j = 0; j < i - 1; ++j)
printf("* ");
printf("\n");
}

for(i = 1; i <= 5; i++)
{
for(j = 1; j <= i; j++)
{
printf("");
}
printf("\n");
}
for(i = 5; i >= 1; i--)
{
for(j = 1; j <= i; j++)
{
printf( "");
}
printf("\n");
}

for(i=1; i<=5; i++)
{
for(j=1; j<=i; j++)
{

if(j % 2 == 1)
{
printf("1");
}
else
{
printf("0");
}
}
printf("\n");
}

for (i = 5; i >= 1; --i) {
for (j = 1; j <= i; ++j) {
printf("* ");
}
printf("\n");
}

m=n=5;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m-1;j++)
{
printf(" ");
}
for(int k=1;k<=2i-1;k++)
{
if(k==1 || k==2i-1 || i==n)
printf("*");
else
printf(" ");
}
m--;

printf("\n");
}

n=5;

for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
{
if (i==1 || i==n || j==1 || j==n)
printf("*");
else
printf(" ");
}
printf("\n");
}

n=5
for(i=0;i<n;i++){
for(k=1;k<n-i;k++){
printf(" ");
}
for(j=0;j<=n;j++){
printf("*");
}
printf("\n");
}

Create a free account and access millions of resources

Similar Resources on Wayground

Popular Resources on Wayground

Discover more resources for Computers

FLASH

10 questions

for(int i=1;i<=5;i++) { for(int j=1;j<=i;j++) { if(j==1|| i==j || i==5 ) { printf("*"); } else printf(" "); } printf("\n"); }

for (i = 1; i <= rows; ++i) { for (j = 1; j <= i; ++j) { printf("* "); } printf("\n"); }

for (i = 5; i >= 1; --i) { for (j = 1; j <= i; ++j) { printf("%d ", j); } printf("\n"); }

for (i = 5; i >= 1; --i) { for (space = 0; space < 5 - i; ++space) printf(" "); for (j = i; j <= 2 * i - 1; ++j) printf("* "); for (j = 0; j < i - 1; ++j) printf("* "); printf("\n"); }

for(i = 1; i <= 5; i++){for(j = 1; j <= i; j++){printf("*");}printf("\n");}for(i = 5; i >= 1; i--){for(j = 1; j <= i; j++){printf( "*");}printf("\n");}

for(i=1; i<=5; i++) { for(j=1; j<=i; j++) { if(j % 2 == 1) { printf("1"); } else { printf("0"); } } printf("\n"); }

for (i = 5; i >= 1; --i) { for (j = 1; j <= i; ++j) { printf("* "); } printf("\n"); }

m=n=5; for(int i=1;i<=n;i++) { for(int j=1;j<=m-1;j++) { printf(" "); } for(int k=1;k<=2*i-1;k++) { if(k==1 || k==2*i-1 || i==n) printf("*"); else printf(" "); } m--; printf("\n"); }

n=5; for (i = 1; i <= n; i++) { for (j = 1; j <= n; j++) { if (i==1 || i==n || j==1 || j==n) printf("*"); else printf(" "); } printf("\n"); }

n=5for(i=0;i<n;i++){ for(k=1;k<n-i;k++){ printf(" "); } for(j=0;j<=n;j++){ printf("*"); } printf("\n"); }

Create a free account and access millions of resources

Similar Resources on Wayground

Popular Resources on Wayground

Discover more resources for Computers

for(int i=1;i<=5;i++)
{
for(int j=1;j<=i;j++)
{
if(j==1|| i==j || i==5 )
{
printf("*");
}
else
printf(" ");
}
printf("\n");
}

for (i = 1; i <= rows; ++i) {
for (j = 1; j <= i; ++j) {
printf("* ");
}
printf("\n");
}

for (i = 5; i >= 1; --i) {
for (j = 1; j <= i; ++j) {
printf("%d ", j);
}
printf("\n");
}

for (i = 5; i >= 1; --i) {
for (space = 0; space < 5 - i; ++space)
printf(" ");
for (j = i; j <= 2 * i - 1; ++j)
printf("* ");
for (j = 0; j < i - 1; ++j)
printf("* ");
printf("\n");
}

for(i = 1; i <= 5; i++)
{
for(j = 1; j <= i; j++)
{
printf("");
}
printf("\n");
}
for(i = 5; i >= 1; i--)
{
for(j = 1; j <= i; j++)
{
printf( "");
}
printf("\n");
}

for(i=1; i<=5; i++)
{
for(j=1; j<=i; j++)
{

if(j % 2 == 1)
{
printf("1");
}
else
{
printf("0");
}
}
printf("\n");
}

for (i = 5; i >= 1; --i) {
for (j = 1; j <= i; ++j) {
printf("* ");
}
printf("\n");
}

m=n=5;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m-1;j++)
{
printf(" ");
}
for(int k=1;k<=2i-1;k++)
{
if(k==1 || k==2i-1 || i==n)
printf("*");
else
printf(" ");
}
m--;

printf("\n");
}

n=5;

for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
{
if (i==1 || i==n || j==1 || j==n)
printf("*");
else
printf(" ");
}
printf("\n");
}

n=5
for(i=0;i<n;i++){
for(k=1;k<n-i;k++){
printf(" ");
}
for(j=0;j<=n;j++){
printf("*");
}
printf("\n");
}