Problem 0. Suppose a file contains 100 bytes of data. A program successfully opens it for both reading and writing (i.e., passing the mode 0_READWR to open()), and gets back a file descriptor number fd. a. The program, which has a 40-byte buffer, issues a call to read() for 40 bytes. It processes that data, and then repeats the call. Both calls return the exact amount requested. Then it issues a third read, again requesting 40 bytes. What value will it return? (Assume no other program has the file open.) b. Next the program calls write(fd, buffer, 40), and the call returns 40. Then it issues another read() call for 40 bytes. What value does that call return? c. Suppose the programmer needs to read back the 40 bytes just written. First it must use 1seek () to reposition the file pointer. What parameters should it invoke 1seek () with so that the next read call will return the 40 bytes just written?

Problem 0. Suppose a file contains 100 bytes of data. A program successfully opens it for both reading and writing (i.e., passing the mode 0_READWR to open()), and gets back a file descriptor number fd. a. The program, which has a 40-byte buffer, issues a call to read() for 40 bytes. It processes that data, and then repeats the call. Both calls return the exact amount requested. Then it issues a third read, again requesting 40 bytes. What value will it return? (Assume no other program has the file open.) b. Next the program calls write(fd, buffer, 40), and the call returns 40. Then it issues another read() call for 40 bytes. What value does that call return? c. Suppose the programmer needs to read back the 40 bytes just written. First it must use 1seek () to reposition the file pointer. What parameters should it invoke 1seek () with so that the next read call will return the 40 bytes just written?

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

C Program Task Write a programme called pgmReduce which takes 3 arguments:1. an input file (either ASCII or binary)2. an integer factor n, and3. an output fileand reduces the input file by that factor in each dimension. For example, if the invocation is:pgmReduce inputFile 5 outputFileand inputFile is a 13x17 image, then outputFile should be a 2x3 image in which only thepixels with row and column of 0 modulo 5 in the inputFile exist.
Problem 3. This problem is about the same file foo as in the previous problem, but before it is modified. A program opens it for reading and gets back the file descriptor number fd. The program has a character array char buf [30]. The program now does the following: if ((rv = read (fd, buf,20)) < 0) { ...handle error... } if ((rv = read(fd,buf,20)) < 0) { ...handle error...} a. What does each call return (assuming no errors)? b. What do the first 20 bytes of the character array buf contain after the second read call? c. What do the last 10 bytes of buf contain?
write a program for I/O system calls. ALGORITHM:1. Start the program.2. open a file for O_RDWR for R/W,O_CREATE for creating a file , O_TRUNC fortruncate a file3. Using getchar(), read the character and stored in the string[] array4. The string [] array is write into a file close it.5. Then the first is opened for read only mode and read the characters and displayed It andclose the file6. Stop the program
Computer Science Write a C++ language program that reads the file numbers.txt having 10,000 random integers ranging from 1-1,000,000. It takes an input argument num_jobs with a value between 1 and 8. E.g. if num_jobs is 3, it splits into 3 parallel processes using fork() function and each process then calculates prime numbers from a subset of the input data. Together these 3 jobs find prime numbers from all the 10,000 input integers. The overall parent process then combines the results from its children into a single file prime.txt. NOTE: The key part is to solve it with fork()
Goal:Experimenting with AES-128 symmetric key cipher. Note:Using Python programming language that provided libraries for AES. Description:PART 1: write a program that uses AES-128 to decrypt a message. The program should be named "decrypt", and should deal with three files that contain the encrypted text as a stream of bytes, the 128-bit key for decryption stored as a stream of bytes, and the outcome of the decryption, respectively.- To test this program, here's an example of an encrypted message (ciphertext.dat) and its 128-bit secret key (key.dat). PART 2: you will try to use "brute force" to decrypt an encrypted message, where you only have the first 96-bits of the 128-bit secret key (last 4 bytes of the secret key are missing!) The program should be called "findk", and should deal with two files that contain the encrypted text as a stream of bytes and the first 96-bits of the key, respectively. The program should print out on standard output the missing 4 bytes of the key in…
implementation of Caesar Cipher Using Python Write Code: You are required to implement the Caesar Cipher encryption/decryption algorithm in Python. Remember to implement the algorithm in such a way that it takes a file as input, encrypts it and store in the current directory. This encrypted file must checkable. The implementation must have a decryption procedure which takes the encrypted file from the current directory, decrypts it and store it with some specific name in the current directory. The name should be different from the original file so that it can be verified.
In python, rite a recursive function, displayFiles, that expects a pathname as an argument. The path name can be either the name of a file or the name of a directory. If the pathname refers to a file, its filepath is displayed, followed by its contents, like so: File name: file_path Lorem ipsum dolor sit amet, consectetur adipiscing elit... Otherwise, if the pathname refers to a directory, the function is applied to each name in the directory, like so: Directory name: directory_path File name: file_path1 Lorem ipsum dolor sit amet... File name: file_path2 Lorem ipsum dolor sit amet... ... Test this function in a new program.
C++ : Searching for a target can be faster if the elements in the file are sorted (are in order). Use a text editor to createa file of integers separated by one space character as shown below. Then use a program to find if a given integer is in thefile. Note that searching time makes a lot of difference if the file is very large, although we test with a small file.14 17 24 32 48 52 64 74 81 92
Write a Java application that performs the following for an user The user is provided with the following menu option • Write UTF-16 Character to a file (File name is sample.txt) Read all UTF-16 Characters from the file sample.txt The user should be able to perform the above mentioned operation any number of times without exiting the system and without losing the data entered in the file.
In Python Define a function writeScores with two parameters. The first should be the name of a file, and the second should be a list of integer scores. The set of scores should be appended to the given file, one score per line.
3. Task 2: Reading lines from a File Write C code which will read a line of characters (terminated by a \n) from input_file into a character array called buffer. NULL terminate the buffer upon reading a \n. NOTE:Your source code must display any of the given sample output below.It means your source code should be flexible enough to meet any of the given sample output.Your source code output must be identical to any of the given sample output.It means you have to strictly follow what are the displayed text, labels, casing of characters in the sample output.Strictly follow the naming of file. Sample OUTPUT1: Enter File Name: lupang_hinirang.txt Bayang magiliw Perlas ng silanganan Alab ng puso sa dibdib mo’y buhay Lupang Hinirang, duyan ka ng magiting Sa manlulupig, di ka pasisiil Sa dagat at bundok na simoy At sa langit mong bughaw Tagumpay na nagnininging Ang bituin at araw niyan Kailan pa ma’y di magdidilim Lupa ng araw ng luwalhati’t pagsinta Buhay ay…
Computer Science In this problem you will create a simple implementation of the FlajoletMartin algorithm using Python. The stream will be the contents of a text file and you will produce an approximation of the number of unique words in the file as given by the algorithm. You will need to process the file one line at a time and may not store any part of the file. You can obtain words by splitting the lines on whitespace. Your code will be run from a terminal according to the following command cat filename | python your_code.py. If you are running OSX then you can run this from the terminal. If you are using Windows you should make use of the Ubuntu terminal installed for running Spark. Your code will need to read from sys.stdin. You may not use list, dictionaries, or any other container as these are not employed by the algorithm. You may use Python’s built-in hash and bin functions. hash will create a number from a string and bin will give you a binary conversion of this number that…