If the page remains remote during execution the N/100 references will take 1.2N nsec. If it is made local, the access time will be C +0.2N nsec, includ- ing the time to copy it. Thus if C+0.2N< 1.2N. the page should be copied: otherwise, the time to copy it is too much to make the copy worthwhile. For C < N it is worth copying.

If the page remains remote during execution the N/100 references will take 1.2N nsec. If it is made local, the access time will be C +0.2N nsec, includ- ing the time to copy it. Thus if C+0.2N< 1.2N. the page should be copied: otherwise, the time to copy it is too much to make the copy worthwhile. For C < N it is worth copying.

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

Part Two: Implementing a rainbow table You are to write a program, in C/C++, Java or Python, that should run using the following instruction: $ ./Rainbow Passwords.txt where the file Passwords.txt contains a list of possible passwords. The password file contains a password per line, as in the provided words file and consists of strings of printable characters. Any password used must be taken from this file, so the only stored hash information needs to relate to those entries in the file. The program is used to find pre-images for given hash values. Rainbow tables can be used to solve pre-image problems for hash functions. At the simplest level they can simply be a list of hash values and the corresponding pre-images, often from some dictionary. This can be expensive in terms of storage space however, and a more efficient way of identifying pre-images involves the use of the hash function and reduction functions. First step The process is as follows: 1. Read in the list of possible…
Please write in C/C++Write a program that spawn 2 thread: a producer and a consumer The producer thread MUST open an input file and repeatedly copy values to a CIRCULAR BUFFER The consumer should open an output file and repeatedly copy values from the same circular buffer to the file. If the producer is unable to write to the buffer (because it does not contain enough empty elements), or if the consumer is unable to read from the buffer (because it does not contain enough unread items), then it should proceed to the next iteration, choosing a new random number of bytes to copy.
Write a C program mexp that multiplies a square matrix by itself a specified number of times. mexp takes a single argument, which is the path to a file containing a square (k × k) matrix M and a non-negative exponent n. It computes Mn and prints the result. Note that the size of the matrix is not known statically. You must use malloc to allocate space for the matrix once you obtain its size from the input file.To compute Mn , it is sufficient to multiply M by itself n −1 times. That is, M3 = M ×M ×M . Naturally, a different strategy is needed for M0 .Input format The first line of the input file contains an integer k. This indicates the size of the matrix M , which has k rows and k columns.The next k lines in the input file contain k integers. These indicate the content of M. Each line corresponds to a row, beginning with the first (top) row.The final line contains an integer n. This indicates the number of times M will be multiplied by itself. n is guaranteed to be non-negative, but…
Problem Given the target file f0 and candidate files f1-f20, there is an identical copy of f0 among the files f1-f20. Write a python program to perform the following tasks: · Read in each file and calculate the hex hash values by using SHA3 function with the length of 512 for all the given files f0, f1-f20. · Save the hex hash values of each file as a new line in a .txt file named hash.txt file. · Read hash values from hash.txt and compare them to find the identical copy of f0 among f1-f20. · Write the finding result (the matched file name) back to hash.txt Submission • Name your project fileHash.py and submit both fileHash.py and hash.txt on Blackboard. • The program should be properly documented. • The program should have user friendly Input/Output design • Duplicate work (or obviously similar one) will result in an F grade in the course. Grading 1. Include comments as specified in the course syllabus. (10%) 2. Source code and results. · Correctness (70%) · User-friendliness…
Student information is being held in a data area, where each student record has the following format: The first nine bytes are the student number, held in ASCII The next byte is the course mark The next word is the section identifierThere are well over three hundred such student records that have been loaded sequentially into memory starting at address $10000. The last record loaded is a dummy record with a section identifier of $FFFF, to show the end of the records.Write an assembler subroutine GetMax that will scan the entire list and find the highest mark. If there is a tie, the first student in the list with the highest mark should be found. The subroutine should return the starting address of this record in address register a3.
06. Assume that you have built a dense primary B+ tree index on a heap file containing 20,000 records. The key field for this B+ tree index is a 40 byte string and it is a candidate key. Pointers (i.e. record ids and page ids) are (at most) 10 byte values. The size of one disk page is 1,000 bytes . The index was built in a bottom-up fashion using the bulk-loading algorithm, and the nodes were filled up as much as possible. Then there are number levels in the tree.
Computer Science Write a C/C++ program, call it findExt, to find all files in a directory hierarchy, whose extensions are in the extension list provided as arguments to the program. Your program should print the whole pathnames of the found files. Synopsis: findExt <extension-list> [-t target-directory] When target-directory is missing, the working directory (./) will be the target directory Some sample runs: $ findExt txt pdf That is, find all files whose extensions are either txt or pdf in the directory hierarchy ./ $ findExt jpg -t $HOME //target directory is home directory That is, find all files whose extensions is jpg in the directory hierarchy $HOME Requirement: - You must use the system call nftw() that allows you to walk across a file tree. This system call will do all the recursive walk and each time it visits a file or a directory, it will call your own function (a function that you pass as a parameter).
Implement a password cracker using C++ Source code must be well documented (comments). You will be provided with an unsalted hashed password file that contains password hashes for different users. Also, you will be provided with a dictionary file(in clear text) containing the most common passwords. You should implement the offline dictionary attack by trying SHA1 and SHA2 algorithms. Also, your program should brute force all possible alphanumeric(only small cases) passwords from 1 to 4 characters using SHA1 and SHA2 algorithms against all hashed passwords left from the offline dictionary attack (if any).
Part C Consider the standard web log file in assets/logdata.txt. This file records the access a user makes when visiting a web page (like this one!). Each line the log has the following items: • a host (e.g., '146.204.224.152') a user_name (e.g., 'feest6811' note: sometimes the user name is missing! In this case, use '-' as the value for the username.) • the time a request was made (e.g., '21/Jun/2019:15:45:24 -0700') • the post request type (e.g., 'POST /incentivize HTTP/1.1' note: not everything is a POST!) Your task is to convert this into a list of dictionaries, where each dictionary looks like the following: example_dict = {"host":"146.204.224.152", "user_name":"feest6811", "time":"21/Jun/2019:15:45:24 -0700", "request":"POST /incentivize HTTP/1.1"} In [ ]: import re def logs(): with open ("assets/logdata.txt", "r") as file: logdata = file.read() # YOUR CODE HERE raise NotImplementedError(() In [ ]: assert len(logs()) == 979 one_item={'host': '146.204.224.152', 'user_name':…
If I have a file that contains a name and ID number and I would like to store them in a listed link c++ How would that be? If I assign first to the first name and last to first as well and then keep adding names and ids until last is null
For the scramble.c problem, write a program that: • Has a main () function and another function that has this prototype: void scramble str (char s[]); • The scramble_str() function scrambles the contents of the string in a random way so that the string has the same length as before, but the contents are all mixed around. It does this in-place, i.e., there is only one buffer that holds a string. You're free to scramble it any way you want to, but use rand () repeatedly so it gets really scrambled. • The main () function will read a string entered by the user into the buffer, call scramble_str(), and output the resulting string. This will be done in a loop forever, until the entered string is the string "bye". When the user says "bye", the program will exit with a polite message. Do note that reading a string using scanf (), which is the only tool I've introduced you to so far, will just read up to the first whitespace. So, multiple-word strings won't work! Let's use something that will…
using c++ In this assignment you are going to implement your own version of university library system,Thesystem will have two different sides , the first one is to help the librarian to do his job and the other side for admin to manage every one permissions in the system , so You should provide the following features in your system: Admin view o Add/remove Studentso Add/remove librarian o Add/remove other admins Librarian viewo Add/Delete bookso Issue/Return bookso View bookso View Issued bookso Log in /log outo Search for the book(id/name) Simple backend for your system , You could use a file each row should represent itemo Books File should be something like:Id , Book Name, Author Name, Available quantity, Issued Quantity1,Oliver Twist, Charles Dickens,98,2In the previous the first row was the name of each column , you can do that or handle it in your code , id =1 , Book Name =Oliver Twist ..Etc. Tables neededo Books Id  Book Name Author Name Available quantity Issued…