TEXAS INSTRUMENTS: TECHNICAL TEST
**********CLICK ON THE IMAGE TO MAXIMIZE
Date: 20th December 2003
Venue: TAJ LANDS END, BANDRA-WEST, MUMBAI
Note: Out of 100 candidates only 7 were short-listed)
1. For a CMOS inverter, the transition slope of Vout vs Vin DC characteristics can be increased (steeper transition) by:
a. Increasing W/L of PMOS transistor
b. Increasing W/L of NMOS transistor
c. Increasing W/L of both transistors by the same factor
d. Decreasing W/L of both transistor by the same factor
2. Minimum number of 2-input NAND gates that will be required to implement the function: Y = AB + CD + EF is
a. 4
b. 5
c. 6
d. 7
3. Consider a two-level memory hierarchy system M1 & M2. M1 is accessed first and on miss M2 is accessed. The access of M1 is 2 nanoseconds and the miss penalty (the time to get the data from M2 in case of a miss) is 100 nanoseconds. The probability that a valid data is found in M1 is 0.97. The average memory access time is:
a. 4.94 nanoseconds
b. 3.06 nanoseconds
c. 5.00 nanoseconds
d. 5.06 nanoseconds
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
8. A CPU supports 250 instructions. Each instruction op-code has these fields:
• The instruction type (one among 250)
• A conditional register specification
• 3 register operands
• Addressing mode specification for both source operands
The CPU has 16 registers and supports 5 addressing modes. What is the instruction op-code length in bits?
a. 32
b. 24
c. 30
d. 36
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
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%
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
15. I decide to build myself a small electric kettle to boil my cup of tea. I need 200 ml of water for my cup of tea. Assuming that typical tap water temperature is 25 C and I want the water boiling in exactly one minute, then what is the wattage required for the heating element?
[Assume: Boiling point of water is 100 C, 1 Calorie (heat required to change 1 gm of water by 1 C)= 4 joules, 1 ml of water weighs 1 gm.]
a. Data given is insufficient
b. 800 W
c. 300 W
d. 1000 W
e. 250 W
16. The athletics team from REC Trichy is traveling by train. The train slows down, (but does not halt) at a small wayside station that has a 100 mts long platform. The sprinter (who can run 100 mts in 10 sec) decides to jump down and get a newspaper and some idlis. He jumps out just as his compartment enters the platform and spends 5 secs buying his newspaper that is at the point where he jumped out. He then sprints along the platform to buy idlis that is another 50 mts. He spends another 5 secs buying the idlis. He is now just 50 mts from the other end of the platform where the train is moving out. He begins running in the direction of the train and the only other open door in his train is located 50 mts behind the door from where he jumped. At what(uniform) speed should the train be traveled if he just misses jumping into the open door at the very edge of the platform?
Make the following assumptions
• He always runs at his peak speed uniformly
• The train travels at uniform speed
• He does not wait (other than for the idlis & newspaper) or run baclwards
a. Data given is insufficient
b. 4 m/s
c. 5 m/s
d. 7.5 m/s
e. 10 m/s
17. State which of the following gate combinations does not form a universal logic set:
a. 2-input AND + 2-input OR
b. 2-to-1 multiplexer
c. 2-input XOR + inverter
d. 3-input NAND
19. The FSM (finite state machine) below starts in state Sa, which is the reset state, and detects a particular sequence of inputs leading it to state Sc. FSMs have a few characteristics. An autonomous FSM has no inputs. For a Moore FSM, the output depends on the present state alone. For a Mealy FSM, the output depends on the present state as well as the inputs. Which of the statements best describes the FSM below?
a. It has two states and is autonomous
b. The information available is insufficient
c. It is a Mealy machine with three states
d. It is a Moor machine with three states
22. The value (0xdeadbeef) needs to stored at address 0x400. Which of the below ways will the memory look like in a big endian machine:
0x403 0x402 0x401 0x400
a. be ef de ad
b. ef be ad de
c. fe eb da ed
d. ed da eb fe
23. In a given CPU-memory sub-system, all accesses to the memory take two cycles. Accesses to memories in two consecutive cycles can therefore result in incorrect data transfer. Which of the following access mechanisms guarantees correct data transfer?
a. A read operation followed by a write operation in the next cycle.
b. A write operation followed by a read operation in the next cycle.
c. A NOP between every successive reads & writes
d. None of the above
24. An architecture saves 4 control registers automatically on function entry (and restores them on function return). Save of each registers costs 1 cycle (so does restore). How many cycles are spent in these tasks (save and restore) while running the following un-optimized code with n=5:
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
25. The maximum number of unique Boolean functions F(A,B), realizable for a two input (A,B) and single output (Z) circuit is:
a. 2
b. 6
c. 80
d. None of the above
HOME
YEAR N ORG
- C++ (1)
- CISCO 2000 (1)
- CISCO IN ISI (1)
- CISCO SELECTION PROCEDURE (1)
- CTS-JUNE-2005 (1)
- GD TIPS (1)
- GE-NIT-CALICUT-06 (1)
- HCL 1995 (1)
- HCL INTERIVIEW (1)
- HUGHES - 2003 (1)
- HUGHES DELHI 1997 (1)
- HUGHES-26/12/03 (1)
- I'VIE QNS TECH COMP (1)
- I'VIEW HOW TO DRESS (1)
- I'VIEW QNS AT EBAY (1)
- I'VIEW QNS ON C (1)
- I'VIEW QNS ORACLE (1)
- I'VIEW TIPS (TEAM) (1)
- I'VIEW TIPS 1 (2)
- I'VIEW TIPS 2 (1)
- I'VIEW TIPS 3 (1)
- I'VIEW TIPS 5 (1)
- I'VIEW WAY OF ANSWERING (1)
- IBM - 2006 (1)
- INFOSYS DCE DELHI 2K (1)
- INFOSYS 1997 (1)
- INFOSYS 1998 (1)
- INFOSYS CET 2000 (1)
- INFOSYS I'VIEW 05 (1)
- INFOSYS IISC (1)
- INFOSYS IISC 2K (1)
- INFOSYS IISC B'LORE (1)
- INFOSYS IITB 2000 (1)
- INFOSYS IITD 2000 (1)
- INFOSYS IT BHU 2K (1)
- INFOSYS PAPER (1)
- INFOSYS PAPR 97 (1)
- INFOSYS QNS (1)
- INFOSYS QYESTIONS (1)
- INFOSYS TECH LTD (1)
- INFOSYS VJIT 2000 (1)
- INFOSYS-BANGLORE-2006 (1)
- interview tips (1)
- ORACLE CANDIDATE EXP (1)
- ORACLE CHENNAI 13/07/03 (1)
- Oracle OFF CAMP (1)
- ORACLE-2001 (1)
- ORACLE-GUIDANCE (1)
- ORACLE-NITK-11/07/03 (1)
- ORACLE-OF CAMPUS 22/06/06 (1)
- ORACLE-OFCAMP -21/06/03 (1)
- ORACLE-OFCAMP 21/06/03 (1)
- ORACLE-OFCAMP-JULY 2003 (1)
- ORACLE-RECW-2003 (1)
- PATNI 1999 (1)
- RESUME 2 (1)
- RESUME 3 (1)
- RESUME 4 (1)
- RESUME 5 (1)
- RESUME 6 (1)
- RESUME 7 (1)
- SAS (1)
- SASKEN SEP 2003 (1)
- SATYAM 2K3 (1)
- SATYAM 2003 (1)
- SATYAM PAPER (1)
- SATYAM PAPER - GD (1)
- SATYAM PAPER CAND EXP (1)
- SATYAM PATTERN (1)
- SATYAM SAMPLE TEST (1)
- SATYAM2003 (1)
- SQL (1)
- Tcs (1)
- TCS - 2006 (1)
- TCS -JADAVPUR UNI 99 (1)
- TCS 01/07/06 PAPER I'VIEW (1)
- TCS 1998 (2)
- TCS 2000 (1)
- TCS 2003 (1)
- TCS B'LRE 23/09/06CAND EXP (1)
- TCS CAND EXPERIENCE (1)
- TCS CHENNAI 10/12/06 (1)
- TCS COBOL PAPER (1)
- TCS HYD 07/10/06 (1)
- TCS HYD 07/10/06 CAND EXP (1)
- TCS I'VIEW (1)
- TCS MODEL PAPER (1)
- TCS PAPER (1)
- TCS PAPER 1998 (1)
- TCS PAPER 2000 (1)
- TCS PAPER I'VIEW 24/07/06 (1)
- TCS PAPER1 (1)
- TCS PATTERN CAND EXP (1)
- TCS PONDY 02/06/07 I'VIEW (1)
- TCS RANCHI 24/07/06 (1)
- TCS ROORKEE 31/07/97 (1)
- TCS SAMPLE TEST 1 (1)
- TCS SAMPLE TEST 2 (1)
- TCS TALENT TEST 1 (1)
- TCS-HYD-20/10/06 (1)
- TEX TECH TEST 2003 (2)
- TEXAS PAPER 2000 (1)
- TEXAS 1999 (1)
- TEXAS 28/07/08 (1)
- TEXAS CSE 2001 (1)
- TEXAS IISc (1)
- TEXAS IITB (1)
- TEXAS IITK (1)
- TEXAS INSTR PAPER (1)
- TEXAS JADAVPUR 99 (1)
- TEXAS PAPER (1)
- TEXAS REC 2000 (1)
- wipro (1)
- WIPRO 1995 (1)
- WIPRO 1999 (1)
- WIPRO 2000 (1)
- WIPRO 2K (2)
- WIPRO INTERVIEW (1)
- WIPRO INTERVIEW 95 (1)
- WIPRO JULY 1997 (1)
- WIPRO NITDURGAPUR 03 (1)
- WIPRO PAPER 2000 (1)
- WIPRO PROCESS B'LORE (1)
- WIPRO ROORKEE 2K (1)
- WIPRO SAMPLETEST 2 (1)
- WIPRO SAMPLETEST1 (1)
- WIPRO SMAPLETEST 3 (1)
- WIPRO SURAT 2002 (1)
- WIPRO TECH 2000 (1)
Thursday, May 3, 2007
TEXAS TECHNICAL TEST
Posted by
pappuagloco
at
1:40 AM
Labels: TEX TECH TEST 2003
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment