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

By signing up, you agree to our Terms of Service & Privacy Policy

Already have an account?

Similar Resources on Wayground

15 questions

DBC CHAPTER 3 - REVISION

Quiz

•

University

10 questions

Què en saps de GSuite?

Quiz

•

University - Professi...

10 questions

Algorithm analysis: divide & conquer theory

Quiz

•

University

13 questions

Five Nights At Freddy's: Security Breach Quiz

Quiz

•

KG - Professional Dev...

10 questions

Programacion Orientada a Objetos

Quiz

•

12th Grade - University

10 questions

Information systems concepts

Quiz

•

University

12 questions

Porcentajes

Quiz

•

University

13 questions

L1 - Computer Networks

Quiz

•

University

Popular Resources on Wayground

10 questions

Honoring the Significance of Veterans Day

Interactive video

•

6th - 10th Grade

9 questions

FOREST Community of Caring

Lesson

•

1st - 5th Grade

10 questions

Exploring Veterans Day: Facts and Celebrations for Kids

Interactive video

•

6th - 10th Grade

19 questions

Veterans Day

Quiz

•

5th Grade

14 questions

General Technology Use Quiz

Quiz

•

8th Grade

25 questions

Multiplication Facts

Quiz

•

5th Grade

15 questions

Circuits, Light Energy, and Forces

Quiz

•

5th Grade

19 questions

Thanksgiving Trivia

Quiz

•

6th Grade

Discover more resources for Computers

20 questions

Definite and Indefinite Articles in Spanish (Avancemos)

Quiz

•

8th Grade - University

7 questions

Force and Motion

Interactive video

•

4th Grade - University

9 questions

Principles of the United States Constitution

Interactive video

•

University

18 questions

Realidades 2 2A reflexivos

Quiz

•

7th Grade - University

10 questions

Dichotomous Key

Quiz

•

KG - University

25 questions

Integer Operations

Quiz

•

KG - University

7 questions

What Is Narrative Writing?

Interactive video

•

4th Grade - University

20 questions

SER vs ESTAR

Quiz

•

7th 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");
}