Page:9
Below are the scanned copy of Kerala Public Service Commission (KPSC) Question Paper with answer keys of Exam Name 'WORKSHOP INSTRUCTOR/INSTRUCTOR GRII/DEMONSTRATOR/DRAFTSMAN GR II INFORMATION TECHNOLOGY TECHNICAL EDUCATIOIN' And exam conducted in the year 2016. And Question paper code was '114/2016'. Medium of question paper was in Malayalam or English . Booklet Alphacode was 'A'. Answer keys are given at the bottom, but we suggest you to try answering the questions yourself and compare the key along wih to check your performance. Because we would like you to do and practice by yourself.
67.
89.
70.
721
72
73.
11472016
. The maximum mode in 8086 is called
A) Uniprocessor mode B) Multiprocessor mode
C) Handshake mode D) Bidirectional mode
. The idea of cache memory is based on which of the following ?
A) The property of locality of reference
B) The heuristic 90-10 rule
C) The fact that references generally tend to cluster
D) All of the above
. In a virtual memory system the addresses used by the programmer belongs 10
A) Memory space B) Physical address
C) Address space D) Main memory system
The provides path between the CPU and peripheral devices which are
connected via interface cards.
A) Computer B) Expansion bus
C) Memory D) CPU
. A nonvolatile type of memory that can be programmed and erased in sectors,
rather than one byte at a time is
A) Flash memory B) EEPROM
C) MPROM D) EPROM
A complete microcomputer system consists of
A) Microprocessor B) Memory
C) Peripheral equipment D) All of the above
The address mapping is done, when the program 15 initially loaded is called
A) Dynamic relocation B) Relocation
©) Static relocation D) Dynamic as well as static relocation
Semaphores are mostly used to implement
A) System calls B) IPC mechanism
C) System protection D) None of the above
Optimal page-replacement algorithm is
A) Replace the page that has not been used for a long time
B) Replace the page that has been used for a long time
C) Replace the page that will not be used for a long time
D) None of the above
Bankers algorithm for resource allocation deals with
A) Deadlock prevention B) Deadlock recovery
C) Mutual exclusion D) Deadlock avoidance
-11-