Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
akashsheoran
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by akashsheoran
0
votes
1
ACE test series
339
views
answered
Jan 28, 2017
Programming in C
ace-test-series
+
–
2
votes
2
Madeeasy CBT
Ethernet frame may carry data upto 512 byte (i.e. mtu 512B ).If total number of fragments are denoted by x and payload bytes in last fragment is y then value of y*2x will be?
Ethernet frame may carry data upto 512 byte (i.e. mtu 512B ).If total number of fragments are denoted by x and payload bytes in last fragment is y then value of y*2x will...
1.1k
views
answered
Jan 28, 2017
6
votes
3
GATE2016 EC-3: GA-6
The velocity $V$ of a vehicle along a straight line is measured in $m/s$ and plotted as shown with respect to time in seconds. At the end of the $7$ seconds, how much will the odometer reading increase by (in m)? $0$ $3$ $4$ $5$
The velocity $V$ of a vehicle along a straight line is measured in $m/s$ and plotted as shown with respect to time in seconds. At the end of the $7$ seconds, how much wil...
4.8k
views
answered
Jan 25, 2017
Quantitative Aptitude
gate2016-ec-3
quantitative-aptitude
speed-time-distance
data-interpretation
+
–
4
votes
4
MadeEasy Subject Test: Operating System - Process Synchronization
Reader Writer's problem How is deadlock possible in this?
Reader Writer's problemHow is deadlock possible in this?
821
views
answered
Jan 25, 2017
Operating System
made-easy-test-series
operating-system
process-synchronization
+
–
1
votes
5
Graph MST
For a simple, undirected, weighted graph each edge havind distinct weight, How is it possible that there can be more than $1$ second best minimum spanning tree?
For a simple, undirected, weighted graph each edge havind distinct weight, How is it possible that there can be more than $1$ second best minimum spanning tree?
394
views
answered
Jan 24, 2017
Algorithms
minimum-spanning-tree
descriptive
+
–
5
votes
6
Time Complexity
Suppose that each row of an n x n array A consists of 1's and 0's such that in any row of A, all the 1's come before any 0's in that row. Assuming A is already in memory, what is the complexity of the most efficient algorithm for finding the row of A that contains the most 1's? A. $O(n2)$ B. $O(logn)$ C. $O(n)$ D. $O(nlogn)$
Suppose that each row of an n x n array A consists of 1's and 0's such that in any row of A, all the 1's come before any 0's in that row. Assuming A is already in memory,...
1.8k
views
answered
Jan 24, 2017
Algorithms
time-complexity
algorithms
asymptotic-notation
+
–
0
votes
7
MadeEasy CO Test q
consider a system that uses interrupt driven I/O for a particular device which has an average data transfer rate of 10KBps.The processing of the interrupt which includes the time to jum to ISR, its execution and returning to the main program is 250 us. what fraction of processor time is consumed by IO device, if IO dvice interrupts for every 2 byte (in %)? a)80 b)40 c)12
consider a system that uses interrupt driven I/O for a particular device which has an average data transfer rate of 10KBps.The processing of the interrupt which includes ...
564
views
answered
Jan 24, 2017
7
votes
8
No. of injective functions ( TestBook Test Series 2 )
450
views
answered
Jan 23, 2017
Set Theory & Algebra
functions
discrete-mathematics
+
–
7
votes
9
Gate Practice Question
int j=0; for(i=0;i<n;i++) { for(i=0;i<2n;i++) { while(j<n) { j++; } } } time complexity.? a.$O(n^{2})$ b.$O(n^{4})$ c.$O(n^{3})$ d.$O(n)$
int j=0; for(i=0;i<n;i++) { for(i=0;i<2n;i++) { while(j<n) { j++; } } }time complexity.?a.$O(n^{2})$ b.$O(n^{4})$ c.$O(n^{3})$ ...
615
views
answered
Jan 23, 2017
Algorithms
time-complexity
+
–
7
votes
10
functions-combinations
Assume an almost injective function is a function in which exactly two element from domain maps to a single element in co-domain, otherwise function is injective. $S$ and $R$ are sets with cardinality $m$ and $n$ respectively. $(m<n)$ and $m\geq 2$. Number of almost injective ... $\frac{( n-m)!}{ 2}$ put m=2 and n=5. we get almost injective functions=5 shudnt it be C?
Assume an almost injective function is a function in which exactly two element from domain maps to a single element in co-domain, otherwise function is injective. $S$ and...
938
views
answered
Jan 23, 2017
Mathematical Logic
combinatory
functions
+
–
3
votes
11
programme running time made easy mock 2
A particular parallel program computation requires 100 ns when executed on a single processor. If 20 percent of this computation is sequential then the execution time for this program running with 4 processors is _______________ (in ns).
A particular parallel program computation requires 100 ns when executed on a single processor. If 20 percent of this computation is sequential then the execution time for...
325
views
answered
Jan 20, 2017
0
votes
12
how to solve
327
views
answered
Jan 7, 2017
Linear Algebra
orthogonal
matrix
eigen-value
+
–
1
votes
13
explain ??
464
views
answered
Jan 6, 2017
Digital Logic
digital-logic
+
–
4
votes
14
CMI2016-A-7
Varsha lives alone and dislikes cooking, so she goes out for dinner every evening. She has two favourite restaurants, $\text{Dosa Paradise}$ and $\text{Kababs Unlimited}$, to which she travels by local train. The train to $\text{Dosa Paradise}$ runs every $10$ ... up eating in $\text{Kababs Unlimited}$? $\frac{1}{5}$ $\frac{1}{3}$ $\frac{2}{5}$ $\frac{1}{2}$
Varsha lives alone and dislikes cooking, so she goes out for dinner every evening. She has two favourite restaurants, $\text{Dosa Paradise}$ and $\text{Kababs Unlimited}$...
695
views
answered
Dec 30, 2016
Probability
cmi2016
conditional-probability
random-variable
+
–
1
votes
15
[Compiler Design] Hash Table
Hsh tables can contribute to an efficient average case solution for all of the following problems described below except? a. Counting Distinct Values b. Dynamic Dictionary c. Range Search d. symbol table look up
Hsh tables can contribute to an efficient average case solution for all of the following problems described below except?a. Counting Distinct Valuesb. Dynamic Dictionaryc...
799
views
answered
Dec 29, 2016
Compiler Design
compiler-design
symbol-table
+
–
0
votes
16
TIFR CSE 2016 | Part B | Question: 3
Assume $P \neq NP$. Which of the following is not TRUE? $2$-SAT in NP $2$-SAT in coNP $3$-SAT is polynmial-time reducible to $2$-SAT 4-SAT is polynmial-time reducible to $3$-SAT $2$-SAT in P
Assume $P \neq NP$. Which of the following is not TRUE?$2$-SAT in NP$2$-SAT in coNP$3$-SAT is polynmial-time reducible to $2$-SAT4-SAT is polynmial-time reducible to $3$-...
609
views
answered
Dec 29, 2016
Theory of Computation
tifr2016
theory-of-computation
reduction
p-np-npc-nph
+
–
1
votes
17
TIFR CSE 2016 | Part A | Question: 14
A $diagonal$ in a polygon is a straight line segment that connects two non-adjacent vertices, and is contained in the interior of the polygon (except for its points). Two such diagonals are said to cross if they have a point in common in the interior of the polygon. In one such ... the information given $\frac{n}{2}-2$ $\frac{n}{4}-1$ $n-4$ $n^2 - 9.5 n +22$
A $diagonal$ in a polygon is a straight line segment that connects two non-adjacent vertices, and is contained in the interior of the polygon (except for its points). Two...
849
views
answered
Dec 28, 2016
Graph Theory
tifr2016
graph-theory
graph-connectivity
+
–
0
votes
18
computer network
315
views
answered
Dec 25, 2016
2
votes
19
made easy test series
Q. The minimal function that can detect a 'divisible by 3' 8421 BCD code digit(representation is D8 D4 D2 D1 ) is given by
Q. The minimal function that can detect a 'divisible by 3' 8421 BCD code digit(representation is D8 D4 D2 D1 ) is given by
1.9k
views
answered
Dec 24, 2016
Digital Logic
digital-logic
+
–
7
votes
20
Probability ,Settheory.
$1)$ A random selector can only select one of the nine integers $\left \{ 1,2,.....,9 \right \}$ and it makes these selections with equal probability,Assume that $n$ numbers are chosen this way.Find the probability such that the product of $n$ numbers selected is not divisible by $3$. $2)$ Let S = {1, 2, . . . , n} then Find |{(R, T) : R, T ⊆ S, R ∩ T = ∅}| = ?
$1)$ A random selector can only select one of the nine integers $\left \{ 1,2,.....,9 \right \}$ and it makes these selections with equal probability,Assume that $n$ num...
1.3k
views
answered
Dec 19, 2016
Probability
engineering-mathematics
probability
set-theory&algebra
+
–
0
votes
21
madeeasy
Whether the given language is context free or context sensitive?
Whether the given language is context free or context sensitive?
287
views
answered
Dec 19, 2016
Theory of Computation
theory-of-computation
+
–
1
votes
22
Ace Test Series: Computer Networks - Tcp
Can someone explain what this question means?
Can someone explain what this question means?
560
views
answered
Dec 7, 2016
Computer Networks
ace-test-series
computer-networks
tcp
+
–
0
votes
23
MadeEasy Test Series: Programming & DS - Programming
292
views
answered
Dec 6, 2016
Programming in C
made-easy-test-series
programming
+
–
1
votes
24
doubt
Q which statement is false?? 1. A SQL query can have a ' having' clause without having containing group by clause. => i think its true 2. in SQL we can use aggregate function without using GROUP by clause ===> i think its true but made easy given both of false answer...so i am confused.....
Q which statement is false??1. A SQL query can have a ' having' clause without having containing group by clause. = i think its true2. in SQL we can use aggreg...
589
views
answered
Dec 6, 2016
5
votes
25
test series os
Suppose 10 processes P1 to P10 share 7 identical resource units which can be reserved and release 1 at are time the maximum resource requirement of a processs P i is SP where SP is greater then 0. The maximum value of that ensures deadlock does not occurs is ________ .
Suppose 10 processes P1 to P10 share 7 identical resource units which can be reserved and release 1 at are time the maximum resource requirement of a processs P i is SP w...
787
views
answered
Dec 2, 2016
Operating System
operating-system
test-series
resource-allocation
+
–
1
votes
26
Algorithm Question , Made easy test series
1.1k
views
answered
Dec 1, 2016
Algorithms
made-easy-test-series
recurrence-relation
+
–
0
votes
27
Gate CS 2014 Set 1 Slight Modification on question
A canonical set of items is given below S→L.>R Q→R. On input symbol > the set has (a).a shift-reduce conflict and a reduce-reduce conflict. (b).a shift-reduce conflict but not a reduce-reduce conflict. (c).a reduce-reduce conflict but not a shift-reduce conflict. (d).neither a shift-reduce nor a reduce-reduce conflict.
A canonical set of items is given belowS→L.>RQ→R.On input symbol the set has(a).a shift-reduce conflict and a reduce-reduce conflict.(b).a shift-reduce conflict but ...
967
views
answered
Dec 1, 2016
Compiler Design
compiler-design
parsing
lr-parser
+
–
2
votes
28
MADE EASY TEST SERIES
Consider the following code : In the above code turn [ ] is a global Boolean array and wakeup ( ) call is used to unblock one of the blocked processes. Assume that above code is executed by any process Pi for 1 ≤ i ≤ 5. Which ... the above code ? Mutual exclusion and deadlock No mutual exclusion and deadlock Mutual exclusion and no deadlock No mutual exclusion but no deadlock
Consider the following code :In the above code turn [ ] is a global Boolean array and wakeup ( ) call is used to unblock one of the blocked processes. Assume that above c...
673
views
answered
Nov 30, 2016
0
votes
29
Need help asap
a).A modulo16 ripple counter uses JK flipflops. If the propagation delay of each flipflop is p ns and the maximum clock frequency that can be used is 5 MHz, then which of the following represents value of p? a. 30 b. 40 c. 50 d. 55 b).Two ... am not able to solve the frequency related problem with flip-flops please guide what approach should i used to solve these kind of problem .?
a).A modulo16 ripple counter uses JK flipflops. If the propagation delay of each flipflop is p ns and the maximum clock frequency that can be used is 5 MHz, then which of...
2.6k
views
answered
Nov 30, 2016
1
votes
30
DOubt TOC
L = { ap | P is NOT Prime } - How to prove is it CFL or NOT?
L = { ap | P is NOT Prime } - How to prove is it CFL or NOT?
376
views
answered
Nov 30, 2016
Theory of Computation
theory-of-computation
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register