Back Year Question Paper (Computer Science & Engineering (CS))-GATE 1. This question consists of (Twenty-five) multiple-choice questions each carrying one mark. For each question, four options are provided out of which exactly one is correct. Write the correct option for each question ONLY in the box provided for the question in the first sheet of the answer book. (25 x 1 = 25) 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 * * 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 (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 question visit our gate site and forum http://www.onestopgate.com http://forum.onestopgate.com