Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by akashsheoran
1
answer
1
Virtual Gate
Calculate the limit (A) 1 (B) 0 (C) -1 (D) Does not exist
Calculate the limit (A) 1 (B) 0 (C) -1 (D) Does not exist
467
views
commented
Feb 7, 2017
1
answer
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
commented
Jan 29, 2017
2
answers
3
ACE test series
379
views
answered
Jan 28, 2017
Programming in C
ace-test-series
+
–
0
answers
4
Testbook 3 Q.no-44
i got Q2 is correct?? but answer is given Q1 plz check ???????
i got Q2 is correct?? but answer is given Q1 plz check ???????
215
views
commented
Jan 28, 2017
Databases
test-series
+
–
2
answers
5
#Testbook- 3 Qno-13
is it given correct answer ????
is it given correct answer ????
625
views
commented
Jan 28, 2017
Linear Algebra
test-series
+
–
6
answers
6
column major in 3d array
Consider 3 dimensional Array A[90] [30] [40] stored in linear array in column major order. If the base address starts at 10. The location of A[20] [20] [30] is __________ . [Assume the first element is stored at A[1][1][1] and each element take 1 B].
Consider 3 dimensional Array A[90] [30] [40] stored in linear array in column major order. If the base address starts at 10. The location of A[20] [20] [30] is __________...
15.9k
views
commented
Jan 26, 2017
Programming in C
array
programming-in-c
data-structures
+
–
2
answers
7
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.9k
views
answered
Jan 25, 2017
Quantitative Aptitude
gate2016-ec-3
quantitative-aptitude
speed-time-distance
data-interpretation
+
–
2
answers
8
MadeEasy CBT 2017: Algorithms - Graph Algorithms
2.0k
views
commented
Jan 25, 2017
Algorithms
algorithms
minimum-spanning-tree
numerical-answers
made-easy-test-series
+
–
2
answers
9
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?
875
views
answered
Jan 25, 2017
Operating System
made-easy-test-series
operating-system
process-synchronization
+
–
1
answer
10
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?
439
views
commented
Jan 24, 2017
Algorithms
minimum-spanning-tree
descriptive
+
–
0
answers
11
algorithm #
261
views
commented
Jan 24, 2017
1
answer
12
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 ...
598
views
commented
Jan 24, 2017
2
answers
13
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.9k
views
answered
Jan 24, 2017
Algorithms
time-complexity
algorithms
asymptotic-notation
+
–
2
answers
14
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...
980
views
commented
Jan 24, 2017
Mathematical Logic
combinatory
functions
+
–
1
answer
15
No. of injective functions ( TestBook Test Series 2 )
461
views
answered
Jan 23, 2017
Set Theory & Algebra
functions
discrete-mathematics
+
–
1
answer
16
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})$ ...
624
views
answered
Jan 23, 2017
Algorithms
time-complexity
+
–
1
answer
17
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...
347
views
answer edited
Jan 20, 2017
0
answers
18
Binary Tree
The number of leaves (nodes with no children) in each left sub tree is within one of the number of leaves in the corresponding right sub tree. What is the worst case height of the tree ? Assume root node at level 0 A.O(log n) B.n C.n+1 D.n-1 Please explain the solution properly
The number of leaves (nodes with no children) in each left sub tree is within one of the number of leaves in the corresponding right sub tree. What is the worst case heig...
292
views
commented
Jan 17, 2017
1
answer
19
Pipelining
You are given a non-pipelined processor design which has a cycle time of 10ns and average CPI(cycle per instruction) of 1.4.The designers pipelined it into 5 stages with stage timing of 1ns,1.5ns,4ns,3ns,0.5ns, Each pipelined stage added also adds 20ps ... the time for 1 cycle and 5% of time for 2 cycles(these occurrences are disjoint).what is speedup compared to the original processor?
You are given a non-pipelined processor design which has a cycle time of 10ns and average CPI(cycle per instruction) of 1.4.The designers pipelined it into 5 stages with ...
2.8k
views
commented
Jan 17, 2017
0
answers
20
test series
243
views
commented
Jan 9, 2017
0
answers
21
Algo problem
An element in an array X is called leader if it is middle element in the sorted array. The best algorithm to find leader in an array. Takes linear time using median of median of array Takes (n logn) time using merge sort. Takes Ο(n2) time using n time linear search Takes Ο(logn) time using binary search tree.
An element in an array X is called leader if it is middle element in the sorted array. The best algorithm to find leader in an array.Takes linear time using median of med...
463
views
commented
Jan 9, 2017
1
answer
22
how to solve
356
views
answered
Jan 7, 2017
Linear Algebra
orthogonal
matrix
eigen-value
+
–
2
answers
23
doubt
In an effort to make MERGE-SORT faster, you decide to divide the array into k equal sized, disjoint subarrays, where k > 2. This means that you have to merge k lists. How many levels are present for this algorithm assuming merge can be accomplished in O(n log(k)) time. O(log2 k) O(n) O(logkn) O(lognk)
In an effort to make MERGE-SORT faster, you decide to divide the array into k equal sized, disjoint subarrays, where k 2. This means that you have to merge k lists. How ...
366
views
commented
Jan 7, 2017
Algorithms
algorithms
merge-sort
time-complexity
+
–
1
answer
24
doubt
386
views
commented
Jan 7, 2017
Computer Networks
computer-networks
+
–
1
answer
25
explain ??
494
views
answer edited
Jan 6, 2017
Digital Logic
digital-logic
+
–
1
answer
26
doubt
286
views
commented
Jan 3, 2017
Digital Logic
digital-logic
digital-counter
+
–
1
answer
27
virtual test series
303
views
commented
Jan 1, 2017
2
answers
28
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}$...
739
views
answered
Dec 30, 2016
Probability
cmi2016
conditional-probability
random-variable
+
–
1
answer
29
TIFR CSE 2016 | Part B | Question: 15
Let $G$ be an undirected graph. For a pair $(x, y)$ of distinct vertices of $G$, let $\mathsf{mincut}(x, y)$ be the least number of edges that should be delted from $G$ so that the resulting graph has no $x-y$ ... and iv are possible but neither ii nor iii ii and iv are possible but neither i not iii iii and iv are possible but neither i nor ii
Let $G$ be an undirected graph. For a pair $(x, y)$ of distinct vertices of $G$, let $\mathsf{mincut}(x, y)$ be the least number of edges that should be delted from $G$ s...
837
views
commented
Dec 29, 2016
Graph Theory
tifr2016
graph-theory
graph-connectivity
+
–
2
answers
30
graph theory
1.4k
views
commented
Dec 29, 2016
Graph Theory
graph-theory
graph-connectivity
euler-graph
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register