CARITOR PAPER

CARITOR PAPER - 2006

It is believed that they've 25 set of papers. And they distribute different papers in the same examination hall.

Total 1 hr ,40 marks 5 sections, 8 questions each

1 mark for correct, -.25 for wrong

1st section

/* This section is damn ..tough, lengthy and time consuming. It is highly recommended to leave this section or set aside to last. I am quoting some part of this question so you can easily identify this section..

*/

It is based on recursive function


M(a,b,c)- L(a) is if u delete 1st element from it

whatever is left.

N(a,b,c)-L(b) is 1st element of the list.

if (a,b) &a r two lists then M(l1,l2) is ((a,b),a).

X(a,l)=a

=L(a)

=M(a,l)

y(a,l)=l

=L(b)

=M(l,a)




Based on this they gave 8 questions were there

2nd section


This is about arrangement of dominos

6 Dominos are given. Also a figure created using these is also shown. But the alignment of the dominos in the figure is unknown. The question is to found out the possible alignment of the dominos.





The multiple choices some what look like this

a)

3
2


b)


1
1

c)..
d)..

What they mean is. if the columns with no.s shown in the figure, forms a single domino, is it possible to make the figure given in the question using the remaining dominos given ?

In this example I arranged the dominos from left to right , top to bottom .

The answer is b.

This forms 1 question. Likewise 8 questions in this section.

3 rd section


/*This section is the easiest. Ou better start with this section*/

This section consists of encoding decoding questions


Eg:- 1) if abacbb corresponds to bbcaba & acbbca acbbca

then baabcb ?

ans-bcbaab.(Read the string in reverse)



2) if abcbac corresponds to bcbaca

& acbacb cbacba

then abcabc ?

ans-bcabca.(Rotate the string left by 1 letter)




Like wise 8 questions



4 th section

/*This is also an easy one*/

Finding the valid string..

Eg:- 1) if x G 0 0 y G y is a string

where x,y are variables which forms strings of G and contains atleast 1 letter.Then which of the following is a valid string of the same language.

a) G G 0 0 G G G G G

b) G G 0 0 G G G G

What they mean is that x and y should be substituted using a consistent value in all the places.

In (a) I put x=G, y = G G.

In (b) x=G , but the 1st occurrence of y is G and 2nd one is G G.

So inconsistent hence answer is (a)

In some case it may create ambiguity while we substitute the values of x,y.

Sufficient clues will be given in the question to handle this.

5 th section

/*Time consuming*/

Anagrams..




Eg:- 1) P_ _ S_ _ D_

a) utopian b) convince c) pervade

What they mean is , to find the particular synonym of the words given,

that fill correctly in the blanks !!

ans- convince.-persuade.

2) PERVERSE

3) DECADENT.

TECHNICAL QUESTIONS

1. Struct x
{
int i;
char c;
}
union y{
struct x a;
double d;
};
printf("%d",sizeof(union y));
a)8
b)5
c)4
d)1
ans:8


2. struct x{
char c1;
char c2;
int i;
short int j;
};
struct y{
short int j;
char c1;
char c2;
int i;
};
printf("%d %d",size of (struct x),size of (struct y));
a)12 12
b)8 8
c)12 8
d)8 12
ans:a


3. enum x {a=1,b,c,d,f=60,y}
printf("%d",y);
a)5
b)61
c)6
d)60
ans:b


4 . #include
void main(){
{
# define x 10
}
printf("%d \n",++x);
}
a)11
b)10
c)compile error
d)runtime error
ans:c


5. #include
void main()
{
int k=2,j=3,p=0;
p=(k,j,k);
printf("%d\n",p);
}
a)2
b)error
c)0
d)3
ans:a


6. How to typedef a function pointer which takes int as a parameter and return an int
a)Is not possible
b)typedef int *funcptr int;
c)typedef int * funcptr( int);
d)typedef int (*funcptr)(int);
ans:d


7. #include
void main()
{
int k=10;
k<<=1;
printf("%d\n",k);
}
a)10
b)0
c)20
d) compilation error
ans:c


8. #include
void main()
{
int i=-10;
for(;i;printf("%d\n",i++));
}
a)error
b)prints -10 to -1
c)infinite loop
d)does not print anything
ans:b


9. #include
void main()
{
int I=65,j=0;
for(;j<26; i++,j++){
printf("%s\n", i);
}
}
a)compilation Error
b)prints A to Z
c)prints a to z
d)runtime error
ans:b


10. #include
void main()
{
unsigned int i=-1;
printf("%d\n",i);
printf("%u\n",i*-1);
}
a)runtime error
b)compilation error
c)prints -1 to 1
d)prints 1 and 1
ans:c


11. #include
void main()
{
int **I;
int *j=0;
i=&j;
if (NULL != i&& NULL != *i){
printf("I am here");
}
}
a)prints I am here
b)does not print anything
c)compilaton error
d)runtime error
ans:b


12 #include
void main()
{
int *j=(int *)0x1000;
printf("%p",j);
}
a)prints-1000
b)runtime error
c)compilation error
d)none of the above
ans:d


13 #include
void main()
{
int a[2][2]={{2},{3}};
printf("%d",a[0][0]);
printf("%d",a[0][1]);
printf("%d",a[1][0]);
printf("%d",a[1][1]);
}
a) 2300
b)2000
c)0030
d)2030
ans:d


14) #include
void main(int x)
{
printf("%d",x) ;
}
if the name of the executable file is abc and the command line is given as abc xyz what is the output
a)compilation error
b)1
c)2

d)undefined
ans:2


15. #include
void main(int argc)
{
char a[]={'1','2','3',0,'1','2','3'};
printf(a);
}
a) compilation error, b) 123, c) 123 123, d) 1230123
ANS:b



16. #include
void func(int *x)
{
x=(int *) malloc(sizeof(int));
printf("in func: %p\n",x);
}
void main(int argc)
{
int **pp;
int *p;
pp=(int **) malloc(sizeof(int *));
p=(int *) malloc(sizeof((int));
*pp=p;
printf("first:%p \n",*pp);
func(*pp);
printf("last %p \n",*pp);
}
assuming the p is equal to 1000 and x is equal to 2000 atfer malloc calls
a) 1000,2000,1000, b) 1000,2000,2000, c) 1000,1000,1000 d) 2000,2000,2000
ANS:a


17. #include
#define const const
void main(int argc)
{
const int x=0;
}
a) compilation error, b) runs fine, c) runtime error, d) none of these
ANS:b


18. #include
void main(int argc)
{
int d=1234.5678;
printf("%d",d);
}
a) error, b) 1234.5678, c) 1234, d) 1235
ANS:c


19. #include
void main(int argc)
{
int a[]={5,6};
printf("%d",a[1.6]);
}
a) 5, b) runtime error , c) compilation error, d) 6
ANS:d


20. #include
struct x
{
int i=0; /*line A*/
};
void main(int argc)
{
struct x y; /*line B*/
}
a) error due to B,
b) no problem with option A and B,
c) error somewhere other than line A and B,
d) error due to line A
ANS:d


21. #include
void main(int arg c)
{
int x=1111;
printf("%d",!x);
}
a.prints 1111
b.compilation error
c.prints 0
d.is not a valid option
ans:c


22. struct {
int len;
char *str
}*p;
++p -> len
a.increments p
b. increments len
c.compilation error
d.nothing happens with either of p and len
ans:b


23. int i=10;
a.declaration
b.definition
c.both
d.none
ans:c


24. #include
void main(int arg c)
{
char a[]=abcdefghijklmnopqrstuvwxyz;
printf(%d,sizeof(a));
}
a.25 b.26 c.27 d.28
ans:c


25. #include
void main(int arg c)
{
char a[]=abcdefghijklmnopqrstuvwxyz;
char *p=a;
printf(%d,strlen(p));
p+=10;
printf(%d,strlen(a));
}
a.26 26
b.26 16
c.compilation error
d.16 26
ans:a


26 .If a file contains the IT solutions Inc.rn then on reading this line the array str using fgets() what would str contain?
a. IT solutions Inc.
b. IT solutions Inc.r0
c. IT solutions Inc.rn0
d. IT solutions Inc.n0


27. if the following program (myprog)is run from the command line as myprog 1 2 3 what would be the output?
Main(int argc , char *argv[])
{
int I ,j=0;
for (I=0;I j=j+atoi(argv[i]);
printf(%d.j);
}
a. 123 b.6 c.error d.123
ans:6


28. when pointers declared initialized to :

a. null
b.newly allocated memory
c)nothing,its random
d)none of the above
ans:c


29. what is the output of the following code?
#include
oid main()
{
printf("%d",printf(" hello world "));
}
a) 13, b) hello world 13, c) hello world, d) error
ANS:b


30. what is the output of the following code, assuming that the array begins at location 5364875?
#include
void main()
{
int a[2][3][4]={
{2,1,4,3,6,5,8,7,0,9,2,2}
{1,2,3,4,5,6,7,8,9,0,1,2}
};
printf("%u %u %u %u",a,*a,**a,***a);
}
a) 5364875,5364876,5364877,5364878
b) 5364875,5364876,5364877,2
c) 5364875,5364875,5364876,5364876
d) 5364875,5364875,5364875,2
ANS:d


31. Are null statements in c null pointers.


32. Is cinst int *p same as int const* p

Before interview

You will be given One form to fill in asking some personal questions. ur strengths, weakness; aim in the life; what do u expect from the company etc etc.It is better to take help from any english "funda master" or after discussing with our friends..

Interview will be cool

Technical bit from unix shell programming