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

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.
moreless
Techtud Editor
Example text
6 months 6 days 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
piyushi
Vaibhav Gupta
Niket Gangwar
Anshu Agarwal
Nirdesh Kumar Joshiya
Prashant Sharma
Prof R.K. Dhawan
Sheshang Ajwalia
shivani
KIRAN KUMAR
KIRAN KUMAR
Narasimha Karumanchi

Pages

Pritam Prasun
905
Shabin Muhammed
1065
Rajesh Kumar Pandey
1522
Vinita Sangwan
2169
partha
2584
Sayan Bose
4083
Rohit Kumar
4589
techtud
6230
Biduro Maharana
6492
Virtual GATE
6911
shashi kant verma
7507
Rakhi Mahanta
7572
Anjan
9527
10290
phanindra
10613

Pages

25 May 2017 - 5:38pm

@vaisbhat, I am unable to find any better method to get upper triangular matrix.
I must say, use other techniques to solve such problems instead of kirchoff rule.

more less
25 May 2017 - 3:59pm

Taking m=2,
k=0;
for i1 = 1 to n
for i2 =1 to i1
k=k+1

for i=1, k is incrementing  1 time
for i=2, k is incrementing 2 times
for i=3, k is incrementing  3 times
........................................................
for i=n, k is incrementing n times.
Total increment in k = 1+2+3+................+n = n(n+1)/2 = selecting 2 integers with repetition among n integers.
Taking m=3,
for i=1, k is incrementing 1 time. (1 times)
for i=2, k is incrementing 3 times. (1+2 times)
for i=3, k is incrementing 5 times. (1+2+3 times)
.........................................................................
for i=n, k is incrementing (1+2+3+....n) times.
Total increment in k = 1 + (1+2) + (1+2+3) + (1+2+3+4) +.............(1+2+3......+n)
= n(n+1)(n+2) / 6  =  selecting 3 integers with repetition among n integers.
Similarly, Take m=k, K will be C(n+k-1,k) =  selecting m integers with repetition among n integers.

more less
24 May 2017 - 3:17pm

@vaisbhat none of the image is visible..please change the image properties.

more less
24 May 2017 - 11:50am

According to the Kirchhoff matrix theorem, all the cofactors of the matrix are equal and equal to the number of spanning trees of the graph. So you need to find only one cofactor and it is not a big deal with 6x6 matrix.

more less
22 May 2017 - 12:08pm

@shweta1920, we are working on that. Sorry for the delay.

more less
22 May 2017 - 11:58am

There are many approaches to solve these type of questions. This is mine.
Consider each case:
1. TLB Hit + Cache Hit:
T1 = TLB Hit probability* Cache Hit probability*  access time
T1 = 0.96 * 0.9 * (1+1)  = 1.728 ns
2. TLB Hit + Cache Miss:
T2 = TLB Hit probability* Cache Miss probability*  access time (Main memoery will be accessed)
T2 = 0.96 * 0.1 * (1+1+10) = 1.152 ns
3. TLB Miss + Cache Hit:
T3 = TLB Miss probability* Cache Hit probability*  access time (2 page table will be accessed)
T3 = 0.04 * 0.9 * (1+1+10+10) = 0.792 ns
4. TLB Miss + Cache Miss:
T4 = TLB Miss probability* Cache Miss probability*  access time
T4 = 0.04 * 0.1 * (1+10+1+10+10) = 0.128 ns

Total avg. time = 3.8 ns ≅ 4ns.

more less
22 May 2017 - 11:24am

Apply divide and conquer approach to find minimum no. of comparisons.
T(n) = 0, if n=0 (only one element is present)
= 1, if n=2 (if only two elements are present )
= floor[T(n/2)] + ceil[T(n/2)] + 2, otherwise .
If you will solve the recursion, you will get 3n/2 - 2 as the answer.

more less
12 May 2017 - 1:14am
I think you are not considering negative numbers.
Consider an array with elements like, 3, 5, -1, -7 .
Here you can see that sum of sub array 3, 5 is greater than sum of all the elements.
more less
10 May 2017 - 5:52pm

no. of indegee is zero?
Can you explain the question a little bit ?
Topological Sorting requires DFS [O(V+E)] to find the order of the vertices.
Have a look here:

more less
10 May 2017 - 3:25pm

We can have any number of combinations. Keep one thing in mind that a candidate key should not be the subset of any other candidate key.
Example: Consider the relation R(A,B,C,D,E,F) and the following functional dependencies,
F = { A→ BCDEF