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


Home » Placement Papers » Texas Placement Papers » Texas Previous Year Placement Paper

 

Texas Placement Paper -: DATA STRUCTURES Questions And Answers


Advertisements
Advertisements




Texas Previous Years Solved Sample Placement Papers

  1. If A and B can do a piece of work in 10 days and A alone can do it in 15 days, how long will B take to do it?

    A. 25

    B. 20

    C. 15

    D. 30 Answer: Option D

  2. Solution: A's work rate is 1/15. A and B together can complete the work in 10 days, so their combined work rate is 1/10. Therefore, B's work rate is 1/10 - 1/15 = 1/30. Thus, B alone can do the work in 30 days.
  3. Q is not equal to zero and k = (Q x n - s)/2. Find n?

    A. (2 x k + s)/Q Answer: Option A

    B. (2 x s x k)/Q

    C. (2 x k - s)/Q

    D. (2 x k + s x Q)/Q

    E. (k + s)/Q

  4. Solution: Rearrange the equation to solve for n: n = (2 x k + s)/Q.
  5. If B occurs which must occur?

    A. D

    B. D and G

    C. G and H

    D. F and G

    E. J Answer: Option E

  6. Solution: The occurrence of B necessitates the occurrence of J.
  7. If J occurs which must have occurred?

    A. E

    B. either B or C Answer: Option B

    C. both E & F

    D. B

    E. both B & C

  8. Solution: For J to occur, either B or C must have occurred.
  9. int f(int a)
    
        {
            a = +b;
            //some stuff
        }
        main()
        {
            x = fn(a);
            y = &fn;
        }
        
    What are x & y types?

    A. x is int, y is a pointer to a function which takes an integer value Answer: Option A

  10. char a[5][15];
    int b[5][15];
    Address of a is 0x1000 and b is 0x2000. Find the address of a[3][4] and b[3][4]. Assume char is 8 bits and int is 32 bits.

    A. Address of a[3][4]: 0x10C4, Address of b[3][4]: 0x20C4 Answer: Option A

  11. TECHNICAL TEST:
    3 flip-flops are connected so that after 0 to 5 count occurred next number is zero. So what is the counter?

    Ans: mod 6 counter

  12. Simplification of some boolean expression which is simple. Boolean Expression is A+A'B.

    Ans: A+B

  13. Given inorder sequence and preorder sequence and asked to find out postorder sequence.
  14. Some question on the value of a static variable.
  15. Given an integer in binary form, find the number of ones in that number without counting each bit. (This question is not a multiple-choice question. This question carries more marks. So please take care of this question.)
  16. 1-way set associative memory is called-----

    A. direct

    B. something

    C. 1-way set associative Answer: Option C

    D. something

  17. Fastest IPC mechanism is

    A. shared memory

    B. pipes

    C. named pipes

    D. semaphores Answer: Option C

  18. Some page references are given. You are asked to implement it with Least Frequently Used algorithm.
  19. Some diagram is given. I am describing the diagram. A 2*1 MUX is given. The inputs are A, B. Output is C. C and A are tied together. What is the diagram?

    Ans: Latch

  20. This paper is for Electrical & Electronics students. There is a separate test for Computer Science Students. There are 20 questions.
  21. Some circuit is given. I am describing the circuit. A resistor R & a capacitor C are connected in parallel. To this circuit, another circuit which is having a capacitor of capacity 2C & an impedance Z is connected in series. You are asked to find out the value of Z? Note that 2C & Z are connected in series.

    A. Z=2C

    B. Z=2L

    C. Z=L/2

    D. Z=2R Answer: Option D

  22. Some circuit which consists of only resistors R is given. This is a repetitive circuit. You have to find the effective resistance of the entire circuit.

    A. Rin=R

    B. Rin=(5+sqrt(3))/7

    C. Rin=(19+sqrt(3))/8

    D. None Answer: Option D

  23. Two waveforms are given. You are asked to write the circuit to get B (second waveform) from A (first waveform).
  24. 
    #define SUM(a, b) a + b
    main() {
      a = 2;
      b = 3;
      x = SUM(a, b) * 2;
      printf("x=%d\n", x);
    }
        

    Ans: 8

  25. number(int i)
    
    {
        number++;
        printf("%d\n", number);
    }
    main() {
        static int i = 0;
        number(i);
    }
        

    Ans: I don't know

  26. Some circuit is given. I can't describe the circuit. There are 3 resistors, 3 capacitors & one inverter. The question is: What is the value of the frequency such that the circuit oscillates?

    A. f=RC

    B. f=sqrt(3)/(Pi*R*C)

    C. f=1/(Pi*R*C)

    D. something

    Ans: I don't know the answer

  27. Question on flip-flop. So go through all flip-flops.
  28. There are 5 questions on Nmos & Pmos circuits.
  29. This Paper is for Computer Science Students. This paper is very easy. You can definitely do it in one hour.
  30. The fastest memory is

    A. DRAM

    B. ROM

    C. SRAM Answer: Option C

    D. Main memory




 


.

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