Quick Heal Placement Paper February 2012:1.How is the fragmented data kept track of ANS.

Describe the direct blocks and indirect blocks in UNIX file system 2. What is a volatile variable? 3. What is the scope of a static function in C ? 4. What is the difference between "malloc" and "calloc"? 5. struct n { int data; struct n* next}node; node *c,*t; c->data = 10; t->next = null; *c = *t; what is the effect of the last statement? 6. If you are on a boat and you throw out a suitcase, Will the level of water increase. 7. Print an integer using only putchar. Try doing it without using extra storage. 8. Write C code for (a) deleting an element from a linked list (b) traversing a linked list 9. What are various problems unique to distributed databases 10. Declare a void pointer ANS. void *ptr; Quick Heal Placement Paper January 2012:1. Which of the following involves context switch, (a) system call (b) privileged instruction (c) floating point exception (d) all the above (e) none of the above Ans: (a) 2. In OST, terminal emulation is done in (a) sessions layer (b) application layer (c) presentation layer (d) transport layer Ans: (b) 3. For a 25MHz processor , what is the time taken by the instruction which needs 3 clock cycles, (a)120 nano secs (b)120 micro secs

(c)75 nano secs (d)75 micro secs 4. For 1 MB memory, the number of address lines required, (a)11 (b)16 (c)22 (d) 24 Ans. (b)

5. Make the pointer aligned to a 4 byte boundary in a efficient manner ANS. Assign the pointer to a long number and the number with 11...1100 add 4 to the number 6. What is a far pointer (in DOS) 7. Describe the file system layout in the UNIX OS 8. describe boot block, super block, inodes and data layout 9. In UNIX, are the files allocated contiguous blocks of data ANS. no, they might be fragmented 10. Write a program to remove duplicates from a sorted array. ANS. int remove_duplicates(int * p, int size) { int current, insert = 1; for (current=1; current < size; current++) if (p[current] != p[insert-1]) { p[insert] = p[current]; current++; insert++; } else current++; return insert; }