2 votes
2 answers
1
2 votes
1 answer
2
L={ xy | x,y$\epsilon$ (a+b)*, na(x) = nb(y) }
1 votes
0 answers
3
1 votes
0 answers
4
Is Most Recently Used (MRU) Page replacement algorithm a 'Stack Algorithm' i.e. it doesn't suffer from Belady's Anomaly ?
3 votes
0 answers
6
L={ (an)m bn | n,m>=1 }
0 votes
0 answers
9
.......
2 votes
0 answers
10
Consider a Weighted undirected graph connected with 'V' vertices and 'E' edges.What is the worst case time complexity to check if 2 particular vertices 'x' and 'y' are p...
2 votes
1 answer
11
A complement of a cyclic graph on 5 vertices , has an Hamiltonian circuit . (True/False)
4 votes
1 answer
12
True/False :1)Several threads can share same physical address space.2)Several threads can share same virtual address space.
5 votes
1 answer
13
A balanced binary search tree of n nodes,the number of steps needed to find and remove the 9th largest element in the worst case?(Please mention the algorithm followed)
1 votes
0 answers
14
1 votes
1 answer
15
Suppose L = { {} } , N = {1, 2, 3}.Now what does the set N × L contain ?
2 votes
1 answer
16
~ $\forall$ x [ P(x) - (Q(x) v P(x) ) ]
2 votes
2 answers
18