Advertisements
Chapters
![Rupa Pandit solutions for कम्प्युटर एपलीकेशंस [इंग्रजी] इयत्ता १० आयसीएसई chapter 1 - Revision of Class 9 Syllabus Rupa Pandit solutions for कम्प्युटर एपलीकेशंस [इंग्रजी] इयत्ता १० आयसीएसई chapter 1 - Revision of Class 9 Syllabus - Shaalaa.com](/images/computer-applications-english-class-10-icse_6:a86debec6313407fa84cd182cd5e7e57.jpg)
Advertisements
Solutions for Chapter 1: Revision of Class 9 Syllabus
Below listed, you can find solutions for Chapter 1 of CISCE Rupa Pandit for कम्प्युटर एपलीकेशंस [इंग्रजी] इयत्ता १० आयसीएसई.
Rupa Pandit solutions for कम्प्युटर एपलीकेशंस [इंग्रजी] इयत्ता १० आयसीएसई 1 Revision of Class 9 Syllabus Exercises [Pages 42 - 50]
Choose the correct options.
These are values of type True or False:
boolean
int
float
char
______ encapsulate state and behaviour.
Data
Methods
Formula
Objects
Identify the true statement.
class as an object factory
object is a class factory
class and objects are same
objects contain class
______ is not a primitive.
int
array
float
double
These are names given to variables, classes, and methods:
Constant
Object
Identifier
Value
______ access specifier does not allow any member to be accessed out of the class.
Private
Public
Protected
Default
Which of the following is an example of implicit type casting?
long to int
int to short
float to double
long to float
Which of the following is a logical operator?
&&
>=
!=
<<
Which of the following is a relational operator?
+
−
*
!=
Keyword new is used for ______.
Rotational memory allocation
Dynamic memory allocation
False memory allocation
Random memory allocation
Given p = 6.9;
Data type of p can be
int
float
long
short
Given: g = ++p + y++ + ++y + p++ + x++;
If p = 2, y = 3, x = 5 then what will be the value of g?
19
18
20
21
It is an ability to have same name but to behave differently under different situations:
Encapsulation
Inheritance
Polymorphism
Abstraction
It is an ability to apply the method without knowing the method details:
Encapsulation
Inheritance
Polymorphism
Abstraction
It is a feature in which a derived class is being able to access data/methods of its base class:
Encapsulation
Inheritance
Polymorphism
Abstraction
It is an instance of a class:
Object
Class
Polymorphism
Method
It is a feature in which all relevant data and methods are present in a boundary:
Abstraction
Inheritance
Polymorphism
Method
It is a factory where objects are made:
Object
Inheritance
Class
Method
It is not a primitive data type:
int
String
double
float
It is not a valid identifier:
name_
name$
_name
+name
It is a valid identifier:
le*af
le_af
1+eaf
lea/f
It is not a relational operator:
<
<=
>=
=
The expression which uses >= operator is known as:
relational
logical
arithmetic
assignment
Relational operators are:
Unary operator
Binary operator
Ternary operator
Conditional operator
State the type of loop in the given program segment
for (int i = 5;i! = 0; i = 2)
System.out.println(i);
finite
null
infinite
fixed
A Identify the type of operator &&:
ternary
unary
logical
relational
What value will Math.sqrt (Math.ceil (15.3)) return?
16.0
16
4.0
5.0
The code obtained after compilation is known as ______.
source code
object code
machine code
java byte code
The absence of which statement leads to fall through situation in switch case statement?
Continue
Break
Return
System.exit(0)
Missing a semicolon in a statement is what type of error?
Logical
Syntax
Runtime
No error
Consider the following program segment and select the output of the same when n = 10:
switch(n)
{Case 10: System.out.println(n*2);
case 4: System.out.println(n*4); break;
default : Syslem.out.println(n);
}20
4010
420, 40
10
10
The number of bits occupied by the value ‘a’ are:
1 bit
2 bits
4 bits
16 bits
Assertion (A): In java statements written in lower case letter or upper case letter are treated as the same.
Reason (R): Java is a case sensitive language.
Both Assertion (A) and Reason (R) are true and Reason (R) is a correct explanation of Assertion (A).
Both Assertion (A) and Reason (R) are true and Reason (R) is not a correct explanation of Assertion (A).
Assertion (A) is true and Reason (R) is false.
Assertion (A) is false and Reason (R) is true.
Assertion (A): Use of escape sequence becomes necessary in programs at a certain point in time.
Reason (R): Certain non-graphic characters cannot be typed directly through the keyboard.
Both Assertion (A) and Reason (R) are true and Reason (R) is a correct explanation of Assertion (A).
Both Assertion (A) and Reason (R) are true and Reason (R) is not a correct explanation of Assertion (A).
Assertion (A) is true and Reason (R) is false.
Assertion (A) is false and Reason (R) is true.
State True or False.
Shift operators are applied on numbers and they shift the integer equivalent of the number.
State True or False.
Keyword default is used to allocate memory to an object.
State True or False.
A condition is a statement that gives an integer result.
State True or False.
In ‘switch case’, only condition of equality can be tested.
State True or False.
In ‘switch case’, default is optional.
State True or False.
In ‘if.. else’, all types of data can be used.
State True or False.
In ‘switch.. case’, two variables can be compared.
State True or False.
‘Fall Through’ is possible in ‘if..else’
State True or False.
In ‘switch.case’, break is necessary after each case.
State True or False.
In a loop, break takes the control statement out of the loop block.
Evaluate the following expression where prefix and postfix increment and decrement operator is used.
int b = 6, d = 12,c = 0;
c = b++ + d-- + ++ b;
System.out.println ("B=" + b+" D=" + d+" C=" +c);
Evaluate the following expression where prefix and postfix increment and decrement operator is used.
int p=3, q=20, r=0;
r = ++p + p++ + q++ + q++;
System.out.println ("P=" + p+ “Q="+ q+ “R="+ r);
Evaluate the following expression where prefix and postfix increment and decrement operator is used.
int cm = 24, dc = 5, re = 8, bq = 1;
bq = cm/++dc + cm/re--;
System.out.printn("CM=" +cm +"DC=" +dc+" RE=" +re +“BQ=" +bq);
Evaluate the following expression where prefix and postfix increment and decrement operator is used.
int rd=206, tf=20, yg=3, km=0;
km = rd % tf++ + tf % ++yg ;
System.out.println ("RD=" +rd+ "TF=" +tf+ “YG=" +yg+ "KM=" +km);
Evaluate the following expression as per Java priority & associativity.
6 * 2 / 4
Evaluate the following expression as per Java priority & associativity.
35 % 6 * 7 / 5
Evaluate the following expression as per Java priority & associativity.
49 − 28 − 4 * 3
Evaluate the following expression as per Java priority & associativity.
52 * 7 % 7
Evaluate the following expression as per Java priority & associativity.
79 % 2 + 2 % 79
Evaluate the following expression as per Java priority & associativity.
1234 % 100 – 1234/100
Evaluate the following expression as per Java priority & associativity.
50 % 9 + 50 % 8 + 50 % 7
Evaluate the following expression as per Java priority & associativity.
24 % (3*2)
Evaluate the following expression as per Java priority & associativity.
6598 / (20 % 8)
Evaluate the following expression as per Java priority & associativity.
22 + 33 – 11 – 10 * 2
What will be the output of the given Java code after the calculation [note the data types]?
int m = 62, k = 10,r = 0, q = 0;
r = m/k;
q = k/m;
System.out.println ("R=" +r+ “Q=" +q);
What will be the output of the given Java code after the calculation [note the data types]?
double d = 43, f = 86, g = 0,h = 0;
g = d/f;
h = f/d;
System.out.println ("G=" +g+ "H=" +h);
What will be the output of the given Java code after the calculation [note the data types]?
int b = 300, a = 150 ; double w = 0,p = 0;
w = b/a;
p = a/b;
System.out.println ("W=" +w+ "P=" +p);
What will be the output of the given Java code after the calculation [note the data types]?
double c = 300, d = 150; int y = 0, g = 0;
y = c/d;
g = d/c;
System.out.println ("Y=" +y+ "G=" +g);
What will be the output of the given Java code after the calculation [note the data types]?
double fw = Math.pow (3,Math.ceil(2.12));
System.out.println ("FW=" + fw);
What will be the output of the given Java code after the calculation [note the data types]?
double mh = Math.sqrt (Math.max (6+3*10, 30−2*5+5));
System.out.println ("MH=" + mh);
What will be the output of the given Java code after the calculation [note the data types]?
double ph = Math.ceil(23.7*2) + Math.floor(32.4/2);
System.out.println("PH=" +ph);
What will be the output of the given Java code after the calculation [note the data types]?
double gm = Math.round (Math.min (Math.pow (2.3, 2), Math.sqrt(62.5)));
System.out.println ("GM=" +gm);
What will be the output of the given Java code after the calculation [note the data types]?
double cy = Math.ceil (Math.cbrt(0.125), Math.sqrt(0.64));
System.out.println("CY=" +cy);
What will be the output of the given Java code after the calculation [note the data types]?
double kv = Math.abs(Math.min(Math.floor(9.9), Math.ceil(9.9))−Math.round(24.6));
System.out.println ("KV=“ +kv);
Given below is the program with errors in it. Identify the errors. Rewrite the program and predict the output.
import java.util.*
class Prog 1
{
void main
{
int A, B, С;
Scanner sc=new Scanner(System.in ());
System.out.print("\n Enter the value of A : ");
A = sc.nextInt();
System.out.print("\n Enter the value of B: ");
B = sc.nextInt();
If (A<B)
{
C=A;
}
else
{
C=B;
}
else
{
C=C;
}
System.out.print("\n The largest is="+C);
}
}Given below is the program with errors in it. Identify the errors. Rewrite the program and predict the output.
import java.util.*
class Program
{
int A, B, C;
Scanner sc = new Scanner.System.in;
System.out.print("\n Enter the value of A: ");
A = sc.nextInt();
If (A % 10=0 )
{
System.out.println(" A is an Even number ");
else
{
System.out.println(" A is an Odd number ");
}
}
}Given below is the program with errors in it. Identify the errors. Rewrite the program and predict the output.
import java.util.*;
class
{
main()
{
int p=0, q=0;
Scanner sc = scanner (System.in);
System.out.print ("Enter p :");
p = nextInt();
System.out.print ("Enter q :");
p = nextInt();
if(p/q=0)
{
System.out.print(q "is a factor of" p);
}
else if
{
System.out.print (q "is NOT a factor of" p);
}
}
}Given below is the program with errors in it. Identify the errors. Rewrite the program and predict the output.
import java.util.*;
Class Program 4
{
void main()
{
int n=0, p; Scanner sc = new Scanner (System.in);
System.out.print(" Enter n : "); n == sc.nextInt();
for(j=1; j<=10; j++)
p=nxj;
System.out.println (p + "x"+j+"= "+i);
}
}Given below is the program with errors in it. Identify the errors. Rewrite the program and predict the output.
import java.util.*;
class ProGram
{
void main()
{
int n=0, tn = 0, p = 0 ; Scanner sc = new Scanner (System.in);
System.out.print("\n Enter total terms (n) :");n = sc.nextInt();
for(tn = n; tn<=1; tn--)
{
p =p*tn;
System.out.print("Factorial of n =" + p );
}
}
}Write the output of the following program code.
int r=0, с=0;
for (r=1; r<=6; r++)
{
for(c=6; с>= r; c--)
{
System.out.print(" "+c) ;
}
System.out.println ();
}Write the output of the following program code.
int r=0, c=0;
for (r=1; r<=5; r++)
{
for(c=1; c<=r; c++)
{
System.out.print(" "+c);
}
System.out.println ();
}Write the output of the following program code.
int r=0, c=0;
for (r=6; r<=10; r++)
{
for(c=6; c<=r; c++)
{
System.out.print(" "+c);
}
System.out.println ();
}Write the output of the following program code.
int r=0, c=0;
for (r=9; r>=5; r--)
{
for(c=9; c>=r; c--)
{
System.out.print(" " + c);
}
System.out.println ();
}Define a class to accept a 3 digit number and check whether it is a duck number or not.
Note: A number is a duck number if it has zero in it.
| Example 1: | |
| Input: | 2083 |
| Output: | Invalid |
| Example 2: | |
| Input: | 103 |
| Output: | Duck number |
Rewrite the following program segment using logical operators:
if (x>5)
if (x>y)
System.out.println (x+y);WAmicable Number Definition: The number n is amicable if it belongs to an amicable pair. Two numbers n and m are called an amicable pair if the sum of all positive divisors of n and the sum of all positive divisors of m are equal to (n + m).
First ten such numbers: 220, 284, 1184, 1210, 2620, 2924, 5020, 5564, 6232, 6368. Declare a class named Numbers contain a method AmicableNos(int, int) that will check both the numbers are of Amicable pairs or not. Appropriate error message should be given in case.
Give the output of the following program segment:
int n = 4279; int d;
while(n>0)
(d=n%10;
System.out.println(d);
n=n/100;
}Write the value of n after execution:
char ch = 'd';
int n = ch+5;Write the Java expression for (a + b)x.
Evaluate the expression when the value of x = 4:x* = − − x + x + + + x
Convert the following do-while loop to a for loop:
int x=−10;
do
{x−−;
System.out.print(x);
}while (r>=1);Rewrite the following code using the if-else statement:
int m = 400;
double cl). = (m>300) ? (m/10.0) * 2:(m/20.0)−2;Define a class to overload the function print as follows:
| void print() | to print the following format | |||
| 1 | 1 | 1 | 1 | |
| 2 | 2 | 2 | 2 | |
| 3 | 3 | 3 | 3 | |
| 4 | 4 | 4 | 4 | |
| 5 | 5 | 5 | 5 | |
| void print(int n) | To check whether the number is a lead number. A lead number is one whose sum of even digits is equal to the sum of odd digits. |
|
e.g. 3669 odd digits sum = 3 + 9 = 12 |
Define a class to accept values in integer array of size 10. Find sum of one-digit numbers and sum of two-digit numbers entered. Display them separately.
Example: Input: a[] = {2, 12, 4, 9, 18, 25; 3, 32, 20, 1}
Output: Sum of one-digit numbers: 2 + 4 + 9 + 3 + 1 = 19
Sum of two-digit numbers: 12 + 18 + 25 + 32 + 20 = 107
Solutions for 1: Revision of Class 9 Syllabus
![Rupa Pandit solutions for कम्प्युटर एपलीकेशंस [इंग्रजी] इयत्ता १० आयसीएसई chapter 1 - Revision of Class 9 Syllabus Rupa Pandit solutions for कम्प्युटर एपलीकेशंस [इंग्रजी] इयत्ता १० आयसीएसई chapter 1 - Revision of Class 9 Syllabus - Shaalaa.com](/images/computer-applications-english-class-10-icse_6:a86debec6313407fa84cd182cd5e7e57.jpg)
Rupa Pandit solutions for कम्प्युटर एपलीकेशंस [इंग्रजी] इयत्ता १० आयसीएसई chapter 1 - Revision of Class 9 Syllabus
Shaalaa.com has the CISCE Mathematics कम्प्युटर एपलीकेशंस [इंग्रजी] इयत्ता १० आयसीएसई CISCE solutions in a manner that help students grasp basic concepts better and faster. The detailed, step-by-step solutions will help you understand the concepts better and clarify any confusion. Rupa Pandit solutions for Mathematics कम्प्युटर एपलीकेशंस [इंग्रजी] इयत्ता १० आयसीएसई CISCE 1 (Revision of Class 9 Syllabus) include all questions with answers and detailed explanations. This will clear students' doubts about questions and improve their application skills while preparing for board exams.
Further, we at Shaalaa.com provide such solutions so students can prepare for written exams. Rupa Pandit textbook solutions can be a core help for self-study and provide excellent self-help guidance for students.
Concepts covered in कम्प्युटर एपलीकेशंस [इंग्रजी] इयत्ता १० आयसीएसई chapter 1 Revision of Class 9 Syllabus are .
Using Rupa Pandit कम्प्युटर एपलीकेशंस [इंग्रजी] इयत्ता १० आयसीएसई solutions Revision of Class 9 Syllabus exercise by students is an easy way to prepare for the exams, as they involve solutions arranged chapter-wise and also page-wise. The questions involved in Rupa Pandit Solutions are essential questions that can be asked in the final exam. Maximum CISCE कम्प्युटर एपलीकेशंस [इंग्रजी] इयत्ता १० आयसीएसई students prefer Rupa Pandit Textbook Solutions to score more in exams.
Get the free view of Chapter 1, Revision of Class 9 Syllabus कम्प्युटर एपलीकेशंस [इंग्रजी] इयत्ता १० आयसीएसई additional questions for Mathematics कम्प्युटर एपलीकेशंस [इंग्रजी] इयत्ता १० आयसीएसई CISCE, and you can use Shaalaa.com to keep it handy for your exam preparation.
