(b) Suppose that a machine prints a status message every minute. Each status message consists of one of the letters A,B,C,D,E or F depending on the machine's internal diagnostics. You suspect that there is a pattern that could predict the occurrence of the next status message being D based on the sequence the previous four (4) messages. You have available a large sequential stream of historical status messages produced by the machine over several days. How would you arrange or transform this data stream, creating appropriate attribute names where required, such that a decision tree learning task could be used to investigate this hypothesis. Further demonstrate this with the first 35 minutes of this status stream included below. B,D,E,A,D,E,E,B,C,B,A,E,E,B,D,B,D,B,F,A,A,B,B,D,D,B,E,E,A,D,E,C,E,E,F,...

(b) Suppose that a machine prints a status message every minute. Each status message consists of one of the letters A,B,C,D,E or F depending on the machine's internal diagnostics. You suspect that there is a pattern that could predict the occurrence of the next status message being D based on the sequence the previous four (4) messages. You have available a large sequential stream of historical status messages produced by the machine over several days. How would you arrange or transform this data stream, creating appropriate attribute names where required, such that a decision tree learning task could be used to investigate this hypothesis. Further demonstrate this with the first 35 minutes of this status stream included below. B,D,E,A,D,E,E,B,C,B,A,E,E,B,D,B,D,B,F,A,A,B,B,D,D,B,E,E,A,D,E,C,E,E,F,...

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

Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving a request at cylinder 2,150, and the previous request was at cylinder 1,805. The queue of pending requests, in FIFO order, is: 2,069 1,212 2,296 2,800 544 1,618 356 1,523 4,956 3,681 Calculate the total seek time for each of the schedules TOTAL DISTANCE TOTAL SEEK TIME FCFS SSTF SCAN LOOK C-SCAN C-LOOK
A system with 6 computer process, P1, P2, P3, P4, P5, P6. their current time stamp 7, 5, 8, 9, 5, 6. All have a common variable X. P2 , P3 and P5 wanted to access X. what wait time will require P2, P3 and P5 use X, assuming each will access X for 1s, and each message passing will require 1s and process time also 1s. use Ricart-Agarwal algorithm suppose P7 failed at 7s, What will be the total time to get the new leader in this ring
Given 4 processes P1, P2,P3,P4 with burst time 4,5,8,1 respectively. What will be the order in which the processes are scheduled according to SJF Algorithm. Assume that all the processes are available at t=0.
When a VA page 30 is written without prior approval, what happens? In the following cases, a TLB managed by software would be more efficient than one managed by hardware:?
38. Consider a computer system with 6 tape drives and 'n' processes completing for them. What is the maximum value of 'n' for the system to be deadlock free? (Assuming that each processes may need 3 tape drives) a. 3 b. 2 c. 4 d. 7
A computer has four page frames. The time of loading, time of last access, and the R and M bits for each page are as show (the times are in clock ticks): Page Loaded Last ref. R M 0 126 280 1 0 1 230 265 0 1 2 140 270 0 0 3 110 285 1 1 At the time of page fault which page will be replaced by following algorithms: 1. FIFO 2. LRU 3. Second chance
How does it effect a user if you refuse to provide a complete service (i.e., the computer does not reply to the user)? Tell us about a time when a 10% denial of service (i.e., a 10% slower rate of computation) caused a major problem for a user. If unauthorized individuals obtain access to a computer system, legitimate users may be refused service. If that's the case, what's the best way to go about it?
Assume the following parameters for Go-Back-N a) N 3 b) Round Trip Time (RTT)10 ms c) Retransmission Timeout period 40 ms d) Segment Size: 1200 bytes. Suppose that Bob sends 7 segments, numbere1 through 7, to Alice using the Go-Back-N mechanism. Suppose that Segment 3 and Segment are lost the first time the segments are sent to Alice, but reach Alice correctly when retransmitted. Apart from the above, there were no other segment losses. What is the average throughput obtained in sending all segments (in bytes/sec)? Draw a diagram to show your work in detail. 2. Assume the following parameters for Selective Repeat: b) Round Trip Time (RTT)10 ms c) Retransmission Timeout period 40 ms d) Segment Size: 1200 bytes Suppose that Bob sends 6 segments, numbered 1 through 6, to Alice using Selective Repeat. Suppose that Segment 3 gets lost the first time Bob sends it to Alice, but reaches Alice correctly when retransmitted Apart from the above, there were no other segment losses. What is the…
A computer uses virtual memory, and a new solid-state drive (SSD) as space for paging. Refer to the last ppt file. In the case presented there, the hard disk drive (HDD) required 25 ms to read in a page, and a rate of 1 page fault per 1000 references introduced a 250 slowdown. If the SSD offers a time of only 80 µs, what is the slowdown in performance caused by 1 pf per 1000 references (you are not concerned with dirty vs. clean pages). What is the maximum rate of page faults you can accept if you want no more than a 5% slowdown in execution using virtual memory? Know your metric prefixes and symbols for time: s for seconds, ms for milliseconds, µs for microseconds, ns for nanoseconds.
Describe a case in which a user's absolute denial of a service (that is, the user receives no answer from the computer) is a major problem for that user. Describe another case in which a 10% denial of service (the user's computation advances, but at a 10% slower rate than normal) is a severe issue for that user. Could unlawful access to a computing system result in a 10% denial of service to legitimate users? If so, how so?
Consider a swapping system in which memory consists of the following hole sizes inmemory order: 12 MB, 4 MB, 20 MB, 12 MB,18 MB, 7 MB, 9 MB and 12 MB.Which hole is taken for successive segment requests of(a) 10MB(b) 15MB(c) 9 MBfor first fit, worst fit, and next fit?
25. When a file is transferred between two computers, two acknowledgement strategies are possible. In the first one, the file is chopped up into packets, which are individually acknowledged by the receiver, but the file transfer as a whole is not acknowledged. In the second one, the packets are not acknowledged individually, but the entire file is acknowledged when it arrives. Discuss these two approaches.