menu
search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Recent activity by thepeeyoosh

16 answers
1
GATE2017-2-44
Two transactions $T_1$ and $T_2$ are given as $T_1:r_1(X)w_1(X)r_1(Y)w_1(Y)$ $T_2:r_2(Y)w_2(Y)r_2(Z)w_2(Z)$ where $r_i(V)$ denotes a $\textit{read}$ operation by transaction $T_i$ on a variable $V$ and $w_i(V)$ denotes a $\textit{write}$ operation by transaction $T_i$ on a variable $V$. The total number of conflict serializable schedules that can be formed by $T_1$ and $T_2$ is ______
Two transactions $T_1$ and $T_2$ are given as $T_1:r_1(X)w_1(X)r_1(Y)w_1(Y)$ $T_2:r_2(Y)w_2(Y)r_2(Z)w_2(Z)$ where $r_i(V)$ denotes a $\textit{read}$ operation by transaction $T_i$ on a variable $V$ and $w_i(V)$ denotes a $\textit{write}$ operation by transaction $T_i$ on a variable $V$. The total number of conflict serializable schedules that can be formed by $T_1$ and $T_2$ is ______
commented Feb 2, 2018 in Databases 36k views
4 answers
2
GATE1990-1-iv-a
A 32-bit floating-point number is represented by a 7-bit signed exponent, and a 24-bit fractional mantissa. The base of the scale factor is 16, The range of the exponent is ___________
A 32-bit floating-point number is represented by a 7-bit signed exponent, and a 24-bit fractional mantissa. The base of the scale factor is 16, The range of the exponent is ___________
commented Jan 27, 2018 in Digital Logic 4.3k views
6 answers
3
GATE2008-40
The minimum number of comparisons required to determine if an integer appears more than $\frac{n}{2}$ times in a sorted array of $n$ integers is $\Theta(n)$ $\Theta(\log n)$ $\Theta(\log^*n)$ $\Theta(1)$
The minimum number of comparisons required to determine if an integer appears more than $\frac{n}{2}$ times in a sorted array of $n$ integers is $\Theta(n)$ $\Theta(\log n)$ $\Theta(\log^*n)$ $\Theta(1)$
commented Jan 24, 2018 in Algorithms 13.5k views
5 answers
4
GATE2007-23
Which of the following graphs has an Eulerian circuit? Any $k$-regular graph where $k$ is an even number. A complete graph on $90$ vertices. The complement of a cycle on $25$ vertices. None of the above
Which of the following graphs has an Eulerian circuit? Any $k$-regular graph where $k$ is an even number. A complete graph on $90$ vertices. The complement of a cycle on $25$ vertices. None of the above
commented Jan 23, 2018 in Graph Theory 10.8k views
5 answers
5
GATE2017-1-3
Let $c_{1}.....c_{n}$ be scalars, not all zero, such that $\sum_{i=1}^{n}c_{i}a_{i}$ = 0 where $a_{i}$ are column vectors in $R^{n}$. Consider the set of linear equations $Ax = b$ ... of equations has a unique solution at $x=J_{n}$ where $J_{n}$ denotes a $n$-dimensional vector of all 1. no solution infinitely many solutions finitely many solutions
Let $c_{1}.....c_{n}$ be scalars, not all zero, such that $\sum_{i=1}^{n}c_{i}a_{i}$ = 0 where $a_{i}$ are column vectors in $R^{n}$. Consider the set of linear equations $Ax = b$ where $A=\left [ a_{1}.....a_{n} \right ]$ ... set of equations has a unique solution at $x=J_{n}$ where $J_{n}$ denotes a $n$-dimensional vector of all 1. no solution infinitely many solutions finitely many solutions
commented Jan 20, 2018 in Linear Algebra 9.6k views
6 answers
6
GATE2017-1-GA-9
Arun, Gulab, Neel and Shweta must choose one shirt each from a pile of four shirts coloured red, pink, blue and white respectively. Arun dislikes the colour red and Shweta dislikes the colour white. Gulab and Neel like all the colours. In how many different ways can they choose the shirts so that no one has a shirt with a colour he or she dislikes? $21$ $18$ $16$ $14$
Arun, Gulab, Neel and Shweta must choose one shirt each from a pile of four shirts coloured red, pink, blue and white respectively. Arun dislikes the colour red and Shweta dislikes the colour white. Gulab and Neel like all the colours. In how many different ways can they choose the shirts so that no one has a shirt with a colour he or she dislikes? $21$ $18$ $16$ $14$
commented Jan 20, 2018 in Quantitative Aptitude 5.8k views
0 answers
8
Self Doubt
the sequence is shown, the element at the lowest level?
the sequence is shown, the element at the lowest level?
commented Jan 18, 2018 in Algorithms 100 views
0 answers
9
algorithms
You are given a set of n nuts and another set of n bolts such that they form n distinct pairs of matching nuts and bolts, i.e., each of the bolts go into one nut only. What will the number of comparisons to matching operation conducted in an effective manner ... is trying to fit a bolt into a nut and thereby concluding whether they are of equal size, or find out which is greater in size)
You are given a set of n nuts and another set of n bolts such that they form n distinct pairs of matching nuts and bolts, i.e., each of the bolts go into one nut only. What will the number of comparisons to matching operation conducted in an effective manner? (Note ... is trying to fit a bolt into a nut and thereby concluding whether they are of equal size, or find out which is greater in size)
commented Jan 17, 2018 in Algorithms 138 views
0 answers
10
ACE Test Series
----
----
commented Jan 17, 2018 in Databases 92 views
0 answers
11
Virtualgate
Why here implementation A is wrong.I feel it is correct.
Why here implementation A is wrong.I feel it is correct.
commented Jan 17, 2018 in Programming 113 views
1 answer
12
virtualgate
Here query is not correct if there are two persons with higher rating?Am I correct?
Here query is not correct if there are two persons with higher rating?Am I correct?
commented Jan 17, 2018 in Databases 184 views
1 answer
13
Digital circuit
commented Jan 16, 2018 in Digital Logic 132 views
1 answer
14
test series
Consider the following code segment: The minimum number of temporary variable required to convert the above code segment to static single assignment form is ________.
Consider the following code segment: The minimum number of temporary variable required to convert the above code segment to static single assignment form is ________.
commented Jan 16, 2018 in Compiler Design 99 views
0 answers
16
Rank of node: dependacy graph
please describe in detail I have no idea how to find rank of the node?
please describe in detail I have no idea how to find rank of the node?
closed Jan 13, 2018 in Compiler Design 132 views
0 answers
17
Speedup In pipelining
Actually, In this problem what will, we consider getting the answer(upper bound or lower bound) and why?
Actually, In this problem what will, we consider getting the answer(upper bound or lower bound) and why?
asked Jan 13, 2018 in CO and Architecture 297 views
1 answer
18
Static variable doubt
asked Jan 13, 2018 in Programming 104 views
2 answers
19
Network IP Addressing
IP : 199. 166.15.119 SubNet Mask: 255. 255. 255. 240 Then Find the (i) SubNet ID ? (ii) SubNet No. ? (iii) First host of the SubNet ? (iv) Last host of the SubNet? (v) third host of the first SubNet? I found ambiguity in ans person to person .
IP : 199. 166.15.119 SubNet Mask: 255. 255. 255. 240 Then Find the (i) SubNet ID ? (ii) SubNet No. ? (iii) First host of the SubNet ? (iv) Last host of the SubNet? (v) third host of the first SubNet? I found ambiguity in ans person to person .
commented Jan 13, 2018 in Computer Networks 362 views
1 answer
20
TEST SERIES
PLEASE GIVE THE CORRECT ANSWER
PLEASE GIVE THE CORRECT ANSWER
commented Jan 12, 2018 in Digital Logic 354 views
2 answers
22
#of variables in SSA
Consider the following code segment: c=b+a e=c-a f=c*e h=c+a i=h+f The minimum number of $\color{blue} {total}$ and $\color{blue} {temporary }$ variable required to convert the above code segment to static single assignment form are ________
Consider the following code segment: c=b+a e=c-a f=c*e h=c+a i=h+f The minimum number of $\color{blue} {total}$ and $\color{blue} {temporary }$ variable required to convert the above code segment to static single assignment form are ________
commented Jan 11, 2018 in Compiler Design 476 views
4 answers
23
Hashing (Test Series)
Consider an initially empty hash table of length 10. Following set of keys are inserted using open addressing with hash function h(k) = k mod 10 and linear probing. 0 1 91 2 2 3 13 4 24 5 12 6 62 7 77 8 82 9 The number of different insertion sequence of the key values using the given hash function and linear probing will result in the hash table shown in above __________.
Consider an initially empty hash table of length 10. Following set of keys are inserted using open addressing with hash function h(k) = k mod 10 and linear probing. 0 1 91 2 2 3 13 4 24 5 12 6 62 7 77 8 82 9 The number of different insertion sequence of the key values using the given hash function and linear probing will result in the hash table shown in above __________.
commented Jan 11, 2018 in DS 1.8k views
1 answer
25
Algorithm Question
commented Jan 11, 2018 in Algorithms 455 views
0 answers
29
Test series
Plzzz explain...
Plzzz explain...
commented Jan 9, 2018 in Algorithms 173 views
1 answer
30
minimum no. of states in dfa in which no. of "a" divisible by 8
I can use 4 state dfa for no. of a should be divisible by 4 then minimum = 4 , or we have to construct dfa with 8 states ??
I can use 4 state dfa for no. of a should be divisible by 4 then minimum = 4 , or we have to construct dfa with 8 states ??
answered Jan 9, 2018 in Theory of Computation 212 views
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...