Similar Topics

Web Technologies32.1K+ articles

DSA20.4K+ articles

C Language1.3K+ articles

GATE CS1.1K+ articles

Operating Systems993+ articles

Theory of Computation274+ articles

MCQ51+ articles

GATE-CS-DS-&-Algo39+ articles

GATE-CS-C-Language12+ articles

AT6+ articles

GATE-CS-2011

9 posts

Automata Theory | Set 4

Last Updated: 23 July 2025

Following questions have been asked in GATE CS 2011 exam. 1) Let P be a regular language and Q be context-free language such that Q P. (For example, let P be the language...read more

article_image

Theory of Computation

Automata Theory | Set 3

Last Updated: 23 July 2025

Following questions have been asked in GATE CS 2011 exam.1) The lexical analysis for a modern language such as Java needs the power of which one of the following machine m...read more

article_image

Theory of Computation

Computer Networks | Set 3

Last Updated: 14 May 2026

Following Questions have been asked in GATE 2011 CS exam. 1) A layer-4 firewall ( a device that can look at all protocol headers up to the transport layer) CANNOT (A) bloc...read more

article_image

Computer Networks

Database Management Systems | Set 4

Last Updated: 23 July 2025

Following Questions have been asked in GATE 2011 exam.1. Consider a relational table with a single record for each registered student with the following attributes.1. Regi...read more

article_image

Operating Systems | Set 7

Last Updated: 23 July 2025

Following questions have been asked in GATE CS exam.1) Let the time taken to switch between user and kernel modes of execution be t1 while the time taken to switch between...read more

Operating Systems

Operating Systems | Set 6

Last Updated: 23 July 2025

Following questions have been asked in GATE 2011 CS exam.1) A thread is usually defined as a 'light weight process' because an operating system (OS) maintains smaller data...read more

Operating Systems

Data Structures and Algorithms | Set 27

Last Updated: 13 December 2022

Following questions have been asked in GATE CS 2011 exam.1) An undirected graph G(V, E) contains n ( n 2 ) nodes named v1 , v2 ,....vn. Two nodes vi , vj are connected if...read more

article_image

GATE-CS-DS-&-Algo

C Language | Set 8

Last Updated: 23 July 2025

Following questions have been asked in GATE CS 2011 exam. 1) What does the following fragment of C-program print?C char c[] = GATE2011; char *p =c; printf(%...read more

GATE-CS-C-Language

Data Structures and Algorithms | Set 26

Last Updated: 23 July 2025

Following questions have been asked in GATE 2011 exam.1) A max-heap is a heap where the value of each parent is greater than or equal to the values of its children. Which ...read more

article_image

GATE-CS-DS-&-Algo