Exam (elaborations)
Advanced Computer Networks Exam Questions with Correct Answers
- Course
- Institution
Advanced Computer Networks Exam Questions with Correct Answers
[Show more]
Content preview
Advanced Computer Networks ExamQuestions with Correct Answers
What do we want from the network (6)? - Answer-Performance
Reliability
Availability
Security
Flexibility
Manageability
What is bandwidth? - Answer-Max rate of data transfer across a given path
- How many data at a time
What is latency? - Answer-The amount of time it takes to delver some data from src to
dst across the network.
- Time to tranmit 1 byte
What is the bottleneck for large objects during the transfer? - Answer-Bandwidth
What are three possible requirements for network Applications? - Answer--
Performance
- Consistency
- Predictability
What is the end-to-end argument? - Answer-Reliable transmission can only be achieved
with end-to-end implementations
What is the fade-sharing principle? - Answer-End systems fail together or not at all. You
do not keep States on intermediary nodes.
Explain Packet VS Circuit switching - Answer-Packet Switching = Message split up in
packets and send over network individualy.
Circuit Switching = Reserve a line for whole Communication.
What are popular Operations in networking? - Answer-Matching and counting
Why are probabilistic data structures more suitable than deterministic ones? - Answer-
Because they are generally faster and consume less space
, What to do if something is critically important (data structure checks)? - Answer-First
probabilistic for fast negative filtering. Then the deterministic (slower) check will be less
frequent.
Explain the bloom filter: - Answer-We maintain M bit cells. Then we apply a hash
function on incoming data and set the corresponding value to 1.
Only supports "Insert" and "Check".
Often multiple hash functions. Elements is then only considered if ALL the hash values
map to 1.
What are the probabilities in bloom filters?
M = Cells
N = Elements
1. Element to be mapped to cell
2. Element not mapped to a cell
3. Probability of a cell being 0
4. False positive rate - Answer-1. Element to be mapped to cell = 1/M
2. Element not mapped to a cell = 1 - (1/M)
3. Probability of a cell being 0 = (1 - (1/M)) ^ N
4. False positive rate = 1 - ((1 - (1/M)) ^ N)
What are the probabilities in bloom filters with multiple hash functions (K)?
M = Cells
N = Elements
1. Element to be mapped to cell
2. Element not mapped to a cell
3. Probability of a cell being 0
4. False positive rate - Answer-1. Element to be mapped to cell = 1/M
2. Element not mapped to a cell = 1 - (1/M)
3. Probability of a cell being 0 = (1 - (1/M)) ^ NK
4. False positive rate = 1 - ((1 - (1/M)) ^ KN) ^ K
What is the tradeoff space for bloom filters? - Answer-Memory
Number of Operations
False Positive Rate
Name two bloom filter extensions - Answer-1. Counting Bloom Filters
2. Invertible Bloom lookup tables
What is Count Min? - Answer-Multiple Bloom filters.
Value + 1 on hit.
When requesting count, we get all and take the min (most probable true value)
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller lectknancy. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $15.49. You're not tied to anything after your purchase.
Can Stuvia be trusted?
4.6 stars on Google & Trustpilot (+1000 reviews)
75323 documents were sold in the last 30 days
Founded in 2010, the go-to place to buy study notes for 14 years now