PREVIOUS
1
GATE CSE 1996
MCQ (Single Correct Answer)
+2
-0.6
A solution to the Dining Philosophers Problem which avoids deadlock is
A
ensure that all philosophers pick up the left fork before the right fork.
B
ensure that all philosophers pick up the right fork before the left fork
C
ensure that one particular philosopher picks up the left fork before the right fork, and that all other philosophers pick up the right fork before the left fork
D
None of the above.
2
GATE CSE 1992
MCQ (Single Correct Answer)
+2
-0.6
At a particular time of computation the value of a counting semaphore is 7. Then 20 P operations and 15 V operations were completed on this semaphore. The resulting value of the semaphore is:
A
42
B
2
C
7
D
12
3
GATE CSE 1990
Fill in the Blanks
+2
-0
Semaphore operations are atomic because they are implemented within the OS
4
GATE CSE 1987
MCQ (Single Correct Answer)
+2
-0.6
A critical region is:
A
One which is enclosed by a pair of P and V operations on semaphores
B
A program segment that has not been proved bug-free
C
A program segment that often causes unexpected system crashes
D
A program segment where shared resources are accessed
PREVIOUS

GATE CSE Subjects

Browse all chapters by subject

Theory of Computation
Finite Automata and Regular Language Push Down Automata and Context Free Language Undecidability Recursively Enumerable Language and Turing Machine
Operating Systems
Process Concepts and Cpu Scheduling Synchronization and Concurrency Deadlocks Memory Management File System IO and Protection
Algorithms
P and NP Concepts Searching and Sorting Greedy Method Dynamic Programming Complexity Analysis and Asymptotic Notations Divide and Conquer Method
Digital Logic
Sequential Circuits Boolean Algebra K Maps Combinational Circuits Number Systems
Database Management System
Er Diagrams Functional Dependencies and Normalization Structured Query Language Relational Algebra Transactions and Concurrency File Structures and Indexing
Data Structures
Arrays Stacks and Queues Linked List Trees Graphs Hashing
Computer Networks
Concepts of Layering Data Link Layer and Switching Network Layer Application Layer Protocol Routing Algorithm TCP UDP Sockets and Congestion Control Lan Technologies and Wi-Fi Network Security
Software Engineering
Software Engineering
Compiler Design
Syntax Directed Translation Parsing Lexical Analysis Code Generation and Optimization
Web Technologies
Web Technologies
General Aptitude
Verbal Ability Logical Reasoning Numerical Ability
Discrete Mathematics
Set Theory & Algebra Linear Algebra Graph Theory Combinatorics Mathematical Logic Probability Calculus
Programming Languages
Basic of Programming Language Pointer and Structure in C Function and Recursion
Computer Organization
Computer Arithmetic Pipelining Machine Instructions and Addressing Modes Memory Interfacing IO Interface Alu Data Path and Control Unit Secondary Memory
EXAM MAP

Browse past year questions by exam & subject

Joint Entrance Examination
JEE Main JEE Advanced MHT CET BITSAT COMEDK WB JEE KCET VITEEE AP EAPCET TS EAMCET IAT (IISER)
Medical
NEET AIIMS MHT CET (Biology)
Graduate Aptitude Test in Engineering
GATE CSE GATE ECE GATE EE GATE ME GATE CE GATE PI GATE IN GATE Data Science and Artificial Intelligence
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12