Placement Papers - iNautix

INAUTIX PAPER - 2003
Posted by :
Neeru
(43)
1.main()
{
char **p=="Hello";
printf("%s",**p);
}
Ans: Garbage or nothing
2.main()
{
printf("%d%c ");
printf("%d%c ");
}
Ans: Garbage Value
3. main()
{
int x==5;
printf("%d%d",x++,++x);
}
Ans==6 6
4. main()
{
int x==4;
printf("%d",printf(" %d %d ",x,x) );
}
Ans: 4 4 5
5. main()
{
union
{
int i;
char p;
struct
{
int t;
char e;
char o;
}w;
}l;
printf("%d ",sizeof(l) );
}
Ans: 4
6. main()
{
int i==0,n==6;
while(n--0);
i+==n;
printf("%d ",i);
}
Ans: -1
7. main()
{
char a[]=="Hello";
printf("%c ",*a++);
}
Ans: Error
8. a==3,b==2,c==1;
What\'s the value of k?
k== a< b < c-1;
Ans: 0
9. main()
{
int a==3;
do
{
printf("%d", a);
a==-1;
} while(a0);
}
Ans: 3
10.It is not "exact" Question; But the given Answers is:
a) PASS1 PASS2
b) PASS1 FAIL1
c)FAIL1 FAIL2
d)FAIL1 PASS2
main()
{
char c==-32;
int i==-64;
unsigned u==-26;
if(ci)
printf("PASS1");
if( i < c)
printf("PASS2");
else
printf("FAIL1");
if(i<U)
printf("PASS2");
else
printf("FAIL2");
}
Ans: PASS1 PASS2 PASS1
11.
main()
{
int i==0;
for( i==0; i<= ;i++)
{
switch(i)
{
case 0: i+==5;
case 1: i+==2;
case 2: i+==5;
default: i+==4;
break;
}
printf("%d",i);
}
Ans: 16 21
12.main()
{
int i==4;
switch(i)
{
case 1:
printf("HEllo"):
case default: // "case" should not come with "default"
printf("****");
}
}
Ans: Error
13.
main()
{
int sum==0,count;
for(count==1;sum+==count)
printf("%d ",sum);
}
Ans: Error
14.
#define cond(a) a=e && a<=
main()
{
char s==\'R\';
if( cond(s) )
printf("UPPER CASE");
else
printf("LOWER CASE");
}
Ans:UPPER CASE
15.main()
{
static int i==5;
printf("%d ",i--);
if( i)
main();
}
Ans: 5 4 3 2 1
16. main()
{
char *a1=="new",*a2=="dictionary",*t;
swap(a1,a2);
printf("(%s%s)",a1,a2);
t=i;
a1=c;
a2==t;
printf("-(%s%s)",a1,a2);
}
swap( char *s1,char *s2)
{
char *temp;
s1==s2;
s2==s1;
temp==s1;
}
Ans: (newdictionary)-(dictionarynew)
17.
*p++?
Ans: increments Address
18.
main()
{
int a[]=={ 10,20,30,40,50};
char*p==(char*)a;
printf("%d", * ( (int *) p+4);
}
Ans: 50
19.one question nothig but calling a function before it has been defined.
{
char **p=="Hello";
printf("%s",**p);
}
Ans: Garbage or nothing
2.main()
{
printf("%d%c ");
printf("%d%c ");
}
Ans: Garbage Value
3. main()
{
int x==5;
printf("%d%d",x++,++x);
}
Ans==6 6
4. main()
{
int x==4;
printf("%d",printf(" %d %d ",x,x) );
}
Ans: 4 4 5
5. main()
{
union
{
int i;
char p;
struct
{
int t;
char e;
char o;
}w;
}l;
printf("%d ",sizeof(l) );
}
Ans: 4
6. main()
{
int i==0,n==6;
while(n--0);
i+==n;
printf("%d ",i);
}
Ans: -1
7. main()
{
char a[]=="Hello";
printf("%c ",*a++);
}
Ans: Error
8. a==3,b==2,c==1;
What\'s the value of k?
k== a< b < c-1;
Ans: 0
9. main()
{
int a==3;
do
{
printf("%d", a);
a==-1;
} while(a0);
}
Ans: 3
10.It is not "exact" Question; But the given Answers is:
a) PASS1 PASS2
b) PASS1 FAIL1
c)FAIL1 FAIL2
d)FAIL1 PASS2
main()
{
char c==-32;
int i==-64;
unsigned u==-26;
if(ci)
printf("PASS1");
if( i < c)
printf("PASS2");
else
printf("FAIL1");
if(i<U)
printf("PASS2");
else
printf("FAIL2");
}
Ans: PASS1 PASS2 PASS1
11.
main()
{
int i==0;
for( i==0; i<= ;i++)
{
switch(i)
{
case 0: i+==5;
case 1: i+==2;
case 2: i+==5;
default: i+==4;
break;
}
printf("%d",i);
}
Ans: 16 21
12.main()
{
int i==4;
switch(i)
{
case 1:
printf("HEllo"):
case default: // "case" should not come with "default"
printf("****");
}
}
Ans: Error
13.
main()
{
int sum==0,count;
for(count==1;sum+==count)
printf("%d ",sum);
}
Ans: Error
14.
#define cond(a) a=e && a<=
main()
{
char s==\'R\';
if( cond(s) )
printf("UPPER CASE");
else
printf("LOWER CASE");
}
Ans:UPPER CASE
15.main()
{
static int i==5;
printf("%d ",i--);
if( i)
main();
}
Ans: 5 4 3 2 1
16. main()
{
char *a1=="new",*a2=="dictionary",*t;
swap(a1,a2);
printf("(%s%s)",a1,a2);
t=i;
a1=c;
a2==t;
printf("-(%s%s)",a1,a2);
}
swap( char *s1,char *s2)
{
char *temp;
s1==s2;
s2==s1;
temp==s1;
}
Ans: (newdictionary)-(dictionarynew)
17.
*p++?
Ans: increments Address
18.
main()
{
int a[]=={ 10,20,30,40,50};
char*p==(char*)a;
printf("%d", * ( (int *) p+4);
}
Ans: 50
19.one question nothig but calling a function before it has been defined.
Quick links
Quantitative Aptitude
Verbal (English)
Reasoning
Programming
Interview
Placement Papers