FLASH

Authored by K MOULIKA

Computers

University

Used 72+ times

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

Content View

Student View

10 questions

Show all answers

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

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

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

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

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

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

Access all questions and much more by creating a free account

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

MATEMÁTICA III

Quiz

•

University

10 questions

Website Usability and UX

Quiz

•

University

10 questions

Visual Basic 2010

Quiz

•

8th Grade - University

11 questions

Types of Mass Media

Quiz

•

10th Grade - Professi...

15 questions

Introducción Redes Tele1 IB

Quiz

•

10th Grade - University

10 questions

Creating tables in HTML

Quiz

•

University

15 questions

Teknik dalam Pemikiran Komputasional

Quiz

•

University

15 questions

Revisão - Unidade I - Teoria da Computação

Quiz

•

University

Popular Resources on Wayground

16 questions

Grade 3 Simulation Assessment 2

Quiz

•

3rd Grade

19 questions

HCS Grade 5 Simulation Assessment_1 2526sy

Quiz

•

5th Grade

10 questions

Cinco de Mayo Trivia Questions

Interactive video

•

3rd - 5th Grade

17 questions

HCS Grade 4 Simulation Assessment_2 2526sy

Quiz

•

4th Grade

24 questions

HCS Grade 5 Simulation Assessment_2 2526sy

Quiz

•

5th Grade

13 questions

Cinco de mayo

Interactive video

•

6th - 8th Grade

20 questions

Math Review

Quiz

•

3rd Grade

30 questions

GVMS House Trivia 2026

Quiz

•

6th - 8th Grade

Discover more resources for Computers

55 questions

Post Malone Addtion (Tres)

Quiz

•

12th Grade - University

20 questions

Disney Trivia

Quiz

•

University

50 questions

AP Biology Exam Review 2017

Quiz

•

11th Grade - University

24 questions

5th Grade Math EOG Review

Quiz

•

KG - University

12 questions

Star Wars Trivia - Easy

Quiz

•

KG - University

215 questions

8th Physical Science GA Milestones Review

Quiz

•

KG - University

40 questions

Famous Logos

Quiz

•

7th Grade - University

14 questions

(5-3) 710 Mean, Median, Mode & Range Quick Check

Quiz

•

6th Grade - University

FLASH

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

Access all questions and much more by creating a free account

Similar Resources on Wayground

Popular Resources on Wayground

Discover more resources for Computers

FLASH

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

Access all questions and much more by creating a free account

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