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 1 week 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 4 days ago

c stands for Complement here.

moreless
Techtud Editor
Example text
6 months 5 days ago

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

moreless
Techtud Editor
Multichoice
6 months 5 days 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

Have a look at a nice discussion below:
http://www.techtud.com/doubt/maximum-no-records-ternary-relationship
Please let me know, if you still have any doubt.

more less

Delete - θ(1) time  directly given
Insert - O(N) time insert at the end of the sorted list
Find - θ(N) time search sequentially
Decrease key - θ(N) time delete then insert

Now using above,
=θ(N) * θ(1) + O(logN) * O(N) + O(logN) * θ(N) + θ(N) * θ(N)
using property of asymptotic notation  O(N2 )
So Answer O(N2
 

more less

height of heap either it is min heap or max heap O(logn) or O(d);
delete the i th node then re-fix O(logn) or O(d)  but not O(1) .
Becasue tree not contain only one element also complexity of heap re-fix is O(logn) for avg or worst and O(1) for  best case;

so answer is B.

more less

Option 4 will be the correct answer. In such questions, take some smaller size array and analyse the program.

more less

You need not to do computation. You will get a series just after analysing a little.

more less

I think data link layer will be responsible for this.

This layer encodes bits into packets.

more less

Pages