Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User NIKU
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by NIKU
0
answers
1
Asymptotic notations / time complexity
int unknown(int n) { inti, j, k = 0; for (i = n/2; i<= n; i++) for (j = 2; j <= n; j = j * 2) k = k + n/2; return k; } What is the returned value of the above function? (GATE CS 2013) (a) Ѳ(n2) (b) Ѳ(n2 log n) (c) Ѳ(n3) (d) Ѳ(n3 log n)
asked
in
Algorithms
Nov 14, 2017
699
views
asymptotic-notation
algorithms
growth-rate
time-complexity
functions
8
answers
2
GATE IT 2005 | Question: 42
Two concurrent processes $P1$ and $P2$ use four shared resources $R1, R2, R3$ and $R4$ ... binary semaphores are used to enforce the above scheduling constraints, what is the minimum number of binary semaphores needed? $1$ $2$ $3$ $4$
commented
in
Operating System
Nov 3, 2017
12.5k
views
gateit-2005
operating-system
process-synchronization
normal
1
answer
3
Probability
Suppose two dies are rolled .What is the probability of getting 4 on the first die , when the the sum is 6 ? A) 1/5 B)1/6
asked
in
Probability
Oct 31, 2017
477
views
probability
engineering-mathematics
discrete-mathematics
conditional-probability
combinatory
1
answer
4
Deadlock
There are 5 processes and 10 instances of a Resource. If each process needs ‘P’ instances which is the minimum value of ‘P’ for the deadlock to occur? (a) 1 (b) 2 (c) 3 (d) 4
answer selected
in
Operating System
Oct 30, 2017
3.2k
views
deadlock-prevention-avoidance-detection
operating-system
process-synchronization
circular-wait
6
answers
5
deadlock
If a process is in unsafe state, then: (a) It is in deadlock (b) It might successfully complete (c) It will lead to deadlock (d) None of the above
commented
in
Operating System
Oct 29, 2017
10.7k
views
deadlock-prevention-avoidance-detection
bankers-algorithm
1
answer
6
Process Synchronisation
11. Consider the following program: Const int n= 10 int Count= 0 Void A( ) { int i; for(i= 1 to n) Count= Count + 1; } Main ( ) { Par begin A( ); A( ); A( ); A( ); Par end } What is the minimum and maximum possible value of count after the ... 40 (b) 2, 40 (c) 3, 40 (d) 4, 40 NOTE: I am not able to understand what does "par begin" and "par end" indicates
edited
in
Operating System
Oct 28, 2017
588
views
process-synchronization
operating-system
semaphore
inter-process-communication
3
answers
7
Process Synchronisation ( binary semaphores)
Consider the below program as two concurrent processes: Semaphore x:= 0; P1: repeat forever P2: repeat forever 1.V(x); 4. P(x); 2.Compute; 5.Compute; 3.P(x); 6.V(x); Consider the following statements about process P1 & P2: (1) ... chance to run , and it wil starve (THIS IS WHAT I THOUGHT THE ANSWER SHOULD BE , PLEASE COMMENT, IF I AM WRONG ANYWHERE)
asked
in
Operating System
Oct 28, 2017
1.0k
views
process-synchronization
operating-system
semaphore
inter-process-communication
process-scheduling
1
answer
8
Proces Synchronisation
Consider the following algorithm as a solution to the Critical Section problem. The process shares two variables: var flag: array [0 .1] of Boolean; turn= 0 ..1; Initially flag [0]= flag [1]= false; turn= 0 (or) 1; the structure of process Pi is like repeat flag[i ... flag [i]= true & turn= j; (d) flag [i]= false & turn= i; Solution: Option (a) (need the explanation)
answer selected
in
Operating System
Oct 27, 2017
1.2k
views
operating-system
interview
process-synchronization
process-scheduling
semaphore
2
answers
9
Process Synchronisation Of Operating System
Consider the below Algorithm where flag and lock are global variables: P0: P1: while (flag= =1 && lock= = 0); while (flag= = 0 && lock= = 1); Enter CS Enter CS lock= 0 flag= 0 flag= 1 lock= 1 (a) The above algorithm is deadlock free (b) The above algorithm guarantees Mutual Exclusion (c) Both (a) & (b) (d) None of the above
answer selected
in
Operating System
Oct 27, 2017
1.5k
views
operating-system
process-scheduling
process-synchronization
semaphore
4
answers
10
Process Synchronisation
Consider the below Algorithm: P0: Process= 0 P1: Process= 1 other= 1-Process other= 1-Process while (flag!= Process); while (flag!= Process); Enter CS Enter CS flag= other. flag= other. (a) The ... guarantees Mutual Exclusion (b) The algorithm is busy waiting solution (c) The algorithm does not guarantee progress (d) The algorithm guarantee Bounded waiting
commented
in
Operating System
Oct 27, 2017
1.6k
views
operating-system
process-synchronization
process-scheduling
semaphore
0
answers
11
Push Down Automata
draw a deterministic PDA for ambn where, m = 2n+1
asked
in
Theory of Computation
Sep 16, 2017
352
views
theory-of-computation
pushdown-automata
dpda
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
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)
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:...