Download GATE Previous Year Original Question Papers of CSE & IT easily without any registration or login. Download some of the previous years question papers as it is. These Papers are not modified in any way. Here, we would like to help our readers and others by providing the previous year papers of Computer Science & Information Technology so that they can secure more in their examinations and they came to know about the patterns of their Papers.here we are providing the offline question papers of GATE held in 2012 and 2013.

**Tips Regarding GATE from GATE Toppers:-**

1).Getting good score in gate doesn’t depend on which book you follow. Study the books that you have been studying since 2nd year.

2).For securing good rank in gate you must have constant practice on the problems and always stay in touch with gate study.

3).Read and understand the question completely ,understand what is given and what is asked for.

4).Look at the answer choices and eliminate ones that are obviously wrong.

5).Look for patterns in the choices.Sometimes, the choice that sticks out the most is probably a wrong choice. Sometimes, all the choices contain the same variables but in different positions.

6).You must have Good technical knowledge,good understanding of Basic Concepts, ability to apply the knowledge and concepts on variety of problems.

**Syllabus of GATE 2015 for CS & IT:-**

**Engineering Mathematics:-**

Mathematical Logic: Propositional Logic; First Order Logic. Probability: Conditional Probability; Mean, Median, Mode and Standard Deviation; Random Variables; Distributions; uniform, normal, exponential, Poisson, Binomial. Set Theory & Algebra: Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra, Combinatory: Permutations; Combinations; Counting; Summation; generating functions; recurrence relations; asymptotics, Graph Theory: Connectivity; spanning trees; Cut vertices & edges; covering; matching; independent sets; Colouring; Planarity; Isomorphism. Linear Algebra: Algebra of matrices, determinants, systems of linear equations, Eigen values and Eigen vectors. Numerical Methods: LU decomposition for systems of linear equations; numerical solutions of non-linear algebraic equations by Secant, Bisection and Newton-Raphson Methods; Numerical integration by trapezoidal and Simpson’s rules. Calculus: Limit, Continuity & differentiability, Mean value Theorems, Theorems of integral calculus, evaluation of definite & improper integrals, Partial derivatives, Total derivatives, maxima & minima.

**Computer Science and Information Technology:-**

Digital Logic: Logic functions, Minimization, Design and synthesis of combinational and sequential circuits; Number representation and computer arithmetic (fixed and floating point).

Computer Organization and Architecture: Machine instructions and addressing modes, ALU and data-path, CPU control design, Memory interface, I/O interface (Interrupt and DMA mode), Instruction pipelining, Cache and main memory, Secondary storage.

Programming and Data Structures: Programming in C; Functions, Recursion, Parameter passing, Scope, Binding; Abstract data types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binary heaps.

Algorithms: Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case analysis; Design: Greedy approach, Dynamic programming, Divide-and-conquer; Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching. Asymptotic analysis (best, worst, average cases) of time and space, upper and lower bounds, Basic concepts of complexity classes – P, NP, NP-hard, NP-complete.

Theory of Computation: Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability.

Compiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and target code generation, Basics of code optimization.

Operating System: Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File systems, I/O systems, Protection and security.

Databases: ER-model, Relational model (relational algebra, tuple calculus), Database design (integrity constraints, normal forms), Query languages (SQL), File structures (sequential files, indexing, B and B+ trees), Transactions and concurrency control.

Information Systems and Software Engineering: information gathering, requirement and feasibility analysis, data flow diagrams, process specifications, input/output design, process life cycle, planning and managing the project, design, coding, testing, implementation, maintenance.

Computer Networks: ISO/OSI stack, LAN technologies (Ethernet, Token ring), Flow and error control techniques, Routing algorithms, Congestion control, TCP/UDP and sockets, IP(v4), Application layer protocols (icmp, dns, smtp, pop, ftp, http); Basic concepts of hubs, switches, gateways, and routers.

Network security – basic concepts of public key and private key cryptography, digital signature, firewalls.

Web technologies: HTML, XML, basic concepts of client-server computing.

GATE- 2015 Syllabus Source:- IIT GATE 2015

So, Friends you can of course have an idea about the GATE Question Paper Pattern. Just be confident you can do it! All the Best.