About

Pursuing M.Tech in Computer Science & Engineering at IIT Kharagpur and Editor at Techtud.

Role

Alma Mater:

B.tech in Compter Science and Engineering
Kamla Nehru Institute of Technology, Sultanpur
2012 to 2016

Experience:

Not updated.
Techtud Editor
Post
5 months 2 weeks ago
All the Best for GATE 2018 :)
moreless
Techtud Editor
Post
5 months 3 weeks ago
Tomorrow is the last date for attempting VirtualGATE-2.
http://virtualgate.in/login/index.php
moreless
Techtud Editor
Example text
6 months 1 week ago

c stands for Complement here.

moreless
Techtud Editor
Example text
6 months 1 week ago

@vikash957 at x= -3, function is not defind ( devide by zero).

moreless
Techtud Editor
Multichoice
6 months 1 week ago
@reenakandari
Question is about non-preemptive kernel design, where a running process can be preempted only when it is being forced for it.
Timer interrupts and Disk interrupts will wait untill the process is running. A blocking system call or an exit request are the high priority kernel requests, so these can not be hold on wait.
moreless
S_raj
piyushi025's picture
piyushi
vg653's picture
Vaibhav Gupta
niket151194's picture
Niket Gangwar
anshukumar's picture
Anshu Agarwal
nirdeshjoshiya's picture
Nirdesh Kumar Joshiya
Prashant Sharma
Prof R.K. Dhawan
sharadshukla's picture
Sharad Shukla
sheshang's picture
Sheshang Ajwalia
shivani1234's picture
shivani
thegatebook's picture
KIRAN KUMAR
KIRAN KUMAR
narasimha's picture
Narasimha Karumanchi
rishiyadav's picture
Rishi Yadav

Pages

pritam's picture
Pritam Prasun
905
shabinmuhammed's picture
Shabin Muhammed
1065
rajeshkpandey008's picture
Rajesh Kumar Pandey
1522
vinitasangwan's picture
Vinita Sangwan
2169
partha
2584
sayanbose's picture
Sayan Bose
4083
rohit37s's picture
Rohit Kumar
4589
techtudgate's picture
techtud
6230
biduromahara's picture
Biduro Maharana
6492
virtualgate's picture
Virtual GATE
6911
shashiverma's picture
shashi kant verma
7507
rakhi's picture
Rakhi Mahanta
7572
prab_1's picture
Anjan
9527
habibkhan's picture
Habib Mohammad Khan
10290
phanindra's picture
phanindra
10613

Pages

Few words in the question are repeating. Plz correct.

more less

@shweta1920 Please read this question once. 

more less

Can you please correct your question ? 

more less

In case of binay tree, answer will be 336.

more less

@shweta1920 @shweta1920
I think that if nothing is given we can go with the structural definition of tree.
So number of trees will be nn-2
Read this,
http://www-math.mit.edu/~djk/18.310/18.310F04/counting_trees.html

more less

@shivanijaiswal1234 I am not getting your answer.
 Why Catalan rule? Can you draw 5 tree skeletons ?
Can you explain it with more details ?

more less

Method:
Step1. Allocate the resources to the processes one less than the maximum need.
    i.e, allocated [Max need - 1] to every process.
Step 2. Add one more resource at the end to ensure that at least one of the process can fulfill his max need. This will be minimum number of resources that are required for deadlock free system.
Example: In the above question:
Max need of P1 = 3
Max need of P2 = 4
Max need of P3 = 5
Apply step 1
Resources allocated to P1 = 2
Resources allocated to P2 = 3
Resources allocated to P3 = 4
Total allocated resources = 2+3+4 = 9 (This will be maximum number of resources that may cause deadlock )
Apply Step2:
Minimum number of resources to ensure deadlock will not occur = 9+1 = 10.
Hence option 4 is correct.

more less

@shweta1920
No, you are taking it in wrong way.
9 is the maximum number of resources that may cause deadlock. Consider the case when P1 has 2, P2 has 3 and P3 has 4 resources and the system is in deadlock. If you will any one more resource then any of the process can take that resource and complete it's execution.
Is it clear?

more less

The question is not clear. Is it asking for binary trees?

more less

Pages