.
  Vyom World.com . Let's Touch the Sky Together!  
.

Home
VyomWorld.com Home
Interview Questions
VyomLinks.com Home
JobsAssist.com Home
Vyom Network
Contact Us
Jobs & Careers
Resume Submitter
Placement Papers
IT Companies Directory
Computer Jobs
Interview Questions
Online Exams
Vyom Career eMag.
Fun
Send FREE SMS!
SMS Jokes
Source Codes Library
Source Codes Home
ASP Source Codes
C Source Codes
C++ Source Codes
COBOL Source Codes
Java Source Codes
Pascal Source Codes
Submit Source Codes
GATE
GATE an Overview
GATE Preparation
Study Materal
GRE
GRE an Overview
GRE Questions
GRE Preparation
GRE Universities
TOEFL Preparation
TOEFL Resources
GMAT Preparation
GMAT Resources
MBA Preparation
MBA Resources
Networking Concepts
Networking Concepts
Testing Preparation
Testing Resources
Webmasters
Free Traffic Builder
Webmaster Articles
Web Hosting
Tutorials
Hardware Tutorial
1500 Free eBooks New!
Get 30,000 Interview Questions & Answers in an eBook.

Interview Success Kit - Get Success in Job Interviews





Interview Success Kit - Get Success in Job Interviews Interview Success Kit - 30,000 Interview Que. & Ans.
Home » Placement Papers » subex Placement Papers »Subex Placement Paper 8 July 2007

New Click here to Download 2024 Latest placement papers of this company New

 

SUBEX-Placement Paper-8 July 2007


Advertisements
Advertisements

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////

HAVE A GOOD KNOWLEDGE IN C,C++
I COULD NOT GOT INTO...BUT I HOPE U WILL GET IT....BEST OF LUCK.....  

 

 

New Click here to Download 2024 Latest placement papers of this company New




 


.

Recently Updated: New Placement Papers added.
Vyom Network : Web Hosting | Dedicated Server | Free SMS, GRE, GMAT, MBA | Online Exams | Freshers Jobs | Software Downloads | Programming & Source Codes | GRE Preparation | Jobs, Discussions | Software Listing | Free eBooks | Free eBooks | Free Business Info | Interview Questions | Free Tutorials | International Business Information | IAS Preparation | Jokes, Songs, Fun | Free Classifieds | Free Recipes | FAQs | Free Downloads | Bangalore Info | Tech Solutions | Project Outsourcing, Web Hosting | GATE Preparation | MBA Preparation | SAP Info | Excellent Mobiles | Software Testing | Interview Questions | Freshers Jobs | Server Insiders | File Extension Directory

Copyright ©2003-2024 Vyom Technosoft Pvt. Ltd., All Rights Reserved. Read our Privacy Policy