Answer carefully

What pathology is represented in this image?

What pathology is shown in this image?

Suppose the program has page requires as: C, B, E, F, C, E, G, B, G, E. 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) = 0                                        H2(Alan) = 3 H1(Bobby) = 2                                     H2(Bobby) = 5 H1(Cathy) = 6                                      H2(Cathy) = 3 H1(Paul) = 5                                        H2(Paul) = 5 H1(Zack) = 6                                        H2(Zack) = 0 H1(David) = 4                                      H2(David) = 8 H1(Eric) = 2                                         H2(Eric) = 2 H1(Fred) = 8                                        H2(Fred) = 3 H1(Harry) = 4                                      H2(Harry) = 3 H1(Owen) = 0                                      H2(Owen) = 2 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) = 0                                        H2(Alan) = 3 H1(Bobby) = 2                                     H2(Bobby) = 5 H1(Cathy) = 6                                      H2(Cathy) = 3 H1(Paul) = 5                                        H2(Paul) = 5 H1(Zack) = 6                                        H2(Zack) = 0 H1(David) = 4                                      H2(David) = 8 H1(Eric) = 2                                         H2(Eric) = 2 H1(Fred) = 8                                        H2(Fred) = 3 H1(Harry) = 4                                      H2(Harry) = 3 H1(Owen) = 0                                      H2(Owen) = 2 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 _______

Create the hash table from the following index key, with the bucket size = 3, and initial hash function: hash1 = index key mod 2, hash2 = index key mod 4, … Give Input index key as:  3, 7, 2, 5, 8, 10, 11, 17, 13, 14. A). What is the hash table after Round 0? (7 points)   B). What is the final hash table? (8 points) Note. Please show each steps, not only the final answer. (Please upload file to answer the question.)

Given the set of SS-tables in LSM.  And the hash functions H1(v), and H2(v) where v is a index key value as: H1(Alan) = 0                                        H2(Alan) = 3 H1(Bobby) = 2                                     H2(Bobby) = 5 H1(Cathy) = 6                                      H2(Cathy) = 3 H1(Paul) = 5                                        H2(Paul) = 5 H1(Zack) = 6                                        H2(Zack) = 0 H1(David) = 4                                      H2(David) = 8 H1(Eric) = 2                                         H2(Eric) = 2 H1(Fred) = 8                                        H2(Fred) = 3 H1(Harry) = 4                                      H2(Harry) = 3 H1(Owen) = 0                                      H2(Owen) = 2 Given B1  1  1  0  1  0  0  0 1 0 1 0 1 2 3 4 5 6 7 8 9   B2  0  1  0  1  1  0  1 1 0  1 0 1 2 3 4 5 6 7 8 9 The false positive will be occurred when searching which index key values?   

Given the set of SS-tables in LSM.  And the hash functions H1(v), and H2(v) where v is a index key value as: H1(Alan) = 0                                        H2(Alan) = 3 H1(Bobby) = 2                                     H2(Bobby) = 5 H1(Cathy) = 6                                      H2(Cathy) = 3 H1(Paul) = 5                                        H2(Paul) = 5 H1(Zack) = 6                                        H2(Zack) = 0 H1(David) = 4                                      H2(David) = 8 H1(Eric) = 2                                         H2(Eric) = 2 H1(Fred) = 8                                        H2(Fred) = 3 H1(Harry) = 4                                      H2(Harry) = 3 H1(Owen) = 0                                      H2(Owen) = 2 Given B1  1  1  0  1  0  0  0 1 0 1 0 1 2 3 4 5 6 7 8 9   B2  0  1  0  1  1  0  1 1 0  1 0 1 2 3 4 5 6 7 8 9 The true positive will be occurred when searching which index key values?   

Given the table imdbs as the following attributes(columns):     Ids: Number     Title: String     Genre:     Director:     Year: Number     Runtime: Number     Rating: Float     Votes: Number     Revenue: Float  Suppose we transfer the above table into collection name “imdb” in MongoDB database name “db”.   Create the MongoDB shell commands that are equivalent as the following SQL Command:             SELECT Title, Ids FROM imdbs WHERE year BETWEEN 2012 AND 2014; For example: SQL Command                                  MongoDB Shell Command SELECT * FROM t1;                           db.t1.find( ); or db.t1.find({ });

Given a record contains 4 attributes as the following:  ID length = 3 bytes (fixed length) NAME variable length AGE length = 2 bytes (fixed length) SALARY length = 5 bytes (fixed length) POSITION variable length   What is the structure of the record (variable length record) for the following information? ID = 199 NAME = Paul Browns AGE = 60 SALARY = Null POSITION = Data Engineering                                  Notes: Null is a null character.