hp placement paper – 3
HP PLACEMENT PAPER – 3
PART- 1 –> 40 q’s (Fundamental computer Concepts, includes OS,N/w , protocols)
PART-2 –> 20 q’s (Purely C )
PART-3 –> 20 q’s (Analytical)
Q : What is not a part of OS ?
O : swapper,compiler,device driver,file system.
A : compiler.
Q : what is the condition called when the CPU is busy swapping in and out pages of
memory without doing any useful work ?
O : Dining philosopher’s problem,thrashing,racearound,option d
A: thrashing.
Q : How are the pages got into main memory from secondary memory?
DMA, Interrupts,option3, option 4
A : as far as i know its Interrupts –by raising a page fault exception.
Q : What is the use of Indexing ?
O : fast linear access, fast random access, sorting of records , option 4
A : find out….
Q : in terms of both space and time which sorting is effecient.(The question is
rephrased .)
O : merge sort, bubble sort, quick sort, option 4
A : find out
which case statement will be executed in the following code ?
main()
{ int i =1; switch(i)
{ i++; case 1 : printf (“”); break;
ase 2 : printf(“”); break;efault : printf(“”); break;
Answer : Case1 will only be executed.
Q : In the given structure how do you initialize the day feild?
struct time {
char * day ;
int * mon ;
int * year ;
} * times;
Options : *(times).day, *(times->day), *times->*day.
Answer : *(times->day) — after the execution of this statement compiler generates
error.i didn’t understand why.can anybody explain.
Q: The char has 1 byte boundary , short has 2 byte boundary, int has 4 byte boundary.
what is the total no: of bytes consumed by the following structure:
struct st {char a ; char b; short c ; int z[2] ; char d ; short f; int q ;
