GATE Exam Papers with Solutions Free Download

sir i want gate exam previous 10 year question papers.this is my mail saikumar2010ece@gmail.com.

Graduate Aptitude Test in Engineering (GATE) is an all India examination conducted jointly by the IISc & IITs.

The GATE Academy Founded by Alumni of Indian Institute of Science and Indian Institute of Technology, we offer comprehensive & rigorous Training for the Graduate Aptitude Test in Engineering – GATE Exam and various Government and Public Sector Unit Jobs. We have eclectic,learned and committed team of professionals (GATE Top Ranker's) to inspire and Train students towards excellence.

It is really very good about The Gate Academy that it is having different types of correspondence program. The Gate Academy is having different types correspondence exams like Correspondence Program Regular/Advance/ Premium, E-Lecture, Mock Test Series.The students can go through it as per his/her requirements.Correspondence Learning Program consist of complete GATE syllabus in the form of booklets with theory, solved examples, model tests, formula and questions in various levels of difficulty in all the topics of the syllabus. The material is designed in such that way that it’s proven to be ideal material in-terms of an accurate and efficient preparation for GATE.

sir i want gate previous
10 question papers with solution this is my mail kmadan340@gmail.com

This website is a useful GATE exam site They have GATE Test Papers and a whole lot more details about GATE examination.

You can go check out The Gate Academy website.

i am preparing for gate.i am electrical engineer. Wil u please send me the previous gate papes with solutions.please sir

sir,pls send me previous question papers of ece with solutions to my mail haritatalasila@gmail.com

i need previous year gate solved question papers for EEE from 2007-2013.send this to my email id: rsangvi94eee@gmail.com

sir i want solved previous gate papers.thanking u sir

here I giving you GATE examination question paper with solutions in PDF files attached with it so you can get it easily..

GATE CS exam papers ::
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)

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)

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 NP-Complete, there exists a non-deterministic 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)

Exp: 1. Cycle detection using DFS: 2 O(V E) O(V ) + = and it is polynomial problem
2. Every P-problem is NP ( ) sin ce P NP Ì
3. NP complete NP − Î
Hence, NP-complete can be solved in non-deterministic polynomial time

Which of the following statements is/are FALSE?
(1) For every non-deterministic 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)

Exp: (1) NTM @ DTM
(2) RELs are closed under union & but not complementation
(3) Turing decidable languages are recursive and recursive languages are closed
under intersection and complementation
(4) RELs are closed under union & intersection but not under complementation

An index is clustered, if
(A) it is on a set of fields that form a candidate key.
(B) it is on a set of fields that include the primary key.
(C) the data records of the file are organized in the same order as the data
entries of the index.
(D) the data records of the file are organized not in the same order as the data
entries of the index.

Ans: (C)
Exp: Clustered index is built on ordering non key field and hence if the index is
clustered then the data records of the file are organized in the same order as the
data entries of the index.

Assume that source S and destination D are connected through two intermediate
routers labeled R. Determine how many times each packet has to visit the
network layer and the data link layer during a transmission from S to D.

for the complete question paper I am attaching PDF file with it ..

Attached Files Available for Download

	GATE CS exam question paper.pdf (291.8 KB, 12 views)
	GATE ECE exam question paper.pdf (328.3 KB, 21 views)
	GATE EE exam question paper.pdf (208.1 KB, 17 views)

Examinations for all the 22 GATE papers will be conducted by an online Computer-Based Test (CBT). The IT and CS papers were merged and there was no separate IT paper.

GATE Papers with Solution:
Here Iam giving you pdf file of GATE Exam Papers with Solutions :

Attached Files Available for Download

GATE Papers with Solution.pdf (327.6 KB, 19 views)