Register
Filter

Questions by VS

2 votes
0 answers
21
Asymptotic-notations
Let f(n)=O(n),g(n)=O(n) and h(n)=Ѳ(n). Then [f(n).g(n)]+h(n) is: Ω (n) O (n) Ѳ (n) None of these
Let f(n)=O(n),g(n)=O(n) and h(n)=Ѳ(n). Then [f(n).g(n)]+h(n)is:Ω (n)O (n)Ѳ (n)None of these
2 votes
1 answer
22
Flooding
Flooding always guaranteed to send packet from source to destination with minimum number of hops. (True / False)
Flooding always guaranteed to send packet from source to destination with minimum number of hops. (True / False)
2 votes
0 answers
24
Identify class of language
L={ (anbn)* | n>0 }
L={ (anbn)* | n>0 }
1 votes
1 answer
25
Distributed Lattice
Is the following lattice distributed ?
Is the following lattice distributed ?
2 votes
0 answers
26
Stack
Consider a stack and we wish to perform an operation StackDelete() in which we wish to delete all the elements of the stack .What is the worst case time complexity of doing this if stack is implemented: 1) Using an array 2)Using a Linked list
Consider a stack and we wish to perform an operation StackDelete() in which we wish to delete all the elements of the stack .What is the worst case time complexity of doi...
3 votes
2 answers
27
DCFG grammar
Can a DCFG grammar be Ambiguous? If so please provide an example.
Can a DCFG grammar be Ambiguous? If so please provide an example.
2 votes
0 answers
28
LL(k)
I know that LL(1) grammar can have No left factoring ,No Left recursion and No Ambiguity. Is same thing true for LL(k) as well i.e. LL(k) which is reading k symbols at a time from input string. Does LL(k) grammar can have No left factoring ,No Left recursion and No Ambiguity ?
I know that LL(1) grammar can have No left factoring ,No Left recursion and No Ambiguity.Is same thing true for LL(k) as well i.e. LL(k) which is reading k symbols at a...
0 votes
1 answer
30
Probability Density function
1 votes
0 answers
31
Deadlock Prevention
If a process releases all its resources before requesting a new resource, then deadlock is possible.(True/False)
If a process releases all its resources before requesting a new resource, then deadlock is possible.(True/False)
0 votes
1 answer
32
C-output
2 votes
1 answer
33
B+ tree 2
Suppose size of block 1000 bytes search key of 12 bytes, pointer size 8 bytes. How many maximum records in DB file which can index by dense B+ tree of 2 levels?
Suppose size of block 1000 bytes search key of 12 bytes, pointer size 8 bytes. How many maximum records in DB file which can index by dense B+ tree of 2 levels?
2 votes
2 answers
34
B+ tree
The minimum number of elements (keys) that need to be inserted into a B+ tree with the order of internal node 3 [maximum child pointers per node] and leaf node 2 [maximum keys per node], to make it to reach 3-levels are __________.
The minimum number of elements (keys) that need to be inserted into a B+ tree with the order of internal node 3 [maximum child pointers per node] and leaf node 2 [maximum...
0 votes
2 answers
36
Minimum Spanning Tree
Multiplying all edge weights by a positive number(>1) will always change the cost of minimum spanning tree. True/False
Multiplying all edge weights by a positive number(>1) will always change the cost of minimum spanning tree.True/False
1 votes
0 answers
38
Balanced Binary Tree vs Complete Tree
Balanced Binary Tree vs Complete Tree Insertion and Deletion is faster in which of the above 2 structures?
Balanced Binary Tree vs Complete TreeInsertion and Deletion is faster in which of the above 2 structures?
0 votes
1 answer
40
toc-identify class of a language
Page: