Placement Papers - Samsung

Ist Round: GSAT (Global Samsung Aptitude Test)

50 questions 60 mins each question carries equal marks..

Section-1: Quantitative ability:total 25 ques-20 ques Data Interpretation(pie chart, bar chart, line graph) and 5 ques quant very simple(multiplication n division and percentage)no need to study quant except DI for SEl.

Section-2: Reasoning(solve reasoning questions given in GRE or solve from any puzzles book(I studied MAGICAL BOOK ON PUZZLES by K.Kundan)). I don\'t remember the exact ques but giving here brief intro abt some questions in reasoning.

1.3 airplanes were assigned to some different-2 tasks and some diff-2 people..2 to 4 conditions were given..and 6-7 ques were there for each reasoning ques.and in each ques some extra condtion ws given and u hv to determine the ans..refer GRE analytical reasoning for better understanding of the ques..

2.5 tv programmes were there ans each hv to b broadcasted on one of these 4 time slots 8:00 pm,8:30 pm,9 pm,9:30 pm..some conditions were given..and similarly 6-7 ques were there to ans..

3.9 programmers were there..and out 0f 9 3 groups of three-2 persons were to b prepared and again some conditions were given n again 5-6 ques.
1 more ques ws there..i can\'t recall that..

I cleared this round..i attempted 35 correct and then guessed..as no negative marking ws there..they won\'t tell dis thing untill 1-2 mins left..

It wud b better if u attempt 40 correct ques fr surity..out of 115, 61 qualified dis round..45 frm btech and 16 frm mca..i ws one of them..


2nd round - Technical Written:(Decisive round)

If u perform good in dis round, 75% chances are there to b selected..

30 ques 30 mins:there were two papers one was fr java and one ws for c/c++..if u hv confidence in java den only go fr it...coz it consists ques frm multithreading, collections, android..etc.

In c/c++ paper 20 ques were frm c/c++(18 c and 2 c++) and 5 ques frm os and 5 ques frm d.s.(os nd ds basic concepts shud b clear)
some ques i m giving here:

1.what is the value of EOF..??ans=-1

2.
class test{ };
int main()
{
cout<<sizeof(test);
return 0;
}
ans=1

3.
class test
{
static int x;
int* ptr;
}
int main()
{ test t1;
cout<<sizeof(t1)<<sizeof(test);return 0;
}
ans:4 4

4.
char* str="hello\0world\0";
main()
{
printf("%s",str);
str=str+5;
printf("%s",str);
str=str+7;
printf("%s",str);
}
check the output
in some ques there may be error also..

5.
char* fun()
{ return("samsung india");
}
main()
{
printf("%s",printf("electronics")+fun());
}
ans:electronicsia

6.main()
{
char* ptr={"samsung","electronics","india"};
char**ptr1;
ptr1=ptr;
now some operations were done on ptr1 and printf was used..i don\'t remember exactly what ws it..it was like *ptr1++, ++*ptr1 etc..try at ur own.

7.main()
{
extern int i;
{
int i=20;
printf("%d",i);
}
}
ans:linker error

8.one ques ws frm void pointer..increment operation ws performed on void pointer in a small code given...ans ws it ws error in code..we can\'t increment void pointer..
9.struct book arr[10];
how to access the next elemnent in arr.
since arr is an array of 10 variables of book type, so to access the next alement add the sizeof(struct) in the base address of the arr.

10. main()
{
int i=10;
switch(i)
{
printf("something here");
case 10:
printf("case10");
break;
case 5*2:
printf("another case 10");
break;
default:
printf("its default");
}}
ans:
case constant already used..10 and 5*2 are same..error
other ques were like above only..i can\'t recall them.better u solve test ur c skills 2-3 times with clear concepts and exploring c..
os ques:-

1.threads don\'t share their ___________________with other threads...ans:stack,register,and counter
2.advantage of using large pages and small pages in paging..??some options wer given..i can\'t remember..
3.wich program loads first when system starts...ans;bootstrap loader.
4.when interrupt occurs what cpu does..ans:cpu at once switches over it control to the interrupt.
5.
ds ques:
1.recursive function uses more__________________than non recursive function.ans:stack space.
2.in heap each node is....ans:each node is greater than its left and right child node.
3.complexty of binary search:ans:nlognr
4.total no of nodes in a full binary tree of 4 levels..ans:15
5.technique used for avoiding page fault frequency?ans:locality of reference.

In technical round +2 and -.5 marking ws there..
In technical out of 61, 11 qualified for tech n hr interview..10 btech n 1 mca..cutoff ws high..

3rd round: Tech and HR Interview

Both were compulsory..combined marks of tech, hr n technical written were used for selection..

Hr round(my hr interview ws b4 tech, there ws no sequence)
introduction, hobbies, strength, weaknesses, why do u want to join sel, question about samsung(b attentive in ppt of company),ur aim, in future u\'ll go fr higher studies or not,any question frm interviwer.

Tech interview-projects, prepare projects u hv undertaken very well, static variable, static function, semaphore, mutex, real time os,code for string reverse using pointer, efficient code for finding largest among 3 no(use conditional operator), code for linked list implementation..

THANK U..
WITH LOTS OF WISHES.