Register
Filter

Recent activity by rajks007

2 answers
1
UGC NET CSE | December 2010 | Part 2 | Question: 21
What is the maximum number of nodes in a B-tree of order $10$ of depth $3$ (root at depth $0$) ? $111$ $999$ $9999$ None of the above
What is the maximum number of nodes in a B-tree of order $10$ of depth $3$ (root at depth $0$) ?$111$$999$$9999$None of the above
1 answer
2
#Doubt_ACE_Subjest_Test_OperatingSystem
0 answers
3
JNU computer science M-TECH interview
Anyone from this group have experience of attending JNU m-tech(cs) admission interview experience ? if you have any idea or any related link please share thanks in advance
Anyone from this group have experience of attending JNU m-tech(cs) admission interview experience ?if you have any idea or any related link please sharethanks in advance
3 answers
5
Gate 2018
Value of V GREEDY - V OPT
Value of V GREEDY - V OPT
2 answers
6
Gate 2018
One query is superset of another 3 queries
One query is superset of another 3 queries
2 answers
7
gate 2018
hello.....how was the paper.....gate 2018 cse? share your experience with the paper....
hello.....how was the paper.....gate 2018 cse?share your experience with the paper....
4 answers
8
Gate 2018
Number System Question...What are all the options that can't be exactly represented...Question is like b7 b6 ....
Number System Question...What are all the options that can't be exactly represented...Question is like b7 b6 ....
3 answers
9
GATE 2018
Maximum no of min spanning trees,.... taking a value of x I answered 2 Is it correct?
Maximum no of min spanning trees,.... taking a value of xI answered 2 Is it correct?
1 answer
11
Job oppertunity for Msc students after GATE in PSU
Which of the PSU takes Msc students and what is the procedure to apply in those PSU
Which of the PSU takes Msc students and what is the procedure to apply in those PSU
4 answers
12
GATE CSE 1992 | Question: 02-xi
A computer system has $6$ tape devices, with n processes competing for them. Each process may need $3$ tape drives. The maximum value of n for which the system is guaranteed to be deadlock-free is: $2$ $3$ $4$ $1$
A computer system has $6$ tape devices, with n processes competing for them. Each process may need $3$ tape drives. The maximum value of n for which the system is guarant...
1 answer
13
NPTEL
Which of the following does not interrupt a running process? 1. A device 2. Timer 3. Power Failure 4. None of the above
Which of the following does not interrupt a running process?1. A device2. Timer3. Power Failure4. None of the above
0 answers
14
postal course
hi all, i am going to buy postal course plese suggest me which coaching offers good quality postal course. ACE OR MADEEASY.
hi all,i am going to buy postal course plese suggest me which coaching offers good quality postal course.ACE OR MADEEASY.