.
  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!



Home » Placement Papers » Chatargee Placement Papers » Chatargee Placement Paper 4


Chatargee Placement Paper 4


Advertisements
Advertisements



CHATARGEE Interview Procedure:

The information on the interview is pretty sketchy but it may consist of both technical grilling and HR interview.

The written test consists of Section A & Section B. Section A consist of Aptitude. It is very very
easy. You can do the aptitude in 10 minutes. The total time is one hour. There is -ve marking.In Section B there are 3 parts. Part 1 is C,part 2 is C++,Part 3 is general. You should give much much preference to C++. C++ is very very important. C language questions are very easy. You give much time for solving C++ programs. 
In the interview also they are asking C++ only. You should be thourough in C++ in friend function, Inheretence,constroctors.In Section B each part consits of 10 questions. There are 30 aptitude questions.



SAMPLE PAPER � I

Aptitude



1. A sequence is given. You should find out error & write correct
1 2 5 10 13 26 29 48. 
ans: Error is 48,there you should write 58.

2. 2,3 6,7 14,15 29,46. Error is 46. In every pair you add 1 to get
second number. Ans:29+1=30

3. A girl is 13'th highest,13th lowest. How many member.
Ans:25

4 .Rearrange MERGANY 
Ans:GERMANY (country)

5. Rearrange BBIRAT 
Ans:RABBIT

6. (passage)
there are 6 persons k,l,m,n,o,p to give seminar 
cond: 3 persons should give before lunch and 3 after lunch
l should immediately precede the seminar of m
there should be no gap between l and m .....

ans: 1. L position is 2
2 m pos is 5
3. k pos is 4

7. (passage)
A is daughter of Y, Z is father of Y. Q is son of Z, 
1.if T is son of Y, then 
ans: T and A brother/sister
2. if m is brother of T, then 
ans :Z is grandfather of M and M & A are brother/sister
3. if Q is son of Z them
ans: Q & Y are brothers
Q. if speed of ongoing train is 24 and while return is 48
avg = ---- 
ans:32

8. 0.23 + 0.02323 + 0.002323.... == ???

9. 0.4 + 0.44 + 0.444 ..... = ???

10.1,2,2,4,8,? 
ans:32

11. 55*55*55+45*45*45/55*55-55*45+45*45 
ans:100

12. 4^^61 + 4^^62 + 4^^63 + 4^^64 . this sum is divisible by which of the following ?
ans:17

C Language

1. 

#define min((a),(b)) ((a)<(b))?(a):(b)
main()
{
int i=0,a[20],*ptr;
ptr=a;
while(min(ptr++,&a[9])<&a[8]) i=i+1;
printf("i=%d\n",i);} 

Ans:5.

2. 
main()
{char a[10]={1,2,3,4,5,6};int x;
for(x=0;x<4;x++){ b[x]=x+'a';}
printf("%s",b);}

Ans:abcd56

3. Linked Lists are preffered than arrays to get advantage while
a)Insertion b)Deletion c)Accessing Element d)None 

4. ~(~0<<8)? Ans:Last 8 digits are 1's rest are 0's.

5. int a,b=3,c=2;
a=b++*c;c=++b*a;Some thing like this.
print a,b,c?

Ans:6,4,24

C++ Language

1. Virtual Functions in C++(Refer to 13'th chapter first two
examples of LAFORE Book)
2. Which of the following is not true regarding FRIEND function
Ans:If y is friend of x and z is friend of y then z can access private of x.

3. Given some program on "&" operator overloading.

4. 
class X{
public:X(){ cout<<"This is Base";}
};
class Y:public X
{ public:Y(){cout<<"This is Derived";}};
what is printed when an object of Y is created?

5. One question on reference variable in C++.
Ans:&a.


Technical

1. Number of nodes in Binary tree with height 3
Ans:7(Refer to Formula 2^^n-1)

2. TCP/IP is used in?
Ans:LAN/WAN

3. Host IP Address is? Ans:32 bits OR 4 bytes. 

there are 3 sections 
sec 1 : 20 questions 
sec 2: 40 
sec 3:15 
30 minutes/section
==================
section 1+2

Q1(passage)
there are 5 medicines which are to be tested........
cond: 1. p is stronger than q


an: 1.p is more stronger 
2.statement 1234
3.there are atleast 4 medicines in every test less than m
( all these are different correct ans for Q1. passage

Q3 (passage)
there are 6 persons k,l,m,n,o,p to give seminar 
cond: 3 persons should give before lunch and 3 after lunch
l should immediately precede the seminar of m
there should be no gap between l and m .....

ans: 1. L position is 2
2 m pos is 5
3. k pos is 4


Q4(passage)
A is daughter of Y, Z is father of Y. Q is son of Z, 
1.if T is son of Y, then 

2. if m is brother of T, then 
ans :Z is grandfather of M and M & A are brother/sister
3. if Q is son of Z them
ans: Q & Y are brothers
Q. if speed of ongoing train is 24 and while return is 48
avg = ---- ans:32

section 2

Q. 0.23 + 0.02323 + 0.002323.... == ???
Q.0.4 + 0.44 + 0.444 ..... = ???
Q.1,2,2,4,8,? ans:32
Q.55*55*55+45*45*45/55*55-55*45+45*45 ans:100
Q.4^^61 + 4^^62 + 4^^63 + 4^^64 . this sum is divisible by which of
the following ? ans:17

Q. there are 12 fig series ( simple from RS.AGARWAL)


section 3

PROG LANG TEST


Q 1: n=11
Q2 : count=33
Q3 : n<=36

Q. n=3
do while(n<=6)
n=n-1;
n=n*(n+1)
end
Q if max() gives max of 3 nos, and min() min of 3 nos......
ans : 3

Q. there is a flow chart consisting n,sum, and count 
a condition is that : n > 10 
ans: sum=45, n=11;

Aptitude


1)A sequence is given. You should find out error & write correct
answer. 1 2 5 10 13 26 29 48. Error is 48,there you should write 58.
2)2,3 6,7 14,15 29,46. Error is 46. In every pair you add 1 to get
second number. Ans:29+1=30
3)A fish problem is given.Ans:72
4)John's age like that there is one age problem. Ans:16
5)A girl is 13'th highest,13th lowest. How many member.Ans:25
6)Cookies problem. Ans:23.
7)Rearrange MERGANY Ans:GERMANY (country)
8)Rearrange BBIRAT Ans:RABBIT

C LANGUAGE
1)#define min((a),(b)) ((a)<(b))?(a):(b)
main()
{
int i=0,a[20],*ptr;
ptr=a;
while(min(ptr++,&a[9])<&a[8]) i=i+1;
printf("i=%d\n",i);} Ans:5.
2)main()
{char a[10]={1,2,3,4,5,6};int x;
for(x=0;x<4;x++){ b[x]=x+'a';}
printf("%s",b);} Ans:abcd56
3)Linked Lists are preffered than arrays to get advantage while 
a)Insertion b)Deletion c)Accessing Element d)None 
4)question on Stack
5)3 programs on recursion
6)~(~0<<8)? Ans:Last 8 digits are 1's rest are 0's.
7)int a,b=3,c=2;
a=b++*c;c=++b*a;Some thing like this.
print a,b,c? Ans:6,4,24

C++

----
1)Virtual Functions in C++(Refer to 13'th chapter first two
examples of LAFORE Book)
2)Which of the following is not true regarding FRIEND function
Ans:If y is friend of x and z is friend of y then z can access
private of x.
3)Given some program on "&" operator overloading.
4)class X{
public:X(){ cout<<"This is Base";}
};
class Y:public X
{ public:Y(){cout<<"This is Derived";}};
what is printed when an object of Y is created?
5)One question on reference variable in C++.Ans:&a.

GENERAL SECTION

1) Number of nodes in Binary tree with height 3:Ans:7
(Refer to Formula 2^^n-1)
2)TCP/IP is used in? Ans:LAN/WAN
3)Host IP Address is? Ans:32 bits OR 4 bytes.








 


.

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