System Software Exam Paper Winter 2023
Uploaded by
sjtrivediSystem Software Exam Paper Winter 2023
Uploaded by
sjtrivediCommon questions
Powered by AIInterpreters translate and execute source code line-by-line, offering greater flexibility and ease of debugging but generally slow execution speeds. Compilers translate entire programs into machine code before execution, leading to faster runtimes but requiring a complete debugging process for errors. Interpreters are used in development environments where testing and immediate feedback are critical, while compilers suit production environments where performance is paramount .
OPTAB stores mnemonic operation codes and their machine equivalent; it's used during the instruction fetching phase of an assembler. SYMTAB is the symbol table that keeps track of user-defined labels and their memory locations. LITTAB is the literal table that manages constant values that appear in the source code. POOLTAB organizes pools of literals, helping in efficient memory allocation during program assembly .
A self-relocating program contains information that enables it to adjust its operation or data use based on memory location at runtime. This adaptation allows dynamic memory management and execution flexibility. An overlay structure program is designed to run in a constrained memory space by loading sections of the program only when needed, thus managing large programs in limited environments. The key difference is that self-relocating programs adjust according to the address, while overlay programs deal with execution sequences and memory constraints .
Pure interpreters execute source code directly without converting it to machine language, which provides flexibility and ease of modification but often at the cost of slower execution speeds. Impure interpreters perform some level of compilation, caching translations to enhance performance while maintaining some flexibility. The main limitation of pure interpretation is performance inefficiency, while impure interpreters may incur overhead due to intermittent compilation stages .
Top-down parsing builds a parse tree from the root by applying grammar rules to expand non-terminals through a predictive approach, which is straightforward but not suitable for left-recursive grammars. It is efficient for grammars designed for LL parsing techniques (like LL(1)). Bottom-up parsing constructs parse trees from the leaves up. It can handle a larger class of grammars, such as LR grammars, which makes it more powerful for complex language designs. However, it can be more complex to implement due to shift-reduce conflicts that must be resolved .
Program relocation is the process of modifying programs to run in different memory locations than initially coded for, improving utility and resource allocation. Linkers achieve this by updating absolute addresses based on relocated segments and using relocation information within the object code. For example, in segmented memory systems, linkers adjust references according to segment bases, allowing for dynamic memory use and larger program execution across varied memory layouts .
Construction of LL(1) parser tables involves the computation of First and Follow sets for each non-terminal. The First set determines the set of terminals that begin strings derivable from a non-terminal, while the Follow set contains terminals that can appear immediately after the non-terminal in some 'sentential' form. An LL(1) parser table is then constructed by placing grammar rules in table slots indexed by non-terminals and the first sets or follow sets if epsilon (ε) transitions are present. This table enables the parser to decide which rule to apply based on the next input symbol .
A bootstrap loader is a small, specialized program that initializes the system to allow the kernel to load. It executes at startup, performing tasks like setting up hardware and loading the full operating system into memory. Bootstrap loaders are pivotal for ensuring that the operating system is correctly initialized from a powered-off state. They must be concise and efficient, often embedded in system firmware or ROM to function properly during every system boot .
Procedure Oriented Languages (POLs), such as C, are designed with a focus on procedures or routines. They emphasize sequence, selection, and iteration in programming, making them suitable for writing clear, well-structured programs that involve repetitive tasks and computation. Problem Oriented Languages (POLs), like SQL, are designed to solve specific problems, enhancing productivity by allowing users to write fewer lines of code to accomplish complex tasks. POLs are often used in data manipulation and analysis where specific tasks like querying databases are required .
System software can be categorized into several types, including operating systems, device drivers, utility software, and language processors. Operating systems manage hardware resources and provide services for application software. Device drivers enable hardware components to communicate with the operating system. Utility software performs maintenance tasks to ensure the smooth operation of a computer, such as virus scanning and file management. Language processors, including compilers, interpreters, and assemblers, translate high-level language code into machine code. Each type plays a crucial role in maintaining and optimizing the computing environment.