Aperçu des questions

1. 1. The access matrix approach to protection has the difficulty that
2. 2. An integer c is a common divisor of two integers x and y if and only if c is a divisor of x and c is a divisor of y. Which of the following sets of integers could possibly be the set of all common divisors of two integers?
3. 3. In the NoNicks operating system, the time required by a single file-read operation has four nonoverlapping components:
   disk seek time-25 msec
   disk latency time-8 msec
   disk transfer time- 1 msec per 1,000 bytes
   operating system overhead-1 msec per 1,000 bytes + 10 msec
   In version 1 of the system, the file read retrieved blocks of 1,000 bytes. In version 2, the file read (along with the underlying layout on disk) was modified to retrieve blocks of 4,000 bytes. The ratio of-the time required to read a large file under version 2 to the time required to read the same large file under version 1 is approximately
4. 4. You want to cluster 7 points into 3 clusters using the k-Means Clustering algorithm. Suppose after the first iteration, clusters C1, C2 and C3 contain the following two-dimensional points: C1 contains the 2 points: {(0,6), (6,0)} C2 contains the 3 points: {(2,2), (4,4), (6,6)} C3 contains the 2 points: {(5,5), (7,7)} What are the cluster centers computed for these 3 clusters?
5. 5. Any set of Boolean operators that is sufficient to represent all Boolean expressions is said to be complete. Which of the following is NOT complete?

… et 35 autres questions.

Commentaires

Connecte-toi pour commenter.