SAMSUNG PLACEMENT PAPER

Jan 4 • Placement • 4538 Views • No Comments on SAMSUNG PLACEMENT PAPER

SAMSUNG PLACEMENT PAPER

1.what is software life cycle model?
2.what is V-model?

3.What is OOPS
4.concept of OOPS?
5.what is polymorphism and write a program based on it.
6.write an algorithm for quick sorting.

7.What is spanning tree?

8.What  is postfix expression?

9.How will you get Postfix notation from tree through traversal?

10.What is D- queue?Its application?

11. What is Forward Declaration?

12.What is PCB (Process Control Block) and its component?

13. .what is the value of EOF?

14.What is the o/p of?

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

15. What is the o/p of?
class test
{
static int x;
int* ptr;
}
int main()
{ test t1;
cout<<sizeof(t1)<<sizeof(test);return 0;
}

16. What is the o/p of?
char* str=”helloworld”;
main()
{
printf(“%s”,str);
str=str+5;
printf(“%s”,str);
str=str+7;
printf(“%s”,str);
}

17. What is the o/p of?
char* fun()
{ return(“samsung india”);
}
main()
{
printf(“%s”,printf(“electronics”)+fun());
}

18. What is the o/p of?

main()
{
extern int i;
{
int i=20;
printf(“%d”,i);
}
}

19. What is the o/p of?

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”);
}}

Operating system Question:

1.Threads don’t share their ___________________with other threads
2.Advantage of using large pages and small pages in paging.?

3.Which program loads first when system starts?

DATA STRUCTURE QUESTION:
1.Recursive function uses more__________________than non recursive function.
2.In heap each node is________ than its left and right child node.
3.Complexity of binary search is ___.
4.Total no of nodes in a full binary tree of 4 levels is ________.
5.Technique used for avoiding page fault frequency is _______.

Tell us Your Queries, Suggestions and Feedback

Your email address will not be published.

« »