Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
lifeisshubh
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by lifeisshubh
8
answers
1
GATE CSE 2012 | Question: 32
Fetch_And_Add(X,i) is an atomic Read-Modify-Write instruction that reads the value of memory location $X$, increments it by the value $i$, and returns the old value of $X$. It is used in the pseudocode shown below to implement ... take on a non-zero value when the lock is actually available works correctly but may starve some processes works correctly without starvation
Fetch_And_Add(X,i) is an atomic Read-Modify-Write instruction that reads the value of memory location $X$, increments it by the value $i$, and returns the old value of $X...
29.7k
views
commented
Feb 2, 2017
Operating System
gatecse-2012
operating-system
process-synchronization
normal
+
–
6
answers
2
GATE CSE 2012 | Question: 15
Which of the following statements are TRUE about an SQL query? P : An SQL query can contain a HAVING clause even if it does not have a GROUP BY clause Q : An SQL query can contain a HAVING clause only if it has a GROUP BY clause R : All attributes used ... Not all attributes used in the GROUP BY clause need to appear in the SELECT clause P and R P and S Q and R Q and S
Which of the following statements are TRUE about an SQL query?P : An SQL query can contain a HAVING clause even if it does not have a GROUP BY clauseQ : An SQL query can ...
39.7k
views
commented
Feb 2, 2017
Databases
gatecse-2012
databases
easy
sql
ambiguous
+
–
2
answers
3
Solve the Recurrence
T(n) = 2 T(n) + n
T(n) = 2 T(n) + n
310
views
answered
Feb 2, 2017
Algorithms
algorithms
time-complexity
asymptotic-notation
recurrence-relation
+
–
7
answers
4
GATE CSE 2013 | Question: 52
A computer uses $46\text{-bit}$ virtual address, $32\text{-bit}$ physical address, and a three-level paged page table organization. The page table base register stores the base address of the first-level table $\text{(T1)}$ ... is $64$ bytes. What is the size of a page in $\textsf{KB}$ in this computer? $2$ $4$ $8$ $16$
A computer uses $46\text{-bit}$ virtual address, $32\text{-bit}$ physical address, and a three–level paged page table organization. The page table base register stores ...
37.1k
views
answered
Feb 1, 2017
Operating System
gatecse-2013
operating-system
virtual-memory
normal
+
–
5
answers
5
GATE CSE 2015 Set 3 | Question: 18
Let $L$ be the language represented by the regular expression $\Sigma^*0011\Sigma^*$ where $\Sigma = \{0, 1\}$. What is the minimum number of states in a DFA that recognizes $\bar{L}$ (complement of $L$)? $4$ $5$ $6$ $8$
Let $L$ be the language represented by the regular expression $\Sigma^*0011\Sigma^*$ where $\Sigma = \{0, 1\}$. What is the minimum number of states in a DFA that recogni...
16.9k
views
commented
Jan 31, 2017
Theory of Computation
gatecse-2015-set3
theory-of-computation
finite-automata
normal
minimal-state-automata
+
–
1
answer
6
Graph Theory : Simple Path in Simple Graph
What should be the maximum lenght of path consisting of n veritces ? Is, it should be n or n-1.
What should be the maximum lenght of path consisting of n veritces ?Is, it should be n or n-1.
320
views
asked
Jan 30, 2017
0
answers
7
#Networks #AIMD #TCP #CongessionControl
What is the initial thresold should be taken in AIMD ? Is it is reciever's advertise window size or half of it. Please clearify.
What is the initial thresold should be taken in AIMD ?Is it is reciever's advertise window size or half of it. Please clearify.
421
views
asked
Jan 27, 2017
Computer Networks
aimd
tcp
congestion-control
+
–
4
answers
8
Conflict Serializable and Timestamp based protocol
I know that every schedule produced by the Timestamp-based protocol is conflict serializable. But is vice versa is true? Means is all conflict serializable schedules produced by timestamp based protocol ?
I know that every schedule produced by the Timestamp-based protocol is conflict serializable. But is vice versa is true? Means is all conflict serializable schedules prod...
2.3k
views
asked
Jan 21, 2017
Databases
conflict-serializable
databases
transaction-and-concurrency
+
–
1
answer
9
ERDiagram conversion to Database
Suppose i have Two strong entity E1 and E2 connected by a 1 to many relationship R. E1 <--------- R ---------- E2 How many table will be created when i will convert the above ER diagram into database ? I know that when E2 ... above. I have seen multiple places and found different answer. I am looking for some solid argument with answer. Answer can be 2 or 3.
Suppose i have Two strong entity E1 and E2 connected by a 1 to many relationship R.E1 < - R E2How many table will be created when i will convert the above ER diagram...
444
views
asked
Jan 21, 2017
Databases
databases
er-diagram
rdbms
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register