1) What is the first step in problem-solving? A) Writing code B) Debugging C) Understanding the problem D) Optimizing the solution Answer: C 2) Which of these is not a step in the problem-solving process? A) Algorithm development B) Problem analysis C) Random guessing D) Testing and debugging Answer: C 3) What is an algorithm? A) A high-level programming language B) A step-by-step procedure to solve a problem C) A flowchart D) A data structure Answer: B 4) Which of these is the simplest data structure for representing a sequence of elements? A) Dictionary B) List C) Set D) Tuple Answer: B 5) What does a flowchart represent? A) Errors in a program B) A graphical representation of an algorithm C) The final solution to a problem D) A set of Python modules Answer: B 6) What is pseudocode? A) Code written in Python B) Fake code written for fun C) An informal high-level description of an algorithm D) A tool for testing code Answer: C 7) Which of the following tools is NOT commonly used in pr...
File Concept
File Attributes
* Various OSes keep track of various file attributes, including:
• Name - Some systems give special importance to names, and particularly
extensions ( .exe, .txt, etc. ), and some do not. Some extensions may be of
Importance to the OS ( .exe ), and others only to definite applications ( .jpg )
• Identifier ( e.g. inode number )
• Type - Text, accessible, other binary, etc.
• Location - on the hard drive.
• Size
• Protection
• Time & Date
• User ID
File Operations
* The file ADT helps many common operations:
• Creating a file
• Writing a file
• Reading a file
• Repositioning within a file
• Deleting a file
• Truncating a file.
* Most OSes need that files be opened before process and closed after all process is finished. Generally the programmer must open and close files correctly, but some rare systems open the file automatically at first process. Information about presently open files is stored in an open file table, containing for example:
• File pointer - records the current position in the file, for the next read or write access.
• File-open count - How many times has the current file been opened (At the same time by different processes ) and not yet closed? When this counter reaches zero the file can be deleted from the table.
• Disk location of the file.
• Access rights
* Some systems provide support for file locking.
• A shared lock is for only reading.
• A exclusive lock is for reading as well as writing.
• An advisory lock is informational only, and not inflict.
• A mandatory lock is enforced. ( A truly locked door. )
• UNIX used advisory locks, and Windows uses compulsory locks.
File TypesWindows ( and some other systems ) use special file extensions to imply the type of each file:
* Macintosh keeps a creator attribute for each file, according to the program that first created it with the create( ) system call.
* UNIX stores magic numbers at the starting of certain files. ( Experiment with the "file" command, mainly in directories such as /bin and /dev )
File Structure
* Some files consists of an internal structure, which might or might not be known to the OS.
* For the OS to support specific file formats increases the size and complexity of the OS.
* UNIX treats all files as series of bytes, with no further consideration of the internal structure. ( With the exception of executable binary programs, which it must know how to load and detects the first executable statement, etc. )
* In Macintosh files there are two forks - a resource fork, and a data fork. The resource fork consists of information relating to the UI, such as icons and button images,and can be modified independently of the data fork, which contains the code or data as appropriate.
Internal File Structure
* Disk files are retrieved in units of physical blocks, typically 512 bytes or some power-of-two multiple thereof. (Larger physical disks use larger block sizes, to keep the scale of block numbers within the scale of a 32-bit integer. )
* Internally files are stored in units of logical units, which may be as small as a single byte, or may be a larger size corresponding to some data record or structure size.
* The number of logical units which fit into one physical block determines its packing, and has an effect on the amount of internal segmentation ( wasted space ) that occurs.
* As a general rule, half a physical block is misused for each file, and the larger the block sizes the more space is lost to internal segmentation.