GATE Computer Science and Information Technology Question Papers
GATE (Graduate Aptitude Test in Engineering) Computer Science and Information Technology is an online examination conducted to get admission in M-Tech (Masters in Technology), ME (Master of Engineering ), and Ph.D. at IITs (Indian Institutes of Technology), NITs (National Institutes of Technology), IIITs (Indian Institutes of Information Technology) and other universities in India. GATE exam is jointly conducted by IIT Bombay, IIT Delhi, IIT Guwahati, IIT Kanpur, IIT Kharagpur, IIT Madras, IIT Roorkee, and Indian Institute for Science, Bangalore (IISC Bangalore). The exam is divided into two different parts General Aptitude (GA) and Candidate’s Selected Subject (Core Subjects).
GATE Computer Science and Information Technology online mock tests help candidates in preparing for the GATE exam. By attempting GATE online mock tests candidates get familiar with the pattern of the actual question paper.
BrPaper provides all GATE question papers completely free. Here you can practice free online mock tests of GATE Computer Science and Information Technology. We advise candidates to solve the online GATE Computer Science and Information Technology mock tests to get good marks in the exam. Start practicing Computer Science and Information Technology GATE Mock tests here online for free.
GATE Computer Science and Information Technology Previous year Question Papers With Solutions
GATE 2019 Computer Science and Information Technology Question Papers with solution
GATE 2018 Computer Science and Information Technology Question Papers with solution
GATE 2021 Computer Science and Information Technology Revised syllabus
Section1: Engineering Mathematics
Discrete Mathematics: Propositional and first order logic. Sets, relations, functions, partial orders and lattices. Monoids, Groups. Graphs: connectivity, matching, coloring. Combinatorics: counting, recurrence relations, generating functions.
Linear Algebra: Matrices, determinants, system of linear equations, eigenvalues and eigenvectors, LU decomposition.
Calculus: Limits, continuity and differentiability. Maxima and minima. Mean value theorem. Integration.
Probability and Statistics: Random variables. Uniform, normal, exponential, poisson and binomial distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem. Computer Science and Information Technology
Section 2: Digital Logic
Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point).
Section 3: Computer Organization and Architecture
Machine instructions and addressing modes. ALU, data‐path and control unit. Instruction pipelining, pipeline hazards. Memory hierarchy: cache, main memory and secondary storage; I/O interface (interrupt and DMA mode).
Section 4: Programming and Data Structures
Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.
Section 5: Algorithms
Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer. Graph traversals, minimum spanning trees, shortest paths
Section 6: Theory of Computation
Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and contex- free languages, pumping lemma. Turing machines and undecidability.
Section 7: Compiler Design
Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation. Local optimisation, Data flow analyses: constant propagation, liveness analysis, common subexpression elimination.
Section 8: Operating System
System calls, processes, threads, inter‐process communication, concurrency and synchronization. Deadlock. CPU and I/O scheduling. Memory management and virtual memory. File systems.
Section 9: Databases
ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints, normal forms. File organization, indexing (e.g., B and B+ trees). Transactions and concurrency control.
Section 10: Computer Networks
Concept of layering: OSI and TCP/IP Protocol Stacks; Basics of packet, circuit and virtual circuit-switching; Data link layer: framing, error detection, Medium Access Control, Ethernet bridging; Routing protocols: shortest path, flooding, distance vector and link state routing; Fragmentation and IP addressing, IPv4, CIDR notation, Basics of IP support protocols (ARP, DHCP, ICMP), Network Address Translation (NAT); Transport layer: flow control and congestion control, UDP, TCP, sockets; Application layer protocols: DNS, SMTP, HTTP, FTP, Email.