(Paper) iNAUTIX Placement Paper (Technical-C C++ Aptitude)
Paper: iNAUTIX Placement Paper (Technical-C C++ Aptitude)
1. 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
2.main()
{ int i==4; switch(i) }
{ case 1: printf("HEllo"): case
default: // "case" should not come with "default" printf("****");}
Ans: Error
3. main()
{ int sum==0,count; for(count==1;sum+==count)
printf("%d\t",sum); }
Ans: Error
4. #define cond(a) a=e &&
a<= main()
{ char s=='R'; if( cond(s) )
printf("UPPER CASE"); else printf("LOWER CASE"); }
Ans:UPPER CASE
5. main()
{ int x==5; printf("%d%d",x++,++x);
}
Ans==6 6
6. main()
{ int x==4; printf("%d",printf("
%d %d ",x,x) ); }
Ans: 4 4 5
7.I there are 132 instructions in a
processor and there are 7 registers. If
14 of the ins share the address of the registers then the no of bits in each
inst will be?
1.132
2.8
3.11
4.64
8.If
there are 12 address lines and if 2 more i/o devices are to be added
,then the no of address lines (excluding the circuit for the i/o devices is
1.2 power 12-2
2.2 power 12
3.2 power 11
4.2 power 10
Ans: 2 power 11
9.context switching means..
10.abCD+abcD+abCd+...
compliment of a is A(similar type of qa)
Ans: ab
11.conversion
of a binary number to base 7.
10.Which of the following is not a
protocol?
1.ICMP
2.UDP
3.SNMP
4.RFC
ans:RFC
(APTITUDE)-
1.A man is moving 50 m north. He
turns left and walks 30 m.again he turns left and walk for 50 m.He
turns left and walks 50.What is the distance from his starting point?
1.25m
2.50m
3.35m
4.none of the above(ans)
2.Reshma is standing in front of
her room.Ramu is coming from north towards her and he can see his
shadow falling on his right. In which direction she is standing?
1.north east
2.east
3.south east
4.west
Ans: west
3.Instead of multiplying by
53,Narmada multiplied it by 35 and got the answer as 1206.What is the exact
number to be multiplied?
1.77
2.67
3.87
4.97
ans:67

Daily JOBS






Get Your Dream Job! Post Your Resume Today!
Get Your Dream Job! Post Your Resume Today!