#2
 
 
Re: Last years GATE CSE Question paper with solutions
Here I am providing you the last year GATE Exam Question paper of Computer Science Engineering (CSE) with solution 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) 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) Which of the following statements are TRUE? (1) The problem of determining whether there exists a cycle in an undirected graph is in P. (2) The problem of determining whether there exists a cycle in an undirected graph is in NP. (3) If a problem A is NPComplete, there exists a nondeterministic polynomial time algorithm to solve A. (A) 1,2 and 3 (B) 1 and 2 only (C) 2 and 3 only (D) 1 and 3 only Ans: (A) Which of the following statements is/are FALSE? (1) For every nondeterministic Turing machine, there exists an equivalent deterministic Turing machine. (2) Turing recognizable languages are closed under union and complementation. (3) Turing decidable languages are closed under intersection and complementation (4) Turing recognizable languages are closed under union and intersection. (A) 1 and 4 only (B) 1 and 3 only (C) 2 only (D) 3 only Ans: (C) Rest of the Questions are attached in below file which is free of cost
__________________ 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) 
Sponsored Links 
Have a Facebook Account? Ask your Question Here 
Share this on... 
