#2
 
 
Re: GATE Previous Question Papers with Solutions for CSE Free Download
As you are looking for GATE CSE Previous Question Papers so as per your requirement I am uploading GATE CSE sample Question Papers. Consider the following logical inferences. I1: If it rains then the cricket match will not be played. The cricket match was played. Inference: There was no rain. I2: If it rains then the cricket match will not be played. It did not rain. Inference: The cricket match was played. Which of the following is TRUE? (A) Both I1 and I2 are correct inferences (B) I1 is correct but I2 is not a correct inference (C) I1 is not correct but I2 is a correct inference (D) Both I1 and I2 are not correct inferences For more questions we are providing you a PDF file with it so you can get it easily.
__________________ Answered By StudyChaCha Request : Support us by liking us on facebook (please click the LIKE button in the Facebook box below, you should be logged in at Facebook to do so) Last edited by Vinodt; February 17th, 2014 at 04:55 PM. 
#6
 
 
Re: GATE Previous Question Papers with Solutions for CSE Free Download
The GATE examination consists of a single test of 3hour duration that contains 65 questions carrying a maximum of 100 marks. The questions consist of both multiple choice questions (MCQs) and numerical answer type questions. Here I am providing you pdf files GATE Previous Question Papers with Solutions for CSE Free Download 
#9
 
 
Re: GATE Previous Question Papers with Solutions for CSE Free Download
You are looking here for GATE 2013 paper of CS with solution so for you i am providing here in pdf mode and here is some question from this pdf: 1. Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is ½. What is the expected number of unordered cycles of length three? (A) 1/8 (B) 1 (C) 7 (D) 8 Ans. (C) Exp: 1 P(edge) 2 = Number of ways we can choose the vertices out of 8 is 3 c 8 (Three edges in each cycle) Expected number of unordered cycles of length 3 = 3 3 C 1 8 7 2 × = 2. Which of the following statements is/are TRUE for undirected graphs? P: Number of odd degree vertices is even. Q: Sum of degrees of all vertices is even. (A) P only (B) Q only (C) Both P and Q (D) Neither P nor Q Ans: (C) for see complete paper you have to download following attached file
__________________ Answered By StudyChaCha Request : Support us by liking us on facebook (please click the LIKE button in the Facebook box below, you should be logged in at Facebook to do so) 
Have a Facebook Account? Ask your Question Here 
Share this on... 
