Here is Texas paper for you.
in this paper there was 20 questions as follows in 60 minutes .
second part consists of 36 que. in 30 minutes all questions are
1. if a 5-stage pipe-line is flushed and then we have to execute 5 and
instructions respectively then no. of cycles will be
a. 5 and 12
b. 6 and 13
c. 9 and 16
c 1 x 0 0
1 x 0 x
3.CHAR A AND INT B IS DEFINED
WHAT'S THE ADDRESS OF A AND B
IF ADDRESS OD A IS OX1000 AND B IS 0X2000
A. 0X1030 AND 0X20C3
B. OX1031 AND OX20C4
AND SOME OTHERS..
4. int f(int *a)
what's the output .
how many times the printf will be executed .
void f(int i)
if (i & (0x8000>>j))
what's the purpose of the program
a. its output is hex representation of i
7.#define f(a,b) a+b
#define g(a,b) a*b
printf("\n m is %d",m);
what's the value of m
printf("\a is null");
printf("\n a is not null");}
what happens with it .
a. compile time error.
b. run-time error.
c. a is null
d. a is not null.
9. char a="hello"
a. in array we can't do the operation .
b. size of a is too large
c. size of a is too small
d. nothing wrong with it .
10. local variables can be store by compiler
a. in register or heap
b. in register or stack
c .in stack or heap .
d. global memory.
11. average and worst time complexity in a sorted binary tree is
12. a tree is given and ask to find its meaning (parse-tree)
ans. ((a+b)-(c*d)) ( not confirmed)
13. convert 40.xxxx into binary .
14. global variable conflicts due to multiple file occurance
is resolved during
two program is given of factorial.
one with recursion and one without recursion .
question was which program won't run for very big no. input because
of stack overfow .
a. i only (ans.)
b. ii only
c. i& ii both .
which is correct .
a. size of a is always diff. form size of b.(ans.)
b. size of a is always same form size of b.
c. we can't say anything because of not-homogeneous (not in ordered)
d. size of a can be same if ...