What, exactly, is a buffer?
Question 1 options:
|
a region of a disk drive for storage of bytes |
|
|
the beginning portion of the heap |
|
|
a region of RAM for storage of bytes |
|
|
a pointer to char |
Question 2 (1 point)
What characteristic of buffers makes them efficient and accurate?
Question 2 options:
|
they are implemented on the stack |
|
|
the memory is part of the heap |
|
|
the region of memory is contiguous |
|
|
they are written only in C |
How do we track usage of a buffer?
Question 3 options:
|
move the index of the start byte to the next position beyond the last byte read |
|
|
call the system function, buf_use |
|
|
save the buffer to a file |
|
|
store the number of times a buffer is accessed |
Question 4 (1 point)
In addition to the index of the next byte to read in the buffer, what other information about the buffer do we need to update in order to manage use?
Question 4 options:
|
the address of the buffer |
|
|
either the index of the last byte or the number of bytes stored in the buffer |
|
|
the data type of the buffer |
|
|
the capacity of the buffer |
Question 5 (1 point)
What is the formula for determining whether to refill a buffer?
Question 5 options:
|
if ( start_byte_index - last_byte_index + 1 ) >= count |
|
|
if ( last_byte_index - start_byte_index - 1 ) >= count |
|
|
if ( last_byte_index - start_byte_index + 1 ) >= count |
|
|
if ( start_byte_index - last_byte_index - 1 ) >= count |
1 c) a region of RAM for storage of bytes
2 the memory is part of the heap
3 move the index of the start byte to the next position beyond the last byte read
4 the address of the buffer
5 if ( last_byte_index - start_byte_index + 1 ) >= count
What, exactly, is a buffer? Question 1 options: a region of a disk drive for storage...
Question 1 What characteristic of buffers makes them efficient and accurate? Question options: Question options: they are implemented on the stack the region of memory is contiguous they are written only in C Question 2 In addition to the index of the next byte to read in the buffer, what other information about the buffer do we need to update in order to manage use? Question options: either the index of the last byte or the number of bytes stored...
Problem #1 (25 points) Address Space, Memory Consider a hypothetical 18-bit processor called HYP18 with all registers, including PC and SP, being 18 bits long. The smallest addressable unit in memory is an 8-bit byte. A. (4 points) What is the size of HYP18's address space in bytes and KB? How many address lines does HYP18 require? Address space: Bytes Address space: KB (KiloBytes). Address bus lines: B. (6 points) Assume that first quarter of the address space is dedicated...
1 Mark Question Two Consider a file system on a disk that has both logical and physical block sizes of 512 tebytes. Assume that the information about each file is already in memory. For each of the three allocation strategies (contiguous, linked, and indexed), answer these at questions: a. How is the logical-to-physical address mapping accomplished in this system? (For the indexed allocation, assume that a file is always less than 512 blocks long.) b. If we are currently at...
Really don't know what its about...
Course in operating system, file system
Question 2. File Systems (10 marks) (a) Consider a 32GB hard disk and a FAT file system with 24 bits cluster (block) address. What is the minimum block (cluster) size in order to fully utilize all space in the hard disk? (3 marks) (b) Consider an index-based file system with the inode containing 64 direct pointers, 1 indirect pointer, and 1 double-indirect pointer. Suppose the size of a...
True / False & MCQ 1. Which of the following is true? there are 8 bits in a byte there are 8 bytes in a bit there are 8 tracks in a sector there are 8 sectors in a track none of the above A disk drive writes data from RAM onto a disk storage medium. Computer software can be divided into two categories; the operating system and the applications system. The microprocessors used on personal computers can only understand...
problem
2 and 3
1. For each variable (a-g) describe whether the variable itself is global or local, static or not static, and initialized or uninitialized. (Hints: Global variables are always static. Local variables become static when declared with 'static'. For pointers, consider the pointer itself, not anything the pointer might point to.) 2. For each variable (a-g), describe where it is located when DoFunctionB is running. That is, for each variable, describe whether it is on the stack, in...
Quiz Question 1 (1 point) Saved The maximum value for an int is: Question 1 options: 2147483647 65535 32767 9223372036854775804 Question 2 (1 point) A float has ____ decimal places of accuracy. Question 2 options: 15 none 7 3 Question 3 (1 point) It is a good practice to compare floats and doubles with ==. Question 3 options: True False Question 4 (1 point) Strings are reference data types. Question 4 options: True False Question 5 (1 point) Value data...
Java Questions A class must implement at least one interface. Question 1 options: True False Question 2 (1 point) Abstract methods can be called. Question 2 options: True False Question 3 (1 point) Constructors Question 3 options: Are inherited but cannot be accessed Are inherited and can be accessed Are accessible but are not inherited Are not inherited and cannot be accessed Question 4 (1 point) We can instantiate an object from an abstract class. Question 4 options: True False...
tore means there is a ongarate memery storage for instructions and (I point) (1 point ean be represented by a (2 points) n Deser the DATA mmory mctore of the PICTSF 452 making sure you inelude answers to the along with other general information from the lecture 3 points) h How many arnks are there? e How many banks do we have access to in our programs? Desvile the PROGRAM memory structure of the PICI8F452 making sure you to (3...
QUESTION 1 In a tree, a ____ is a node with successor nodes. root child descendent parent sibling QUESTION 2 In a tree, the ____ is a measure of the distance from a node to the root. count degree branch height level QUESTION 3 Which of the following is not a characteristic of a binary search tree? Each node has zero, one, or two successors. The preorder traversal processes the node first, then the left subtree, and then the right...