Register
Filter

Answers by Bikram

1 votes
161
Self Doubt
Do commit operations matter while checking serilizability?If yes why?
Do commit operations matter while checking serilizability?If yes why?
0 votes
162
Test by Bikram | Theory of Computation | Test 1 | Question: 30
Given a regular grammar $G_1$ and a context free grammar $G_2$, the problem of deciding if $L(G_1)$ is a proper subset of $L(G_2)$ is: Decidable Undecidable but semi-decidable Not even semi-decidable Indeterminable
Given a regular grammar $G_1$ and a context free grammar $G_2$, the problem of deciding if $L(G_1)$ is a proper subset of $L(G_2)$ is:DecidableUndecidable but semi-decida...
0 votes
163
Gateforum Test
1-In self referential relation we alwasy need 1 table. 2-If there is a total participation of one entity with the relation,we can can merge E1,the relation and E2 into a single table. Which of the above given statements are true?
1-In self referential relation we alwasy need 1 table.2-If there is a total participation of one entity with the relation,we can can merge E1,the relation and E2 into a ...
1 votes
165
Test by Bikram | Databases | Test 1 | Question: 4
Each dealer owns one or more cars and each car is owned by at-most one dealer. If Dealer table has $20$ tuples and Cars table has $60$ tuples then owns table can have maximum _____ number of tuples
Each dealer owns one or more cars and each car is owned by at-most one dealer. If Dealer table has $20$ tuples and Cars table has $60$ tuples then owns table can have max...
2 votes
166
maximum value of n to be deadlock
A computer system has 6 tape drives, with n processes competing for them. Each process may need 3 tape drives. What is the maximum value of n for which the system is guaranteed to be deadlock? Justify your answer.
A computer system has 6 tape drives, with n processes competing for them. Each process may need 3 tape drives. What is the maximum value of n for which the system is guar...
2 votes
167
MIN Resource requirement for deadlock
A system is having 3 user process , each requiring 2 units of resource R . WHAT IS the minimum and maximum no. of units of R required such that no deadlock will occur ?
A system is having 3 user process , each requiring 2 units of resource R . WHAT IS the minimum and maximum no. of units of R required such that no deadlock will occ...
4 votes
168
Deadlock
Which is true/false & why 1.) There is a deadlock b/w 2 threads in a process ? 2.) Deadlock occurs with single resource ?
Which is true/false & why 1.) There is a deadlock b/w 2 threads in a process ?2.) Deadlock occurs with single resource ?
9 votes
169
user and kernel mdoe
can anyone tell what are different activities that are performed in kernel mode user mode how to change frm user mode to kernel mode and vice-versa,,
can anyone tell what are different activities that are performed in kernel modeuser modehow to change frm user mode to kernel mode and vice-versa,,
2 votes
170
user and kernel mdoe
can anyone tell what are different activities that are performed in kernel mode user mode how to change frm user mode to kernel mode and vice-versa,,
can anyone tell what are different activities that are performed in kernel modeuser modehow to change frm user mode to kernel mode and vice-versa,,
2 votes
171
#threads
int main() { if(fork() == 0) printf("GATE2018"); if(fork() == 0) printf("GATE2018"); } How many times GATE2018 printed?
int main() { if(fork() == 0) printf("GATE2018"); if(fork() == 0) printf("GATE2018"); }How many times GATE2018 printed?
0 votes
172
#THREADS
if(fork() && fork()) { fork(); } if(fork()||fork()) { fork(); fork(); } printf("XYZ"); How many time XYZ gets printed ?
if(fork() && fork()) {fork();}if(fork()||fork()) {fork();fork();}printf("XYZ");How many time XYZ gets printed ?
1 votes
175
probability_sheldon ross
Which chapter is readable for GATE in A First Course In Probability(Sheldon Ross) Say with its subtopic in detail.....Thank For Answer
Which chapter is readable for GATE in A First Course In Probability(Sheldon Ross) Say with its subtopic in detail.....Thank For Answer
3 votes
176
Deadlock
1) How deadlock is an extreme case of starvation. 2) How deadlock avoidance is less restrictive than deadlock prevention.
1) How deadlock is an extreme case of starvation.2) How deadlock avoidance is less restrictive than deadlock prevention.
3 votes
180
The process of accessing data stored in a serial access memory is similar to manipulating data on a
The process of accessing data stored in a serial access memory is similar to manipulating data on a (A) heap (B) queue (C) stack (D) binary tree
The process of accessing data stored in a serial access memory is similar to manipulating data on a(A) heap (B) queue(C) stack ...
10 votes
182
Test by Bikram | Theory of Computation | Test 1 | Question: 13
An NFA has $10$ states out of which $3$ are final states. The maximum number of final states in converted DFA is: $895$ $894$ $896$ $897$
An NFA has $10$ states out of which $3$ are final states. The maximum number of final states in converted DFA is:$895$$894$$896$$897$
4 votes
183
[DBMS] Number of view equal schedules
Number of schedules view equal to following schedule :- r1(A), w1(B), r2(A), w2(B), r3(A), w3(B)
Number of schedules view equal to following schedule :- r1(A), w1(B), r2(A), w2(B), r3(A), w3(B)
3 votes
185
Operating system concepts
Multi processing OS is an OS with more than one processor it it right?? if its is it implies that throughput is better is these os ans more no. of process can be excecuted per unit time.
Multi processing OS is an OS with more than one processor it it right?? if its is it implies that throughput is better is these os ans more no. of process can be excecute...
1 votes
188
Difference between Memory Access and memory Reference ?
Difference between Memory Access and memory Reference ?
Difference between Memory Access and memory Reference ?
1 votes
190
Toc Peter Linz
can anyone provide solution of Toc Peter Linz 6th edition ?
can anyone provide solution of Toc Peter Linz 6th edition ?
Page: