GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

793.

A low memory can be connected to 8085 by using [1 mark]
(a) INTER
(b) RESET IN
(c) HOLD
(d) READY

asked in Computer Science And Engineering, 2001

View Comments [0 Reply]
794.

Which of the following statements is false? [1 mark]
(a) Virtual memory implements the translation of a program’s address space into physical memory address space
(b) Virtual memory allows each program to exceed the size of the primary memory
(c) Virtual memory increases the degree of multiprogramming
(d) Virtual memory reduces the context switching overhead

asked in Computer Science And Engineering, 2001

View Comments [0 Reply]
795.

More than one word are put in one cache block to [1 mark]
(a) exploit the temporal locality of reference in a program
(b) exploit the spatial locality of reference in a program
(c) reduce the miss penalty
(d) none of the above

asked in Computer Science And Engineering, 2001

View Comments [0 Reply]
796.

Given an arbitary non-deterministic finite automaton (NFA) with N states, the maximum number of states in an equivalent minimized DFA is at least [1 mark]
(a) N²
(b) 2^N
(c) 2N
(d) N!

asked in Computer Science And Engineering, 2001

View Comments [0 Reply]
797.

Which of the following statement is true? [1 mark]
(a) If a language is context free it can always be accepted by a deterministic push-down automaton
(b) The union of two context free languages is context free
(c) The intersection of two context free languages is context free
(d) The complement of a context free language is context free

asked in Computer Science And Engineering, 2001

View Comments [0 Reply]
798.

Consider the following two statements:
S1: {0²ⁿ |n≥1|} is a regular language
S2: {0^m1ⁿ0^m+n |m ≥ 1 and n ≥ 1| }
Which of the following statements is correct? [1 mark]
(a) Only S1 is correct
(b) Only S2 is correct
(c) Both S1 and S2 are correct
(d) None of S1 and S2 is correct

asked in Computer Science And Engineering, 2001

View Comments [0 Reply]

801 1 ...‹‹131 132133 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