Register
Filter

Recent activity by shivanisrivarshini

2 answers
6
number of spanning trees
Find the no. of minimum cost spanning tree using Kruskal’s or Primus algorithm i am getting "4" but the answer is given "5" ...verify please
Find the no. of minimum cost spanning tree using Kruskal’s or Primus algorithmi am getting "4" but the answer is given "5" ...verify please
1 answer
7
workbook
An unordered list contains n distinct elements. The number of comparisons to find an element in this list that is neither 2nd maximum nor 2nd minimum is Θ(nlogn) Θ(n) Θ(logn) Θ(1)
An unordered list contains n distinct elements. The number of comparisons to find an element in this list that is neither 2nd maximum nor 2nd minimum isΘ(nlogn)Θ(n)Θ(l...
1 answer
8
time complexity
What is the value of following recurrence. T(n) = T(n/4) + T(n/2) + cn^2 T(1) = c T(0) = 0
What is the value of following recurrence.T(n) = T(n/4) + T(n/2) + cn^2 T(1) = c T(0) = 0
2 answers
9
Gate Question
Process control block does not contain Process ID User identification number Registers None of the above
Process control block does not containProcess IDUser identification numberRegistersNone of the above
1 answer
10
B+ Tree
Consider the following $B^+$ tree with the order of internal and leaf nodes as $3$ and $2$ respectively: The minimum number of key insertions that causes a new level to be introduced in the above $B^+$ tree ________. (Assume key redistribution is not allowed)
Consider the following $B^+$ tree with the order of internal and leaf nodes as $3$ and $2$ respectively: The minimum number of key insertions that causes a new level to b...
1 answer
12
UGC NET CSE | November 2017 | Part 2 | Question: 27
_________ do not take their decisions on measurements or estimates of the current traffic and topology. Static algorithms Adaptive algorithms Non-Adaptive algorithms Recursive algorithms.
_________ do not take their decisions on measurements or estimates of the current traffic and topology.Static algorithmsAdaptive algorithmsNon-Adaptive algorithmsRecursiv...
1 answer
17
Permutations
0 answers
18
How to solve
0 answers
19
ISI sample paper
2 answers
20
UGC NET CSE | June 2008 | Part 2 | Question: 12
Consider the following declaration in $\mathrm{C}$ : char a[]; char * p; Which of the following statement is not a valid statement? $\mathrm{p}=\mathrm{a}$; $\mathrm{p}=\mathrm{a}+2$; $\mathrm{a}=\mathrm{p}$; $\mathrm{p}=\& \mathrm{a}[2]$
Consider the following declaration in $\mathrm{C}$ :char a[]; char * p;Which of the following statement is not a valid statement?$\mathrm{p}=\mathrm{a}$;$\mathrm{p}=\math...
1 answer
21
theory of computation
$\text{Recursive languages are also called type 0 languages. state true or false with explanation}$
$\text{Recursive languages are also called type 0 languages. state true or false with explanation}$
1 answer
24
ISI CSB 2017
The left-to-right post-order traversal of a tree $T$ yields the following sequence of nodes: $\text{D K E F B G L M H I J C A.}$ For each node of $T$ ... $T$.
The left-to-right post-order traversal of a tree $T$ yields the following sequence of nodes:$$\text{D K E F B G L M H I J C A.}$$For each node of $T$, the deg...
1 answer
27
Binary Search Question!
The average successful search time taken by binary search on a sorted array of 5 CONSECUTIVE integers starting with 1? My Answer is - 2.2 Kindly tell me is it correct or not? NOTE: I have edited the question and changes are shown in highlighted text.
The average successful search time taken by binary search on a sorted array of 5 CONSECUTIVE integers starting with 1?My Answer is - 2.2Kindly tell me is it correct or no...
1 answer
28
self doubt
Can we have a grammar $G$ which is $LL(1)$ but not $SLR(1)$ ,If so given example grammar
Can we have a grammar $G$ which is $LL(1)$ but not $SLR(1)$ ,If so given example grammar
1 answer
29
Lattice
Lattice or not and why?
Lattice or not and why?
2 answers
30
Function
swap(int c, int d) { int k,t; k=3; t=c; c=d; d=t; k=c+d+t; } main() { int k=5, l=9; swap(k,l); printf("%d,%d",k,l); } 9,5 5,9 5,19 19,5
swap(int c, int d) { int k,t; k=3; t=c; c=d; d=t; k=c+d+t; } main() { int k=5, l=9; swap(k,l); printf("%d,%d",k,l); }9,55,95,1919,5