Texas Previous Years Solved Sample Placement Papers
-
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
- 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.
-
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
- Solution: Rearrange the equation to solve for n: n = (2 x k + s)/Q.
-
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
- Solution: The occurrence of B necessitates the occurrence of J.
-
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
- Solution: For J to occur, either B or C must have occurred.
-
int f(int a)
What are x & y types?{ a = +b; //some stuff } main() { x = fn(a); y = &fn; }
A. x is int, y is a pointer to a function which takes an integer value Answer: Option A
-
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
-
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
-
Simplification of some boolean expression which is simple. Boolean Expression is A+A'B.
Ans: A+B
-
Given inorder sequence and preorder sequence and asked to find out postorder sequence.
-
Some question on the value of a static variable.
-
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.)
-
1-way set associative memory is called-----
A. direct
B. something
C. 1-way set associative Answer: Option C
D. something
-
Fastest IPC mechanism is
A. shared memory
B. pipes
C. named pipes
D. semaphores Answer: Option C
-
Some page references are given. You are asked to implement it with Least Frequently Used algorithm.
-
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
-
This paper is for Electrical & Electronics students. There is a separate test for Computer Science Students. There are 20 questions.
-
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
-
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
-
Two waveforms are given. You are asked to write the circuit to get B (second waveform) from A (first waveform).
-
#define SUM(a, b) a + b main() { a = 2; b = 3; x = SUM(a, b) * 2; printf("x=%d\n", x); }
Ans: 8
-
number(int i)
{ number++; printf("%d\n", number); } main() { static int i = 0; number(i); }
Ans: I don't know
-
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
-
Question on flip-flop. So go through all flip-flops.
-
There are 5 questions on Nmos & Pmos circuits.
-
This Paper is for Computer Science Students. This paper is very easy. You can definitely do it in one hour.
-
The fastest memory is
A. DRAM
B. ROM
C. SRAM Answer: Option C
D. Main memory