Answer / guest

Chatargee Placement Papers | Chatargee Interview Procedure
| Chatargee Aptitude Questions | Chatargee Technical
Questions | Chatargee Interview Questions


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

ALL THE BEST.


Chatargee Placement Papers | Chatargee Interview Procedure
| Chatargee Aptitude Questions | Chatargee Technical
Questions | Chatargee Interview Questions


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.

Chatargee Placement Papers | Chatargee Interview Procedure
| Chatargee Aptitude Questions | Chatargee Technical
Questions | Chatargee Interview Questions

banking related inteview question?

0 Answers   Banking,

---

HP PLACEMENT PAPERS -------- Placement Paper - 2

2 Answers   HP,

---

Infosys Written Examination Paper on 29th October at Hyderabad

2 Answers   Infosys,

---

dell placement paper

0 Answers   DELL,

---

what to study for aptitude?????

4 Answers   nvidia,

---

technical -electrical

1 Answers  

---

I-Gate Interview Experience 06/05/2007 (Cochin)

1 Answers   Accenture, iGate,

---

SNAPDEAL QUESTIONS 1. A train is going at a speed of 60kmph towards Delhi and returned back at a speed of 30kmph. What is its average speed? ANS : (2*30*60)/(30+60) = 40kmph 2. How many different 4 letter words can be framed that have at least one vowel? ANS : 264 - 214 (total no of 4 digits words – no of words with no vowels) 3. Write an algorithm to find out a number from an array of numbers where only one number occurs once and rest all occurs twice. ANS : XOR all the numbers ,you will get the number with single occurrences . 4. Which among the following have the product of the distance between opposite sides of a regular polygon and it side equals one fourth of the area. A. hexagon B. octagon C. n=16 D. n=18 ANS : n=16.(area of regular polygon = apothem*perimeter/2 Apothem = distance between opposite sides/2 Area = (opp_side_dist * n * a )/4 Product of opp_side_dist and side of reg. polygon = opp_side_dist * a For n= 16 the ration becomes 1:4 5. Which of the following cannot be a relation between two variables? ANS = 4th diagram. 6.what will be the output of this program Void print (int n) { If (n>0) { printf(“hello”); print(n-1); } printf(“world”); } ANS : N times hello followed by N+1 times world. 7. Which among the following cannot be used for future prediction? ANS : 4th Diagram. 8. There are 25 horses. We have to find out the fastest 3 horses In one race maximum 5 horses can run. How many such races are required in minimum to get the result. ANS : 7 races (A. first run all horses = 5 races, eliminate 4th 5th of all races. B. Run horses who came 1st in those 5 races = 1 race , the horse coming first is the fastest Run horses a. 2nd and 3rd with the fastest horse (in first time race A) b. 2nd and 3rd coming horse in B. c. The horse who came 2nd with the horse(who came 2nd in race B) in race A You will have the fastest 3 horses.) 9. In a game of rolling dice you are given 2 dice and you have to roll them. Whatever is the outcome the player will win that many dollars. What should the game owner charge each player (optimum) so that he doesn’t have to bear any loss? ANS : $7 10. We have a function REV(“string”,m,n).This function is capable of reversing the caharacters in the string from mth location to nth location. e.g. REV(“abcd”,2,3) &#61672; the output will be acbd We need to swap a string from a position,e.g. SWAP(“abcdefg”,4) &#61672; output needs to be efgabcd. How can the REV function used do this. ANS : L = string length,N= position given in SWAP function. SWAP(“abcdefg”,4) = REV(REV(REV(“abcdefg”,N+1,L),1,N),1,L).

1 Answers   SnapDeal,

---

Flextronics placement papers -------- placement paper 1

3 Answers   Flextronics,

---

INFOSYS PLACEMENT PAPERS ----- Placement Paper 7

1 Answers   Infosys,

---

TCS

3 Answers   TCS,

---

TCS 2014 Passing Out Batch

1 Answers   TCS,

---