Trending ▼   ResFinder  

GATE 1999 : Computer Science And Information Technology

15 pages, 86 questions, 0 questions with responses, 0 total responses,    0    0
gate
  
+Fave Message
 Home > gate >

Formatting page ...

SECTION - A 1. This question consists of TWENTY-FIVE multiple questions of ONE mark each. For each question, four possible alternatives (A, B, C and D) are given, out of which ONLY ONE is correct. Indicate the correct answer in the boxes corresponding to the questions only on the FIRST sheet of the answer book. 1.1 Suppose that the expectation of a random variable X is 5. Which of the following statements is true? (a) There is a sample point at which X has the value 5. (b) There is a sample point at which X has value greater than 5. (c) There is a sample point at which X has a value greater than or equal to 5. (d) None of the above 1.2 The number of binary relations on a set with n elements is: (a) n2 (b) 2n 2 (c) 2n 1.3 (d) None of the above The number of binary strings of n zeroes and k ones that no two ones are adjacent is (a) (b) (c) 1.4 n 1 n (d) None of the above Ck C k +1 n Ck 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 (a) n states (c) n + 2 states 1.5 (b) n + 1 states (d) None of the above Context-free languages are closed under: (a) Union, intersection (c) Intersection, complement 1.6 (b) Union, Kleene closure (d) Complement, Kleene closure Let LD be the set of all languages accepted by a PDA by final state and LE the set of all languages accepted by empty stack. Which of the following is true? (a) LD = LE (c) LE = LD 1.7 (b) LD LE (d) None of the above Which of the following expressions is not equivalent to x ? (a) x NAND X (b) x NOR x (c) x NAND 1 Think GATE Think GATE Forum (d) x NOR 1

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

 

  Print intermediate debugging step

Show debugging info


 

Additional Info : Solved GATE exam paper study guide - GATE 1999 : Computer Science And
Tags : GATE Computer Science And Information Technology 1999 Model Question Papers, GATE Computer Science & Information Technology Syllabus, GATE CS Papers, India, GATE Exam Question Papers, Free Online Solutions, Answers, Answer Key, Graduate Aptitude Test in Engineering, IIT, IISc, GATE Exam Syllabus, GATE Study Material, GATE Exam Pattern, gate exam papers, gate question papers 2016, 2015, 2014, 2013, 2012, 2011, 2010, 2009, 2008, 2007, 2006, 2005, 2004, 2003, 2002, 2001, 2000, 1999, 1998, 1997, 1996, 1995, 1994, 1993, 1992, 1991, past gate papers, gate papers with answers, gate entrance exam engineering, gate previous years papers, gate old papers, gpat.  

© 2010 - 2024 ResPaper. Terms of ServiceContact Us Advertise with us

 

gate chat