2026/2027 | Graded A+ | Assured Pass.
1. When the part of the original changing is gived as an debate from the mission order to the named order, we reply that it
is...
a. forgotten citation
b. copy gived
c. forgotten advantage
d. remark gived
e. nobody of the same
ANS a. forgotten remark
2. By virtue of what regularly does the communication box catch performed in a loop that starts accompanying the
following declaration?
int I;
for (I = 1; I < 4; I++)
{
MessageBox.Show(I);
}
a. 0
b. 2
c. 3
d. 1
e. no one of duplicate
ANS c. 3
4. By virtue of what many positions will skilled be for an array asserted as
strand[ ] Names
= new strand[4];
a. 4
b. 3
c. 2
d. 1
e. no one of duplicate
ANS a. 4
5. Later the rule is done killing, what is the profit of A[1]?
int[ ] A = new int[5]; int[ ] B = new int[3]; int x;
for (x = 0; x < 5; x++)
{
A[x] = x * 2 + 4;
}
a. 10
b. 8
c. 6
, d. 0
e. nobody of duplicate
ANS c. 6
3. What is the advantage of the changing I later u.s. city is done killing?
int I;
for (I = 1; I < 4; I++)
{
MessageBox.Show(I);
}
a. 1
b. 2
c. 3
d. 4
e. no one of the same
ANS d. 4
6. What is the maximum index of the array, B?
int[ ] A = new int[5]; int[ ] B = new int[3]; int x;
for (x = 0; x < 5; x++)
{
A[x] = x * 2 + 4;
}
a. 0
b. 2
c. 3
d. 4
e. nobody of the same
ANS b. 2
9. By means of what often will the following total kill?
int X = 0 while (X <= 8)
{
X = X + 2; // this is the total, count in this place
}
a. 6
b. 5
c. 4
d. 0
e. nobody of these, this is an limitless loop
ANS b. 5
10. That of the following pieces of rule will increase all the even numbers middle from two points 0 and 8 (containing 0 and
8, 0 is an even number, total starts at 0)? int x; is asserted for all of ruling class.
a. for (x=0; x<=9; x+=2)
{
total = total + x;
}
b. for (x=0; x<=8; x++)
{
total = total + 2 * x;