In a B-Tree, each node represents a disk block. Suppose one block holds $8192$ bytes. Each key uses $32$ bytes. In a B-tree of order $M$ there are $M-1$ keys. Since each branch is on another disk block, we assume a branch is of $4$ bytes. The total memory requirement for a non-leaf node is:
Previous 10 Questions — UGC NET Computer Science Dec 2019 (Paper II)
Nearest first
1
2
3
4
5
6
7
8
9
10
What is the worst case running time of Insert and Extract-min, in an implementation of a priority queue using an unsort…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
A clique in an undirected graph $G=\langle V,E\rangle$ is a subset $V'\subseteq V$ of vertices, such that
Topic: UGC NET Computer Science Dec 2019 (Paper II)
Let $a^{2c}\bmod n=(a^c)^2\bmod n$ and $a^{2c+1}\bmod n=a\cdot(a^c)^2\bmod n$. For $a=7,\ b=17$ and $n=561$, what is th…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
An $...............$ chart is a project schedule representation that presents project plan as a directed graph. The cri…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
In a system for a restaurant, the main scenario for placing an order is given below:
(a) Customer reads menu
(b) Custom…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
Java Virtual Machine $($JVM$)$ is used to execute architectural neutral byte code. Which of the following is needed by …
Topic: UGC NET Computer Science Dec 2019 (Paper II)
Which of the following methods are used to pass any number of parameters to the operating system through system calls?
Topic: UGC NET Computer Science Dec 2019 (Paper II)
Given a CPU time slice of $2$ ms and the following list of processes.
Process
Burst time $($ms$)$…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
Which of the following interprocess communication model is used to exchange messages among co-operative processes?
Topic: UGC NET Computer Science Dec 2019 (Paper II)
Suppose a system has $12$ magnetic tape drives and at the time $t_0$, three processes are allotted tape drives out of t…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
Next 10 Questions — UGC NET Computer Science Dec 2019 (Paper II)
Ascending by ID
1
2
3
4
5
6
7
8
9
10
Give asymptotic upper and lower bound for $T(n)$ given below. Assume $T(n)$ is constant for $n\le 2$.
$T(n)=4T(\sqrt n)…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
Consider a weighted directed graph. The current shortest distance from source $S$ to node $x$ is represented by $d[x]$.…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
When using Dijkstra's algorithm to find shortest path in a graph, which of the following statement is not true?
Topic: UGC NET Computer Science Dec 2019 (Paper II)
The time complexity to multiply two polynomials of degree $n$ using Fast Fourier transform method is:
Topic: UGC NET Computer Science Dec 2019 (Paper II)
Consider the following grammars:
$G_1:S\rightarrow aSb\mid bSa\mid aa$
$G_2:S\rightarrow aSb\mid bSa\mid SS\mid \…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
Consider the language $L={a^n b^{n-3}\mid n>2}$ on $\Sigma={a,b}$. Which one of the following grammars generates the…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
Consider the following grammar:
$S\rightarrow 0A\mid 0BB$
$A\rightarrow 00A\mid \lambda$
$B\rightarrow 1B\mid 11C$
$C\r…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
Consider $\Sigma={w,x}$ and $T={x,y,z}$. Define homomorphism $h$ by:
$h(x)=xzy$
$h(w)=zxyy$
If $L$ is the regular langu…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
Consider the following statements with respect to the language $L={a^n b^n\mid n\ge 0}$
$S_1:L^2$ is context free langu…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
Consider the following languages:
$L_1={a^n b^n c^m}\cup{a^n b^m c^m},\ n,m\ge 0$
$L_2={ww^R\mid w\in{a,b}^*}$ where $R…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
