Here is the texas instruments Placement Test paper for Computer science and IT Branches.
Technical multiple choice questions / MCQ for CSE, IT Branches. C, C++, programming, hardware related questions.

The fastest memory is
(i) DRAM, (ii) ROM, (iii) SRAM, (iv) Main memory
Ans : SRAM

Programing exceptions are
(i) Asynchronous, (ii) Synchronous, (iii) None
Ans : Asynchronous

DSP which architecture is used
(i) MIMD, (ii) SIMD, (iii) Nueman, (iv) Harvard Architecture
Ans : Harvard Architecture

C prog. for searching for an element in linked list

main()
{
unsigned char i;
int sum;
for(i=0; i<300; i++)
sum+ = i;
printf(“\nSum = %d\n”, sum);
}
Ans : infinite loop

void fn(int *p)
{
static int val = 100;
p = &val;
}
main()
{
int i=10;
printf(“i=%d\n”, i);
fn(&i);
printf(“i=%d\n”, i);
}
Ans : i=10 i=10

int a[10[15];
char b[10[15];
(a) location g a[3][4], if base location g a[0][0] is ox1000
(b) location g b[3][4], if base location g b[0][0] is ox2000
int taken 32 bits and char taken 8 bits.
Ans : (a) ox10C4 (b) ox2031

Implement OR gate function with 2*1 MUX
Ans : A ___________
——–|2*1 MUX |
B | |——–o/p
——–| |
| ———–
|_______|C
B=C

Implement 4*1 MUX with 2*1 MUXES

Swapping without using a temporary variables. (2 methods)
(i) x = x+y;
y = x-y;
x = x-y;
(ii) x = x^y;
y = x^y;
x = x^y;

Count no of 1′s in a word without using bit by bit. (This question carries more marks. It is not a multiple choice
question.

Code 1 :
for(i=0; i<1000; i++)
for(j=0; j<100; j++)
x = y;
Code 2 :
for(i=0; i<100; i++)
for(j=0; j<1000; j++)
x = y;
Which code will execute faster
(i) Code 1 and Code 2 are of same speed,
(ii) Code 1,
(iii) Code 2,
(iv) None.
Ans : Code 2

main()
{
int a[10] = {1, 2, 3, …., 10}, i, x=10, temp;
for(i=0; itemp = a[i];
a[i] = a[x-i-1];
a[x-i-1] = temp;
}
(i) All contents of array a are reversed
(ii) Only some portions are altered
(iii) Remains same
(iv) None
Ans : (iii)

An array is stored in row major order. The memory capacity is 30 MB. And in unix system demand paging is used. Which one will give more page faults?
#define V_L_I 10000
int i, j, array[V_L_I][V_L_I];
Code 1 :
array[i][j] = 1;
Code 1 :
for(j=0; jfor(i=0; iarray[i][j] = 1;
Ans : Code 2

In C which parameter passing technique is used?
(i) call by value,
(ii) call by reference,
(iii) both
Ans : call by value

A circuit is given with 2 exclusive OR gates whose boolean expression will be y = ‘(AB) + AB (‘ indicates bar)

(17) main()
{
int i = 1;
fork();
fork();
printf(“\ni = %d\n”, i+1);
}
Ans : 4 printfs will occur and i = 2

Compute the complexity of Binary search.
Ans : O(lg n) ( Answer in detail. This is not a multiple choice question. It carries more marks.)

Write expression for the tree graph :
Ans : ((a-b) + c*d)/x

# define MAX(a, b) a>b ? a:b
main()
{
int m, n;
m = 3 + MAX(2, 3);
n = 2 * MAX(3, 2);
printf(“m = %d, n = %d\n”, m, n)
}
Ans : m=2, n=3