Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged data
0
votes
2
answers
1
Self Doubt
The Total Combinations Possible of Min heap with 8 Distinct elements are ?
The Total Combinations Possible of Min heap with 8 Distinct elements are ?
viral8702
274
views
viral8702
asked
Sep 21, 2023
Programming in C
binary-heap
heap
combinatory
data
data-structures
+
–
0
votes
1
answer
2
Telecommunication
Consider that a signal is transmitted over a channel of bandwidth 200 kHz and the total path loss in the channel is found to be 60dB. The noise power per hertz at the receiver is- 100dBm. Determine the required transmit power to achieve data rate of 40kb/s.
Consider that a signal is transmitted over a channel of bandwidth 200 kHz and the total path loss in the channel is found to be 60dB. The noise power per hertz at the rec...
rayhanrjt
228
views
rayhanrjt
asked
Dec 14, 2022
Computer Networks
data
communication
+
–
0
votes
1
answer
3
Data Communications and Networks, James Irvine and David Harle, Chapter 8, Question 8.1.2.1
An information source produces 8 different symbols with probabilities 1/2, 1/4, 1/8, 1/16, 1/32, 1/64, 1/128, 1/128. These symbols are encoded as 000, 001, 010, 011, 100, 101, 110 and 111, ... ) What is the amount of information per symbol? (ii) What are the probabilities of occurrence for a 0 and a 1?
An information source produces 8 different symbols with probabilities 1/2, 1/4, 1/8, 1/16,1/32, 1/64, 1/128, 1/128. These symbols are encoded as 000, 001, 010, 011, 100, ...
xnanx
305
views
xnanx
asked
Dec 19, 2021
Study Resources
communication
data
+
–
1
votes
3
answers
4
Are all Irrecoverable/Non-Recoverable schedules cascading?
Suppose, T1: W(X), T2: R(X), T1: W(X), T2: Commit, T1: Abort Here we can see T2 is getting committed before T1 aborts, so it is clearly an Irrecoverable schedule but is it cascading?
Suppose,T1: W(X), T2: R(X), T1: W(X), T2: Commit, T1: AbortHere we can see T2 is getting committed before T1 aborts, so it is clearly an Irrecoverable schedule but is it ...
DebRC
701
views
DebRC
asked
Nov 2, 2021
Databases
databases
transaction-and-concurrency
data
+
–
1
votes
1
answer
5
Applied Test Series
Consider a selective repeat sliding window protocol, the window size of the sender is 128. What will be the sequence number for the 800th frame? [ Assume the available sequence number are the minimum required for window size of 128]
Consider a selective repeat sliding window protocol, the window size of the sender is 128. What will be the sequence number for the 800th frame? [ Assume the available se...
LRU
514
views
LRU
asked
Oct 7, 2021
Computer Networks
test-series
computer-networks
data
data-link-layer
+
–
0
votes
1
answer
6
Self doubt
If there is negative edge cycle then dijkstra algorithm will give correct path or not same thing about bellman ford also? Bellman ford always halts or not?
If there is negative edge cycle then dijkstra algorithm will give correct path or not same thing about bellman ford also?Bellman ford always halts or not?
iamdeepakji
265
views
iamdeepakji
asked
Jan 27, 2019
Programming in C
data
data-structures
+
–
0
votes
1
answer
7
self doubt
Please solve this by taking some example Back edge cross edge tree edge Thankyou.
Please solve this by taking some exampleBack edgecross edgetree edgeThankyou.
iamdeepakji
384
views
iamdeepakji
asked
Dec 27, 2018
Programming in C
data
data-structures
+
–
2
votes
0
answers
8
MIT assignment
A geosynchronous satellite has a half-duplex channel with a transmission rate of 10 kbps and a propagation delay of 0.25 sec each way. With a data packet size of 1000 bits and a loss probability p of 0.001 ,(A) what is the expected transmission time of ... parameters are the same as part (a), what is the longest channel propagation delay for which we can still use stop-and-wait?
A geosynchronous satellite has a half-duplex channel with a transmission rate of 10 kbps and a propagation delay of 0.25 sec each way. With a data packet size of 1000 bit...
sushmita
984
views
sushmita
asked
Oct 15, 2018
Computer Networks
computer-networks
network-flow
flow-control-methods
stop-and-wait
data
data-link-layer
+
–
0
votes
1
answer
9
Testbook Test Series: Programming & DS - Stack
A queue is implemented using two stacks S1 and S2. Initially the queue contains 1, 2, 3, 4 from front to rear. The following operations are performed in the queue: delete, insert (5), delete, Then how many total no. of push and pop operations are needed to perform ... ? a) Push: 12 Pop: 13 b) Push: 15 Pop: 16 c) Push: 11 Pop: 10 d) Push: 12 Pop: 11
A queue is implemented using two stacks S1 and S2. Initially the queue contains 1, 2, 3, 4 from frontto rear. The following operations are performed in the queue: delete,...
bhavnakumrawat5
1.2k
views
bhavnakumrawat5
asked
Jul 23, 2018
DS
testbook-test-series
data
data-structures
stack
+
–
0
votes
1
answer
10
array
anyone please explain me how to find loc in lower triangular matrix , i am getting little bit confuse suppose matrix is 1 2 3 4 1 a11 a12 a13 a14 2 a21 a22 a23 a24 3 a31 a32 a33 a34 4 a41 a42 a43 a44 now i have to find location of a[4] b[3]:- given BA=1000 C=1 =1000+ [(4-1) * ((3)(4))/2 +(3-1)]*1 by this way i we get answer but something wrong please exolplain
anyone please explain me how to find loc in lower triangular matrix , i am getting little bit confuse suppose matrix is ...
air1ankit
663
views
air1ankit
asked
Jul 12, 2018
Programming in C
algorithms
data
data-structures
+
–
0
votes
1
answer
11
self doubt
vijju532
411
views
vijju532
asked
Jun 29, 2018
Set Theory & Algebra
data
data-structures
+
–
1
votes
0
answers
12
test series
how to calculate address in 3D array
how to calculate address in 3D array
92komal
384
views
92komal
asked
Jan 21, 2018
DS
data
structure
+
–
0
votes
1
answer
13
madeeasy work book
https://gateoverflow.in/?qa=blob&qa_blobid=12037309044418228871 someone plz solve this question??
https://gateoverflow.in/?qa=blob&qa_blobid=12037309044418228871someone plz solve this question??
aaru14
233
views
aaru14
asked
Dec 6, 2017
Programming in C
data
data-structures
+
–
2
votes
2
answers
14
madeeasy theory book
a sorted array of n elements contains 0 and 1. to find out majority of 0 and 1 how much ime it will take? 1)O(1) 2)O(logn) 3)O(n) 4)O(n^2)
a sorted array of n elements contains 0 and 1. to find out majority of 0 and 1 how much ime it will take?1)O(1)2)O(logn)3)O(n)4)O(n^2)
aaru14
371
views
aaru14
asked
Sep 7, 2017
Programming in C
data
data-structures
+
–
1
votes
0
answers
15
Access control method
please tell me name of access control method in data link layer which are needed for gate 2018?
please tell me name of access control method in data link layer which are needed for gate 2018?
Arjun Kumar 1
622
views
Arjun Kumar 1
asked
Aug 16, 2017
Computer Networks
data
layer
computer-networks
+
–
3
votes
2
answers
16
CN Data link layer
True/False:- 1. The communication between Network layer and Mac sublayer is contention less. 2. The communication between Network layer and LLC sublayer is contention less.
True/False:-1. The communication between Network layer and Mac sublayer is contention less.2. The communication between Network layer and LLC sublayer is contention less....
rahul sharma 5
960
views
rahul sharma 5
asked
Aug 11, 2017
Computer Networks
computer-networks
link
layer
data
+
–
6
votes
2
answers
17
Data Link Layer
Two peer processes A(sender) and B(receiver) use 'stop-and-wait ARQ to send packets over a Single link with capacity C. All packets have the same length of 100 bits. The round-trip time (which is the time until A receives an acknowledgment for a sent packet) is equal to 2 ... which process A sends data to process B? (a) 34.47 bps (b) 49.97 bps c) 51.45 bps (d) 67.75 bps
Two peer processes A(sender) and B(receiver) use 'stop-and—wait ARQ to send packets over a Single link with capacity C. All packets have the same length of100 bits. The...
Ashish Roy
2.8k
views
Ashish Roy
asked
Aug 3, 2017
Computer Networks
computer-networks
data
link
layer
+
–
1
votes
0
answers
18
help and doubt
can anyone please teach me how to find where a functional dependencies are dapendencies preserving or not with examples?
can anyone please teach me how to find where a functional dependencies are dapendencies preserving or not with examples?
Palash Moon
253
views
Palash Moon
asked
Jul 25, 2017
Databases
data
dependency-preserving
+
–
0
votes
1
answer
19
Data Structure and programing
If the address of A[1][1] and A[2][1] are 1000 and 1010 respectively and each element occupies 2 byte then the array has been stored in which order ? 1.row major 2.column major 3. matrix major Answer is row major explain how ?
If the address of A and A are 1000 and 1010 respectively and each element occupies 2 byte then the array has been stored in which order ?1.row major 2.column major 3....
Harikesh Kumar
6.3k
views
Harikesh Kumar
asked
Jun 3, 2017
Programming in C
data
data-structures
programming-in-c
+
–
0
votes
1
answer
20
data cube
Sanjay Sharma
258
views
Sanjay Sharma
asked
Apr 30, 2016
Databases
data
cubes
+
–
0
votes
0
answers
21
data cube
Sanjay Sharma
245
views
Sanjay Sharma
asked
Apr 30, 2016
Databases
data
cubes
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register