280 previous year GATE Engineering - Computer Science & Information Technology (CS/IT) questions, grouped by year, with answers and solutions.
Theory of Computation: Which of the following language classes is NOT closed under intersection and complementation in 'Memory Management: Paging, Segmentation, Virtual Memory and Page Replacement (LRU, FIFO)'?
Database Management Systems (DBMS): In 'Graph Algorithms: BFS, DFS, Dijkstra, Bellman-Ford, Kruskal and Prim's MST', a relation $R(A,B,C,D)$ has functional dependencies $F = \{AB \to C, C \to D, D \to A\}$. What is the highest normal form of $R$?
Engineering Analysis & Principles: In technical analysis of 'Computer Networks: OSI and TCP/IP Reference Models, Framing, Error Detection (CRC) and Sliding Window' within Process Scheduling, Normalization, SQL & Networking Protocols, which governing relationship or mathematical model determines optimal system response under equilibrium conditions?
GATE Technical Standard: In computational modeling of 'Computer Networks: OSI and TCP/IP Reference Models, Framing, Error Detection (CRC) and Sliding Window', what constitutes the primary performance trade-off regarding asymptotic efficiency and resource conservation?
GATE CS/IT (Algorithms): What is the asymptotic time complexity of building a Max-Heap from an unsorted array of $n$ elements in 'Turing Machines: Decidability, Halting Problem and Chomsky Hierarchy'?
Theory of Computation: Which of the following language classes is NOT closed under intersection and complementation in 'Graph Algorithms: BFS, DFS, Dijkstra, Bellman-Ford, Kruskal and Prim's MST'?
Operating Systems: In 'Transactions and Concurrency Control: ACID Properties, Serializability, 2PL and Timestamp Ordering', which page replacement algorithm is immune to Belady's Anomaly (where increasing page frames increases page faults)?
Theory of Computation: Which of the following language classes is NOT closed under intersection and complementation in 'Routing Protocols: Distance Vector, Link State, OSPF, BGP and IPv4/IPv6 Subnetting'?
Algorithms (Graph Theory): What is the tightest worst-case time complexity of finding Single-Source Shortest Paths in a directed graph with $V$ vertices, $E$ edges, and NON-NEGATIVE weights using a Fibonacci Heap in 'Non-Linear Data Structures: Binary Trees, BST, AVL Trees, Heaps and Hashing'?
Computer Networks (Subnetting): An organization is allocated the network block 192.168.10.0/24 in 'Theory of Computation: Regular Expressions, DFA, NFA, Pumping Lemma, CFL and Pushdown Automata'. If it requires 4 equal subnets, what is the subnet mask and maximum usable host count per subnet?
Computer Networks (Subnetting): An organization is allocated the network block 192.168.10.0/24 in 'Non-Linear Data Structures: Binary Trees, BST, AVL Trees, Heaps and Hashing'. If it requires 4 equal subnets, what is the subnet mask and maximum usable host count per subnet?
Theory of Computation: Which of the following language classes is NOT closed under intersection and complementation in 'DBMS: ER Modeling, Relational Algebra, Relational Calculus and Tuple Calculus'?
Algorithms (Graph Theory): What is the tightest worst-case time complexity of finding Single-Source Shortest Paths in a directed graph with $V$ vertices, $E$ edges, and NON-NEGATIVE weights using a Fibonacci Heap in 'Database Normalization: Functional Dependencies, 1NF, 2NF, 3NF and BCNF'?
Theory of Computation: Which of the following language classes is NOT closed under intersection and complementation in 'Operating Systems: Process Management, CPU Scheduling Algorithms, Deadlocks and Banker's Algorithm'?
Operating Systems: In 'Non-Linear Data Structures: Binary Trees, BST, AVL Trees, Heaps and Hashing', which page replacement algorithm is immune to Belady's Anomaly (where increasing page frames increases page faults)?
Computer Networks (Subnetting): An organization is allocated the network block 192.168.10.0/24 in 'Database Normalization: Functional Dependencies, 1NF, 2NF, 3NF and BCNF'. If it requires 4 equal subnets, what is the subnet mask and maximum usable host count per subnet?
Algorithms (Graph Theory): What is the tightest worst-case time complexity of finding Single-Source Shortest Paths in a directed graph with $V$ vertices, $E$ edges, and NON-NEGATIVE weights using a Fibonacci Heap in 'Turing Machines: Decidability, Halting Problem and Chomsky Hierarchy'?
Computer Networks (Subnetting): An organization is allocated the network block 192.168.10.0/24 in 'Memory Management: Paging, Segmentation, Virtual Memory and Page Replacement (LRU, FIFO)'. If it requires 4 equal subnets, what is the subnet mask and maximum usable host count per subnet?
Theory of Computation: Which of the following language classes is NOT closed under intersection and complementation in 'Computer Networks: OSI and TCP/IP Reference Models, Framing, Error Detection (CRC) and Sliding Window'?
Algorithms (Graph Theory): What is the tightest worst-case time complexity of finding Single-Source Shortest Paths in a directed graph with $V$ vertices, $E$ edges, and NON-NEGATIVE weights using a Fibonacci Heap in 'Graph Algorithms: BFS, DFS, Dijkstra, Bellman-Ford, Kruskal and Prim's MST'?
Computer Networks (Subnetting): An organization is allocated the network block 192.168.10.0/24 in 'Graph Algorithms: BFS, DFS, Dijkstra, Bellman-Ford, Kruskal and Prim's MST'. If it requires 4 equal subnets, what is the subnet mask and maximum usable host count per subnet?
Database Management Systems (DBMS): In 'Turing Machines: Decidability, Halting Problem and Chomsky Hierarchy', a relation $R(A,B,C,D)$ has functional dependencies $F = \{AB \to C, C \to D, D \to A\}$. What is the highest normal form of $R$?
Sign up free to unlock every previous year question paper with detailed solutions, practice in timed exam mode, and evaluate your rank.
Sign up free to unlock every previous year question and generate papers from them.