Courses
Tutorials
Interview Prep
DSA
Practice Problems
C
C++
Java
Python
JavaScript
Data Science
Machine Learning
Courses
Linux
DevOps
Similar Topics
Web Technologies
32.1K+ articles
DSA
20.4K+ articles
Computer Networks
3.4K+ articles
C Language
1.3K+ articles
DBMS
1.3K+ articles
GATE CS
1.1K+ articles
Operating Systems
993+ articles
MCQ
51+ articles
GATE-CS-DS-&-Algo
39+ articles
GATE-CS-C-Language
12+ articles
GATE-CS-2006
9 posts
Recent Articles
Database Management Systems | Set 9
Last Updated: 23 July 2025
Following questions have been asked in GATE 2006 CS exam. 1) Consider the following log sequence of two transactions on a bank account, with initial balance 12000, that tr...
read more
DBMS
GATE CS
MCQ
GATE-CS-2006
Computer Networks | Set 11
Last Updated: 23 July 2025
Following questions have been asked in GATE CS 2006 exam. 1) Station A uses 32 byte packets to transmit messages to Station B using a sliding window protocol. The round tr...
read more
Computer Networks
GATE CS
MCQ
GATE-CS-2006
Operating Systems | Set 15
Last Updated: 23 July 2025
Following questions have been asked in GATE CS 2006 exam.1) Consider three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All...
read more
Operating Systems
GATE CS
MCQ
GATE-CS-2006
Operating Systems | Set 14
Last Updated: 23 July 2025
Following questions have been asked in GATE CS 2006 exam.1) Consider three CPU-intensive processes, which require 10, 20 and 30 time units and arrive at times 0, 2 and 6,...
read more
Operating Systems
GATE CS
MCQ
GATE-CS-2006
Data Structures and Algorithms | Set 20
Last Updated: 23 July 2025
Following questions have asked in GATE CS 2006 exam.1. Let S be an NP-complete problem and Q and R be two other problems not known to be in NP. Q is polynomial time reduci...
read more
DSA
GATE-CS-DS-&-Algo
GATE-CS-2006
Data Structures and Algorithms | Set 18
Last Updated: 23 July 2025
Following questions have been asked in GATE CS 2006 exam. 1. Consider the polynomial p(x) = a0 + a1x + a2x^2 +a3x^3, where ai != 0, for all i. The minimum number of multip...
read more
DSA
GATE-CS-DS-&-Algo
GATE-CS-2006
Data Structures and Algorithms | Set 17
Last Updated: 23 July 2025
Following questions have been asked in GATE CS 2006 exam. 1. An implementation of a queue Q, using two stacks S1 and S2, is given below:C void insert(Q, x) { ...
read more
DSA
GATE-CS-DS-&-Algo
GATE-CS-2006
C Language | Set 6
Last Updated: 27 March 2017
Following questions have been asked in GATE CS 2006 exam. 1. Consider the following C-program fragment in which i, j and n are integer variables.C for (i = n, j...
read more
C Language
GATE-CS-C-Language
GATE-CS-2006
Data Structures and Algorithms | Set 7
Last Updated: 23 July 2025
Following questions have been asked in GATE CS 2006 exam. 1. In a binary max heap containing n numbers, the smallest element can be found in time (GATE CS 2006)(A) 0(n)(B)...
read more
DSA
GATE-CS-DS-&-Algo
GATE-CS-2006