Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User sachin486
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by sachin486
0
votes
1
Repeatable Read Problem
Does the schedule below have the repeatable read problem or not? repeatable read problem is when a transaction read a data, then another transaction comes and changes that data, another time that the first transaction wants to read that data the ... schedule doesn't have this problem. What is the correct answer? I have this question for inconsistent analysis too, please?
answered
in
Databases
Feb 20, 2022
421
views
0
votes
2
Doubt about joins on keys
Consider the following relation: R (A B C) A primary key with 100 tuples. S (E F G) E primary key with 50 tuples. T (AE D) AE primary key with 80 tuples. U (D G H) H primary key with 10 tuples. The maximum number of possible records in the result of _______.
answered
in
Databases
Jan 15, 2022
2.2k
views
databases
relational-algebra
0
votes
3
TCP Congestion control AIMD
Consider an instance of TCP's Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of slow start phase is 2 KB and the threshold at the start of first transmission is 32 KB. Assume that 3 ... transmission and 1 duplicate ACK received during 6th transmission. what is the congestion window size at the end of 10th transmission?
answered
in
Computer Networks
Dec 27, 2021
2.0k
views
congestion-control
tcp
0
votes
4
S->AA/ab A->Bd/null B->SB/d remove left recursion
S->AA/ab A->Bd/null B->SB/d remove left recursion
answered
in
Compiler Design
Dec 26, 2021
1.1k
views
compiler-design
left-recursion
grammar
0
votes
5
MadeEasy Test Series: Computer Networks - Distance Vector Routing
answered
in
Computer Networks
Dec 23, 2021
1.3k
views
computer-networks
distance-vector-routing
made-easy-test-series
1
vote
6
Applied Test Series
The solution for process synchronization is given below : Which of the following is correct about the above given solution? (A) Satisfies Mutual Exclusion (B) Satisfies Progress (C) Satisfies Bounded wait (D) Suffers from deadlock
answered
in
Operating System
Dec 23, 2021
541
views
test-series
operating-system
process-synchronization
multiple-selects
0
votes
7
Gateforum Test Series: Computer Networks - Error Detection
Which of the following statements is FALSE for the generator $x^{6}$+1? S1: This generator can detect all burst errors with a length of 5 bits. S2: This generator can detect some but not all burst errors with a length of 6 bits.
answered
in
Computer Networks
Feb 8, 2021
567
views
gateforum-test-series
computer-networks
error-detection
1
vote
8
MadeEasy Test Series 2017: Computer Networks - Distance Vector Routing
Consider the following statements, when a distance vector routing protocol finding minimum cost paths suffers from count to infinity problem: S1 : The count-to-infinity problem may arise in distance vector routing protocol, when network gets disconnected. S2 : ... (A) Only S1 AND S3 (B) Only S2 AND S3 (C) Only S2 (D) All of them
answered
in
Computer Networks
Jan 15, 2021
1.7k
views
made-easy-test-series
computer-networks
distance-vector-routing
0
votes
9
Tanenbaum Networks
A 1024-bit message is sent that contains 992 data bits and 32 CRC bits. CRC is com- puted using the IEEE 802 standardized, 32-degree CRC polynomial. For each of the following, explain whether the errors during message transmission will be detected by the receiver: ( ... burst error. (f) There was a 35-bit long burst error. In the above question can anyone explain for option (c).
answered
in
Computer Networks
Jan 8, 2021
1.4k
views
computer-networks
tanenbaum
1
vote
10
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 18 (Page No. 253)
A 1024-bit message is sent that contains 992 data bits and 32 CRC bits. CRC is computed using the IEEE 802 standardized, 32-degree CRC polynomial. For each of the following, explain whether the errors during message transmission will be ... . (e) There was a 24-bit long burst error. (f) There was a 35-bit long burst error.
answered
in
Computer Networks
Jan 8, 2021
1.8k
views
computer-networks
data-link-layer
tanenbaum
crc-polynomial
error-detection
0
votes
11
Comparisons in merge sort
Can pls someome. Tell.number of comparisons in. Merge sort in best case as well as worst case. Acc to. Me, at. Each level we need O(n) comaprisons and number of levels are log n in merge sort(whether it. Is a best case or worst case).hence mumber o comparisons should be nlogn in worst case as well as best case. Pls guide me.
answered
in
Algorithms
Jan 6, 2021
2.4k
views
algorithms
merge-sort
time-complexity
0
votes
12
Virtual Gate Test Series: Computer Networks - Subnet Mask(Host Id)
In a class $C$ address, $3$ bits are borrowed for subnetting of host id part. Total possible number of subnet masks are _________________.
answered
in
Computer Networks
Dec 28, 2020
599
views
computer-networks
subnetting
virtual-gate-test-series
0
votes
13
What is the effect on line utilization, if we increase the number of frames for a constant message size?
answered
in
Computer Networks
Dec 26, 2020
3.3k
views
computer-networks
sliding-window
0
votes
14
Do we have token ring in Gate 2018 syllabus
Do we have token ring in Gate 2018 syllabus
answered
in
Computer Networks
Dec 25, 2020
1.2k
views
computer-networks
token-ring
0
votes
15
CSMA ALOHA
answered
in
Computer Networks
Dec 25, 2020
373
views
csma-cd
slotted-aloha
computer-networks
0
votes
16
MadeEasy Test Series: Computer Networks - Flow Control Methods
Assume 2 computers are connected via a network. The network uses Go-Back 7 sliding window protocol for maintaining flow control. It is observed that every 5th packet that has been sent through the network is lost. ... number of extra packets that has to be resent for transmitting 10 such packet through the network? With explanation.
answered
in
Computer Networks
Dec 21, 2020
2.5k
views
made-easy-test-series
computer-networks
flow-control-methods
go-back-n
0
votes
17
projection in relational algebra
For the relation instances A and B, A/B is the largest relation instance Q such that Q B ⊆ A. Consider A has exactly two fields x and y and B has just one field y with the same domain as in A. Division operation A/B is defined as the set of all x values (in the form of unary tuples) such ... A) - B) (C) πx(A) - πx((πx(A) B) - A) (D) πx(A) - πx((πx(B) A) - A)
answered
in
Databases
Dec 14, 2020
1.2k
views
relational-algebra
databases
relations
0
votes
18
Gateforum DBMS assesment test(Relational Algebra)(see the image below)
answered
in
Databases
Dec 13, 2020
822
views
gateforum-test-series
databases
relational-algebra
0
votes
19
Why is the maximum number of tuples in full outer join equal to m*n ?
Why is the maximum number of tuples in full outer join equal to m*n, where m is the number of attributes in one relation and n is the attribute count in other ? Can someone give an example to illustrate this ?
answered
in
Databases
Dec 13, 2020
3.3k
views
databases
relational-algebra
0
votes
20
MadeEasy Test Series: Databases - Relational Algebra
Consider relation R' and S' have n' and m' tuples, respectively. Choose the best matching between List-I (Expression) and List-II (Maximum number of tuple): Soln. According to me Answer should be Option C. 1.R union S = m+n (easy nothing to say) 2. ... 2 3 3 3 5 4 3 3 3 6 Now in R natual join S = m * n So option C should suffice isn't it ?
answered
in
Databases
Dec 13, 2020
2.7k
views
made-easy-test-series
databases
relational-algebra
natural-join
0
votes
21
Basic 3NF doubt .
Suppose we have a relation R(ABCD) where AB is candidate key. Now if there is a FD B -> AD, then will this FD satisfy the condition of 3NF ? I mean condition of X->Y where X is super key or Y is prime attribute as here only A is prime attribute on ... above FD as B->A and B->D and here B->A satisfies the condition and B->D doesn't Any help would be appreciated.
answered
in
Databases
Dec 10, 2020
1.9k
views
database-normalization
0
votes
22
NORMALIZATION
WHICH OF THE FOLLOWING IS CORRECT IF RELATION R IS IN 3NF 1. NO NON PRIME ATTRIBUTE OF R IS TRANSITIVELY DEPENDENT ON KEY(SUPER KEY,PRIMARY KEY,CANDIDATE KEY). 2.PRIME ATTRIBUTE OF R CAN BE TRANSITIVELY DEPENDENT ON KEY(SUPER KEY,PRIMARY KEY,CANDIDATE KEY). 3. A ... R. 4.A relation R is in 3NF, if every non-prime attribute of R, is fully functionally dependent on every key of R.
answered
in
Databases
Dec 10, 2020
1.2k
views
database-normalization
0
votes
23
Ace Test Series: Databases - Transactions
Whether the given schedule is conflict serializable or view serializable or none.
answered
in
Databases
Nov 29, 2020
869
views
databases
transaction-and-concurrency
ace-test-series
0
votes
24
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?
answered
in
Databases
Nov 28, 2020
871
views
databases
transaction-and-concurrency
view-serializable
conflict-serializable
0
votes
25
transaction
answered
in
Databases
Nov 27, 2020
562
views
transaction-and-concurrency
databases
test-series
conflict-serializable
1
vote
26
is conservative 2PL is recoverable
is conservative 2PL is recoverable schedule ?
answered
in
Databases
Nov 24, 2020
3.6k
views
2phaselocking
transaction-and-concurrency
1
vote
27
How Strict 2PL avoids unrepeatable read problem?
Please explain. Use the below transaction.
answered
in
Databases
Nov 24, 2020
1.6k
views
transaction-and-concurrency
databases
two-phase-locking-protocol
concurrency
1
vote
28
Raghuramkrishnan
T1: R(X), T2: W(X), T2: commit, T1: W(X), T1: commit, T3: R(X), T3: commit is this allowed in Thomas write rule? if yes then what will be the serial order
answered
in
Databases
Nov 19, 2020
1.1k
views
databases
transaction-and-concurrency
concurrency
timestamp-ordering
view-serializable
0
votes
29
Ace Test Series: DBMS - Transaction And Serializable
answered
in
Databases
Nov 18, 2020
592
views
ace-test-series
databases
transaction-and-concurrency
serializability
0
votes
30
ACE-MockTest-Serializability Problem
answered
in
Databases
Nov 13, 2020
402
views
view-serializable
databases
conflict-serializable
Page:
1
2
3
4
5
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(24)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(682)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
243k
comments
79.6k
users
Recent Blog Comments
Hlo I'm Rupesh I got AIR 3485 in gate CS and AIR...
@Ajay Sasank here is the direct link...
Thank you for the post didi My GATE 2023 & 2024...
I Hope it helps 😊
Today's best post I seen thank you for motivation