here is the full paper of TI India IITB 20/07/2001.
WITH SOME ANSWER
the paper had 4 sections in which we have to attend 2 sections
i attempted digtal and analog and in apti, there was 75 Qs in 60min. be prepare
for it also, apti was very tough. Apti was more mathematical stuff, requires a
lot of thinking and very high speed. ex. Coding. reading compreh.(RC),
calculations, relationship, travelling problem (given some cities and
journey conditions were given) etc etc...
DIGITAL
------
1. nand gate is
a) Associative &cumulative
b) Cumulative but not associative
c) Not cumulative but associative
d) not cumulative and associative
ANS. b
2. Which imp has les delay
a) (a xor b) xor (c xor d)
b) (((a xor b) xor c) xor d)
(think on the situation when input a, b, c, d are comes in ascending (i.e. a frist then b
then c and then
d) and desending (opposite order)
3) one inverter cmos circuit was given with A variable and enable B signal
ANS. tristate inverter with B as enable
4)a logic cell which dertermines(op =1) for odd no.. of 1s in the given seq is
ANS. one xor gate
5)circuit
------
| ttl |q---+diode--inverter--res--+led---gnd |Logic|
-------
led should glow when q=0 and off when q=1 the choices are
a.ckt will funct as given
b.it wont funct as given
c.q cant drive ttl inverter
d.non of these
ANS: b
6)n nets are givenin how many ways can we model each of the stuck at fault in n nets in
single(one at a time) and w....
ANS. 2n and (3^n)-1
7) circiut with 2 d ffs was given i/p
whaT is the relation between B and clk i/p?
D O/p
D
clk clk
CLK
XOR
Ans. b is 1/3 of clk i/p with 50% duty cycle.
8)3 dffs was given with common clk
setup time 3ns
hold time 1ns
clk to q delay 2ns find the maximum frequency of
operation
ANS: 200MHz
9)fsm question there states given ques what
is the
machne called
s1---------------
if 0 same state 1 goes to s3
s2<-------------s3 if 1 same
state s3
0
if 1 same state s2
ans: MOORE M/C
10. consider a adder and multiplier
question ios some what like can both implemented
in
same fsm or cant
ANS: Yes they can implemented in same machine.
these are the 10 ques asked in digitl section and
we are in a
situation to attend 2 section i attented analog
part
and i am giving the ruogh idea of analog section
***********
Analog part 10questions
1. input is sine wave
what is the op in the middle of serially connected
2
rc parallel ckts
-------------
r c
sine wave ------------op
r c
-------------
a. cos wave
b.sine wave with 0 phase shift
etc
ANS: b
2.square wave as input given to the ckt
-------res------
L and C
IN PAR
----------------
What is the op in the cap
ANS: SINE WAVE.
3.in 5v wave --------
+5v |
--- C
---
|vo=5V (intially)
|
--- C
- ---
|
GND------
to the circuit in which two cap are
connected in series
what is the op at the vo at time T
intially it was at 5v
ans: may be 5V. (CHECK IT MAY BE 2.5 V)
4.darlinton pair was given with beta as ct gain of
each trans
what is the overall gain
ans: (beta+1)^2
_______r_____
| |
5. GND----r---- -
opamp ----v0
vin----r---- + |
| |
I -----r--------
|
gnd
what isI?
ans Vin/R
6. -----10K------R-----10K-----
| | 20V
10V 10K 10K
------------| |------------
WHAT IS THE I IN R? ans. I=0Amp
7. IF THE INPUT SGL IS 95khz and it is
sampled
at 120samples
per sec the at what freq wil the fft opt
fundemental freq will come
totally there were 10 questions in
analog ssection also
the numbering is not right
8. 6C 4C 4C
---||------||-------||---- Vo
| | | |
+ | | |
Supply 6V -- -- -- 4C
DC - -- 2C -- 2C --
| | | |
| | | |
----------------------------GND
find out Vo=? (caps vaule may be changed).
ANS was 0.75V but here i think cap. values changed,
so calculate urself
for currect answer.
9. Vo
-----R-----|------Switch-----
| | |
+| | |+
5V DC ---C 2V DC
-| --- |
| | |
----------------------------------GND
Switch is open at t=0, what is the value of Vo at
t=infinity. Ans. 5V
10. one Qs on current mirror. there are n current
mirrors are connected in series, you have to find
out
the condition for whitch current mirrors will be in
linear region.
(a)Vt
(b)Vt+ deta V
(c)n*Vt+ (n-1)* delta V
(d)n(Vt+delta V)
ANS: c
BEST OF LUCK
Best Regards
VIJAY KUMAR MATHUR
M.Tech.[Microelectronics]
Hostel No. 3, Room No. 192
I.I.T. Powai Mumbai-76 India
Zip code 400076
Phone No.+91-022-5722545 ext 8898 [Lab.]
=====
Vijay Kumar Mathur
M.Tech. IIT Bombay
Microelectronics
Plain Text Attachment [ Download File | Save to
my Yahoo! Briefcase ]
--- In teluguiitians@yahoogroups.com, hari prasad <b_hariprasad@y...>
wrote:
texas instruments paper .
in this paper there was 20 questions as follows in 60
minutes .
second part consists of 36 que. in 30 minutes all
questions are
diagramatical.(figurs)..
1. if a 5-stage pipe-line is flushed and then we have
to execute 5 and 12
instructions respectively then no. of cycles will
bea. 5 and 12b. 6 and 13
c. 9 and 16d.none 2. k-mapab----------c 1 x 0 0 1
x 0 xsolve it a. A.B
B. ~AC. ~BD. A+B3.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 0X2000A. 0X1030 AND
0X20C3
B. OX1031 AND OX20C4AND SOME OTHERS..4. int f(int *a){
int b=5;a=&b;}main(){
int i;printf("\n %d",i);f(&i);printf("\n
%d",i);}what's the output .1.10,5
2,10,10c.5,5d. none5. main(){int
i;fork();fork();fork();printf("----");}
how many times the printf will be executed .a.3 b.
6c.5d. 86. void f(int i){
int j;for (j=0;j<16;j++){if (i &
(0x8000>>j))printf("1");elseprintf("0");}}
what's the purpose of the program a. its output is hex
representation of ib. bcd
c. binaryd. decimal 7.#define f(a,b) a+b#define g(a,b)
a*bmain(){int m;
m=2*f(3,g(4,5));printf("\n m is %d",m);}what's the
value of ma.70b.50c.26d. 698.
main(){char a[10];strcpy(a,"\0");if
(a==NULL)printf("\a is null");else
printf("\n a is not null");}what happens with it .a.
compile time error.
b. run-time error.c. a is nulld. a is not null.9.
char a[5]="hello"
a. in array we can't do the operation .b. size of a is
too large
c. size of a is too smalld. nothing wrong with it .
10. local variables can be store by compilera. in
register or heap
b. in register or stackc .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) (expression 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
a. compile-timeb. run-time c. link-timed. load-time15.
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 onlyc. 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 ...
