# Tag Archives: Aptitude (adsbygoogle = window.adsbygoogle || []).push({});

## Aptitude | GATE CS 1998 | Question 59

a.  The implication gate shown below, has two inputs (x and y), the output is 1 except when x=1 and y=0. Realize f=x’y  + xy’ using… Read More »

## Aptitude | GATE CS 1998 | Question 58

[Subjective type] Design a deterministic finite state automaton (using minimum number of states) that recognizes the following language: L = { w ∈ {0,1}* |… Read More »

## Aptitude | GATE CS 1998 | Question 57

[Subjective type] Given a regular expression for the set of binary strings where every 0 is immediately followed by exactly k 1’s and preceded by… Read More »

## Aptitude | GATE CS 1998 | Question 56

[Subjective type] Two friends agree to meet at a park with the following conditions. Each will reach the park between 4:00 p.m. and 5:00 p.m.… Read More »

## Aptitude | GATE CS 1998 | Question 55

Suppose the domain set of an attribute consists of signed four digit numbers. What is the percentage rate of reduction in storage space of this… Read More »

## Aptitude | GATE CS 1998 | Question 54

Which of the following query transformations (i.e., replacing the l.h.s. expression by the r.h.s. expression) is incorrect? R1 and R2 are relations. C1, C2 are… Read More »

## Aptitude | GATE CS 1998 | Question 53

If an instruction takes i microseconds and a page fault takes an additional j microseconds, the effective instruction time if on the average a  page fault… Read More »

## Aptitude | GATE CS 1998 | Question 52

Consider n processes sharing the CPU in a round-robin fashion. Assuming that each process switch takes s seconds, what must be the quantum size q… Read More »

## Aptitude | GATE CS 1998 | Question 51

The overlay tree for a program is as shown below: What will be the size of the partition (in physical memory) required to load (and… Read More »

## Aptitude | GATE CS 1998 | Question 50

Faster access to non-local variables is achieved using an array of pointers to activation records, called a (A) stack (B) heap (C) display (D) activation… Read More »

## Aptitude | GATE CS 1998 | Question 49

Let A be a two dimensional array declared as follows: A: array [1 … 10] [1 … 15] of integer; Assuming that each integer takes… Read More »

## Aptitude | GATE CS 1998 | Question 48

What is the result of the following program? program side-effect (input, output); var x, result: integer; function f (var x:integer):integer; begin x:x+1;f:=x; end; begin x:=5;… Read More »

## Aptitude | GATE CS 1998 | Question 47

What value would the following function return for the input x=95 ? function fun (x:integer):integer; Begin If x >100 then fun = x-10 Else fun… Read More »

## Aptitude | GATE CS 1998 | Question 46

A complete n-ary tree is one in which every node has 0 or n sons. If x is the number of internal nodes of a… Read More »

## Aptitude | GATE CS 1998 | Question 45

The address space of 8086 CPU is (A) One Megabyte (B) 256 Kilobytes (C) 1 K Megabytes (D) 64 Kilobytes Answer: (A) Explanation: Quiz of… Read More »