1. Critical section program segment is

a. enclosed by semaphores with P & V operations
b. deadlock avoidance
c. where shared resources are accessed

2. The addressing mode in which the address of the operand is expressed explicitly within the instruction

a) index addressing             b) absolute             c) indirect               d) immediate

3. The module that should be always reside in main memory is _________________

4. Between 100 and 999 how many no have the prob that they does not contain 7?

5. Which PageReplacement algo will give the best result ?

Answer : By replacing that page which has the next reference after a long time.(optimal algo)

6. Number of filpflops for mod 11 counter is _________

7. (A - B) U (B - A) U (A ^ C) = __________ where A,B are two sets A' , B' are compliments of A and B

8. The network that does not use virtual circuit __________

9. There Are two sets A and B and (A-B)union(B-A)union(A intersection B) is equivalent to _________

Answer : A union B

10. For how many numbers there is no difference between little endian and big endian

Answer : 256

11. For the multiplication of two 8 bit numbers how much ROM will be used

Answer :  64k*16 ROM

12. For an IP Router how many IP addresses

13. What is the shannon theorem

14. Nyquist theorem

15. Addressing mode, Assembler passes,  Linking and Loading,  File directory search,  Turning machine, Finite state machine, Daisy wheel