TEXAS PAPERS

TEXAS INSTRUMENTS PAPER

2007-05-05T09:02:00.000-07:00

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

TEXAS TECHNICAL TEST 2003

2007-05-05T08:50:00.000-07:00

TEXAS 1999

2007-05-05T08:49:00.002-07:00

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
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 be
a. 5 and 12
b. 6 and 13
c. 9 and 16
d.none

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

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

A. 0X1030 AND 0X20C3
B. OX1031 AND OX20C4
AND 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,10
c.5,5
d. none

5. main()
{
int i;
fork();
fork();
fork();
printf("----");
}

how many times the printf will be executed .
a.3
b. 6
c.5
d. 8

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

a. its output is hex representation of i
b. bcd
c. binary
d. decimal

7.#define f(a,b) a+b
#define g(a,b) a*b

main()
{

int m;
m=2*f(3,g(4,5));
printf("\n m is %d",m);
}

what's the value of m
a.70
b.50
c.26
d. 69

8.
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 null
d. 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 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)
(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-time
b. run-time
c. link-time
d. load-time

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

______________________________________________________

TEXAS IITB

2007-05-05T08:49:00.001-07:00

> > > TEXAS INSTRUMENTS PAPER
> > > ------------------------
> > >
> > >
> > > 1.THE CURRENT IN 4-OHM RESISTOR IS (CIRCUIT IS
> > > GIVEN)
> > > ANS:1A
> > >
> > > 2.WHAT IS THE BELOW CIRCUIT
> > > A)MEMORY ELEMENT
> > > B)LATCH
> > > C)AND GATE
> > > D)OSCILLATOR
> > > ANS:NOT SURE
> > >
> > > 3.KARNAUGH MAP
> > > ANS:B'(B-BAR)
> > >
> > > 4.HOW MANY 2:1 MUX ARE REQUIRED TO IMPLEMENT 8:1 MUX
> > > ANS:7
> > >
> > > 5.TWO N_MOS FETS ARE THERE .WHAT IS THE OUTPUT=20
> > > ANS:3VOLTS
> > >
> > > 6.#DEFINE SUM (A,B) A+B
> > > FIND THE VALUE OF X
> > > X=3DSUM(2,3)*SUM(3,2)
> > > ANS:13(NONE OF THE ABOVE)
> > >
> > > 7.FIND VALUE OF SIGMA B[i] =B7(-2)POWER I
> > > WHERE B[i] IS THE VALUE AT THE ITH PLACE
> > > WHAT IS RESULT IF INPUT IS 0 1 1 0 0 1 1 0
> > > ANS:+34
> > >
> > > 8.(A EX-OR B)EX-OR B=3D
> > > ANS:A
> > >
> > > 9.AB+CD+EF HOW MANY TWO I/P NAND GATES ARE REQUIRED
> > > TO IMPLEMENT THE ABOV=
> > > E FUNCTIION
> > > ANS:6
> > >
> > > 10.HOW MANY BOOLEAN FUNCTIONS WE CAN REALIZE WITH
> > > ONE INPUT
> > > ANS:4
> > >
> > > 11. WHAT IS THE TOTAL POWER DISSIPATION IF EACH BULB
> > > RATED AT 20 W ,120V=
> > > OLTS(IN THE GIVEN FIGURE)
> > > ANS:12W
> > >
> > > 12. TO INCREASE THE SLOPE OF C-MOS .WHAT IS TO BE
> > > DONE.
> > > ANS:INCREASE W/L RATIO OF P-MOS
> > >
> > > 13.IF THERE ARE W PEOPLE STANDING IN THE QUEUE AT
> > > FIRST IF THE RATE OF RE=
> > > MOVAL IS PROPORTIONAL TO REMAINING PERSONS IN THE
> > > QUEUE.
> > > ANS:DECREASES EXPONENTIALLY
> > >
> > > 14.SIMLIFY THE FOLLOWING BOOLEAN EXPRESSION=20
> > > A'+A'C+AB'
> > >
> > > 15.AB'+BC IN THE FOLLOWING ANSWERS WHICH ARE
> > > EQUILENT TO GIVEN FORM FUNCT=
> > > IONALLY
> > > ANS:ALL OF THE ABOVE
> > >
> > > 16.CIRCUIT CONSISTS OF 6 FETS IS GIVEN. O/P IS
> > > ANS:(A+BC)'
> > >
> > > 17. IN THE FOLLOWING IF 8 I/P 'S IS GIVEN TO AND
> > > GATE .WHICH IS THE FASTE=
> > > ST IMPLEMENTATION=20
> > > ANS: ((( AB)(CD))((EF)(GH)))
> > >
> > > 18. IF PROBABILITY OF EACH INPUT HIGH IS 0.5
> > > AND LOW IS 0.5.WHAT IS THE PROBABILITY OF O/P AS
> > > HIGH.
> > > CIRCUIT IS GIVEN)OUTPUT Y=3D(AB)+(CD)'
> > > ANS:13/16.
> > >
> > > 19.OUT PUT OF THE GIVEN CIRCUIT(WHEAT STONE BRIDGE
> > > WITH DIODES)
> > > ANS:0 VOLTS
> > >
> > > 20.IF C IS THE CAPACITENCE AND V IS THE APPLIED
> > > VOLTAGE AND F IS THE SWIT=
> > > HING FREQUENCY THEN POWER DISSIPATION IS
> > > ANS: F*C*V*V
> > >

TEXAS REC 2000

2007-05-05T08:48:00.003-07:00

M.N.R.E.C TI PAPER (2000)

about all interviews in brief they are asking about n/w's so prepare well.

20 tech q's (1 hr)
tech:
multiple choice , q's are not in order

1)Reentrant os required
a)multitasking
b)multiuser
c)both
d)none
ans: c (check)

2)identify a DFA for all strings which ended with string '00'
4 dfa's have given , u can simply identify
3)dfa has given we have to find the string accepted by that.

4)in a memory hierarchy, M1,M2
M1 access time is 2 ns ,M2 accesstime is 100 ns . the hit ratio for
M1 is .97, then what's the avg access time
ans: 500 ns

5) Interrupts main use is for elimination of
a) spooling
b)polling
c)job scheduling
d)....

6)A coprocessor for floating point operations has given. after that the execution of the
floating point ops has incresed by 20 times. if 20% floating pt ops are there then
what's the sped up?

7) two heaps of sizes m,n are given,
then the time needed to merge them
a)m
b)n
c)m+n
d) none
8)context switching is useful in
a) spooling
b) polling
c)interrupt handling
d) interrupt servicing

9) if 2^n leaves are given in a tree then no.of internal nodes
a)2^n
b) 2^n -1
c);......

10) semaphores used for
a)to prevent deadlocks
b) to sycronize critical activities
c)....

remaining q's i have forgot, but some q's are about c (easy)

u can do 18 q's in this section ( i.e this sec is that much easy)

anal:
it's some what difficult.
in this sec they has given big passeges, analytical reasoning,some apti bits
i have forgot many of the q's
so i am giving here few q's
but it's very easy to shortlist in this TI, if u done this sec well.

1) derivative of e^sinx
2)x=2yt y=2t^2
dy/dx? (figures may not correct)

x mod y=x-y[x/y]
=x-y{x/y} some conditions are given
[x/y] means floor operation.
{x/y} ceal op.

based on this 4 or 5 q's are given u can do the all the q's except
one q.
that's why iam giving only one q from this

3)xmod 3=2, xmod5=10 then xmod15=?

i can't give the remaining q's those are very lengthy i have forgot those.

about TI interview:

Ti is asking v.....very basic fundaasssss
for me they have asked only in c, but some other persi\ons they asked in ds,os,ip etc.

in c they have asked
if u have given a 32 bit no. u have to set m th bit without using any arithmetic ops
and u must have to write in a single expr. (hint: use &,<< ops)
they asked the same for reset.

they have asked to print 2^0 to 2^16 with out using any arith. ops. (same as above)
if u have given two seperate c files u have toexecute these two in one by linking how
u can achieve this (hint: make utility)

about ds:
they have asked how u can print levelwise in a tree ( hint: bfs)

TEXAS IITK C SECTION

2007-05-05T08:48:00.001-07:00

Here is the C section.(not in order)

1. x=x^y;
y=x^y;
x=x^y;
x=?

2. In a link list we want to go from

last to first element and vice
versa.
Which is efficient
a. Cirular List
b. Doubly Link List
c. Double Ended Link List
d. Simple List

3.Hash function h(i)=i mod 5, there are 5 buckets 0,1,2,3,4. Rehashing is
(h(i)+1)mod 5,(h(i)+2)mod 5......
5 numbers are to be enterd, Find the number in a given bucket..

4.To reconstuct a Tree which sequence is enough
a. Inoreder sequence
b. Preorder and Post order
c. In, Pre, Post order are required
d. Any one can be used

6.convert a inorder string to post order

7.int (*a[5])() what is this declaration?

There were in all 10 questions in this. Also a section on Analog Circuits,
Digital Circuits and Computer Architecture. Do any 2 of 4.

TEXAS REC TRICHY 2000

2007-05-05T08:47:00.002-07:00

Texas Instruments. rec trichy this year (2000).
don't bank on it. might be.

-----------------------------------------------------------------------
75 qs in 60 min.....
-- 2 reading comprehesion.. 5 qs each...
-- quanta....5 qs.
-- data sufficiency..5 qs.
Q..u have weights only in power of 3... based on
it answer 5
qs. like for given weight what are the combination of
available
weight..
-- data interpretation 2 qs..5 qs each
Q..one qs witin a circle population % is given
based on it 5
qs.(PI chart)
-- analitical
Q.. one tour is shedhuled for 9 countries..each
country have 2
days shedhule....tour held on for 12 days..
some cond'n are given..like if u visit ROME u
have to visit
australia .....
based on it 5 qs...like which 3 countries
missed...
Q..4 metals are given..each year % price of these
metals are
increasing..some more cond'n.....based on it 4 qs..
answer of one qs is 13.6%
Q.. {x}=greater real of x
[x]=least real of x
x mod y = some expression is given
based on it 5 qs...like calculate 5 mod 3....

TEXAS PAPER

2007-05-05T08:47:00.001-07:00

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

TEXAS 1999

2007-05-05T08:46:00.001-07:00

----------------------------------------------------------------------------

>^M
> THIS IS TI 1999 jadavpur for ECE students.for cs another paper is ^M
>given^M
>^M
>1.two transistors are connected Vbe is 0.7volts .this is simple ckt.one ^M
>transistor is diode equivalent. & asked the o/p across the 2 nd transistor.^M
>2.simple k map ans is Bbar.^M
>3.^M
>^M
> Emitter^M
>---R-------transistorbase| --^M
> | ---^M
> collector^M
> in above capacitor is connected parallel with resistance ^M
>r.capacitor is not shown^M
> in fig.capacitor is used for in this ckt:^M
>^M
>^M
> ans:a.speedupb.active bypass c.decoupling^M
> 4.^M
>^M
> -----R------I----------o/p^M
> |___R____ |^M
> in above r is resistence.I is cmos inverter.^M
> then ckt is used for:^M
>^M
>^M
> a.schmitt trigger b.latch c.inverter ^M
>d.amplifier^M
>^M
>^M
> 5.simple amplifier ckt openloop gain of amplifier is 4.V in ^M
>=1v.asked for V x?^M
> amplifdier + is connected to base. - is connected to i/p in between ^M
>5k is connected.^M
> from o/p feedback connected to - of amplifier with 15k.this is ckt.^M
>^M
>^M
> 6.resistence inductot cap are serially connected to ac voltage 5 ^M
>volts.voltage across^M
> inductor is given.R I C values are given & asked for^M
> voltages across resistence & capacitor.^M
> 7.^M
> ___ R_____^M
> | |^M
> ---R------OPAMP ----------^M

> |---^M
> R1 R1 is for wjhat i mean what is the purpose of R1.^M
> |^M
>^M
> ground^M
>^M
>^M
> 8.asked for Vo at the o/p.it is like simple cmos realization that is n ^M
>block is above^M
> & p block is below.Vdd is 3 volts at supply.V threshold 5 volts.^M
> 9.2 d ffs are connected in asyncro manner .clock 10 MEGAHZ.gate delay ^M
>is 1 nanosec.^M
> A B are the two given D FFs.asked for AB output is:^M
>^M
>^M
> a.updown^M
> b.up c. updown glitching like that (take care abt glitching word)^M
>^M
> 10.^M
>^M
>^M
> ----------------| subtractor|---------o/p^M
> |___HPF____|^M

>^M
> the ckt is LPF ,HPF or APF ?^M
>^M
> 11.in a queue at the no of elements removed is proportional to no of ^M
>elements in^M
> the queue.then no of elements in the queue:^M
> a.increases decreases exp or linearly(so these are the 4 options given ^M
>choose 1 option)^M
> 12.with 2 i/p AND gates u have to form a 8 i/p AND gate.which is the ^M
>fastest in the^M
> following implementations.^M
> ans we think ((AB)(CD))((EF)(GH))^M
> 13.with howmany 2:1 MUX u can for 8:1 MUX.answer is 7.^M
> 14. there are n states then ffs used are log n.^M
> 15.cube each side has r units resistence then the resistence across ^M
>diagonal of cube.^M
> 16.op amp connections asked for o/p^M
> the answer is (1+1/n)(v2-v1).check it out.practise this type of model.^M
> 17.^M
> _____________ supply^M
> ---|__ ___|^M
> Ii >________ |___ Tranistot^M
> > _______Vo^M
> > _______Vo^M
> |^M
> |^M
> R |^M
> | | Io^M
> ground.^M
>^M
>^M
>^M
>^M
> asked for Io/Ii=? transistor gain is beta.^M
>^M
>^M
> a.(1+beta)square b.1+beta c. beta^M
>^M
>^M
> 18.y=kxsquare. this is transfer function of a block with i/p x & o/p ^M
>y.if i/p is^M
> sum of a & b then o/p is :--^M
>^M
> a. AM b.FM c. PM^M
> 19.^M
> ------MULTIPLIER--- |^M

> | |^M
> _____R__|__OPAMP______________________Vo^M
> ---^M
> |^M
> ground.^M
> v in = -Ez then o/p Vo =?^M
> answer is squareroot of -Ez.multiplier i/ps are a & b then ^M
>its o/p^M
> is a.b;^M

TEXAS IISc

2007-05-05T08:45:00.002-07:00

Technical was "very easy" but Aptitide was lengthy & hence
difficult.
Interview was cool...........
Just clear the test.............and get it.

I appeared for CS sections, there were easy programs on C and in
other section few questions on DSA, OS and Architecture.

1. binary search complexity
2. for a paging system 2 programs were given u have to choose the
faster one
3. 1 q. on bigendian
4. If high priority process comes when low prority process is
running, what will OS do?
5. i simple qn on Hash table with rehashing.
5 nos were given with rehashing , find the location at
2nd position.
6. difference between combinational and sequential logic
7. find formula for effective access time calculation... hit
ratio,cache access time and memory access time was given.
8. int *ptr[4]() something like this.........
what does it represent?
9. In an architecture at each fun. call it stores 4 registers and
on return loads the 4. each load and store take 1 cycle.
A recursive fn to find fibonacci seriese is given with start val as 5.
Calculate the num of extra cycles reqd in load/store.

n = 5;
fib(int n)
{ if(n ==0 || n==1)
return(1);
return( fib(n-1) + fib(n-2) );
}
ans 120 check.

Can't recall all the questions ..............sorry...............
Apti is imp........... prepare for that............

TEXAS CSc 2001

2007-05-05T08:45:00.001-07:00

hi all
i am sending you TI CSE paper 2001
ENJOY.
BEST OF LUCK TO ALL OF YOU.

about all interviews in brief they are asking
about n/w's so prepare well.

20 tech q's (1 hr)
tech:
multiple choice , q's are not in order

1)Reentrant os required
a)multitasking
b)multiuser
c)both
d)none
ans: c (check)

2)identify a DFA for all strings which ended
with string '00'
4 dfa's have given , u can simply
identify
3)dfa has given we have to find the string
accepted by that.

4)in a memory hierarchy, M1,M2
M1 access time is 2 ns ,M2 accesstime is 100
ns . the hit ratio for
M1 is .97, then what's the avg access time
ans: 500 ns

5) Interrupts main use is for elimination of
a) spooling
b)polling
c)job scheduling
d)....

6)A coprocessor for floating point operations
has given. after that the execution of the
floating point ops has incresed by 20 times.
if 20% floating pt ops are there then
what's the sped up?

7) two heaps of sizes m,n are given,
then the time needed to merge them
a)m
b)n
c)m+n
d) none
8)context switching is useful in
a) spooling
b) polling
c)interrupt handling
d) interrupt servicing

9) if 2^n leaves are given in a tree then no.of
internal nodes
a)2^n
b) 2^n -1
c);......

10) semaphores used for
a)to prevent deadlocks
b) to sycronize critical activities
c)....

remaining q's i have forgot, but some q's are
about c (easy)

u can do 18 q's in this section ( i.e this sec is
that much easy)

anal:
it's some what difficult.
in this sec they has given big passeges,
analytical reasoning,some apti bits
i have forgot many of the q's
so i am giving here few q's
but it's very easy to shortlist in this TI, if u
done this sec well.

1) derivative of e^sinx
2)x=2yt y=2t^2
dy/dx? (figures may not correct)

x mod y=x-y[x/y]
=x-y{x/y} some conditions are given
[x/y] means floor operation.
{x/y} ceal op.

based on this 4 or 5 q's are given u can do the all
the q's except
one q.
that's why iam giving only one q from this

3)xmod 3=2, xmod5=10 then xmod15=?

i can't give the remaining q's those are very
lengthy i have forgot those.

about TI interview:

Ti is asking v.....very basic fundaasssss
for me they have asked only in c, but some other
persi\ons they asked in ds,os,ip etc.

in c they have asked
if u have given a 32 bit no. u have to set m th
bit without using any arithmetic ops
and u must have to write in a single expr. (hint:
use &,<< ops)
they asked the same for reset.

they have asked to print 2^0 to 2^16 with out
using any arith. ops. (same as above)
if u have given two seperate c files u have
toexecute these two in one by linking how
u can achieve this (hint: make utility)

about ds:
they have asked how u can print levelwise in a
tree ( hint: bfs)
*******************************************