Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
thepeeyoosh
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by thepeeyoosh
18
answers
1
GATE CSE 2017 Set 2 | Question: 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 ... 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...
70.7k
views
commented
Feb 2, 2018
Databases
gatecse-2017-set2
databases
transaction-and-concurrency
numerical-answers
conflict-serializable
+
–
4
answers
2
GATE CSE 1990 | Question: 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 ex...
7.8k
views
commented
Jan 27, 2018
Digital Logic
gate1990
digital-logic
number-representation
floating-point-representation
fill-in-the-blanks
+
–
7
answers
3
GATE CSE 2008 | Question: 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)...
36.3k
views
commented
Jan 24, 2018
Algorithms
gatecse-2008
normal
algorithms
time-complexity
+
–
5
answers
4
GATE CSE 2007 | Question: 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...
25.1k
views
commented
Jan 23, 2018
Graph Theory
gatecse-2007
graph-theory
normal
graph-connectivity
+
–
9
answers
5
GATE CSE 2017 Set 1 | Question: 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$ ... 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$...
20.1k
views
commented
Jan 20, 2018
Linear Algebra
gatecse-2017-set1
linear-algebra
system-of-equations
normal
+
–
6
answers
6
GATE CSE 2017 Set 1 | Question: 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 ... 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 Shwet...
9.9k
views
commented
Jan 20, 2018
Quantitative Aptitude
gatecse-2017-set1
combinatory
quantitative-aptitude
+
–
0
answers
7
doubt extern variable here they initialized it is it valid ?
extern int num = 10; // is it valid ??
extern int num = 10; // is it valid ??
572
views
commented
Jan 19, 2018
Programming in C
programming-in-c
extern-variable
+
–
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?
370
views
commented
Jan 18, 2018
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. Wh...
306
views
commented
Jan 17, 2018
0
answers
10
ACE Test Series
----
289
views
commented
Jan 17, 2018
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.
392
views
commented
Jan 16, 2018
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?
519
views
commented
Jan 16, 2018
1
answer
13
Digital circuit
447
views
commented
Jan 16, 2018
Digital Logic
digital-logic
digital-circuits
+
–
0
answers
14
Programming Question
554
views
commented
Jan 14, 2018
Programming in C
programming-in-c
programming
output
+
–
0
answers
15
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?
344
views
closed
Jan 13, 2018
Compiler Design
compiler-design
+
–
0
answers
16
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?
699
views
asked
Jan 13, 2018
CO and Architecture
pipelining
co-and-architecture
speedup
+
–
1
answer
17
Static variable doubt
346
views
asked
Jan 13, 2018
Programming in C
static-single-assignment
compiler-design
+
–
2
answers
18
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.119SubNet Mask: 255. 255. 255. 240Then Find the (i) SubNet ID ?(ii) SubNet No. ?(iii) First host of the SubNet ?(iv) Last host of the SubNet?(v) third ho...
1.0k
views
commented
Jan 12, 2018
Computer Networks
network-addressing
ip-addressing
computer-networks
ip
+
–
2
answers
19
TEST SERIES
PLEASE GIVE THE CORRECT ANSWER
PLEASE GIVE THE CORRECT ANSWER
1.1k
views
commented
Jan 12, 2018
Digital Logic
digital-logic
combinational-circuit
+
–
2
answers
20
MadeEasy Test Series 2018: Graph Theory - Graph Coloring
Consider the following graph: Which of the following will represents the chromatic number of the graph? answer given is 4. Please provide a detailed solution.
Consider the following graph: Which of the following will represents the chromatic number of the graph?answer given is 4.Please provide a detailed solution.
741
views
answered
Jan 11, 2018
Graph Theory
graph-theory
graph-coloring
made-easy-test-series
madeeasy-testseries-2018
+
–
8
answers
21
#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+ae=c-af=c*eh=c+ai=h+f The minimum number of $\color{blue} {total}$ and $\color{blue} {temporary }$ variable required to convert t...
1.8k
views
commented
Jan 11, 2018
Compiler Design
compiler-design
static-single-assignment
+
–
4
answers
22
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 1912...
3.3k
views
commented
Jan 11, 2018
DS
data-structures
hashing
+
–
0
answers
23
CO: Cache Memory
458
views
commented
Jan 11, 2018
CO and Architecture
co-and-architecture
cache-memory
multilevel-cache
test-series
+
–
1
answer
24
Algorithm Question
1.0k
views
commented
Jan 11, 2018
Algorithms
algorithms
time-complexity
test-series
+
–
0
answers
25
CO: Memory
495
views
commented
Jan 11, 2018
CO and Architecture
co-and-architecture
cache-memory
test-series
+
–
0
answers
26
CO: Addressing Mode Question
2.6k
views
closed
Jan 11, 2018
CO and Architecture
addressing-modes
co-and-architecture
+
–
0
answers
27
What is the meaning of specialized and generalized entity?
372
views
asked
Jan 11, 2018
Databases
databases
self-doubt
+
–
0
answers
28
Test series
Plzzz explain...
Plzzz explain...
584
views
commented
Jan 9, 2018
1
answer
29
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 ??
773
views
answered
Jan 9, 2018
1
answer
30
automata
How many states in dfa of X= { (a+b)* where no of a is divisible by 4 and 8}
How many states in dfa of X= { (a+b)* where no of a is divisible by 4 and 8}
713
views
commented
Jan 9, 2018
Theory of Computation
theory-of-computation
finite-automata
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register