La palabra policía contiene:

Suppose the program has page requires as: 6, 7, 7, 8, 4, 2, 7, 8, 5, 8, 5, 7. Show the buffer’s page allocation using the replacement policy: Least Recently Used-LRU, where the buffer size = 3.  (Please upload file to answer the question.) 

According to the following SQL commands run on SQLite3: CREATE TABLE t(id integer, name text); INSERT INTO t SELECT ABS(RANDOM()%100) AS id, ‘No name’ AS name FROM generate_series(1, 1000); CREATE INDEX name_idx ON t(name); CREATE INDEX id_idx ON t(id); SELECT * FROM dbstat; Using the above table to answer the following questions: If there is RAID level 0 using 3 hard drives for store B+ tree of table t, how many blocks for each drive? _______ blocks

The student data file(fixed length record) contains the following attributes: Id   : Varchar(10) (10 bytes) Name  : Varchar(17) (17 bytes) Phone :  Varchar(10) (10 bytes) GPA : Double (3 bytes) -all GPAs are null values.  And index file(fixed length record) contains the following attributes: Id   : Varchar(8) (8 bytes) Pointer: Double (2 bytes) There are 40,000 records in this data file. We want to store the data and index files in a hard drive with the block(page) size = 2KB ~ 2,000 B. The number of blocks or pages that need for storing the data file in a hard drive = _______ .  (The answer must be integer) The number of blocks or pages that need for storing the index file in a hard drive = _______ . (The answer must be integer) Given RAID level 10 for storing data and index files using 8 hard drives, how many blocks for each drive =  _______ . (The answer must be integer) and a data storage space = _______ % usage. (The answer must be integer)  

Solve for x by factoring 3×2  = 75

Factor completely 6×2 – 11x + 4

Factor completely x2 + 13x + 30

Factor completely 3×2 + 12x – 36

Factor completely xy + 7x – 3y -21

Factor completely 2×2 + 5x – 3