Texas Instruments India placement paper technical test questions – more sample placement tests here.
Given an expression tree and asked us to write the in fix of that expression
four choices : 2
Global variables in different files are
a:at compiletime
b) loading time
c) linking time
d)execution time
size of(int)
a) always 2 bytes
b) depends on compiler that is being used
c) always 32 bits
d) can’t tell
which one will over flow given two programs
2 prog 1: prog2:
main() main()
{ {
int fact; int fact=0
long int x; for(i=1;i<=n;i++)
fact=factoral(x); fact=fact*i;
} }
int factorial(long int x)
{
if(x>1) return(x*factorial(x-1);
}
a) program 1;
b) program 2;
c) both 1 &2
d) none
}
variables of fuction call are allocated in
a) registers and stack
b) registers and heap
c) stack and heap
d)
avg and worst case time of sorted binary tree
data structure used for proority queue
a) linked list b) double linkedd list c)array d) tree
main(){
char str[5]=”hello”;
if(str==NULL) printf(“string null”);
else printf(“string not null”);
}
what is out put of the program?
a) string is null b) string is not null c) error in program d) it executes but print nothing
There are 0ne 5 pipe line and another 12 pipe line sates are there and flushed time taken to execute five instructions a) 10,17
b) 9,16
c)25,144
d)
for hashing which is best on terms of buckets
a)100 b)50 c)21 d)32 ans 32
void f(int value){
for (i=0;i<16;i++){
if(value &0×8000>>1) printf(“1″)
else printf(“0″);
}
}
what is printed?
a) bineray value of argument b)bcd value c) hex value d) octal value
void f(int *p){
static val=100;
val=&p;
}
main(){
int a=10;
printf(“%d “,a);
f(&a);
printf(“%d “,a);
}
what will be out put?
a)10,10
struck a{
int x;
float y;
char c[10];
}
union b{
int x;
float y;
char c[10];
}
which is true?
a) size of(a)!=sizeof(b);
b)
c)
d)
# define f(a,b) a+b
#defiune g(c,d) c*d
find valueof f(4,g(5,6))
a)26 b)51 c) d)
find avg access time of cache
a)tc*h+(1-h)*tm b)tcH+tmH
c) d) tc is time to access cache tm is time to access when miss occure
main()
{
char a[10]=”hello”;
strcpy(a,’\0′);
printf(“%s”,a);
}
out put of the program?
a) string is null b) string is not null c) program error d)
simplyfy k map
1 x x 0
1 x 0 1
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 pointer to afunction which takes integer value
char a[5][15];
int b[5][15];
address of a 0×1000 and b is 0×2000 find address of a[3][4] and b[3][4]
assume char is 8 bits and int is 32 bits
a) b) c) d)
There are 20 questions in technical paper and 36 questions in aptitude test. There are all diagramatic questions and the time allowed is 1 hour for 20 questions and 40 minutes for 36 questions.
See the texas instruments placement test papers – aptitude test and technical test held at chennai, bangalore, hyderabad, noida, gurgaon, campus placement papers, pune, mumbai, coimbatore, mangalore, etc. for freshers and experienced engineers, vlsi designers, etc.