La sílaba tónica de la palabra libertad es:

La palabra Raúl contiene:

La palabra préstamo es:

La palabra lápiz es:

La sílaba tónica de la palabra estudio es:

La palabra teatro contiene:

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.) 

Suppose the program has page requires as: D, B, A, E, A, F, E, D, E, G, A, B. How many page faults will be occurred when using Second Chance Algorithm, where the buffer size = 3.  

Given the set of SS-tables in LSM.         And the hash functions H1(v), H2(v) where v is a search key as: H1(Alan) = 2                                        H2(Alan) = 4 H1(Bobby) = 4                                     H2(Bobby) = 9 H1(Cathy) = 3                                      H2(Cathy) = 4 H1(Paul) = 0                                        H2(Paul) = 2 H1(Zack) = 5                                        H2(Zack) = 9 H1(David) = 7                                      H2(David) = 1 H1(Eric) = 2                                         H2(Eric) = 3 H1(Fred) = 4                                        H2(Fred) = 1 H1(Harry) = 4                                      H2(Harry) = 2 H1(Owen) = 0                                      H2(Owen) = 4 What are bloom bitmap filters for B1? (length = 10 bits) B1 0 1 2 3 4 5 6 7 8 9 B1 0 _______   B1 1 _______   B1 2 _______   B1 3 _______   B1 4 _______   B1 5 _______   B1 6 _______ B1 7 _______ B1 8 _______   B1 9 _______ Given the set of SS-tables in LSM.          And the hash functions H1(v), H2(v) where v is a search key as: H1(Alan) = 2                                        H2(Alan) = 4 H1(Bobby) = 4                                     H2(Bobby) = 9 H1(Cathy) = 3                                      H2(Cathy) = 4 H1(Paul) = 0                                        H2(Paul) = 2 H1(Zack) = 5                                        H2(Zack) = 9 H1(David) = 7                                      H2(David) = 1 H1(Eric) = 2                                         H2(Eric) = 3 H1(Fred) = 4                                        H2(Fred) = 1 H1(Harry) = 4                                      H2(Harry) = 2 H1(Owen) = 0                                      H2(Owen) = 4 What are bloom bitmap filters for B2? (length = 10 bits) B2 0 1 2 3 4 5 6 7 8 9 B2 0 _______   B2 1 _______   B2 2 _______   B2 3 _______   B2 4 _______   B2 5 _______   B2 6 _______ B2 7 _______ B2 8 _______   B2 9 _______