direct-mapped cache work and what might the data replacement policy…

Question Answered step-by-step direct-mapped cache work and what might the data replacement policy… direct-mapped cache work and what might the data replacement policy be? [6 marks] How does a set-associative cache work and what might the data replacement policy be? [6 marks] 3 Digital Communication I You are required to design a topology discovery protocol for a network of switching nodes interconnected by links. There are n nodes, l links, the maximum degree of any . [10 marks…It is suggested to you that an application previously addressed as a constraint satisfaction problem might alternatively be solved using some variant of local search. Is this a reasonable suggestion? If it is, then outline a way in which it might be achieved. If not, then provide a reasoned discussion explaining why. Answer all(a) For vectors u, v ∈ V in linear space V = Rn with u = (u1, u2, . . . , un), define theEuclidean norm ||u||, and state the triangle inequality for ||u + v||.(b) Define cyclical convolution of two periodic sequences f[n] and g[n].(c) If Ψ(x) is a generating (or “mother”) wavelet, give the dyadic shifting and scalingoperations that generate her “daughter” wavelets Ψjk(x) in terms of dilates jand translates k of(x).(d) Why is the dyadic property of wavelets useful for analysing naturally-arisingdata that often exhibits self-similarity across scales? [2 marks](e) Derive the Fourier series of a periodic triangle wave, f(x) = |x| for x ∈ [−π, π]  Write  program to subtract large unsigned integers. Your program should prompt and read in two large unsigned integers. The two large integers should be stored arrays, one array for each integer.Write  program to read a (binary) file of integers, sort the integers, and write them back to the same file.Write program that takes int numbers from user until user gives a sentinel value (loop terminating condition). Sort the numbers in ascending order using Insertion sort method. Sorting part should be done in different function named insertionSort(). The lectures defined Boyce-Codd Normal Form (BCNF) as follows. A relationalschema R is in BCNF if for every functional dependency X  A either• A ∈ X, or• X is a superkey for R(a) Present a relational schema (with functional dependencies) that is not in BCNFand explain how BCNF is violated. (b) Describe a problem that could be encountered in a database implementing yourschema.(c) Decompose your schema into smaller relations that are in BCNF. Justify youranswer.(d) Discuss one cost and one benefit involved in the kind of schema normalisationperformed in (c). (e) Is every BCNF schema free from the problem you described in (b)? Explainyour answer. (a) Moore’s law is an observation by Gordon Moore in the 1960s that trends inelectronic manufacturing technology would result in transistor density doublingevery 18 to 24 months.(i) Explain how Moore’s law can be applied to processor speed and hard diskdensity.(ii) Today transistor scaling favours transistors over wires and thermal densitieslimit performance. Why is this resulting in commercial chips having manyprocessor cores rather than one high-performance processor core?(b) PCI, used to connect I/O boards to a PC, has been replaced with PCIe. Thistransition has resulted in parallel communication being replaced by bundles ofserial communication channels.(i) What is the difference between parallel and serial communication? Whyare multiple serial channels now preferred to a parallel link? (a) A spy elects to use a self-synchronizing scrambler to encode his secret message.Explain why this will not give him any privacy and why his self-synchronisingapproach would be better used by a communications engineer.(b) With the assistance of annotated diagrams explain CSMA/CD and CSMA/CA.In your explanation, note the physical constraints on packets and networks thatthese approaches impose.(c) Consider the network buffer sizing formula B = 2T × C(i) Explain this formula.(ii) Discuss the network architecture and traffic assumptions made in the useof this formula. Here are four options for improving web page performance.Option 1: HTTP Caching with a Forward ProxyOption 2: CDN using DNSOption 3: CDN using anycastOption 4: CDN based on rewriting HTML URLsYou have been asked to help reduce the costs for networking in the University.(a) The University pays its service provider networks’r’us, based on the bandwidth ituses; bandwidth use is dominated by students downloading external web pages.Which, if any, of the above four options would reduce the bandwidth usage?Explain your choice. (a) Considering either TCP/IP or UDP/IP, write a description of how server-port,client-port, source-port and destination-port relate to each other. You may wishto give examples and use diagrams as appropriate. [4 marks](b) What is a routing-loop? Include a diagram in your answer. [4 marks](c) Describe a mechanism that prevents routing-loops in Ethernet networks.[4 marks](d) (i) Describe and, with the aid of an example, illustrate the IP Time-To-Live(TTL) mechanism for minimising the impact of routing-loops.(ii) Assuming, in part (d)(i), a perfect implementation, describe a disadvantageof the approach including the symptoms that might be experienced in anetwork subject to this disadvantage, and a test that may identify theproblem.(e) Explain the technical and architectural argument behind the decision in IPv6to retain header TTL but not a header checksum. [2 marks](f ) Explain why there is ambiguity about handling packets with TTL values of 1and give a practical solution. (a) Deadlock is a classic problem in concurrent systems.(i) What are the four necessary conditions for deadlock? [4 marks](ii) Deadlock is often explained using the Dining Philosopher’s Problem. Inthis pseudo-code, each fork is represented by a lock:Lock forks[] = new Lock[5];// Code for each philosopher (i)while (true) {think();lock(fork[i]);lock(fork[(i + 1) % 5]);eat();unlock(fork[i]);unlock(fork[(i + 1) % 5]); Skip QuestionShow 1 CommentReport Issue   Subject: Networking$10.00    Do you want to answer this question?     Computer Science Engineering & Technology C++ Programming COMM 5894 Share QuestionEmailCopy link Comments (0)