**GATE CS Question Paper 1999.**

GATE CS Computer Science Question Paper 1999 Answers Solution Free Download PDF 1999

GATE i.e. Graduate Aptitude Test in Engineering Computer Science 1999 Exam Has been Conducted by IISc Bangalore IIT Bombay IIT Delhi IIT Guwahati IIT Kanpur IIT Kharagpur IIT Madras IIT Roorkee. This GATE CS 1999 examination is the procedure to get the admission in M.Tech

GATE Computer Science i.e. CS Question Paper, This GATE CS 1999 Question will help all the students for their exam preparation, here the question type is MCQ i.e multiple choice question answers, if this GATE CS 1999 question paper in pdf file for GATE CS you can download it in FRCS, if GATE Computer Science 1999 paper in text for GATE CS you can download GATE CS 1999 page also just Go to menu bar, Click on File->then Save.

**GATE CS Question Paper 1999**

**GATE CS Question Paper 1999**

GATE CS 1999 Question paper Free Download PDF is available in **www.oldquestionpapers.net** which has been provided by many students this GATE Computer Science 1999 paper is available for all the students in FRCS and also GATE CS 1999 question paper fully solved i.e with answer keys and solution.

You can get daily updates on GATE CS 1999 from **www.oldquestionpapers.net** here you can also check similar links for other related study materials on GATE Computer Science exam. Here GATE CS 1999 question is also available in English.

**SECTION – A**

**1.1 Suppose that the expectation of a random variable X is 5. Which of the following statements is true?**

• There is a sample point at which X has the value 5.

• There is a sample point at which X has value greater than 5.

• There is a sample point at which X has a value greater than or equal to 5.

• None of the above.

**1.2 The number of binary relations on a set with n elements is:**

• n 2

• 2 n

• n 2 n

• None of the above

**1.3 The number of binary strings of n zeros and k ones that no two ones are adjacent is**

• n-1 C k

• n C k

• n C k+l

• None of the above

**1.4 Consider the regular expression (0 + 1) (0 + 1)……..n times. The minimum state finite automation that recognizes the language represented by this regular expression contains**

• n states

• n + I states

• n + 2 states

**. **None of the above

**1.5 Context-free languages are closed under:**

- Union , intersection
- Union , Kleene closure
- Intersection, complement
- Complement, Kleene Closure

**1.6 Let L p be the set of all languages accepted by a PDA by final state and L E the set of all languages accepted by empty stack. Which of the following is true?**

(a) L D = L E (b) L D É L E

(c) L D = L E (d) None of the above

**1.7 Which of the following expressions is not equivalent to ?**

- x NAND x
- x NOR x
- x NAND 1
- x NOR 1

**Similar Pages..**

**Similar Links…… **