Interrupt Latency Is The Time
Interrupt Latency Is The Time
Interrupt Latency Is The Time
Ans 6
Ans 5
4. Interrupt latency is the time elapsed between:
a. Occurrence of an interrupt and its detection by the CPU
b. Assertion of an interrupt and the start of the
associated ISR
c. Assertion of an interrupt and the completion of the
associated ISR
d. Start and completion of associated ISR
5. Which of the following is true for the function (A.B +
A’.C + B.C)
a. This function can glitch and can be further reduced
b. This function can neither glitch nor can be further
reduced
c. This function can glitch and cannot be further reduced
d. This function cannot glitch but can be further reduced
A B
+ +
10V 20V
_ _
GND B
I 1 I 2 I n I n +1 I n + 2
0
Y1 Y2 Yn Yn+1 Yn+2
ans n and..2^n
D1 Q1 D2 Q2 D3 Q3
CLOCK SIGNAL
a. 200 MHz
b. 333 MHz
c. 250 MHz
d. None of the above
ans a
12. Which of the following statements is/are true?
I. Combinational circuits may have feedback, sequential
circuits do not.
II. Combinational circuits have a ‘memory-less’ property,
sequential circuits do not.
III. Both combinational and sequential circuits must be
controlled by an external clock.
a. I only
b. II and III only
c. I and II only
d. II only
ans d
13. Consider an alternate binary number representation
scheme, wherein the number of ones M, in a word of N bits,
is always the same. This scheme is called the M-out-of-N
coding scheme. If M=N/2, and N=8, what is the efficiency of
this coding scheme as against the regular binary number
representation scheme? (As a hint, consider that the number
of unique words represent able in the latter representation
with N bits is 2^N. Hence the efficiency is 100%)
a. Close to 30%
b. Close to 50%
c. Close to 70%
d. Close to 100%
ans a
14. A CPU supports 4 interrupts- I1, I2, I3 and I4. It
supports priority of interrupts. Nested interrupts are
allowed if later interrupt is higher priority than previous
one. During a certain period of time, we observe the
following sequence of entry into and exit from the
interrupt service routine:
I1-start---I2-start---I2-end---I4-start---I3-start---I3-
end- --I4-end---I1-end
From this sequence, what can we infer about the interrupt
routines?
a. I3 > I4 > I2 > I1
b. I4 > I3 > I2 > I1
c. I2 > I1; I3 > I4 > I1
d. I2 > I1, I3 > I4 > I2 > I1
ans c
IN OUT INVERTER
0 1 0 1 0
+
+
_
_
B
Y
Void fib(int n)
{
if((n==0) || (n==1)) return 1;
return(fib(n-1) + fib(n-2));
}
a. 120
b. 80
c. 125
d. 128
a. 2
b. 6
c. 8
d. None of the above
Ans 16
2. k-map
ab
----------
c 1 x 0 0
1 x 0 x
solve it
a. A.B
B. ~A
C. ~B
D. A+B
Ans c
3.CHAR A[10][15] AND INT B[10][15] IS DEFINED
WHAT'S THE ADDRESS OF A[3][4] AND B[3][4]
IF ADDRESS OD A IS OX1000 AND B IS 0X2000
main()
{
int i;
printf("\n %d",i);
f(&i);
printf("\n %d",i);
}
1.10,5
2,10,10
c.5,5
d. none
5. main()
{
int i;
fork();
fork();
fork();
printf("----");
}
6.
void f(int i)
{
int j;
for (j=0;j<16;j++)
{
if (i & (0x8000>>j))
printf("1");
else
printf("0");
}
}
what's the purpose of the program
main()
{
int m;
m=2*f(3,g(4,5));
printf("\n m is %d",m);
}
8.
main()
{
char a[10];
strcpy(a,"\0");
if (a==NULL)
printf("\a is null");
else
printf("\n a is not null");}
9. char a[5]="hello"
15.
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 .
c. none
16.
struct a
{
int a;
char b;
int c;
}
union b
{
char a;
int b;
int c;
};
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 ...
bye..
p.sreenivasa rao
______________________________________________________
------------------------------------------------------------------------
Click Here to apply for a NextCard Internet Visa and start earning
FREE travel in HALF the time with the NextCard Rew@rds Program.
http://clickhere.egroups.com/click/449
eGroups.com home: http://www.egroups.com/group/csmtechiitm
http://www.egroups.com - Simplifying group communications
______________________________________________________
Get Your Private, Free Email at http://www.hotmail.com
----------------------------------------------------------------------------