Placement Papers - Samsung

1st Round: GSAT (Global Samsung aptitude test).

50 questions 60 mins each question carries equal marks.

Section-1: Quantitative ability: total 25 ques-20 question Data Interpretation (pie chart, bar chart, line graph) and 5 question 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 question but giving here brief intro about 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 question were there for each reasoning question. And in each question some extra condition was given and you have to determine the answer. Refer GRE analytical reasoning for better understanding of the question.

2. 5 tv programs were there answer each have 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 question were there to answer.

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

1 more question was there. I can't recall that.

I cleared this round. I attempted 35 correct and then guessed. As no negative marking was there. They won't tell this thing until 1-2 mins left.

It would be better if you attempt 40 correct question for surety. Out of 115, 61 qualified this round. 45 from B-Tech and 16 from MCA. I was one of them.

2nd round; technical written: (decisive round) if you perform good in this round, 75% chances are there to b selected.

30 question 30 mins: there were two papers one was for java and one was for C/C++. If you have confidence in java then only go for it. Because it consists question from multithreading, collections, android. etc.

In C/C++ paper 20 question were from C/C++ (18 c and 2 C++) and 5 question from OS and 5 question from D.S. (os nd ds basic concepts should b clear).

Some question I m giving here:.

1. What is the value of EOF..?? answer : -1

2.

class test{ };
int main()
{
cout< return 0;
}

answer: 1

3.

class test
{
static int x;
int* ptr;
}
int main()
{ test t1;
cout< }

answer: 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 question were like above only. I can't recall them. Better you solve test your 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 were given. I can't remember.
3. Which 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.

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. Complexity 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 was there.
In technical out of 61, 11 qualified for Tech and HR interview. 10 B.Tech and 1 MCA. Cutoff was high.

3rd round: Tech and HR interview. Both were compulsory. Combined marks of tech, HR and technical written were used for selection.

Hr round (my Hr interview was before tech, there was no sequence).

Introduction, hobbies, strength, weaknesses, why do you want to join sel, question about Samsung (b attentive in ppt of company) , your aim, in future u'll go for higher studies or not, any question from interviewer.

Tech interview-projects, prepare projects you have 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 you.