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

## Aptitude | GATE CS 1998 | Question 14

A multiplexor with a 4-bit data select input is a (A) 4:1 multiplexor (B) 2:1 multiplexor (C) 16:1 multiplexor (D) 8:1 multiplexor Answer: (C) Explanation:… Read More »

## Aptitude | GATE CS 1998 | Question 13

What happens when a bit-string is XORed with itself n-times as shown: [ B⊕ (B⊕ (B⊕ (B…….. n times) ]   (A) complements when n… Read More »

## Aptitude | GATE CS 1998 | Question 12

The string 1101 does not belong to the set represented by (A) 110* (0+1) (B) 1(0+1)* 101 (C) (10)* (01)* (00+11)* (D) (00+(11)*0)* Answer: (D)… Read More »

## Aptitude | GATE CS 1998 | Question 11

Regarding the power of recognition of languages, which of the following statement is false? (A) The non-deterministic finite state automata are equivalent to deterministic finite… Read More »

## Aptitude | GATE CS 1998 | Question 10

Which of the following sets can be recognized by a Deterministic Finite-state Automaton? (A) The number 1, 2, 4, 8……,2^n,………. written in binary. (B) The… Read More »

## Aptitude | GATE CS 1998 | Question 9

If the regular set ‘A’ is represented by A= (01+1)* and the regular set ‘B’ is represented by B= ((01)* 1*)*, which of the following… Read More »

## Aptitude | GATE CS 1998 | Question 8

The number of functions from an m element set to an n element set is (A) m+n (B) m^n (C) n^m (D) m*n Answer: (C)… Read More »

## Aptitude | GATE CS 1998 | Question 7

Let R1 and R2 be two equivalence relations on a set. Consider the following assertions: (i) R1 ∪ R2 is an equivalence relation (ii) R1… Read More »

## Aptitude | GATE CS 1998 | Question 6

Suppose A is a finite set with n elements. The number of elements in the largest equivalence relation of A is (A) n (B) n^2… Read More »

## Aptitude | GATE CS 1998 | Question 5

What is the converse of the following assertion? I stay only if you go. (A) I stay if you go (B) If I stay then… Read More »

## Aptitude | GATE CS 1998 | Question 4

Consider the function y = |x| in the interval [-1,1]. In this interval, the function is (A) continuous and differentiable (B) continuous but not differentiable (C)… Read More »

## Aptitude | GATE CS 1998 | Question 3

Which of the following statements applies to the bisection method used for finding roots of functions: (A) converges within a few iteration (B) guaranteed to… Read More »

## Aptitude | GATE CS 1998 | Question 2

Consider the following set of equations x+2y = 5 4x+8y = 12 3x+6y+3z = 15 This set- (A) has a unique solution (B) has no… Read More »

## GATE | GATE CS 1998 | Question 1

A die is rolled three times. The probability that exact one odd number turns up among the three outcomes is (A) 1/6 (B) 3/8 (C)… Read More »

## Aptitude | Trigonometry & Height and Distances | Question 5

The least value of 2sin2θ + 3cos2θ (A) 1/3 (B) 4/3 (C) 2 (D) 3/4 Answer: (C) Explanation: = 2sin2θ + 2cos2θ + cos2θ =2(sin2θ… Read More »