Data Mining 1. Consider the following distance matrix between 9 observations:ACDEFGHB 5.2C 3.92.1D1.26.76.6E8.34.85.53.4F4.97.32.94.72.82.56.11.75.13.57.1H1.33.83.72.67.66.48.2I9.22.47.28.15.93.18.56.5Dradendrogram after applyingarchical agglomerative clustering using the "single"linkage method.

A dendrogram is a network structure. It is constituted of a root node that gives birth to several…

Answered: Data Mining

Engineering

Computer Science

Data Mining

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Consider the below image EIGRP topology and answer the following questions accordingly. 1. Calculate the EIGRP metric using the composite metric formula to reach the internet from R2 to THE INTERNET trough R1 : 2. Calculate the EIGRP metric using the composite metric formula to reach the internet from R2 to THE INTERNET trough R4: 3. Calculate the EIGRP metric using the composite metric formula to reach the internet from R2 to THE INTERNET trough R5: 4. Which router is considered a feasible successor to reach THE INTERNET from R2? * R1 R3 R4 R5 5. Calculate the reported distance from the other 2 routers to reach THE INTERNET: 6. Is there a feasible successor of R2 to reach the Internet? * R1 R3 R4 R5 None of the above
Consider the following page referance string:4,2,2,4,6,4,1,2,3,4,1,2,6,1,5How many page faults would occur for the Second Change (or Clock) Page replacement, assume three frames?Remember that all frames are initially empty, so your first unique pages will cost one fault each
a. Based on the following data, determine the replacement algorithm use: 2 1 2 4 5 3 4 2 3 1 5 1 4 i. FIFOii. CLOCK b. If using 3 frames, which one is better the following replacements:i. LRUii. Optimal c. There is a fundamental difference between page replacement on Android, Linux and Windows. Name and explain the difference.
Consider page reference string of 1 2 3 0 5 0 1 2 1 4 5 0 7 1 2 Using the first in first out (FIFO) page replacement algorithm, draw THREE (3) page frames (3 pages can be in memory at a time during process) for the above-mentioned page reference string. b Calculate the hit rate and fault rate for your answer.
A communication link has a bit rate of 10 Gbps and a length of 20 km. Propagation velocity is 2.5 × 108 m/s and ACK frames are piggybacked on information frames going in the reverse direction, one ACK for every received frame. Information frames are 9000 bytes long. The frame header is 100 bytes. (a) What is the minimum window size that maximizes the effective bit rate? (b) What is the information effective bit rate if the window size is 16 frames?
Consider the following string of page references 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2.Complete a figure similar to Figure 8.14, showing the frame allocation for: FIFO (first-in-first-out)LRU (least recently used)ClockOptimal (assume the page reference string continues with 1, 2, 0, 1, 7, 0, 1)List the total number of page faults and the miss rate for each policy. Count page faults only after all frames have been initialized.
A communication link has a bit rate of 10 Gbps and a length of 20 km. Propagation velocityis 2.5 × 108 m/s and ACK frames are piggybacked on information frames going in the reversedirection, one ACK for every received frame. Information frames are 9000 bytes long. The frameheader is 100 bytes.(a) What is the minimum window size that maximizes the effective bit rate?(b) What is the information effective bit rate if the window size is 16 frames? The final answers are a) Wsmin = 25 (piggybacked means ACKs embedded in info frames), b) 6.53 Gbps
P7. Consider the network fragment shown below. x has only two attached neighbors, w and y. w has a minimum-cost path to destination u (not shown) of 5, and y has a minimum-cost path to u of 6. The complete paths from w and y to u (and between w and y) are not shown. All link costs in the network have strictly positive integer values. a) Give x’s distance vector for destinations w, y, and u. b) Give a link-cost change for either c(x,w) or c(x,y) such that x will inform its neighbors of a new minimum‐cost path to u as a result of executing the distance‐vector algorithm. c) Give a link‐cost change for either c(x,w) or c(x,y) such that x will not inform its neighbors of a new minimum‐cost path to u as a result of executing the distance‐vector algorithm.
P7. Examine the network fragment below. w and y are x's only neighbours. W's minimum-cost route to u (not illustrated) is 5, while y's is 6. The pathways from w and y to u and between them are not indicated. All network link costs are positive integers. 2, Give x's distance vector to w, y, and u.
3. A set of web browsers on the institutional network at USC generates an average of 15.0 requests/second for web objects of size 1.0 Mb. The access link to the public Internet is 15 Mbps. USC’s LAN operates at 1 Gbps. Assume LAN delay and internet delay are negligible. Suppose you installed a web cache and found that access link utilization was reduced to 7.5 Mbps. From your findings, what is the cache hit rate that resulted in this reduction in access link utilization?
A process refers to 5 pages, 1, 2, 3, 4, 5 in the order : 4,1,0,4,2,1,3,4,2,5,2,1,0,4,3,5,2,0,1,4. If the page replacement algorithm is FIFO, the number of page fault with an empty internal store of 3 frames is? 18 17 16 15 14 13 12 11
A demand paging system takes 100 time units to service a page fault and 300 time units to replace a dirty page. Memory access time is 1 time unit. The probability of a page fault is p. In case of a page fault, the probability of page being dirty is also p. It is observed that the average access time is 3 time units. Then the value of p is?