Print Page | Close Window

GATE (CS) Previous year question

Printed From: One Stop GATE
Category: GATE Previous Years Test Papers - Discuss Here
Forum Name: CS Papers
Forum Discription: Computer Science Previous Year GATE Papers to can discussed here.
URL: http://forum.onestopgate.com/forum_posts.asp?TID=1222
Printed Date: 06Feb2025 at 8:47pm


Topic: GATE (CS) Previous year question
Posted By: parween
Subject: GATE (CS) Previous year question
Date Posted: 27Apr2007 at 8:29pm

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
http://www.onestopgate.com/ - http://www.onestopgate.com

2 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

 

3.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

(d) None of the above

  http://www.onestopgate.com/ - http://www.onestopgate.com

4 Context-free languages are closed under:

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

 

5. 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


For More Question U Can Visit Our onestopgate web site

http://www.onestopgate.com - http://www.onestopgate.com



Replies:
Posted By: shreya
Date Posted: 27Apr2007 at 10:02pm
Hi parveena we are thankful to you to joinour group please ask your friends to jon this group and promote this group

Posted By: meena_malviya
Date Posted: 19Oct2007 at 10:44pm
Originally posted by parween

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
http://www.onestopgate.com/ - http://www.onestopgate.com

2 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

 

3.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

(d) None of the above

  http://www.onestopgate.com/ - http://www.onestopgate.com

4 Context-free languages are closed under:

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

 

5. 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


For More Question U Can Visit Our onestopgate web site

http://www.onestopgate.com - http://www.onestopgate.com



-------------
meenamalviya


Print Page | Close Window