Dark Mode

Recent activity by Jhunjhunuwala

1 answer

1

College
With rank 302 score 774 , can i get Nit T?

commented in NITs Mar 29, 2017

864 views

1 answer

2

Virtual Test Series

asked in Graph Theory Feb 7, 2017

198 views

1 answer

3

Virtual Gate
Calculate the limit (A) 1 (B) 0 (C) -1 (D) Does not exist

commented in Calculus Feb 7, 2017

434 views

1 answer

4

Doubt regarding Go Back n
What is 'n' in Go back n protocol Is it the number of bits required in total sequence numbers or is it the total sequence numbers? Please explain

asked in Computer Networks Feb 6, 2017

325 views

0 answers

5

virtual test series
Consider the following directed graph Suppose a depth-first traversal of this graph is performed, assuming that whenever there is a choice, the vertex earlier in the alphabetical order is to be chosen. Suppose the number of tree edges is T, the number of back edges is B and the number of cross edges is C. Then ... T = 4. (C) B = 2, C = 1, and T = 3. (D) B = 1, C = 2, and T = 3.

asked in DS Feb 1, 2017

197 views

1 answer

6

virtual test series
Find the number of all possible conflict-equivalent schedules to the following serial schedule: r1(X);w1(Y);w1(Z);r2(X);w2(Y);w2(Z); where ri(A) means ith transaction reads resource A and wi(A) means ith transaction writes resource A.

asked in Databases Feb 1, 2017

190 views

0 answers

7

commented in Theory of Computation Feb 1, 2017

272 views

1 answer

8

answer selected in Databases Jan 31, 2017

392 views

1 answer

9

Complexity
What is the time complexity of above program

commented in Algorithms Jan 30, 2017

273 views

1 answer

10

virtual test series

commented in Databases Jan 1, 2017

267 views

1 answer

11

virtual test series

asked in Operating System Jan 1, 2017

370 views

1 answer

12

virtual test series

asked in Theory of Computation Jan 1, 2017

398 views

1 answer

13

virtual test series

asked in Theory of Computation Jan 1, 2017

304 views

9 answers

14

GATE CSE 2013 | Question: 44
Consider the following operation along with Enqueue and Dequeue operations on queues, where $k$ is a global parameter. MultiDequeue(Q){ m = k while (Q is not empty) and (m > 0) { Dequeue(Q) m = m – 1 } } What is the worst case time complexity of a sequence of $n$ queue operations on an initially empty queue? $Θ(n)$ $Θ(n + k)$ $Θ(nk)$ $Θ(n^2)$

commented in DS Jan 1, 2017

31.3k views

1 answer

15

Virtual Test Series
Consider a social network with n persons. Two persons A and B are said to be connected if either they are friends or they are related through a sequence of friends: that is, there exists a set of persons F1, . . . , Fm such that A and F1 are friends, F1 and ... them is connected. What is the maximum number of friendships possible? (A) n−k+1C2 (B) n-kC2 (C) n-k-1C2 (D) none

asked in Mathematical Logic Jan 1, 2017

254 views

6 answers

16

GATE CSE 2007 | Question: 63, ISRO2016-59
The order of a leaf node in a $B^+$ - tree is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is $1K\;\text{bytes}$, data record pointer is $7\;\text{bytes}$ long, the value field is $9\;\text{bytes}$ long and a block pointer is $6 \;\text{bytes}$ long, what is the order of the leaf node? $63$ $64$ $67$ $68$

commented in Databases Dec 16, 2016

23.4k views

1 answer

17

Test Series
Two concurrent processes P1 and P2 use four shared resources R1, R2, R3, R4. Both processes are started at same time and each resource can be accessed by only 1 process at a time. The following scheduling constants exists between the access of ... . If any binary semaphore are used to enforce the above scheduling constants, what is the minimum number of binary semaphore needed?

asked in Operating System Nov 18, 2016

330 views

8 answers

18

GATE CSE 2003 | Question: 66
The cube root of a natural number $n$ is defined as the largest natural number $m$ such that $(m^3 \leq n)$ . The complexity of computing the cube root of $n$ ($n$ is represented by binary notation) is $O(n)$ but not $O(n^{0.5})$ $O(n^{0.5})$ ... constant $m>0$ $O( (\log \log n)^k )$ for some constant $k > 0.5$, but not $O( (\log \log n)^{0.5} )$

commented in Algorithms Oct 2, 2016

24.2k views

1 answer

19

Virtual Test series

commented in Algorithms Sep 25, 2016

374 views

2 answers

20

Virtual Test series

asked in Algorithms Sep 25, 2016

345 views

2 answers

21

Virtual Test series

asked in Algorithms Sep 25, 2016

622 views

1 answer

22

Virtual Test series

commented in Algorithms Sep 25, 2016

503 views

1 answer

23

Virtual Test series

commented in Algorithms Sep 25, 2016

329 views

0 answers

24

Virtual Test series

asked in Algorithms Sep 25, 2016

197 views

1 answer

25

virtual test series

asked in Algorithms Sep 25, 2016

223 views

0 answers

26

Virtual Test Series

asked in Algorithms Sep 25, 2016

217 views

1 answer

27

C program
why this function not do swapping #include <stdio.h> void swap(char *str1, char *str2) { char *temp = str1; str1 = str2; str2 = temp; } int main() { char *str1 = "Gate"; char *str2 = "Overflow"; swap(str1, str2); printf("str1 is %s, str2 is %s", str1, str2); return 0; } Output : str1 is Gate, str2 is Overflow

commented in Programming in C Apr 27, 2016

636 views

0 answers

28

regarding clashing dates of iitb-ra and iitd-eet
IITD-EET and IITB-RA interview dates are clashing. So which option to be chosen like where selection ratio is higher and gate score is given less weightage for final selection as my gate score is quite low..it is 749(general category)

asked in IISc/IITs Apr 21, 2016

390 views

2 answers

29

permutations
The number of ways in which 6 rings can be worn on the four fingers of one hand is: a. 360 b. 4^6 c. 6C4 d. 6^4

commented in Combinatory Apr 12, 2016

1.1k views

1 answer

30

Suppose that the probability that x is in a list of n distinct integers is 2/3 and that it is equally likely that x equals any element in the list.

commented in Probability Apr 11, 2016

2.0k views