LPSC technical assistant exam paper
 

Can you provide me the LPSC technical assistant exam sample paper???

Re: LPSC technical assistant exam paper
 

As per your request here I am sharing the LPSC technical assistant exam sample paper:

Consider a set of n tasks with known runtimes r1, r2 ……. r to be run on a unlprocessor machine. Which of the following processor scheduling algorithms will result in the maximum throughput?
a) Round Robin
b) Shortest job first
c) Highest response ratio next
d) first cum first served
Ans.

The principal of locality of reference justifies the use of
a) virtual memory
b) interrupts
c) main memory
d) cache memory
Ans.

What is the value of I at the end of the pseudocode?
a) 4
b) 5
c) 6
d) 7
Ans.

The five items: A, B, C, D, and E are pushed in a stack, one after the other starting from A. The stack is popped four times and each element Is inserted in a queue. Then two elements are deleted from the queue and pushed back on the stack. Now one item is popped from the stack. The popped item is
(a) A
(b) B
(c) C
(d) D
Ans.


Round Robin scheduling is essentially the pre-emptive version of
a) FIFO
b) Shortest Job First
c) shortest remaining time
d) Longest remaining time
Ans.

The number of digit I present in the binary representation of
3 x 512 +7 x 64 + 5 x 8 +3 is
(a) 8
(b) 9
(c) 1O
(d) 12