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 AakS
4
votes
1
GATE CSE 2004 | Question: 68
A hard disk with a transfer rate of $10$ Mbytes/second is constantly transferring data to memory using DMA. The processor runs at $600$ MHz, and takes $300$ and $900$ ... percentage of processor time consumed for the transfer operation? $5.0 \%$ $1.0\%$ $0.5\%$ $0.1\%$
A hard disk with a transfer rate of $10$ Mbytes/second is constantly transferring data to memory using DMA. The processor runs at $600$ MHz, and takes $300$ and $900$ clo...
27.2k
views
answered
Jan 27, 2018
CO and Architecture
gatecse-2004
dma
normal
co-and-architecture
+
–
3
votes
2
GATE CSE 2014 Set 1 | Question: 43
Consider a $6$-stage instruction pipeline, where all stages are perfectly balanced. Assume that there is no cycle-time overhead of pipelining. When an application is executing on this $6$-stage pipeline, the speedup achieved with respect to non-pipelined execution if $25$% of the instructions incur $2$ pipeline stall cycles is ____________
Consider a $6$-stage instruction pipeline, where all stages are perfectly balanced. Assume that there is no cycle-time overhead of pipelining. When an application is exec...
20.0k
views
answered
Jan 4, 2018
CO and Architecture
gatecse-2014-set1
co-and-architecture
pipelining
numerical-answers
normal
+
–
19
votes
3
GATE IT 2004 | Question: 40
Let $M = (K, Σ, Г, Δ, s, F)$ be a pushdown automaton, where $K = (s, f), F = \{f\}, \Sigma = \{a, b\}, Г = \{a\}$ and $Δ = \{((s, a, \epsilon), (s, a)), ((s, b, \epsilon), (s, a)), (( s, a, a), (f, \epsilon)), ((f, a, a), (f, \epsilon)), ((f, b, a), (f, \epsilon))\}$. Which one of the following strings is not a member of $L(M)$? $aaa$ $aabab$ $baaba$ $bab$
Let $M = (K, Σ, Г, Δ, s, F)$ be a pushdown automaton, where$K = (s, f), F = \{f\}, \Sigma = \{a, b\}, Г = \{a\}$ and$Δ = \{((s, a, \epsilon), (s, a)), ((s, b, \epsil...
42.5k
views
answered
Dec 28, 2017
Theory of Computation
gateit-2004
theory-of-computation
pushdown-automata
normal
+
–
4
votes
4
Timestamp Ordering Protocol
Assume basic timestamp ordering protocol and that time starts from $1$, each operation takes unit amount of time and start of transaction $T_i$ is denoted as $S_i$. The table of timestamp is given below: Find $rts(a), wts(a), rts(b)$ and $wts(b)$ at the end 1, 5, 2, 5 1, 7, 3, 3 3, 7, 3, 7 1, 7, 3, 7
Assume basic timestamp ordering protocol and that time starts from $1$, each operation takes unit amount of time and start of transaction $T_i$ is denoted as $S_i$. The t...
7.3k
views
answered
Dec 24, 2017
Databases
databases
transaction-and-concurrency
+
–
3
votes
5
GATE CSE 2010 | Question: 10
In a binary tree with $n$ nodes, every node has an odd number of descendants. Every node is considered to be its own descendant. What is the number of nodes in the tree that have exactly one child? $0$ $1$ $\frac{(n-1)}{2}$ $n-1$
In a binary tree with $n$ nodes, every node has an odd number of descendants. Every node is considered to be its own descendant. What is the number of nodes in the tree ...
16.3k
views
answered
Dec 23, 2017
DS
gatecse-2010
data-structures
binary-tree
normal
+
–
1
votes
6
GATE CSE 2015 Set 1 | Question: 43
The graph shown below has $8$ edges with distinct integer edge weights. The minimum spanning tree (MST) is of weight $36$ and contains the edges: $\{(A, C), (B, C), (B, E), (E, F), (D, F)\}$. The edge weights of only ... which are in the MST are given in the figure shown below. The minimum possible sum of weights of all $8$ edges of this graph is_______________.
The graph shown below has $8$ edges with distinct integer edge weights. The minimum spanning tree (MST) is of weight $36$ and contains the edges: $\{(A, C), (B, C), (B, E...
17.7k
views
answered
Dec 12, 2017
Algorithms
gatecse-2015-set1
algorithms
spanning-tree
normal
numerical-answers
+
–
2
votes
7
GATE IT 2005 | Question: 52
Let $G$ be a weighted undirected graph and e be an edge with maximum weight in $G$. Suppose there is a minimum weight spanning tree in $G$ containing the edge $e$. Which of the following statements is always TRUE? There exists a cutset in $G$ having ... $e$ cannot be contained in a cycle. All edges in $G$ have the same weight.
Let $G$ be a weighted undirected graph and e be an edge with maximum weight in $G$. Suppose there is a minimum weight spanning tree in $G$ containing the edge $e$. Which ...
20.7k
views
answered
Dec 12, 2017
Algorithms
gateit-2005
algorithms
spanning-tree
normal
+
–
18
votes
8
GATE CSE 2001 | Question: 2.22
Consider Peterson's algorithm for mutual exclusion between two concurrent processes i and j. The program executed by process is shown below. repeat flag[i] = true; turn = j; while (P) do no-op; Enter critical section, perform actions, then exit critical section Flag[i] = ... i flag[j] = true and turn = j flag[i] = true and turn = j flag[i] = true and turn = i
Consider Peterson's algorithm for mutual exclusion between two concurrent processes i and j. The program executed by process is shown below.repeat flag[i] = true; turn = ...
27.0k
views
answered
Nov 25, 2017
Operating System
gatecse-2001
operating-system
process-synchronization
normal
+
–
65
votes
9
GATE CSE 2001 | Question: 2.25
Consider a relation geq which represents "greater than or equal to", that is, $(x,y) \in $ geq only if $y \geq x$. create table geq ( ib integer not null, ub integer not null, primary key ib, foreign key (ub) references geq on delete cascade ); Which ... (z,w) with z > x is deleted A tuple (z,w) with w < x is deleted The deletion of (x,y) is prohibited
Consider a relation geq which represents "greater than or equal to", that is, $(x,y) \in $ geq only if $y \geq x$.create table geq ( ib integer not null, ub integer not n...
10.7k
views
answered
Nov 24, 2017
Databases
gatecse-2001
databases
sql
normal
+
–
63
votes
10
GATE IT 2006 | Question: 68
On a wireless link, the probability of packet error is $0.2$. A stop-and-wait protocol is used to transfer data across the link. The channel condition is assumed to be independent of transmission to transmission. What is the average number of transmission attempts required to transfer $100$ packets? $100$ $125$ $150$ $200$
On a wireless link, the probability of packet error is $0.2$. A stop-and-wait protocol is used to transfer data across the link. The channel condition is assumed to be in...
13.4k
views
answered
Oct 21, 2017
Computer Networks
gateit-2006
computer-networks
sliding-window
stop-and-wait
normal
+
–
2
votes
11
GATE CSE 2017 Set 1 | Question: 34
If $G$ is a grammar with productions $S\rightarrow SaS\mid aSb\mid bSa\mid SS\mid\epsilon$ where $S$ is the start variable, then which one of the following strings is not generated by $G$? $abab$ $aaab$ $abbaa$ $babba$
If $G$ is a grammar with productions$S\rightarrow SaS\mid aSb\mid bSa\mid SS\mid\epsilon$where $S$ is the start variable, then which one of the following strings is not g...
11.6k
views
answered
Oct 12, 2017
Theory of Computation
gatecse-2017-set1
theory-of-computation
context-free-language
normal
+
–
4
votes
12
GATE CSE 2003 | Question: 14
The regular expression $0^*(10^*)^*$ denotes the same set as $(1^*0)^*1^*$ $0+(0+10)^*$ $(0+1)^*10(0+1)^*$ None of the above
The regular expression $0^*(10^*)^*$ denotes the same set as$(1^*0)^*1^*$$0+(0+10)^*$$(0+1)^*10(0+1)^*$None of the above
19.2k
views
answered
Oct 4, 2017
Theory of Computation
gatecse-2003
theory-of-computation
regular-expression
easy
+
–
0
votes
13
C Programming
what will be the output of following program ? would this program compile properly ? #include <stdio.h> void swap(int **cc,int *dd) { int t=**cc; **cc=*dd; *dd=t; } void exchange(int *cc,int *dd) { swap(&cc,dd); } int main(void) { int c=10,d=20; printf("befor swap c=%d d=%d \n",c,d); exchange(&c,&d); printf("after swap c=%d d=%d \n",c,d); }
what will be the output of following program ?would this program compile properly ?#include <stdio.h>void swap(int cc,int *dd){int t= cc; cc=*dd; *dd=t;}void exc...
541
views
answered
Sep 30, 2017
Programming in C
programming-in-c
+
–
2
votes
14
Doubt Question on Transaction schedules
Consider a Serial Schedule given- T1 T2 T3 w1(A) w1(B) r2(A) w2(B) r3(A) w3(B) How many schedules which are view equivalent to above schedule? How many schedules which are confilct equivalent to above schedule? ... serializable/ view serializable? If yes How many serial schedules are possible which are conflict equivalent/ view equivalent to able schedule?
Consider a Serial Schedule given-T1T2T3w1(A) w1(B) r2(A) w2(B) r3(A) w3(B) How many schedules which are view equivalent to above schedule?How many schedules whic...
904
views
answered
Sep 30, 2017
Databases
databases
transaction-and-concurrency
view-serializable
conflict-serializable
+
–
7
votes
15
GATE CSE 2006 | Question: 20, ISRO2015-17
Consider the following log sequence of two transactions on a bank account, with initial balance $12000,$ that transfer $2000$ to a mortgage payment and then apply a $5\%$ interest. T1 start T1 B old $=12000$ new $=10000$ ... $3$ because transaction T1 has committed We can apply redo and undo operations in arbitrary order because they are idempotent
Consider the following log sequence of two transactions on a bank account, with initial balance $12000,$ that transfer $2000$ to a mortgage payment and then apply a $5\%$...
28.0k
views
answered
Sep 30, 2017
Databases
gatecse-2006
databases
transaction-and-concurrency
normal
isro2015
+
–
15
votes
16
GATE CSE 2003 | Question: 87
Consider three data items $D1, D2,$ and $D3,$ and the following execution schedule of transactions $T1, T2,$ and $T3.$ In the diagram, $R(D)$ and $W(D)$ denote the actions reading and writing the data item $D$ ... $T2; T1; T3$ The schedule is serializable as $T3; T2; T1$ The schedule is not serializable
Consider three data items $D1, D2,$ and $D3,$ and the following execution schedule of transactions $T1, T2,$ and $T3.$ In the diagram, $R(D)$ and $W(D)$ denote the action...
11.3k
views
answered
Sep 29, 2017
Databases
gatecse-2003
databases
transaction-and-concurrency
normal
+
–
76
votes
17
GATE IT 2005 | Question: 36
Let $P(x)$ and $Q(x)$ ...
Let $P(x)$ and $Q(x)$ be arbitrary predicates. Which of the following statements is always TRUE?$\left(\left(\forall x \left(P\left(x\right) \vee Q\left(x\right)\right)\r...
14.8k
views
answered
Sep 21, 2017
Mathematical Logic
gateit-2005
mathematical-logic
first-order-logic
normal
+
–
44
votes
18
GATE CSE 2016 Set 2 | Question: 50
A file system uses an in-memory cache to cache disk blocks. The miss rate of the cache is shown in the figure. The latency to read a block from the cache is $1$ ms and to read a block from the disk is $10$ ms. Assume that the cost ... in multiples of $10$ MB. The smallest cache size required to ensure an average read latency of less than $6$ ms is _________ MB.
A file system uses an in-memory cache to cache disk blocks. The miss rate of the cache is shown in the figure. The latency to read a block from the cache is $1$ ms and to...
15.0k
views
answered
Aug 18, 2017
CO and Architecture
gatecse-2016-set2
co-and-architecture
cache-memory
normal
numerical-answers
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register