I am 4th undergraduate student at the department of Computer Science and Engg

### Alma Mater:

B-tech in Computer Science & Engineering
--
2017

### Experience:

Not updated.
Babytud
Video lecture
8 months 3 weeks ago

I think if all processes are available then it schedules according to decreasing order of Priority Instead of Burst time

morelessWatch Now
Babytud
9 months 2 days ago

According to me answer is 1 please explain how 2 is right

moreless
Babytud
Example text
9 months 3 days ago

Is there any other way

moreless
Babytud
Multichoice
9 months 6 days ago

LUB is lowest upper bound which is minimum of upper bound So upper bound of 4 and 6 is 12 bcz only one element so it is also LUB as well as UB

GLD is Greatest Lower Bound is maximum of lower bound so lower bound of 4 and 6 is 2 so GLB is 2

moreless
Saurabh
Krishan
Ashu
akash prajapati
Krishna Vaibhav
shivani
KIRAN KUMAR
KIRAN KUMAR
Sumit Verma
Virtual GATE
Rajesh Kumar Pandey
Arjun Suresh
Vivek Vikram Singh
atchyut kumar

## Pages

Sumit Verma
10677
Krishna Vaibhav
37213
Krishan
37227
12 Sep 2017 - 1:25pm

In permutation and Combinations

If there are n objects if one type n1 objects and n2 type another objects

where

(Total objects) n=n1+n2

so permutation will be n! by n1! * n2!

more less
10 Sep 2017 - 3:14pm

Is it is also equal to 2n-1 + 2n-2

For A1 candidate key

A1 _ _ _..........._   total n-1 places in each place we have a choice either we choose or not so =2 x 2 x .......x 2 = 2n-1 keys

for A2 candidate key

_ A2 _ _ .........._  total n-1 places so 2n-1 keys but some keys are already taken with A1 candidate key so

A1 A2 _ _ ..... _ total n-2 places therefore = 2n-2  superkeys

total keys = 2n-1 + 2n-2

more less