As you want here I am giving bellow Orissa JEE Lateral Entry Question Paper for MCA subject on your demand:
1. Which of the following circuits can be used to store one bit of data?
A) Encoder
B) OR gate
C) Flip Flop
D) Decoder
2. What would be the output of the following C program?
main ( ){
int = 2, y = 5;
if ( < y) return (x = +y); else printf (d);
printf(d:”y);
}
A) 2:
B) 5:
C) 7: 5:
D) No output would be produced
3. What would be the output produced by the following program?
main (){
int d = 1;
do
printf(d\n d++);
while (d < = 9);}
A) 45
B) 2 3 4 5 6 7 8 9 10
C) 1 2 3 4 5 6 7 8 9 10
D) 1 2 3 4 5 6 7 8 9
4. Which one of the following C instructions is the odd one out?
A) j= j + 1;
B) j =+ 1;
C) j++;
D) j+= 1;
5. What would be the value of d at the end of execution of the following C code segment?
int a=7,b=12,c=5,d;
d= 2 * bc/3+ a/b
A) 23
B) 6
C) 25
D) 8
6. Which one of the following is the 2s complement representation of the decimal value 15?
A) 1111
B) 10111
C) 11111
D) 10001
7. In a C program, suppose the condition part of a for loop is missing. Then which one of the following
would be implicitly assumed about this missing for loop conditional?
A) It is assumed to be present and taken to be false.
B) It is assumed to be present and taken to be true.
C) It results in a syntax error.
D) Execution will be terminated abruptly.
8. What would be the output of the following C statement?
for(i=1; i<4; i++)
printf(“%d”,(i%2) ? i : 2*i);
A) 1 4 3
B) 1 2 3
C) 2 4 6
D) 2 2 6
9. What would be displayed corresponding to the following C code snippet?
char ch[6]={e, n, d, \0, p};
printf(“%s”, ch);
A) endp
B) end0p
C) end
D) error
10. What would be the values of the variables x,y,z, after the following C program statements have been
executed?
int x = 6, y=8, z, w;
y = x++;
z = ++x;
A) y=8, z=8, x=6
B) y=6, x=8, z=8
C) y=9, z=7, x=8
D) y=7, x=8, z=7
11. Which of the following is the correct declaration in C for an array S to hold a character string of
length 5?
A) char S[5];
B) string S[5];
C) char S[6];
D) string S[6];
12. How many nodes would a complete binary tree of height d (with root at height 0) have?
A) 2
d−1 +1
B) 2
d+1 −1
C) 2
d−1 −1
D) 2
d+1 +1
13. What is the average case time complexity of the quick sort algorithm?
A) O(n
2)
B) O(n)
C) O(n log n)
D) O(log n)
14. What would be the number of comparisons required to sort 5 numbers in ascending order using
bubble sort?
A) 7
B) 6
C) 10
D) 5
Orissa JEE Lateral Entry Question Paper for MCA subject 
