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
Answers by srestha
0
votes
91
Self doubt SQL
Select Rating From professor P2 Where 5>=(Select count (*) From professor P3 Where P2.Rating <= P3.Rating); Can someone please explain the query?
Select Rating From professor P2 Where 5>=(Select count (*) From professor P3 Where P2.Rating <= P3.Rating);Can someone please explain the query?
1.0k
views
answered
Dec 2, 2018
Databases
sql
+
–
0
votes
92
made easy test series
Consider a machine with byte addressable memory 32 bits virtual addresses, 32 bits physical addresses and 4 KB page size. If a two-level page table system is used where each page table occupies one page and page table entries of 4 B each, then the memory overhead for this machine is ________ KB.
Consider a machine with byte addressable memory 32 bits virtual addresses, 32 bits physical addresses and 4 KB page size. If a two-level page table system is used where e...
240
views
answered
Dec 2, 2018
1
votes
93
TOTAL CONFLICT SERIALIZABLE SCHEDULES
Two transactions T1 and T2 are given as T1:r1(A) w1(A) r1(B) w1(B) r1(C) w1(C) T2:r2(B) w2(B) r2(C) w2(C) r2(D) w2(D) The total number of conflicts serializable schedules that can be formed by T1 and T2 are _____
Two transactions T1 and T2 are given asT1:r1(A) w1(A) r1(B) w1(B) r1(C) w1(C)T2:r2(B) w2(B) r2(C) w2(C) r2(D) w2(D)The total number of conflicts serializable schedules th...
1.8k
views
answered
Nov 30, 2018
13
votes
94
MadeEasy Subject Test 2019: Programming & DS - Heap
The minimum number of comparisons required to find the 65th smallest element in a minheap is equal to
The minimum number of comparisons required to find the 65th smallest element in a minheap is equal to
3.5k
views
answered
Nov 24, 2018
DS
made-easy-test-series
data-structures
binary-heap
+
–
0
votes
95
ME Test Series
Consider a CPU containing 2000 instructions, there are 80 misses In the $L_1$ cache and 40 misses In the $L_2$ cache. Assume the miss penalty from the $L_2$ cache to memory is 200 clock cycles, the hit time of $L_2$ cache Is 30 clock cycles, ... time of $L_1$ cache Is 5 clock cycles and these are 1.8 memory references per instruction, then average stall per instruction Is _________.
Consider a CPU containing 2000 instructions, there are 80 misses In the $L_1$ cache and 40 misses In the $L_2$ cache. Assume the miss penalty from the $L_2$ cache to memo...
623
views
answered
Nov 24, 2018
CO and Architecture
co-and-architecture
cache-memory
stall
numerical-answers
made-easy-test-series
+
–
3
votes
96
Zeal Test Series 2019: Set Theory & Algebra - Relations
1.0k
views
answered
Nov 19, 2018
Set Theory & Algebra
zeal
set-theory&algebra
relations
zeal2019
+
–
0
votes
97
Gilbert_Strang_LU_Decomposition
For which numbers c is $A=LU$ impossible? $\begin{bmatrix} 1 & 2 &0 \\ 3 & c &1 \\ 0 &1 &1 \end{bmatrix}$
For which numbers c is $A=LU$ impossible? $\begin{bmatrix} 1 & 2 &0 \\ 3 & c &1 \\ 0 &1 &1 \end{bmatrix}$
743
views
answered
Nov 18, 2018
Linear Algebra
linear-algebra
+
–
1
votes
98
Recursion
How 22 ?
How 22 ?
838
views
answered
Nov 12, 2018
3
votes
99
Pipelining
2.1k
views
answered
Nov 8, 2018
CO and Architecture
pipelining
co-and-architecture
clock-cycles
+
–
2
votes
100
self doubt
Difference between both synchronous and asynchronous I/O on the based of ISR . Means when they are going to invoked during i/o completion ( i.e. before, after ?????? )
Difference between both synchronous and asynchronous I/O on the based of ISR . Means when they are going to invoked during i/o completion ( i.e. before, after ?????? )
323
views
answered
Nov 3, 2018
CO and Architecture
co-and-architecture
input-output
self-doubt
+
–
1
votes
101
Permutation and Combination
An Entrepenuer wants to assign 5 different jobs to 3 of his employees. If every employee is assigned atleast 1 task, how many ways the entrepenuer can assign those task to employees ?
An Entrepenuer wants to assign 5 different jobs to 3 of his employees. If every employee is assigned atleast 1 task, how many ways the entrepenuer can assign those task t...
525
views
answered
Oct 13, 2018
Mathematical Logic
combinatory
engineering-mathematics
+
–
1
votes
102
keneth rosen chapter 6 ex21
A playoff between two teams consists of at most five games. The first team that wins three games wins the playoff. In how many different ways can the playoff occur? (solution without manual calculation).
A playoff between two teams consists of at most five games. The first team that wins three gameswins the playoff. In how many different ways can the playoff occur? (solut...
372
views
answered
Oct 9, 2018
1
votes
103
Irreflexive relation
If Irreflexive relation are represented as directed graphs, then the partitions of an equivalence relation manifest in the form of ______ A) Strongly connected component B) Unilaterally connected component C) Clique D) None of these
If Irreflexive relation are represented as directed graphs, then the partitions of an equivalence relation manifest in the form of ______A) Strongly connected component B...
1.1k
views
answered
Oct 6, 2018
Set Theory & Algebra
discrete-mathematics
set-theory&algebra
irreflexive
relations
bad-question
+
–
3
votes
104
Page tables are stored in memory , which has access time of 100 ns.
Page tables are stored in memory , which has access time of 100 ns. The TLB holding 8 page table entries, has an access time of 10 ns. Using execution of process , it is found that 85 % of the time, a required page table ... requires 2 memory accesses and TLB requires one memory access. A) 38120 ns B) 40000 ns C) 40120 ns D) None
Page tables are stored in memory , which has access time of 100 ns. The TLB holding 8 page table entries, has an access time of 10 ns. Using execution of process , it is ...
5.0k
views
answered
Oct 5, 2018
Operating System
operating-system
virtual-memory
normal
+
–
0
votes
105
Made easy
second one is uncountable?
second one is uncountable?
913
views
answered
Oct 3, 2018
2
votes
106
operating system
Suppose the following jobs are to be executed in a uniprocessor system. Multilevel Feedback Queue(MLQ) is used with queues numbered 1-10, quantum = 2i, where i is thequeue level number and processes are initially placed in the first queue (i.e., level 1). In this schedulingpolicy, each ... 3. 18.6, 3.375, 71.4% 4. 11.6, 3.75, 80.6% Need good explanation :( (answer given is b.)
Suppose the following jobs are to be executed in a uniprocessor system.Multilevel Feedback Queue(MLQ) is used with queues numbered 1-10, quantum = 2i, where i is thequeue...
1.9k
views
answered
Oct 1, 2018
0
votes
107
Linear Algebra RGPV 2001
Test the consistency of the following system of equations and solve if possible $3x + 3y +2z = 1$ $x + 2y = 4$ $10y + 3z = -2$ $2x - 3y -z = 5$
Test the consistency of the following system of equations and solve if possible$3x + 3y +2z = 1$$x + 2y = 4$$10y + 3z = -2$$2x - 3y -z = 5$
759
views
answered
Sep 30, 2018
Linear Algebra
linear-algebra
engineering-mathematics
system-of-equations
+
–
0
votes
108
MIT assigment
Arrange the following functions in their increasing order of complexities. $f(n) = n ^{0.999999} * \log n$ ($\log n$ is not in power) $g(n) = 10000 n$ $h(n) = n^{2}$ $k(n) = (1.000001)^{n}$ $p(n) =\large \frac{2 ^{√n}}{ n^{2}}$ $q(n) = \Large \frac{n^{1.000001}}{\log n}$
Arrange the following functions in their increasing order of complexities.$f(n) = n ^{0.999999} * \log n$ ($\log n$ is not in power)$g(n) = 10000 n$$h(n) = n^{2}...
1.7k
views
answered
Sep 28, 2018
Algorithms
time-complexity
algorithms
asymptotic-notation
+
–
3
votes
109
Kenneth Rosen Edition 6th Exercise 7.4 Question 6 (Page No. 496)
Find the closed form for the generating function for the sequence $\{a_n\}$ where (a)$a_n=\binom{n}{2}$ for $n=0,1,2....$ (b)$a_n=\binom{10}{n+1}$ for $n=0,1,2....$
Find the closed form for the generating function for the sequence $\{a_n\}$ where(a)$a_n=\binom{n}{2}$ for $n=0,1,2....$(b)$a_n=\binom{10}{n+1}$ for $n=0,1,2....$
691
views
answered
Sep 28, 2018
Combinatory
kenneth-rosen
generating-functions
discrete-mathematics
+
–
0
votes
110
PREDICATE LOGIC DOUBT 3
E(x) = x is Earthling A(x) = x is Alien What is the corresponding Well Formed Formula for "Nobody is Earthling unless somebody is Alien" ?
E(x) = x is EarthlingA(x) = x is AlienWhat is the corresponding Well Formed Formula for "Nobody is Earthling unless somebody is Alien" ?
508
views
answered
Sep 28, 2018
0
votes
111
doubt in databases
1.3k
views
answered
Sep 27, 2018
Databases
databases
database-normalization
+
–
0
votes
112
Rosen-Pigeonhole Principle
An arm wrestler is the champion for a period of 75 hours. (Here, by an hour, we mean a period starting from an exact hour, such as 1 P.M., until the next hour.) The arm wrestler had at least one match an hour, but no more than 125 total matches. Show that there is a period of consecutive hours during which the arm wrestler had exactly 24 matches.
An arm wrestler is the champion for a period of 75 hours. (Here, by an hour, we mean a period starting from an exact hour, such as 1 P.M., until the next hour.) The arm w...
1.4k
views
answered
Sep 24, 2018
Combinatory
pigeonhole-principle
combinatory
+
–
0
votes
113
Random variable
468
views
answered
Sep 23, 2018
0
votes
114
test series
Consider the following orders of transactions: T2:R(x); T3:W(x); T3:commit; T1:W(x); T1:commit; T2:R(y); T2:W(z); T2:commit; T4:R(x); T4:R(y); T4:commit. If S is serializable, then how many conflict serial orderings of S is possible? (A)10 (B)11 (C)8 (D)13
Consider the following orders of transactions:T2:R(x); T3:W(x); T3:commit; T1:W(x); T1:commit; T2:R(y); T2:W(z); T2:commit; T4:R(x); T4:R(y); T4:commit.If S is serializab...
6.0k
views
answered
Sep 22, 2018
1
votes
115
How many solutions are there to the equation x+y+z=17 ?They are non-negative integers
How many solutions are there to the equation x+y+z=17 ?They are non-negative integers A) 120 B)171 C)180 D)121
How many solutions are there to the equation x+y+z=17 ?They are non-negative integers A) 120 B)171 C)180 D)121
8.3k
views
answered
Sep 19, 2018
Combinatory
combinatory
+
–
0
votes
116
number of recoverable schedule possible
if transactions are T1:r(A),w(A),r(B),w(B),c T2: r(A),r(B),c then howmany recoverable schedule possible over T1,T2?
if transactions are T1:r(A),w(A),r(B),w(B),c T2: r(A),r(B),cthen howmany recoverable schedule possible over T1,T2?
1.0k
views
answered
Sep 17, 2018
1
votes
117
Estimate the average time to access data from memory
Estimate the average time to access data from memory with the following information, page fault service time = $2$ ms, memory access time = $200$ ns, $10$ page faults for every $10^6$accesses, TLB hit rate = $50\%$, ... to execute the page fault handler and update the v2p mapping (via possible evictions of other pages, reading from disk etc.)
Estimate the average time to access data from memory with the following information, page fault service time = $2$ ms, memory access time = $200$ ns, $10$ page faults for...
347
views
answered
Sep 13, 2018
Operating System
operating-system
non-gate
+
–
1
votes
118
Complexity Question Based on array
Given an array A of size n*n, 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(n^2) B. O(n) C. O(log n) D. O(nlogn)
Given an array A of size n*n, 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 t...
271
views
answered
Sep 7, 2018
Algorithms
algorithms
array
time-complexity
+
–
1
votes
119
Topological Sort
How many Topological Orderings possible?
How many Topological Orderings possible?
852
views
answered
Sep 7, 2018
Algorithms
algorithms
topological-sort
numerical-answers
+
–
0
votes
120
Topological Sort
How many Topological Orderings possible from A to H?
How many Topological Orderings possible from A to H?
2.1k
views
answered
Sep 7, 2018
Algorithms
algorithms
topological-sort
numerical-answers
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
...
36
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register