Scribd
Upload
2 views2 pages

AVM Computer Prelims Question Set

The document contains a series of questions and answers related to computer programming concepts, including Java syntax, error types, and output expectations. It covers topics such as variable declarations, control structures, and array manipulations. The content appears to be part of a preliminary examination for a computer course.

Uploaded by

vidush673
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
2 views2 pages

AVM Computer Prelims Question Set

The document contains a series of questions and answers related to computer programming concepts, including Java syntax, error types, and output expectations. It covers topics such as variable declarations, control structures, and array manipulations. The content appears to be part of a preliminary examination for a computer course.

Uploaded by

vidush673
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd

computer1

AVM COMPUTER PRELIMS


Question 1
i) (b) private
ii) (c) 16
iii) (d) Assertion (A) is false and Reason (R) is true
iv) (c) 90
v) (a) [Link]([Link](2,4).toUpperCase());
vi) (a) left
vii) (a) a value that is greater than zero
viii) (d) run time error
ix) (a) 0
x) (d) All of these
xi) (b) 1,1 ?
xii) (a) 5 3 ?
xiii) (c) Assertion (A) is true and Reason (R) is false
xiv) (d) Both b and c ?
xv) (a) instance ?
xvi) (b) false
xvii) (c) String
xviii) (c) Class ?
xix) (c) 2,1,4,3
xx) (d) int m= display(45,'A');

Question 2
i) Output: /n 11 /n 13
ii) Corrected code:
int s[]= {2,22,3,32,4,42,5,52};
if(s[3]%2==0)
int sum= s[4] +s[8];
[Link](sum); Kind of error: Logical error
iii) char code;
switch(c0de)
{
case 'B':
case 'b':
[Link]("Businessman");
break;
case 'F':
case 'f':
[Link]("Fighter");
case 'E':
case 'e':
[Link]("Employee");
iv) Output:
EXP
RESSION
v) double m1[]= {74, 50, 90};
double m2[]= {65, 89, 69};
vi) double res= [Link]([Link](y) * [Link](a+b, 3.0))/u;
vii) a) [Link](pno);
b) [Link]("965")>=0
viii) arranged array: int n[]={70, 56, 40, 35, 22, 12, 9};
Number of iterations required: 6 iterations
Size of array in bits: 7*4 => 28 bytes => 224 bits
ix) a) [Link](0); or return
b) Binary search technique
x) String s="Hope";
int i=0;
do
{

You might also like