ICS Part 2 Computer Science Chapter 12 Short Questions Test With Answer

Online Short Questions For Chapter 12 "ICS Part 2 Computer Science Chapter 12 Short Questions Preparation "

Try The Short Questions For ICS Part 2 Computer Science Chapter 12 Short Questions Preparation

  • Total Questions10

  • Available Sets2

Computer Science - ICS Part 2 Computer Science Chapter 12 Short Questions Preparation

Question # 1

Convert the following loop in do-while loop.
For (i=3;i <39; i+=6)
{
Printf ("%d/n",i);
}

  • Ans 1: Conversion:
    Void main( )
    {
    Int I =1;
    Do
    {
    Fprintf("%d/n",i);
    i+ =6;
    }while (i<39);
    }
Submit

Prepare Complete Set Wise Questions For Chapter 12 "ICS Part 2 Computer Science Chapter 12 Short Questions Preparation "

ICS Part 2 Computer Science Chapter 12 Short Questions Preparation - Set 1

Question # 1

Convert the following loop in do-while loop.
For (i=3;i <39; i+=6)
{
Printf ("%d/n",i);
}

  • Ans 1: Conversion:
    Void main( )
    {
    Int I =1;
    Do
    {
    Fprintf("%d/n",i);
    i+ =6;
    }while (i<39);
    }
Submit

ICS Part 2 Computer Science Chapter 12 Short Questions Preparation - Set 2

Question # 1

Define While Loop.

  • Ans 1: The while loop keeps repeating associated statements until the specified condition becomes false. This is useful where the programmer does not know in advance how many times the loop will be traversed.The dyntax o the while statement is
    While (condition)
    }
    statements(S);
    }
    The condition in the while loop controls iteration. The statements which are executed when the given condition is true,from the body of the loop. If the condition is true, the body of the loop is executed . As soon as it becomes false, the loop terminates immediately.
Submit

12th Chapter

12th Computer Science Chapter 12 Preparation

Here you can prepare 12th Computer Science Chapter 12 Problem Solving Preparation. Click the button for 100% free full practice test.

Is this page helpful?

Share your comments & questions here

Guest
  • No comments yet. Be the first to comment!