GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

343.

Consider three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by giving priority to the process with the lowest process id. The average turn around time is: [2 marks]
(A) 13 units
(B) 14 units
(C) 15 units
(D) 16 units

asked in Computer Science And Engineering, 2006

View Comments [0 Reply]
344.

A computer system supports 32-bit virtual addresses as well as 32-bit physical addresses. Since the virtual address space is of the same size as the physical address space, the operating system designers decide to get rid of the virtual memory entirely. Which one of the following is true? [2 marks]
(A) Efficient implementation of multi-user support is no longer possible
(B) The processor cache organization can be made more efficient now
(C) Hardware support for memory management is no longer needed
(D) CPU scheduling can be made more efficient now

asked in Computer Science And Engineering, 2006

View Comments [0 Reply]
345.

A CPU generates 32-bit virtual addresses. The page size is 4 KB. The processor has a translation look-aside buffer (TLB) which can hold a total of 128 page table entries and is 4-way set associative. The minimum size of the TLB tag is: [2 marks]
(A) 11 bits
(B) 13 bits
(C) 15 bits
(D) 20 bits

asked in Computer Science And Engineering, 2006

View Comments [0 Reply]
346.

The atomic fetch-and-set x, y instruction unconditionally sets the memory location x to 1 and fetches the old value of x n y without allowing any intervening access to the memory location x. consider the following implementation of P and V functions on a binary semaphore S.
void P (binary_semaphore *s) {
unsigned y;
unsigned *x = &(s->value);
do {
fetch-and-set x, y;
} while (y);
}
void V (binary_semaphore *s) {
S->value = 0;
}
Which one of the following is true? [2 marks]
(A) The implementation may not work if context switching is disabled in P
(B) Instead of using fetch-and –set, a pair of normal load/store can be used
(C) The implementation of V is wrong
(D) The code does not implement a binary semaphore

asked in Computer Science And Engineering, 2006

View Comments [0 Reply]
347.

Consider the following C code segment.
for (i = 0, i<n; i++) {
for (j=0; j<n; j++) {
if (i%2) {
x += (4*j + 5*i);
y += (7 + 4*j);
}
}
}
Which one of the following is false? [2 marks]
(A) The code contains loop invariant computation
(B) There is scope of common sub-expression elimination in this code
(C) There is scope of strength reduction in this code
(D) There is scope of dead code elimination in this code

asked in Computer Science And Engineering, 2006

View Comments [0 Reply]
348.

Consider the following translation scheme.
S → ER
R → *E {print ('*') ;} R| ε
E → F+E{print('+');}| F
F → (S) | id{print.(idvalue);}
Here id is a token that represents an integer and id.value represents the corresponding integer value. For an input '2 * 3 + 4', this translation scheme prints [2 marks]
(A) 2 * 3 + 4
(B) 2 * +3 4
(C) 2 3 * 4 +
(D) 2 3 4+*

asked in Computer Science And Engineering, 2006

View Comments [0 Reply]

801 1 ...‹‹56 5758 59 60 ›› ... 134

High Frequency Word List with Mnemonics

GPL Dictionary is fast way to learn words with mnemonics.
It contains high frequency word list which are mostly asked in various examinations.
It is dedicated for student appearing for PSUs, GRE, UPSC or any other exams in which vocabulary test is taken.
User can save their own mnemonics (key and link).

Check Now