UGC NET CSE | June 2008 | Part 2 | Question: 40

admin asked in Others Jan 6 edited Jan 7 by makhdoom ghaya

58 views

0 votes

A computer has $6$ tape drives with ' $n$ ' processes competing for them. Each process may need two drives. For which values of ' $n$ ' is the system deadlock free?

ugcnetcse-june2008-paper2
deadlock-prevention-avoidance-detection

admin asked in Others Jan 6 edited Jan 7 by makhdoom ghaya

by admin

58 views

0 Comments

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

← Previous Next →

← Previous in category Next in category →

Related questions

0 votes

1 answer

admin asked in Others Jan 6

90 views

UGC NET CSE | June 2008 | Part 2 | Question: 1
Which of the following does not define a tree? A tree is a connected acyclic graph. A tree is a connected graph with $n-1$ edges where ' $n$ ' is the number of vertices in the graph. A tree is an acyclic graph with $n-1$ edges where ' $n$ ' is the number of vertices in the graph. A tree is a graph with no cycles.

admin asked in Others Jan 6

by admin

90 views

ugcnetcse-june2008-paper2
directed-acyclic-graph
tree

0 votes

1 answer

admin asked in Others Jan 6

85 views

UGC NET CSE | June 2008 | Part 2 | Question: 2
The complexity of Kruskal's minimum spanning tree algorithm on a graph with ' $n$ ' nodes and ' $e$ ' edges is : $\mathrm{O}(n)$ $\mathrm{O}(n \log n)$ $\mathrm{O}(e \log n)$ $\mathrm{O}(e)$

admin asked in Others Jan 6

by admin

85 views

ugcnetcse-june2008-paper2
kruskals-algorithm
minimum-spanning-tree

0 votes

1 answer

admin asked in Others Jan 6

91 views

UGC NET CSE | June 2008 | Part 2 | Question: 3
If a code is t-error correcting, the minimum Hamming distance is equal to : $2 t+1$ $2 t$ $2 t-1$ $t-1$

admin asked in Others Jan 6

by admin

91 views

ugcnetcse-june2008-paper2
hamming-code
error-correction

0 votes

3 answers

admin asked in Others Jan 6

219 views

UGC NET CSE | June 2008 | Part 2 | Question: 4
The set of positive integers under the operation of ordinary multiplication is : not a monoid not a group a group an Abelian group

admin asked in Others Jan 6

by admin

219 views

ugcnetcse-june2008-paper2
abelian-group

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Quick search syntax

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Subjects

All categories
General Aptitude (3.5k)
Engineering Mathematics (10.4k)
Digital Logic (3.6k)
Programming and DS (6.2k)
Algorithms (4.8k)
Theory of Computation (6.9k)
Compiler Design (2.5k)
Operating System (5.2k)
Databases (4.8k)
CO and Architecture (4.0k)
Computer Networks (4.9k)
Artificial Intelligence (79)
Machine Learning (48)
Data Mining and Warehousing (25)
Non GATE (1.4k)
Others (2.7k)
- Others (2.3k)
- Study Resources (360)
- GATE Application (43)
- Revision (27)
- Site Issues (10)
Admissions (684)
Exam Queries (1.6k)
Tier 1 Placement Questions (17)
Job Queries (80)
Projects (11)
Unknown Category (870)

64.3k questions

77.9k answers

244k comments

80.0k users

Recent Blog Comments

category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...

Send feedback
Rank Predictor
College Prediction
Useful Links
FAQ
Corrections
Discuss
Copyright
Request
Testimonials
Chat Logs
Chat
Badges
Search tips
Exam Category
Blog Category
Blog Tags
Privacy
Test Series
GATER
Refund Policy
Terms and Conditions
Contact Us

Developed by Chun

UGC NET CSE | June 2008 | Part 2 | Question: 40

0 Comments

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Recent Posts

Subjects

Recent Blog Comments