GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

313.

Consider the following statements about user level threads and kernel level threads. Which one of the following statements is FALSE? [1 mark]
(A) Context switch time is longer for kernel level threads than for user level threads.
(B) User level threads do not need any hardware support.
(C) Related kernel level threads can be scheduled on different processors in a multi-processor system.
(D) Blocking one kernel level thread blocks all related threads.

asked in Computer Science And Engineering, 2007

View Comments [0 Reply]
314.

Group 1 contains some CPU scheduling algorithms and Group 2 contains some applications. Match entries in Group 1 to entries in Group 2.

Group I Group II

(P) Gang Scheduling (1) Guaranteed Scheduling

(Q) Rate Monotonic Scheduling (2) Real-time Scheduling

(R) Fair Share Scheduling (3) Thread Scheduling

[1 mark]
(A) P - 3, Q - 2, R - 1
(B) P - 1, Q - 2, R - 3
(C) P - 2, Q - 3, R - 1
(D) P - 1, Q - 3, R - 2

asked in Computer Science And Engineering, 2007

View Comments [0 Reply]
315.

Consider the following segment of C-code:
int j, n;
j = 1;
while (j <=n)
j = j*2;
The number of comparisons made in the execution of the loop for any n > 0 is:
[1 mark]

asked in Computer Science And Engineering, 2007

View Comments [0 Reply]
316.

Which of the following sorting algorithms has the lowest worst-case complexity?
[1 mark]
(A) Merge sort
(B) Bubble sort
(C) Quick sort
(D) Selection sort

asked in Computer Science And Engineering, 2007

View Comments [0 Reply]
317.

The maximum number of binary trees that can be formed with three unlabeled nodes is:
[1 mark]
(A) 1
(B) 5
(C) 4
(D) 3

asked in Computer Science And Engineering, 2007

View Comments [0 Reply]
318.

The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number of nodes in a binary tree of height h is: [1 mark]
(A) 2^h -1
(B) 2^h-1 - 1
(C) 2^h+1 -1
(D) 2^h+1

asked in Computer Science And Engineering, 2007

View Comments [0 Reply]

801 1 ...‹‹51 5253 54 55 ›› ... 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