.
  Vyom World.com . Let's Touch the Sky Together!  
.

Home
VyomWorld.com Home
Interview Questions
VyomLinks.com Home
JobsAssist.com Home
Vyom Network
Contact Us
Jobs & Careers
Resume Submitter
Placement Papers
IT Companies Directory
Computer Jobs
Interview Questions
Online Exams
Vyom Career eMag.
Fun
Send FREE SMS!
SMS Jokes
Source Codes Library
Source Codes Home
ASP Source Codes
C Source Codes
C++ Source Codes
COBOL Source Codes
Java Source Codes
Pascal Source Codes
Submit Source Codes
GATE
GATE an Overview
GATE Preparation
Study Materal
GRE
GRE an Overview
GRE Questions
GRE Preparation
GRE Universities
TOEFL Preparation
TOEFL Resources
GMAT Preparation
GMAT Resources
MBA Preparation
MBA Resources
Networking Concepts
Networking Concepts
Testing Preparation
Testing Resources
Webmasters
Free Traffic Builder
Webmaster Articles
Web Hosting
Tutorials
Hardware Tutorial
1500 Free eBooks New!
Get 30,000 Interview Questions & Answers in an eBook.

Interview Success Kit - Get Success in Job Interviews





Interview Success Kit - Get Success in Job Interviews Interview Success Kit - 30,000 Interview Que. & Ans.
Home » Placement Papers » Texas Placement Papers » Texas Placement Paper

New Click here to Download 2024 Latest placement papers of this company New

 

Texas Placement Paper


Advertisements
Advertisements




Sample Questions
  1. For a CMOS inverter, the transition slope of Vout vs Vin DC characteristics can be increased

              (steeper transition) by: 

    1. Increasing W/L of PMOS transistor

    2. Increasing W/L of NMOS transistor

    3. Increasing W/L of both transistors by the same factor

    4. 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

    1. 4

    2. 5

    3. 6

    4. 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:

    1. 4.94 nanoseconds

    2. 3.06 nanoseconds

    3. 5.00 nanoseconds

    4. 5.06 nanoseconds

  4. Interrupt latency is the time elapsed between:

    1. Occurrence of an interrupt and its detection by the CPU

    2. Assertion of an interrupt and the start of the associated ISR

    3. Assertion of an interrupt and the completion of the associated ISR

    4. Start and completion of associated ISR

  5.  Which of the following is true for the function (A.B + A�.C + B.C)

    1. This function can glitch and can be further reduced

    2. This function can neither glitch nor can be further reduced

    3. This function can glitch and cannot be further reduced

    4. This function cannot glitch but can be further reduced

  6. For the two flip-flop configuration below, what is the relationship of the output at B to the clock frequency?

    1. Output frequency is 1/4th the clock frequency, with 50% duty cycle

    2. Output frequency is 1/3rd the clock frequency, with 50% duty cycle

    3. Output frequency is 1/4th the clock frequency, with 25% duty cycle

    4. Output frequency is equal to the clock frequency

             

  7. The voltage on Node B is:

    1. 0
    2. 10
    3. �10

       

  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?

    1. 32
    2. 24
    3. 30
    4. 36
  9.  In the iterative network shown, the output Yn of any stage N is 1 if the total number of 1s at the inputs starting from the first stage to the Nth stage is odd. (Each identical box in the iterative network has two inputs and two outputs). The optimal logic structure for the box consists of:

    1. One AND gate and one NOR gate

    2. One NOR gate and one NAND gate
    3. Two XNOR gates
    4. One XOR gate



  10. Consider a circuit with N logic nets. If each net can be stuck-at either values 0 and 1, in how many ways can the circuit be faulty such that only one net in it can be faulty, and such that up-to all nets in it can be faulty?

    1. 2 and 2N

    2. N and 2^N
    3. 2N and 3^N-1
    4. 2N and 3N
  11.  In the circuit shown, all the flip-flops are identical. If the set-up time is 2 ns, clock->Q delay is 3 ns and hold time is 1 ns, what is the maximum frequency of operation for the circuit?
              


     a.  200 MHz
     b.  333 MHz
     c.  250 MHz
     d.  None of the above

     

  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.

    1. I only
    2. II and III only
    3. I and II only
    4. 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%)

    1. Close to 30%

    2. Close to 50%
    3. Close to 70%
    4. 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?

    1. I3 > I4 > I2 > I1
    2. I4 > I3 > I2 > I1
    3. I2 > I1; I3 > I4 > I1
    4. 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.]

    1. Data given is insufficient
    2. 800 W
    3. 300 W
    4. 1000 W
    5. 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
    1. Data given is insufficient
    2. 4 m/s

    3. 5 m/s
    4. 7.5 m/s
    5. 10 m/s
  17. State which of the following gate combinations does not form a universal logic set:

    1. 2-input AND + 2-input OR
    2. 2-to-1 multiplexer
    3. 2-input XOR + inverter
    4. 3-input NAND
  18. For the circuit shown below, what should the function F be, so that it produces an output of the same frequency (function F1), and an output of double the frequency (function F2).     
                




         



          

    1. F1= NOR gate and F2= OR gate
    2. F1=NAND gate and F2= AND gate

    3. F1=AND gate and F2=XOR gate
    4. None of the above
  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?

    1. It has two states and is autonomous
    2. The information available is insufficient

    3. It is a Mealy machine with three states
    4. It is a Moor machine with three states



  20. In the circuit given below, the switch is opened at time t=0. Voltage across the capacitor at t=infinity is:

    1. 2V
    2. 3V
    3. 5V
    4. 7V

        
       

  21. What is the functionality represented by the following circuit?

    1. y= ! (b+ac)
    2. y= ! (a+bc)
    3. y= ! (a(b+c))
    4. y= ! (a+b+c)
  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?

    1. A read operation followed by a write operation in the next cycle.
    2. A write operation followed by a read operation in the next cycle.

    3. A NOP between every successive reads & writes
    4. 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));

    }

    1. 120
    2. 80
    3. 125
    4. 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:  

    1. 2
    2. 6
    3. 8

       






New Click here to Download 2024 Latest placement papers of this company New




 


.

Recently Updated: New Placement Papers added.
Vyom Network : Web Hosting | Dedicated Server | Free SMS, GRE, GMAT, MBA | Online Exams | Freshers Jobs | Software Downloads | Programming & Source Codes | GRE Preparation | Jobs, Discussions | Software Listing | Free eBooks | Free eBooks | Free Business Info | Interview Questions | Free Tutorials | International Business Information | IAS Preparation | Jokes, Songs, Fun | Free Classifieds | Free Recipes | FAQs | Free Downloads | Bangalore Info | Tech Solutions | Project Outsourcing, Web Hosting | GATE Preparation | MBA Preparation | SAP Info | Excellent Mobiles | Software Testing | Interview Questions | Freshers Jobs | Server Insiders | File Extension Directory

Copyright ©2003-2024 Vyom Technosoft Pvt. Ltd., All Rights Reserved. Read our Privacy Policy