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

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.
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 an Overview
GATE Preparation
Study Materal
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
Free Traffic Builder
Webmaster Articles
Web Hosting
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 2019 Latest placement papers of this company New


Texas Placement Paper


  1. Pattern  Consist of 

    Technical Test

    Contains three sections (Data Structures and Algorithms, Analog Circuits, Digital Circuits) you have to choose any two sections among the three. Each section has 10 questions each and the total time for the two sections is 45 minutes. There is negative marking.

    Aptitude Test

    75 questions – 1 hour – Negative marking is there

    Technical Interview

    Behavioral Interview

     Here is some sample Questions

    1. int fact(int n) int fact_ii(int n) 
      { { 
      if (n >0)
        int fact_val = 1, i = 0; 
      return n*fact (n-1); for (i = 1; i <= n ; i++) 
      else fact_val = fact_val*i; 
      return 1; return fact_val; 
      } } 
      (a) (i) only
      (b) (ii) only
      (c) both
      (d) None of these

    2. (2) Which of the following is a semantic error?
      (a) Division by zero
      (b) Missing of a semicolon at the end of a statement
      (c) Assigning a single precision real value to a long integer
      (d) All the above

    3. (3) If the following code segment is to count the no of zero’s in the given integer ‘x’ in its binary representation, what is to replaced by CONDITION?
        int i, count, x;
        for(i=0, count=0;i<16;i++)
       a. (x & (1 << i))
       b. (x & (1 << i))
       c. (x && (1 << i))
       d. None of the above.

    4. A graph was given and asked to find out the minimum no of colors required to color the graph?
      (a)  1
      (b)  2
      (c)  3
      (d)  The graph can’t be colored

    5. Inorder traversal of a binary tree is d c e b a and preorder traversal of a binary tree is b c d e a. Find out the post order traversal?
      (6) Which is not an advantage of using subroutines?
      (a) Easier maintenance
      (b) Runtime reduces
      (c) Storage space reduces
      (d) Modularity

    6. A k-diagonal matrix is a n *n square matrix in which the elements on the principal diagonal and k diagonals above the principal diagonal and k diagonals below the principal diagonal only have none zero elements. Other elements are zero’s. In order to save the space, the non zero elements are stored in a one dimensional array. The no of locations in this array are:
      (a) n*(n-k-1)/2
      (b) n*(n-1) – (n-k)(n-k-2)
      (c) n*(n-1) – (n-k)(n-k-2)
      (d) n*n – (n-k-1)

    7. A 1D - array A whose size is N is given and is divided into P partitions and an element x is to be searched in the array. Each partition is given to one processor. The elements are searched with in the partition using a binary search. What is the time complexity of the algorithm? 
      (a) O (N/P)
      (b) O (P)
      (c) O ( log (N/P))
      (d) O ( log (N/P)) + O (P log P)

    8. Write the code segment to insert an element p into the linked list after an element q? Make necessary pointer adjustments?
      p.next = q.next;
      q.next = p;

    9.  Given a matrix A. What is the minimum no of multiplications do u need to compute A10 ?
      (a) 9
      (b) 5
      (c) 4
      (d) 6


New Click here to Download 2019 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-2019 Vyom Technosoft Pvt. Ltd., All Rights Reserved. Read our Privacy Policy