Register

Recent activity

0 votes
1 answer
4
go test series 2025
I bought test series but it shows that you bought only gateoverflow test series....It may be my mistake now what should i do...i want both test series
I bought test series but it shows that you bought only gateoverflow test series....It may be my mistake now what should i do...i want both test series
User Avatar
0 votes
1 answer
6
Number of Super Keys
R(A1, A2,A3,A4....AN). How many super keys possible in relation? If (A1 is candidate key, A2 is candidate key, A3 is candidate key)
R(A1, A2,A3,A4....AN). How many super keys possible in relation? If (A1 is candidate key, A2 is candidate key, A3 is candidate key)
User Avatar
2 votes
1 answer
12
Sector Interleaving - MCQs in CS - Timothy Williams
Sector interleaving in disks is done by a) the disk manufacturer b) the disk controller cord c) the os d) none of the above
Sector interleaving in disks is done bya) the disk manufacturerb) the disk controller cordc) the osd) none of the above
User Avatar
0 votes
0 answers
14
#TOC regular expression
what will be the regular expression of this DFA using Arden's theorem
what will be the regular expression of this DFA using Arden's theorem
User Avatar
0 votes
1 answer
15
Minimal Cover
Consider R(A,B,C,D,E,H) be a relational schema with the following functional dependencies: A->BC, CD->E, E->C, D->AEH, ABH->BD, DH->BC Find minimal cover ?
Consider R(A,B,C,D,E,H) be a relational schema with the following functional dependencies:A->BC, CD->E, E->C, D->AEH, ABH->BD, DH->BCFind minimal cover ?
User Avatar
29 votes
2 answers
20
GATE CSE 2011 | Question: 35
Consider the following table of arrival time and burst time for three processes $P0, P1$ and $P2.$ ... of processes. What is the average waiting time for the three processes? $5.0$ ms $4.33$ ms $6.33$ ms $7.33$ ms
Consider the following table of arrival time and burst time for three processes $P0, P1$ and $P2.$$$\small \begin{array}{|c|c|c|} \hline \textbf{Process} & \textbf{Arriva...
User Avatar
0 votes
3 answers
21
QUICK SORT- SELF DOUBT
In quick sort for sorting of n Numbers, the 75th greatest Element is selected as pivot using $O(n^2)$ time complexity algorithm than what is the worst case time complexity of quick sort. O($n^2$) O($n^3$) O(nlogn) O(n)
In quick sort for sorting of n Numbers, the 75th greatest Element is selected as pivot using $O(n^2)$ time complexity algorithm than what is the worst case time complexit...
User Avatar
49 votes
7 answers
22
GATE CSE 1993 | Question: 01.1
The eigen vector $(s)$ of the matrix $\begin{bmatrix} 0 &0 &\alpha\\ 0 &0 &0\\ 0 &0 &0 \end{bmatrix},\alpha \neq 0$ is (are) $(0,0,\alpha)$ $(\alpha,0,0)$ $(0,0,1)$ $(0,\alpha,0)$
The eigen vector $(s)$ of the matrix $$\begin{bmatrix} 0 &0 &\alpha\\ 0 &0 &0\\ 0 &0 &0 \end{bmatrix},\alpha \neq 0$$ is (are)$(0,0,\alpha)$$(\alpha,0,0)$$(0,0,1)$$(0,\al...
User Avatar
99 votes
8 answers
23
GATE CSE 2014 Set 2 | Question: 47
The product of the non-zero eigenvalues of the matrix is ____ $\begin{pmatrix} 1 & 0 & 0 & 0 & 1 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 1 & 0 & 0 & 0 & 1 \end{pmatrix}$
The product of the non-zero eigenvalues of the matrix is ____$\begin{pmatrix} 1 & 0 & 0 & 0 & 1 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 1 & 0 & ...
User Avatar
33 votes
8 answers
30
GATE IT 2008 | Question: 28
Consider the following Hasse diagrams. Which all of the above represent a lattice? (i) and (iv) only (ii) and (iii) only (iii) only (i), (ii) and (iv) only
Consider the following Hasse diagrams. Which all of the above represent a lattice?(i) and (iv) only(ii) and (iii) only(iii) only(i), (ii) and (iv) only
User Avatar
To see more, click for the full list of questions or popular tags.