SUBEX-Placement Paper-8 July 2007

HI FRIENDS
                  I am sambit from eastern academy of science and tehnology,bhubaneswar.I had recently attended the SUBEX         
that had occur in KIIT...the selection process was
1.technical test
2.technical interview by junoir project leader
3.technical interview by senoir poject leader..
4.HR
In the TECHNICAL TEST it comprises of 2 test consists of 6 sets of papers...
ONE PAPER CONSISTS OF SOME PROGRAMM AND U HAVE TO DETECT THE THE OUT PUT...AND SOME CHOICE
WERE PROVIDED...
---------------
IN ANOTHER PAPER IT CONSISTS OF 2 QUESTIONS AND U HANE 2 WRITE ANY ONE.....
TIME ALLOTED WAS 1HR 5 MINS...
-----------
SO u have 2 do carefully 2 complete it..BOTH....
I HAD THE SET1 AND SET 3 ....
THE QUESTION WAS VERY TRICKY BUT QUITE EASY.......
IT COMPULSORY THAT U HAVE 2 DO BOTH PAPER IN TIME..
I REMEMBERED SOME OF THE QUESTION...//u have 2 detect output///
1>int main()
{
int a[4]={1,2,3,4};
int *ptr ;
ptr=a;
*(a+3)=*(++ptr)+(*ptr++);
pf("%d........",a[0,1,2,....];
}
---------------------------
int main
{
struct node
{
int a,b,c;
};
struct node s={3,5,6};
struct node*pt=&s;
pf("%d",*(int)pf);
}

---------------------------
#define max 20
int main()
{
pf("%d",++max);
}
--------------
int i,b[]={1,2,3,4,5},*p;
p=b;
++*p;
p+=2;
-----
int i=20;
pf=("%x",i);
---------

int main()
{
char*name ="name";
change (name);
pf("%s",name);
}
change(char*name)
{
char * nm="new name";
name=nm;
}
SOME WERE FROM OBJ TYPE ON C++LIKE VIRTUAL FUNCTION,INHERITANCE.....
IN SECOND PAER  2 PROGRAMM WAS GIVEN 2 WRITE ON
1.FIND COUNT OF COMMON WORD ,WHICH EXIXT IN 2 FILES..THE FILE NAME SHOULD BE TAKEN AS O/P....
 2.WRITE 'DELETE NODE' TO DELETE ALL THE NODES CONTAINING A GIVEN NO. OF LINKED LIST.....
SRUCT NODE
{
INT i;
STRUCT node*next;
};
struct node * delete node(struct  nodes* start,cons int i;);
}
 

/////rest u have 2 solve////