menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
User thepeeyoosh
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
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
Recent Posts
Update on GO Book for GATE 2022
Barc Interview Experience 2020- CSE stream
JEST 2021 registrations are open
TIFR GS-2021 Online Application portal
IIT Jodhpur Mtech AI - Interview Expierence (Summer Admission)
Subjects
All categories
General Aptitude
(2.1k)
Engineering Mathematics
(8.5k)
Digital Logic
(3k)
Programming and DS
(5.1k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.7k)
Databases
(4.3k)
CO and Architecture
(3.5k)
Computer Networks
(4.3k)
Non GATE
(1.2k)
Others
(1.3k)
Admissions
(595)
Exam Queries
(838)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1.1k)
Recent Blog Comments
Ohh, yeah now turned off. Got it sir, Thank you :)
I guess you might have turn on "Only GATE...
https://gateoverflow.in/280484/tifr2019-b-11 Arju...
Which question disappeared? Can you share a link?
OFFTOPIC:- @Arjun sir why are the questions of...
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
gate2017-2
databases
transactions
numerical-answers
conflict-serializable
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
gate1990
descriptive
digital-logic
number-representation
floating-point-representation
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
gate2008
normal
algorithms
time-complexity
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
gate2007
graph-theory
normal
graph-connectivity
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
gate2017-1
linear-algebra
system-of-equations
normal
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
gate2017-1
combinatory
numerical-ability
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 ??
commented
Jan 19, 2018
in
Programming
143
views
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?
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
digital-logic
digital-circuits
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
15
Programming Question
commented
Jan 15, 2018
in
Programming
148
views
programming-in-c
programming
output
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
compiler-design
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
pipelining
co-and-architecture
speedup
1
answer
18
Static variable doubt
asked
Jan 13, 2018
in
Programming
104
views
static-single-assignment
compiler-design
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
network-addressing
ip-addressing
computer-networks
ip
1
answer
20
TEST SERIES
PLEASE GIVE THE CORRECT ANSWER
PLEASE GIVE THE CORRECT ANSWER
commented
Jan 12, 2018
in
Digital Logic
354
views
digital-logic
combinational-circuits
2
answers
21
MadeEasy Test Series 2018: Graph Theory - Graph Coloring
answer given is 4. Please provide a detailed solution.
answer given is 4. Please provide a detailed solution.
answered
Jan 12, 2018
in
Graph Theory
291
views
graph-theory
graph-coloring
made-easy-test-series
madeeasy-testseries-2018
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
compiler-design
static-single-assignment
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
hashing
0
answers
24
CO: Cache Memory
commented
Jan 11, 2018
in
CO and Architecture
163
views
co-and-architecture
cache-memory
multilevel-cache
test-series
1
answer
25
Algorithm Question
commented
Jan 11, 2018
in
Algorithms
455
views
algorithms
0
answers
26
CO: Memory
commented
Jan 11, 2018
in
CO and Architecture
241
views
co-and-architecture
cache-memory
test-series
0
answers
27
CO: Addressing Mode Question
closed
Jan 11, 2018
in
CO and Architecture
1.7k
views
addressing-modes
co-and-architecture
self
0
answers
28
What is the meaning of specialized and generalized entity?
asked
Jan 11, 2018
in
Databases
242
views
databases
self-doubt
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
...