Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
balaganesh
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by balaganesh
18
answers
1
GATE CSE 2017 Set 2 | Question: 44
Two transactions $T_1$ and $T_2$ are given as $T_1:r_1(X)w_1(X)r_1(Y)w_1(Y)$ $T_2:r_2(Y)w_2(Y)r_2(Z)w_2(Z)$ where $r_i(V)$ denotes a $\textit{read}$ operation by transaction $T_i$ on a variable $V$ and $w_i(V)$ denotes a ... by transaction $T_i$ on a variable $V$. The total number of conflict serializable schedules that can be formed by $T_1$ and $T_2$ is ______
Two transactions $T_1$ and $T_2$ are given as$T_1:r_1(X)w_1(X)r_1(Y)w_1(Y)$$T_2:r_2(Y)w_2(Y)r_2(Z)w_2(Z)$where $r_i(V)$ denotes a $\textit{read}$ operation by transaction...
70.9k
views
commented
Jan 28, 2019
Databases
gatecse-2017-set2
databases
transaction-and-concurrency
numerical-answers
conflict-serializable
+
–
1
answer
2
flow control
Host A is sending data to host B over a full duplex link. A and B are using the sliding window protocol for flow control. The send and receive window sizes are 4 packets each. Data packets (sent only from A to B) are all 1500 bytes long and the transmission time ... What is the maximum achievable throughput in this communication? 3.75 10^6 Bps 7.5 10^6 Bps 10 10^6 Bps 12.75 10^6Bps
Host A is sending data to host B over a full duplex link. A and B are using the sliding window protocol for flow control. The send and receive window sizes are 4 packets...
1.3k
views
answer selected
Jan 7, 2019
Computer Networks
computer-networks
flow-control-methods
+
–
3
answers
3
Operating System
Assume a demand paged memory management system with the following characteristics: page size = 2^12 bytes physical address space = 2^24 bytes logical address space = 2^32 bytes TLB size = 2^6 bytes How many page table entries can fit in the TLB if each entry only contains the information needed for logical to physical translation? A) 16 B)32 C) 22 D)24
Assume a demand paged memory management system with the following characteristics:page size = 2^12 bytesphysical address space = 2^24 byteslogical address space = 2^32 by...
2.4k
views
answered
Dec 30, 2018
0
answers
4
network security
suppose that a message has been encrypted using DES in chipertext block chaining mode.Instead of a single 0 bit being transformed One bit of chipertext in block Ci is accentually transformed from 0 to 1 during transmission. How much plaintext will be grabled as a result? a)1 b)2 c)n- d)n-i+1
suppose that a message has been encrypted using DES in chipertext block chaining mode.Instead of a single 0 bit being transformed One bit of chipertext in block Ci is ac...
141
views
asked
Oct 28, 2018
1
answer
5
network security
suppose that a message has been encrypted using DES in chipertext block chaining mode. One bit of chipertext in block Ci is accedntally transformed from 0to 1during transmissin. How much plaintext will be grabled as a result? a)1 b)2 c)n- d)n-i+1
suppose that a message has been encrypted using DES in chipertext block chaining mode. One bit of chipertext in block Ci is accedntally transformed from 0to 1during trans...
635
views
asked
Oct 28, 2018
Computer Networks
network-security
+
–
0
answers
6
flow control
A series of 1000 bit frames is to be transmitted across a data link 100 km in length at 20 Mbps. If the link has a velocity of propagation 2*10^8 m/s and BER is 2*10 ^-5, then the link utlization for i. selective repeat with send window w=10 ii. go back n with send window w =10 is a) 34%,46% b)46%,20% c)46%,34% d)20%,46%
A series of 1000 bit frames is to be transmitted across a data link 100 km in length at 20 Mbps. If the link has a velocity of propagation 2*10^8 m/s and BER is 2*10 ^-5,...
1.0k
views
asked
Oct 6, 2018
Computer Networks
computer-networks
flow-control-methods
please
+
–
1
answer
7
time complexity
Determine the time complexity of the program segment given below: i= n; while (i>0) { k=1; for (j=1; j<=n; j+=k) { k++; } i= i/2; } (A) O(n2) (B) O(n.log n) (C) O(log2 n) (D) O(log n√n)
Determine the time complexity of the program segment given below:i= n; while (i>0) { k=1; for (j=1; j<=n; j+=k) { k++; } i= i/2; }(A) O(n2)(B) O(n.log n)(C) O(log2 n)(D) ...
3.1k
views
answered
Oct 2, 2018
Algorithms
time-complexity
algorithms
asymptotic-notation
+
–
2
answers
8
minimal DFA
Let L be the set of all binary strings whose last two symbols are the same. The number states of the minimal DFA for L has a)2 b)5 c)8 d)3 explain!!
Let L be the set of all binary strings whose last two symbols are the same. The number states of the minimal DFA for L hasa)2b)5c)8d)3 explain!!
490
views
commented
Sep 25, 2018
Theory of Computation
theory-of-computation
+
–
1
answer
9
time-complexcity
for(i=0;i<n;i++) for(j=0;j<i;j++) for(k=0;k<j;k++) what is the time complexity of above psudo code? explain.
for(i=0;i<n;i++) for(j=0;j<i;j++) for(k=0;k<j;k++) what is the time complexity of above psudo code?explain.
446
views
commented
Sep 23, 2018
Algorithms
time-complexity
algorithms
asymptotic-notation
+
–
0
answers
10
Binary-semaphones
The number of binary semaphores required to implement readers-writers code in busy waiting mode is ------------- answer given as 1. why 1 and why not 2?
The number of binary semaphores required to implement readers-writers code in busy waiting mode is - answer given as 1.why 1 and why not 2?
448
views
commented
Sep 21, 2018
Operating System
operating-system
binary-semaphore
+
–
2
answers
11
dynamic prgramming
Given a two dimensional array A with n rows and k columns initialized to -1 . what is the time complexity of the function f(A,m,m)? int f(int **a,int n,int k) { if ((n<=k)||(k<=1)) return 1; if(a[n][k]==-1) a[n][k]=f(a,n-1,k)+f(a,n-1,k-1); return a[n][k]; } a)theta(m) b)theta(m^2) c)theta(2^m) d)O(1) }
Given a two dimensional array A with n rows and k columns initialized to -1 . what is the time complexity of the function f(A,m,m)?int f(int a,int n,int k){ if ((n<=...
449
views
commented
Sep 18, 2018
Algorithms
dynamic-programming
algorithms
+
–
2
answers
12
alagorithms analysis
The running time of an algorithm is given by T(n)=T(n-1)+T(n-2)-T(n-3), ifn>3 =n, otherwise The order of this algorithm is a)n b)log n c)n^n d)n^2 explain !
The running time of an algorithm is given by T(n)=T(n-1)+T(n-2)-T(n-3), ifn>3 =n, otherwiseThe order of this algorithm isa)nb)log nc)n^nd)n^2 explain !
489
views
commented
Sep 5, 2018
Algorithms
algorithms
asymptotic-notation
+
–
1
answer
13
gate forum
550
views
answered
Sep 2, 2018
Programming in C
recursion
+
–
2
answers
14
Gate CS
#include<stdio.h> int main() { int x, y = 7; x = ++y + ++y + y--; printf("%d\n", x); return 0; } What is the output of this code snippet ? A. 27 B. 26 C. 25 D. Compilation error
#include<stdio.h int main() { int x, y = 7; x = ++y + ++y + y ; printf("%d\n", x); return 0; }What is the output of this code snippet ?A. 27B. 26C. 25D. Compilation error...
587
views
commented
Sep 1, 2018
Programming in C
programming-in-c
undefined-behaviour
+
–
1
answer
15
syntatactically correct?
consider the two declarations void *voidPtr; char *charPtr; which of the following assignments are syntactically correct? (a)charPtr= voidPtr (b)*charPtr=voidPtr (c)*voidPtr=*charPtr (d)voidPtr=charPtr please explain!
consider the two declarationsvoid *voidPtr;char *charPtr;which of the following assignments are syntactically correct?(a)charPtr= voidPtr(b)*charPtr=voidPtr(c)*voidPtr=*c...
3.9k
views
commented
Aug 31, 2018
Programming in C
pointers
+
–
0
answers
16
assignment operators with parameters
the output of the following problem? main() { int a=1,b=2,c=4; printf("%d",a+=(a+=4,10,a)); } Explain?
the output of the following problem?main(){ int a=1,b=2,c=4; printf("%d",a+=(a+=4,10,a));} Explain?
227
views
asked
Aug 31, 2018
Programming in C
output
programming-in-c
+
–
1
answer
17
hashing
given keys: 224562,137456,214562 140145,214576,162145 144467,199645,234534 Using the digit-extraction method (first, third and fifth digits) and quadratic probing, stores the keys shown above in an array with 19 elements. What is the indexes of bin into which all the records are inserted? hint : digit extraction(1,3,5) for 224562->246 mod 19 = 18 and soon.
given keys:224562,137456,214562140145,214576,162145144467,199645,234534Using the digit-extraction method (first, third and fifth digits) and quadratic probing, stores the...
1.5k
views
commented
Aug 31, 2018
DS
quadratic
probing
hashing
data-structures
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register