ExamSIDE (Powered by ExamGOAL)
Questions
PREVIOUS
1
GATE CSE 2000
MCQ (Single Correct Answer)
+2
-0.6
Which of the following is NOT a valid deadlock prevention scheme?
A
Release all resources before requesting a new resource
B
Number the resources uniquely and never request a lower numbered resource than the last one requested.
C
Never request a resource after releasing any resource
D
Request and all required resources be allocated before execution.
2
GATE CSE 1997
MCQ (Single Correct Answer)
+2
-0.6
An operating system contains 3 user processes each requiring 2 units of resource R.The minimum number of units of R such that no deadlocks will ever arise is
A
3
B
5
C
4
D
6
3
GATE CSE 1993
MCQ (Single Correct Answer)
+2
-0.6
Consider a system having m resources of the same type. These resources are shared by 3 processes A, B and C, which have peak demands of 3, 4 and 6 respectively. For what value of m deadlock will not occur?
A
7
B
9
C
10
D
13
4
GATE CSE 1992
MCQ (Single Correct Answer)
+2
-0.6
A computer system has 6 tape drives, with n process completing for them. Each process may need 3 tape drives. The maximum value of n for which the system is guaranteed to be deadlock free is:
A
2
B
3
C
4
D
1
PREVIOUS
GATE CSE Subjects
Theory of Computation
Finite Automata and Regular Language Push Down Automata and Context Free Language Recursively Enumerable Language and Turing Machine Undecidability
Operating Systems
Process Concepts and Cpu Scheduling Synchronization and Concurrency File System IO and Protection Deadlocks Memory Management
Algorithms
Complexity Analysis and Asymptotic Notations Searching and Sorting Divide and Conquer Method Greedy Method Dynamic Programming P and NP Concepts
Digital Logic
Number Systems Boolean Algebra K Maps Combinational Circuits Sequential Circuits
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 Lan Technologies and Wi-Fi Data Link Layer and Switching Network Layer Routing Algorithm TCP UDP Sockets and Congestion Control Application Layer Protocol Network Security
Software Engineering
Software Engineering
Compiler Design
Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization
Web Technologies
Web Technologies
General Aptitude
Verbal Ability Numerical Ability
Discrete Mathematics
Mathematical Logic Probability Set Theory & Algebra Combinatorics Linear Algebra Graph Theory Calculus
Programming Languages
Basic of Programming Language Function and Recursion Pointer and Structure in C
Computer Organization
Computer Arithmetic Memory Interfacing Pipelining Machine Instructions and Addressing Modes Alu Data Path and Control Unit IO Interface Secondary Memory
EXAM MAP
Joint Entrance Examination
JEE MainJEE AdvancedWB JEEBITSATMHT CETKCETCOMEDKVITEEE
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12