Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Purple
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Purple
2
answers
1
iisc written
Consider a directed graph with V nodes and E edges. The graph is represented by two arrays, source src[] and destination dest[] each of size E, such that src[i] and dest[i] represent the nodes connected by edge, i. How to calculate the maximum indegree(or out degree)?
Consider a directed graph with V nodes and E edges. The graph is represented by two arrays, sourcesrc[] and destination dest[] each of size E, such that src[i] and dest[i...
530
views
asked
Jun 6, 2017
Graph Theory
graph-theory
graph-connectivity
iisc-interview
iisc
mtech
descriptive
+
–
2
answers
2
Probability puzzles
A grasshopper is sitting on a little stone, which we'll call stone zero. Ahead of him, arranged in a line, are stones one, two, three, et cetera, all the way up to nine. The grasshopper would like to reach that ninth stone, for reasons ... two: he could take one big jump, or two little ones. How many different paths can the grasshopper take to reach his destination?
A grasshopper is sitting on a little stone, which we'll call stone zero. Ahead of him, arranged in a line, are stones one, two, three, et cetera, all the way up to nine. ...
1.2k
views
commented
May 28, 2017
Probability
probability
engineering-mathematics
conditional-probability
+
–
0
answers
3
Probbility puzzles
Three men - conveniently named A, B, and C - are fighting a duel with pistols. It's A's turn to shoot. The rules of this duel are rather peculiar: the duelists do not all shoot simultaneously, but instead take turns. A fires at B, B fires ... B is a better shot, and hits with probability 0.75 - all shots are independent. What's the probability that A wins the duel?
Three men — conveniently named A, B, and C — are fighting a duel with pistols. It's A's turn to shoot. The rules of this duel are rather peculiar: the duelists do not...
1.2k
views
commented
May 23, 2017
Probability
probability
conditional-probability
+
–
0
answers
4
Information regarding UGC NET
Can someone please tell what's the use of giving UGC NET in computer science after doing MTech and have given GATE in CSE? What benefits will NET give when applying for Phd or as an assistant professor? What is the requirement of NET? I am currently in 1st year MTech, AFAIK we are eligible only if we are in final year MTECH(ie 2nd year) is this right?
Can someone please tell what's the use of giving UGC NET in computer science after doing MTech and have given GATE in CSE?What benefits will NET give when applying for Ph...
405
views
asked
Mar 4, 2017
Others
net-exam
general
admissions
query
+
–
2
answers
5
What is "Strict recoverable" schedule?
Consider the following schedule: $S: r_1(A), w_2(A), Commit_2, w_1(A),w_3(A), Commit_3, Commit_1$ Which of the following is true? a. Schedule is view serializable schedule and strict recoverable schedule b. Schedule is ... know what is "strict schedule" and "recoverable schedule", But then what it means by "strict recoverable"?
Consider the following schedule:$S: r_1(A), w_2(A), Commit_2, w_1(A),w_3(A), Commit_3, Commit_1$Which of the following is true?a. Schedule is view serializable schedule a...
6.7k
views
answer selected
Feb 10, 2017
Unknown Category
concurrency
databases
transaction-and-concurrency
+
–
1
answer
6
automata
what is the use of automata in computer science?
what is the use of automata in computer science?
794
views
answer selected
Feb 9, 2017
1
answer
7
progress and deadlock
Is is true that...If there is deadlock then system can not progress?
Is is true that...If there is deadlock then system can not progress?
4.8k
views
answer selected
Feb 9, 2017
Operating System
deadlock-prevention-avoidance-detection
operating-system
process-synchronization
progress
+
–
1
answer
8
gatebook mt2 qn 42
The intended purpose of this code is to precompute all the primes less than N. When it is finished executing, for r ∈ [2, N), bits[r] is supposed to equal 1 if and only if N is composite. Assume that the bits array is initialized to all zeroes. for ... composite." so why cant we just do a direct search? If it is 0 its prime, otherwise composite? What is the problem in this?
The intended purpose of this code is to precompute all the primes less than N. When it is finished executing, for r ∈ [2, N), bits[r] is supposed to equal 1 if and only...
321
views
answer selected
Feb 8, 2017
Algorithms
algorithms
time-complexity
gatebook-test-series
+
–
4
answers
9
GB Mock 2
875
views
answer edited
Feb 7, 2017
Theory of Computation
gatebook-mt2
theory-of-computation
+
–
11
answers
10
GATE CSE 2015 Set 3 | Question: 36
Two hosts are connected via a packet switch with $10^7$ bits per second links. Each link has a propagation delay of $20$ microseconds. The switch begins forwarding a packet $35$ microseconds after it receives the same. If $10000$ bits of ... between the transmission of the first bit of data and the reception of the last bit of the data in microseconds is ______.
Two hosts are connected via a packet switch with $10^7$ bits per second links. Each link has a propagation delay of $20$ microseconds. The switch begins forwarding a pack...
32.6k
views
commented
Feb 7, 2017
Computer Networks
gatecse-2015-set3
computer-networks
normal
numerical-answers
network-switching
+
–
5
answers
11
Number of conflict serializable schedules
Number of conflict serializable schedules in T1 : R(A) W(A) R(B) W(B) T2: R(A) W(A) R(B) W(B)
Number of conflict serializable schedules inT1 : R(A) W(A) R(B) W(B)T2: R(A) W(A) R(B) W(B)
4.0k
views
commented
Feb 7, 2017
2
answers
12
gatebook mt2 qn-36
Consider a simple in-order five-stage pipeline with a two-cycle branch misprediction penalty and a single-cycle load-use delay penalty. For a specific program, 30% of the instructions are loads, 20% are branches, the remaining 50% of instructions are ... dependent instruction, and 75% of branches are predicted correctly. What is the average CPI of this program on this processor?
Consider a simple in-order five-stage pipeline with a two-cycle branch misprediction penalty and a single-cycle load-use delay penalty. For a specific program, 30% of the...
1.8k
views
asked
Feb 7, 2017
CO and Architecture
co-and-architecture
machine-instruction
clock-frequency
+
–
1
answer
13
gatebook mt2
A certain pipelined RISC machine has 8 general-purpose registers R0, R1, . . . , R7 and supports the following operations. ADD Rs1, Rs2, Rd /* Add Rs1 to Rs2 and put the sum in Rd */ MUL Rs1, Rs2, Rd /* Multiply Rs1 by Rs2 and put the product in Rd */ An operation ... of clock cycles required for an operation sequence that computes the value of AB + ABC + BC ? (A) 5 (B) 6 (C) 7 (D) 8
A certain pipelined RISC machine has 8 general-purpose registers R0, R1, . . . , R7 and supports the following operations. ADD Rs1, Rs2, Rd /* Add Rs1 to Rs2 and put the ...
2.6k
views
asked
Feb 7, 2017
CO and Architecture
machine-instruction
co-and-architecture
clock-frequency
+
–
2
answers
14
gatebook
How many ways are there for arranging letters of the word AMAZING such that the 'I' appears between the two 'A's? (A) 5! ways (B) 7! ways (C) 8! ways (D) 4! ways Note: AMZIA is valid and AIA is also valid right?
How many ways are there for arranging letters of the word AMAZING such that the 'I' appears between the two 'A's?(A) 5! ways(B) 7! ways(C) 8! ways(D) 4! waysNote: AMZIA i...
907
views
asked
Feb 7, 2017
Quantitative Aptitude
gatebook
combinatory
+
–
9
answers
15
GATE CSE 2003 | Question: 34
$m$ identical balls are to be placed in $n$ distinct bags. You are given that $m \geq kn$, where $k$ is a natural number $\geq 1$. In how many ways can the balls be placed in the bags if each bag must contain at least $k$ ... $\left( \begin{array}{c} m - kn + n + k - 2 \\ n - k \end{array} \right)$
$m$ identical balls are to be placed in $n$ distinct bags. You are given that $m \geq kn$, where $k$ is a natural number $\geq 1$. In how many ways can the balls be place...
11.1k
views
commented
Feb 4, 2017
Combinatory
gatecse-2003
combinatory
balls-in-bins
normal
+
–
4
answers
16
Which of the following is not a necessary condition for a deadlock among processes?
Which of the following is not a necessary condition for a deadlock among processes? (a) Shared Resources (b) No Preemption (c) Acyclic condition among processes (d) None of the above
Which of the following is not a necessary condition for a deadlock among processes?(a) Shared Resources(b) No Preemption(c) Acyclic condition among processes(d) None of t...
7.7k
views
answer selected
Feb 2, 2017
Operating System
deadlock-prevention-avoidance-detection
operating-system
+
–
1
answer
17
geeks-mocks-2017
Four different pens (1, 2, 3, 4) are to be distributed at random in four pen stands marked as 1, 2, 3, 4. What is the probability that none of the pen occupies the place corresponding to its number ? a. 17/18 b. 3/8 c. 1/2 d. 5/8 How will we use the formula for derangements here? Using the direct formula of !n is giving wrong answer.
Four different pens (1, 2, 3, 4) are to be distributed at random in four pen stands marked as 1, 2, 3, 4. What is the probability that none of the pen occupies the place ...
962
views
answer selected
Feb 2, 2017
Quantitative Aptitude
test-series
geeksforgeeks-test-series
probability
+
–
1
answer
18
Time complexity
What will be the time complexity of: T(n)=n½ * T(n½) + n ? I tried by substitution by taking m=n^½ but I'm not getting the answer that way.
What will be the time complexity of:T(n)=n½ * T(n½) + n ?I tried by substitution by taking m=n^½ but I'm not getting the a...
293
views
asked
Jan 29, 2017
Algorithms
time-complexity
algorithms
asymptotic-notation
+
–
1
answer
19
Countable and recursive language relation
Is every countable language recursive enumerable?
Is every countable language recursive enumerable?
570
views
asked
Jan 27, 2017
Theory of Computation
theory-of-computation
recursive-and-recursively-enumerable-languages
countable-uncountable-set
+
–
1
answer
20
is the set of recursively enumerable languages countable?
4.3k
views
commented
Jan 27, 2017
Theory of Computation
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
4
answers
21
GATE CSE 2006 | Question: 71
The $2^n$ vertices of a graph $G$ corresponds to all subsets of a set of size $n$, for $n \geq 6$. Two vertices of $G$ are adjacent if and only if the corresponding sets intersect in exactly two elements. The number of vertices of degree zero in $G$ is: $1$ $n$ $n + 1$ $2^n$
The $2^n$ vertices of a graph $G$ corresponds to all subsets of a set of size $n$, for $n \geq 6$. Two vertices of $G$ are adjacent if and only if the corresponding set...
17.0k
views
commented
Jan 23, 2017
Graph Theory
gatecse-2006
graph-theory
normal
degree-of-graph
+
–
1
answer
22
Which is the best file organization when data is frequently added or deleted from a file? IETE_ELAN
Which is the best file organization when data is frequently added or deleted from a file? (A) Sequential (B) Direct (C) Index sequential (D) None of the above
Which is the best file organization when data is frequently added or deleted from a file?(A) Sequential (B) Direct(C) Index...
8.7k
views
answer selected
Jan 23, 2017
Databases
databases
file-system
file
+
–
3
answers
23
How many DFA's exist with three states over the input alphabet {0,1}
Is there any procedure to generalize these types of problems ? Thanks in advance
Is there any procedure to generalize these types of problems ? Thanks in advance
16.3k
views
commented
Jan 21, 2017
Theory of Computation
theory-of-computation
combinatory
finite-automata
number-of-dfa
+
–
1
answer
24
ace 2017 test series
How will this query execute? Q1: Select pno from project Q2: select pno from works where employee.eno=works.eno Now Q1 except Q2 will all projects which do not have an employee working on it. So the outer query should give: All employees who are working on some project. But answer is: Employees working on all projects.
How will this query execute?Q1: Select pno from projectQ2: select pno from works where employee.eno=works.enoNow Q1 except Q2 will all projects which do not have an emplo...
415
views
asked
Jan 19, 2017
Databases
test-series
ace-test-series
databases
sql
+
–
1
answer
25
Virtual Gate Test Series: Databases - Referential Integrity
We can convert any weak entity set to a strong entity set by simply adding appropriate attributes. Why, then, do we have weak entity sets at all? $1)$ We want to avoid the data duplication and consequent possible inconsistencies caused by duplicating the key of the strong ... : $A)1$ and $2$ $B)2$ and $3$ $C)1$ and $3$ $D)1,2$ and $3$
We can convert any weak entity set to a strong entity set by simply adding appropriate attributes. Why, then, do we have weak entity sets at all? $1)$ We want to avoid th...
4.7k
views
answered
Jan 19, 2017
Databases
databases
referential-integrity
virtual-gate-test-series
+
–
3
answers
26
TIFR CSE 2012 | Part A | Question: 11
Let $N$ be the sum of all numbers from $1$ to $1023$ except the five primes numbers: $2, 3, 11, 17, 31.$ Suppose all numbers are represented using two bytes (sixteen bits). What is the value of the least significant byte (the least significant eight bits) of $N$? $00000000$ $10101110$ $01000000$ $10000000$ $11000000$
Let $N$ be the sum of all numbers from $1$ to $1023$ except the five primes numbers: $2, 3, 11, 17, 31.$ Suppose all numbers are represented using two bytes (sixteen bits...
1.7k
views
commented
Jan 19, 2017
Digital Logic
tifr2012
digital-logic
number-representation
+
–
1
answer
27
Virtual Gate Test Series: Numerical Ability - Percentage
A country’s GDP grew by $7.8%$ within a period. During the same period, the country’s per-capita-GDP (= ratio of GDP to the total population) increased by $10%.$ During this period, the total population of the country$?$ increased by $4\%$ decreased by $4\%$ increased by $2\%$ decreased by $2\%$
A country’s GDP grew by $7.8%$ within a period. During the same period, the country’s per-capita-GDP (= ratio of GDP to the total population) increased by $10%.$ Duri...
551
views
asked
Jan 19, 2017
Quantitative Aptitude
general-aptitude
numerical-methods
percentage
virtual-gate-test-series
+
–
1
answer
28
mock1 ace
How to solve this?
How to solve this?
565
views
commented
Jan 18, 2017
Mathematical Logic
ace-test-series
test-series
engineering-mathematics
mathematical-logic
first-order-logic
+
–
3
answers
29
Optimal Window Size
In optimal window size for sender or for finding the maximum window size of sender N, do we consider N=1+2a or N=a. Where a=(propagation time/Transmission time)? For max efficiency: n*Tt should be equal to Tt+2Tp. ie n=1+2a. But in some places it is just n=2a.
In optimal window size for sender or for finding the maximum window size of sender N, do we consider N=1+2a or N=a.Where a=(propagation time/Transmission time)?For max ef...
7.5k
views
edited
Jan 18, 2017
Computer Networks
computer-networks
tcp
sliding-window
+
–
1
answer
30
ace coa subject test
AFAIK "In direct we do specify the address of the operand right? Its just that we specify it in the instruction directly, ie hardcode the address in the instruction. In implied there is no address given since address is deduced from the operation itself." Is this right?
AFAIK "In direct we do specify the address of the operand right? Its just that we specify it in the instruction directly, ie hardcode the address in the instruction. In i...
533
views
asked
Jan 17, 2017
CO and Architecture
test-series
ace-test-series
addressing-modes
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register