GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

43.

The lexical analysis for a modern computer language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense?
[1 mark]
(A) Finite state automata
(B) Deterministic pushdown automata
(C) Non-deterministic pushdown automata
(D) Turing machine

last reply by CpjJwWHV • 13 years ago • asked in Computer Science And Engineering, 2011

View Comments [3 Reply]
44.

Let the page fault service time be 10 ms in a computer with average memory access time being 20 ns. If one page fault is generated for every 10⁶ memory access, what is the effective access time for the memory? [1 mark]
(A) 21 ns
(B) 30 ns
(C) 23 ns
(D) 35 ns

last reply by CpjJwWHV • 14 years ago • asked in Computer Science And Engineering, 2011

View Comments [1 Reply]
45.

Consider a hypothetical processor with an instruction of type LW R1, 20(R2), which during execution reads a 32-bit word from memory and stores it in a 32-bit register R1. The effective address of the memory location is obtained by the addition of a constant 20 and the contents of register R2. Which of the following best reflects the addressing mode implemented by this instruction for the operand in memory? [1 mark]
(A) Immediate Addressing
(B) Register Addressing
(C) Register Indirect Scaled Addressing
(D) Base Indexed Addressing

last reply by CpjJwWHV • 13 years ago • asked in Computer Science And Engineering, 2011

View Comments [2 Reply]
46.

Which does the following fragment of C program print?
Char c[] = “GATE2011”;
char *p = c;
printf(“%s”, p + p[3] – p [11]); [1 mark]
(A) GATE2011
(B) E2011
(C) 2011
(D) 011

asked in Computer Science And Engineering, 2011

View Comments [0 Reply]
47.

A max-heap is a heap where the value of each parent is greater than or equal to the value of its children. Which of the following is a max-heap? [1 mark]

last reply by CpjJwWHV • 13 years ago • asked in Computer Science And Engineering, 2011

View Comments [5 Reply]
48.

Let P be a regular language and Q be a context-free language such that Q ⊆ P. (For example. let P be the language represented by the regular expression p*q* and be
{pⁿqⁿ | n ∈ N}, Then which of the following ALWAYS regular? [1 mark]
(A) P ∩ Q
(B) P –Q
(C) Σ* P
(D) Σ* – Q

last reply by CpjJwWHV • 13 years ago • asked in Computer Science And Engineering, 2011

View Comments [2 Reply]

801 1 ...‹‹6 78 9 10 ›› ... 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