Register
Filter

Questions by Aboveallplayer

0 votes
1 answer
21
UNIX i-node2
How large a file can be addressed by a double indirect block alone in a 64 bit system?minimum block entry size 8 byte and block size 8KB
How large a file can be addressed by a double indirect block alone in a 64 bit system?minimum block entry size 8 byte and block size 8KB
1 votes
0 answers
24
Made Easy doubt
A fair coin is tossed until the same result turns up in succession(two head or two tail).Find the probability the number of tosses neede are even.. my approach ..P={P(x=2)+P(x=4)+P(x=6)+...}=0.33 Me answer 2*{P(x=2)+P(x=4)+P(x=6)+...}=0.66 what is the reason of this 2 multiplication?
A fair coin is tossed until the same result turns up in succession(two head or two tail).Find the probability the number of tosses neede are even..my approach ..P={P(x=2)...
0 votes
1 answer
25
TestBook Test Series: Theory Of Computation - Finite Automata
what is the number of states in dfa of all language over {a,b} where n(a)mod3>=n(b)mod2 how to think in this kind of question ??
what is the number of states in dfa of all language over {a,b} where n(a)mod3>=n(b)mod2 how to think in this kind of question ??
1 votes
2 answers
26
operating syatem
system has 9 identical resources and N processes competing for them..Each process can request at most 4 resources what is the minimum possible value of n which will lead to a deadlock?
system has 9 identical resources and N processes competing for them..Each process can request at most 4 resourceswhat is the minimum possible value of n which will lead t...
2 votes
2 answers
27
..BCNF
Which of the following is false when R is is in 3NF but not in BCNF a)R must contain at least two overlapped CK b)R must consist proper subset of CK determines proper subset of some other CK c)R must consist at most one compound CK and others are simple CK d)R must consists at most two compound CK
Which of the following is false when R is is in 3NF but not in BCNFa)R must contain at least two overlapped CKb)R must consist proper subset of CK determines proper subse...
1 votes
0 answers
28
computer networking
in a heavily loaded network,which one we should use a)pure aloha b)slotted aloha
in a heavily loaded network,which one we should use a)pure alohab)slotted aloha
2 votes
1 answer
29
Balanced BST
What is the worst case running time of searching an element in balanced binary search tree of (2n)! elements
What is the worst case running time of searching an element in balanced binary search tree of (2n)! elements
2 votes
1 answer
30
No of binary tree
number of distinct binary tree,that can be created by 5 nodes(distinct)
number of distinct binary tree,that can be created by 5 nodes(distinct)
0 votes
1 answer
31
operating system
A system has 32 bit Virtual adress and 8KB page size.main memory is 128 MB..the size of page table, when page table ,when pt entry has 1 valid bit 1 modified bit and frame bits is_____(MB) p.s what is frame bits..is it the frame entry size?
A system has 32 bit Virtual adress and 8KB page size.main memory is 128 MB..the size of page table, when page table ,when pt entry has 1 valid bit 1 modified bit and fram...
0 votes
0 answers
32
Discrete
Number of relations which will be either symmetric or antisymeetric of 4 elements will be?
Number of relations which will be either symmetric or antisymeetric of 4 elements will be?
3 votes
1 answer
33
Graph
graph of 100 edges and 25 vertices..size of minimum vertex cover is 8..what is the size of maximum independence set?
graph of 100 edges and 25 vertices..size of minimum vertex cover is 8..what is the size of maximum independence set?
0 votes
1 answer
34
Algorithm ME
Find the number of orders in which we can insert {1,2,...,7} in AVL tree,such that no rotation needs to be performed is _____(consider 4 as root element)
Find the number of orders in which we can insert {1,2,...,7} in AVL tree,such that no rotation needs to be performed is _____(consider 4 as root element)
1 votes
3 answers
35
Algorithm-ME
A mean -heap having 1024 elements with the key ranging from 0 to 1023 ,stored in array of 1024 indices the maxmimum difference between keys of all elements that can be stored at (n/2) th index of the array is ___________
A mean -heap having 1024 elements with the key ranging from 0 to 1023 ,stored in array of 1024 indices the maxmimum difference between keys of all elements that can be st...
2 votes
2 answers
36
Made-easy
$T(N) = 2T\sqrt{N} + Log\sqrt{N}$ what is the solution of recurrence relation
$T(N) = 2T\sqrt{N} + Log\sqrt{N}$what is the solution of recurrence relation
0 votes
1 answer
37
IITD phd-sample Q
You are given a heap containing N elements. Write a procedure which takes as input a parameter k, and outputs the k'th smallest number in the heap. The running time of the procedure must depend on k alone.
You are given a heap containing N elements. Write a procedure which takes as input a parameter k, and outputs the k'th smallest number in the heap. The running time of th...
1 votes
1 answer
38
IITd Phd -sample Q
Derive the running time of the binary search algorithm. If I modify binary search to break the interval size into 1/3, 2/3 rather than 1/2, 1/2, then what is the worst case running time?
Derive the running time of the binary search algorithm. If I modify binary search to break the interval size into 1/3, 2/3 rather than 1/2, 1/2, then what is the worst ca...
5 votes
1 answer
39
IITM november 2016
a fair dice is rolled until the output appers to be >4..now what is the probability that we need an even number of roll to get that? (forgot the options)
a fair dice is rolled until the output appers to be >4..now what is the probability that we need an even number of roll to get that?(forgot the options)
2 votes
1 answer
40
IITM november 2016
What is the time complexity of finding the kth smallest element in an array? $O(\log n)$ $o(\log n)$ $\Omega(n\log n)$ $O(n)$
What is the time complexity of finding the kth smallest element in an array?$O(\log n)$$o(\log n)$$\Omega(n\log n)$$O(n)$
Page: