GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

637.

In a system with 32 bit virtual addresses and 1KB page size, use of one-level page tables for virtual to physical address translation is not practical because of [1 mark]
(A) the large amount of internal fragmentation
(B) the large amount of external fragmentation
(C) the large memory overhead in maintaining page tables
(D) the large computation overhead in the translation process

asked in Computer Science And Engineering, 2003

View Comments [0 Reply]
638.

Using a larger block size in a fixed block size file system leads to [1 mark]
(A) better disk throughput but poorer disk space utilization
(B) better disk throughput and better disk space utilization
(C) poorer disk throughput but better disk space utilization
(D) poorer disk throughput and poorer disk space utilization

asked in Computer Science And Engineering, 2003

View Comments [0 Reply]
639.

Which of the following statements is FALSE? [1 mark]
(A) In statically typed languages, each variable in a program has a fixed type
(B) In un-typed languages, values do not have any types
(C) In dynamically typed languages, variables have no types
(D) In all statically typed languages, each variable in a program is associated with values of only a single type during the execution of the program

asked in Computer Science And Engineering, 2003

View Comments [0 Reply]
640.

In a heap with n elements with the smallest element at the root, the 7th smallest element can be found in time [1 mark]
(A) Θ(n log n)
(B) Θ(n)
(C) Θ(log n)
(D) Θ(1)

asked in Computer Science And Engineering, 2003

View Comments [0 Reply]
641.

The usual Θ(n2) implementation of Insertion Sort to sort an array uses linear search to identify the position where an element is to be inserted into the already sorted part of the array. If, instead, we use binary search to identify the position, the worst case running time will [1 mark]
(A) remain Θ(n²)
(B) become Θ(n (log n)²)
(C) become Θ(n log n)
(D) become Θ(n)

asked in Computer Science And Engineering, 2003

View Comments [0 Reply]
642.

Consider the following graph

Among the following sequences
I. a b e g h f
II. a b f e h g
III. a b f h g e
IV. a f g h b e
Which are depth first traversals of the above graph? [1 mark]
(A) I, II and IV only
(B) I and IV only
(C) II, III and IV only
(D) I, III and IV only

asked in Computer Science And Engineering, 2003

View Comments [0 Reply]

801 1 ...‹‹105 106107 108 109 ›› ... 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