College of Engineering, Andhra University 2007 B.E Computer Science and Engineering - Question Paper

Back Year ques. Paper (Computer Science & Engineering (CS))-GATE

1. This ques. consists of (Twenty-five) multiple-choice ques. every carrying 1 mark. For every ques­tion, 4 choices are given out of which exactly 1 is accurate. Write the accurate choice for every ques. ONLY in the box given for the ques. in the 1st sheet of the ans book. (25 x one = 25)

1.1 Suppose that the expectation of a random variable X is 5. Which of the subsequent 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 two
* two n
*
* None of the above



1.3 The number of binary strings of n zeros and k ones that no 2 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 + two states

(d) None of the above



1.5 Context-free languages are closed under:

* Union , intersection
* Union , Kleene closure
* Intersection, complement
* Complement, Kleene Closure
For more ques. visit our gate site and forum
http://www.onestopgate.com
http://forum.onestopgate.com

Earning:   Approval pending.