TEXAS PAPER

2) simplification of boolean function
2) one question on sampling frequency
3) FSM(finite state machine): Adder: can be implimented using single FSM, Multiplier can take more than one FSM
4) ((a*b)+c)/d how many stack operations : 9
5) 128k bytes of cache , 32 bytes each, total memory 128Mbytes cache will devide the memory in how many : 1024.
6) Gate output is of the above ckt : tristate inverter with B as enable for high impedence state
7) totla number of two input boolean logic function can be implemented : 6 (OR, AND, EXOR, EXNOR, NAND, NOR)

8) y= ab+ a’c+bc Ans: may have glitch and can be reduced
9) which of the following is not an universal logic set , (a)2 to 1 Mux, (b)3-input NAND (c)2-EXOR+1-NOT (d)2-input AND + 2input OR.
10) REC trychy , train problem ans : 7.5 m/s
11) Voltage at node B for a ckt with two voltage sources of 10 v and 20 v. Ands: -5v
If the question is of voltage drop across R , it is ‘0’ . There is no current flowing through that element
12) two sequential flow digrams are given of 3 and 4 state rsply. So ans. is 3 and 4 .
13) Max frequency of operation is
T= T(steup time) + T(delay time)+ T(Skew time)
14) one question on big endean memory format (whether LSB is stored at starting address .)
15) CMOS questions : Vout Vs. Vin characteristics depend on W/L ratio.(answer which of the MOSFETS are having more steeper characteristics if the W/L ratios of PMOs or Nmos or both are goibg to be increased ).
16) Realeted to aptitude do all aptitude questions , if time permites then go to english setion.
Maintain time to answer aptitude section , because u should answer 60% of the aptitude .
All the best