Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Year
Exams
Questions by tamaldeepmaity
User tamaldeepmaity
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User tamaldeepmaity
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
0
answers
Made Easy Test OS
Can a process have bounded waiting and progress even if it has a possibility of deadlock?
asked
Jan 27
in
Operating System

11
views
madeeasytestseries
#operatingsystem
deadlock
0
votes
0
answers
MADE EASY TEST SERIES CFL
Which of the following languages is CFL? (a) ${{a^{m}b^{n}c^{n}  m != n}}$ (b) ${a^{m}b^{n}c^{k}  if (m==n) then (n!=k) }$ (C) ${a^{m}b^{n}c^{k}  (m>n) or (n<k) }$ (d) None of the above
asked
Jan 7
in
Theory of Computation

38
views
madeeasytestseries
theoryofcomputation
contextfreelanguages
0
votes
0
answers
MADE EASY TEST SERIES Memory Access Time
Consider a cache memory which is 30 times faster than main memory and it can be used 90% of the time. Speed up gained by the cache memory is ____.
asked
Dec 28, 2019
in
CO & Architecture

64
views
madeeasytestseries
computerarchitecture
cachememory
+1
vote
1
answer
MADE EASY Test Series: Serializability
S : W1(x) R2(x) W3(x) R4(x) W5(x) R6(x) W7(x) R8(x) Number of serial schedules that are view equivalent to S but not conflict equivalent to S are ____.
asked
Dec 26, 2019
in
Databases

46
views
madeeasytestseries
database
viewserializablity
0
votes
0
answers
MOCK TEST ACE VIEW SERIALIZABILITY
Is this schedule view serializable? Why or why not? T1: R(x), T1: R(y), T1: W(x), T2: R(y), T3: W(y), T1: W(x), T2: R(y)
asked
Dec 23, 2019
in
Databases

46
views
viewserializablity
database
0
votes
0
answers
MOCK TEST ACE TOC
Consider the following questions over $\sum = \begin{Bmatrix} a,b \end{Bmatrix}$ $L_{1} = \begin{Bmatrix} ww  w \in \begin{Bmatrix} a,b \end{Bmatrix}* \end{Bmatrix}$ $L_{2}$ = Complement of $L_{1}$ $L_{3} = L_{1} \bigcup L_{2}$ Which of the above languages is/are Recursively Enumerable but not Context Free Language?
asked
Dec 16, 2019
in
Theory of Computation

22
views
theoryofcomputation
contextfreelanguages
recursively
0
votes
0
answers
MOCK TEST ACE
Let [A;R] is a totally ordered set with n elements (n>2). If [A;R] is a Boolean Algebra then n = ?
asked
Dec 15, 2019
in
Set Theory & Algebra

23
views
engineeringmathematics
settheory
0
votes
0
answers
ACE MOCK TEST
Consider a system having 10 IO bound jobs and 1 CPU bound job. If IO bound job issues an IO request once for every ms of CPU computation and that each IO request takes 10 ms. If contextswitch overhead is 0.1ms, using round robin scheduling with a time quantum of 10 ms, CPU efficiency = ___
asked
Dec 9, 2019
in
Operating System

10
views
operatingsystem
0
votes
0
answers
ACE Mock Test Sets
Question: One quarter of 5 element subsets of {1,2,3,4,….n} contain 7, then n = ? My answer: $\frac{C(n1,4)}{C(n,5)} = \frac{1}{4} \Rightarrow n = 20$ Given answer: $\frac{C(n,4)}{C(n,5)} = \frac{1}{4} \Rightarrow n = 24$ I think I am correct because once we consider 7 as an element we can choose only 4 remaining elements, but can you please confirm the same?
asked
Dec 6, 2019
in
Linear Algebra

10
views
engineeringmathematics
settheory
0
votes
1
answer
Self doubt on Predicate Logic quantifier position implications
asked
Nov 24, 2019
in
Mathematical Logic

22
views
predicate_logic
engineeringmaths
discrete_maths
7,536
questions
1,781
answers
10,866
comments
90,472
users