Nandha Arts and Science College, Erode-52

Department of Computer Applications

System Software and Operating System (43A)

UNIT – 1 (SYSTEM SOFTWARE)

1. ____________ translate mnemonic instructions into machine code.

a. Assembler b. Compiler c. Interpreter d. Translator
2. Most system software is machine ____________
a. Independent b. Dependent c. Oriented d. None of the above
3. SIC stands for ____________
a. Sophisticated Instructional Computer b. Simplified Instructional Computer
c. Simplified Information Computer d. Sophisticated Information Computer
4. XE stands for ____________
a. Excess Equipment b. Extra Evaluation
c. Extra Equipment d. Excess Evaluation
5. Memory consists of ____________ bytes.
a. 4 bit b. 8 bit c. 6 bit d. 2 bit
6. A total number of ____________ bytes in the computer memory.
a. 4096 b. 8192 c. 16384 d. 32768
7. There are ____________ registers in SIC machines.
a. Two b. Five c. Eight d. Ten
8. Each register is ____________ in length.
a. 8 bits b. 16 bits c. 24 bits d. 32 bits
9. Integers are stored as 24-bits ____________ number.
a. Binary b. Octal c. Hexadecimal d. Mnemonic
10. ____________ representation is used for negative value.
a. Signed Magnitude b. 1’s Complement
c. 2’s Complement d. Excess-3
11. Characters are stored using their ____________ codes.
a. 6 bit b. 7 bit c. 8 bit d. 16 bit
12. ____________ jumps to the subroutine, placing the return address in register L.
a. Jump b. Goto c. JSUB d. RSUB
13. ____________ returns by address to the address contained in register L.
a. Return b. Return To c. JSUB d. RSUB
14. TD stands for ____________
a. To Device b. Test Device c. Three Device d. Text Device
15. The maximum memory available on a SIC/XE system is ____________
a. 1 MB b. 1 GB c. 1 TB d. 1 PB
16. The ____________ is interpreted as a value between 0 and 1.
a. Fraction b. Exponent c. Flag d. Input
1
17. The _________ is interpreted as an unsigned binary number between 0 and 2047.
a. Fraction b. Exponent c. Flag d. Output
18. The standard version of the SIC machine uses only ____________ addressing.
a. Direct b. Indexed c. Program Counter d. Base
19. ____________ cannot be used with immediate or indirect addressing models.
a. Pointer b. Partition c. Indexing d. Redirecting
20. A ____________ is a system program that performed the loading function.
a. Linker b. Assembler c. Loader d. Compiler
21. The ____________ record is checked to verify that the correct program has been
presented for loading.
a. Define b. Refer c. Header d. Text
22. Loaders that allows for program relocation are called ____________ loader.
a. Relocating b. Bootstrap c. Absolute d. Simple
23. The ____________ record is the same as before except that there is a relocation bit
associated with each word of object code.
a. Define b. Refer c. Header d. Text
24. The relocation bit is gathered together into a ____________
a. Module b. Bit Mask c. Record d. Procedure
25. ____________ is the beginning address in memory where the linked program is to
be loaded.
a. PROGADDR b. CSADDR c. RETADDR d. ESTAB
26. ____________ contains the starting address assigned to the control section currently
begin scanned by the loader.
a. PROGADDR b. CSADDR c. RETADDR d. ESTAB
27. All external symbols are entered in ____________
a. PROGADDR b. CSADDR c. RETADDR d. ESTAB
28. ____________ means the routines are automatically retrieved from a library as they
are needed during linking.
a. Special Call b. Super Call c. Automatic Library Call d. No Call
29. Linking function is performed at execution time is called ____________ linking.
a. Static b. Compile Time c. Library d. Dynamic
30. The _______ perform linking operations before the program is loaded for execution.
a. Linking Loaders b. Linkage Editors c. Absolute Loaders d. Relative Loaders
31. ____________ linking is often used to allow several executing program to share one
copy of a subroutine or library.
a. Static b. Compile Time c. Library d. Dynamic
32. Dynamic linking function is also called ____________
a. Static Load b. Load-on-call c. Compile Time Load d. Library Load
33. ____________ will always contain the actual address of the next instruction.
a. Accumulator b. Base c. Index d. Program Counter
34. State any three types of records ____________
a. Header, Test, End b. Header, Text, End
c. Hyper, Test, End d. Hyper, Text, End
35. Control is simply passed from dynamic loader is called ____________
a. Routine b. Block c. Define d. Record

2
5 Marks

1. Discuss the basic function loader.

2. Write down the features of machine independent loader.
3. What is system software? What are its main components?
4. Summarize about absolute loader algorithm with example.
5. Write note on Pass 1 algorithm.
6. Write note on Pass 2 algorithm.
7. Explain about automatic library search in machine independent loader feature.

8 Marks

1. Discuss on the following:

(i) Linkage Editor.
(ii) Bootstrap Loader.
2. Write in detail about System software and machine architecture.
3. Discuss on the loader design options:
(i) Linkage Editor.
(ii) Dynamic linking
4. Explain in detailed about basic loader function with example.
5. Write about the architecture of SIC standard model.
6. Write about the architecture of SIC / XE model.
7. Discuss about machine dependent loader features
(i) Relocation
8. Discuss about machine dependent loader features
(i) Program Linking

UNIT – 2 (SYSTEM SOFTWARE)

1. A high-level programming language is usually described in terms of a __________

a. Pattern b. Procedure c. Blocks d. Grammar
2. The task of scanning the source statement, recognizing and classifying the various
tokens is known as ____________ Analysis.
a. Lexical b. Syntax c. Semantic d. Symmetric
3. Basic part of the compiler that performs the analytic function is called as
____________
a. Parser b. Linker c. Loader d. Scanner
4. A grammar for a programming language is a formal description of the
____________
a. Lexical b. Syntax c. Semantic d. Symmetric
5. ____________ is taken to mean any terminal symbol
a. Operand b. Operator c. Literal d. Constant
3
6. BNF stands for ____________
a. Block Naur Form b. Bunch Naur Form
c. Backups Naur Form d. Bulk Naur Form
7. The possible BNF grammar for a highly restricted subset of the ____________
language.
a. COBOL b. PASCAL c. PYTHON d. FORTRAN
8. Parsing techniques are divided into two general classes ____________
a. Bottom-up & Data-centric b. Top-down & Process-centric
c. Data-centric & Process-centric d. Top-down & Bottom-up
9. ____________ is used to keep a count of the number of items currently in the list.
a. Count b. Maximum c. List Count d. Capacity
10. The purpose of a ____________ is to translate programs written in high-level
programming languages into machine language.
a. Translator b. Interpreter c. Compiler d. Assembler
11. ____________ is normally done by considering an intermediate form of the
program being compiled.
a. Lexical Analysis b. Syntax Analysis
c. Semantic Analysis d. Code Optimization
12. The executable instructions of the program with a sequence of ____________
a. Statements b. Mnemonics c. Quadruples d. Blocks
13. A ____________ is a sequence of quadruples with one entry point.
a. Basic block b. Procedure c. Container d. Subroutines
14. A ____________ operation is also usually considered to begin a new basic block.
a. New b. Create c. Call d. Connect
15. A typical generation of machine code from these quadruples using only a
____________
a. Single Register b. Two Registers c. Many Registers d. Without register
16. If each integer variable occupies ____________ word of memory.
a. One b. Two c. Three d. Four
17. Most ____________ compilers store arrays in column-major order.
a. COBOL b. PASCAL c. PYTHON d. FORTRAN
18. One important source of code optimization is the ____________
a. Elimination of common sub expressions b. Elimination of blocks
c. Elimination of subroutines d. Elimination of procedures
19. Merging of the bodies of loops is called as ____________
a. Loop inverse b. Loop jamming c. Loop reverse d. Loop survey
20. The first program has been caused by the ____________
a. OS or Loader b. OS or Linker c. OS or Executer d. OS or Runner
21. The first word in an activation record would normally contain a pointer __________
a. BASE b. PREV c. NEXT d. LAST
22. The second word of the activation record contains a pointer ____________
a. BASE b. PREV c. NEXT d. LAST
23. One common method for providing access of variable surrounding blocks uses a
data structure called a ____________
a. Array b. Vector c. Display d. Showcase

4
 24. The compiler was driven by the ____________ process.
a. Translating b. Parsing c. Asymmetric d. Symmetric
25. A ____________ was invoked as each language construct was recognized by the
parser.
a. Code generation routine b. Code adopting routine
c. Code reading routine d. Code addressing routine
26. ____________ processes a source program written in a high-level language just as
the compiler does.
a. Translator b. Assembler c. Interpreter d. Processor
27. An interpreter usually performs ____________ analysis functions.
a. Lexical & Syntactic b. Lexical & Symmetric
c. Syntactic & Symmetric d. Lexical & Semantic
28. P-code compiler is also called ____________ compilers.
a. Port code b. Parse code c. Byte code d. Simple code
29. A ____________ can be used without modification on a wide variety of system.
a. Single pass compiler b. Interpreter
c. P-code compiler d. Compilers-compilers
30. A ____________ is software told that can be used to help in the task of compiler
construction.
a. Single pass compiler b. Interpreter
c. P-code compiler d. Compilers-compilers
31. In some languages a program can be divided into units called ____________
a. Statements b. Mnemonics c. Quadruples d. Blocks
32. Lexical analyser is also known as ____________
a. Scanner b. Parser c. Code generator d. Code optimizer
33. Syntax analyser is also known as ____________
a. Scanner b. Parser c. Code generator d. Code optimizer
34. ____________ executed in very few times.
a. One pass compiler b. Interpreter
c. P-code compiler d. Compilers-compilers
35. ____________ designed for single user micro computer system.
a. Single pass compiler b. Interpreter
c. P-code compiler d. Compilers-compilers
36. Compiler-compiler also known as ____________
a. Compiler unit b. Translator writing system
c. Compiler generation d. Both b and c
37. The READ and WRITE statements are represented with a ___________ operation.
a. Call b. Convert c. Design d. Execute

5 Marks

1. Write the short notes on p-code compiler.

2. Discuss briefly about the machine independent code optimization.
3. Write short notes on phases of the compiler.
4. With about the functioning of one pass and multi pass compilers.
5
 5. Write short notes on intermediate form of the program.
6. Elucidate about interpreters.
7. Explain about compilers-compilers.

8 Marks

1. Discuss in detail about

(i) Lexical analyzer
(ii) Code generation.
2. Give a detailed note on machine dependent compiler features.
3. What is an interpreter? Explain.
4. Explain about the structured variables in machine independent compiler features.
5. Discuss about p-code compiler in detail.
6. Discuss about compiler design options
(i) Division into passes
(ii) Interpreters
7. Discuss about compiler design options
(i) p-code compilers
(ii) Compilers-compilers
8. Write about machine independent compiler features:
(i) Storage allocation
9. Write about machine independent compiler features:
(i) Block structured languages

UNIT – 3 (OPERATING SYSTEM)

1. The term ___________ was first used by the designers of the Multics system in the
1960s.
a. Process b. Processor c. Operation d. Process States
2. Process is ___________
a. Program in execution b. Animated spirit of a procedure
c. Dispatchable unit d. All the above
3. A process should be divided into ___________ states.
a. Ready, Running & Blocked b. Create, Running & Blocked
c. Create, Ready & Running d. Ready, Running & Stopped
4. The ___________ sets a hardware interrupting clock or interval time to allow the
user to utilize the Processor.
a. Operating System b. System Module c. A Program d. A Switch
5. The manifestation of a process in an operating system is a ___________
a. Process Description b. Process Control Block (PCB)
c. Both a & b d. Process Matrix
6
6. The user to run for a specific time interval is also known as ___________
a. Time Slice b. Quantum c. Both a & b d. Random Time
7. The assignment of the CPU to the first process on the ready list is called
___________
a. Transferring b. Locating c. Dispatching d. Linking
8. ___________ is an event that alters the sequence in which a processor executes
instructions.
a. Interrupt b. Dispatcher c. Scheduler d. Monitor
9. An interrupt may be specifically initiated by running process called ___________
a. Trap b. Synchronous c. Both a & b d. Asynchronous
10. An interrupt may or may not be related to the running process called ___________
a. Asynchronous b. Synchronous c. Asymmetric d. Symmetric
11. SVC is stands for ___________
a. Supervisor Call Interrupt b. System Visit Call Interrupt
c. System Vision Call Interrupt d. System Visual Call Interrupt
12. ___________ instruction arrives from another processor on a multi processor
system will restart the system.
a. Signal Processor (SIGP) b. Start Processor
c. Stop Processor d. Restart Processor
13. ___________ caused by wide range of problems that may occur as a program’s
machine language instructions is executed.
a. Program Check Interrupt b. Machine Check Interrupt
c. Input Output Interrupt d. External Interrupt
14. The same amount of space divides main storage into portions called ___________
a. Storage Organization b. Partition c. Storage Management d. Segments
15. ___________ caused by malfunctioning hardware.
a. Program Check Interrupt b. Machine Check Interrupt
c. Input Output Interrupt d. External Interrupt
16. ___________ is defines the manner in which the main storage is viewed.
a. Storage Organization b. Partition c. Storage Management d. Processor
17. ___________ are concerned to obtain the next piece of program from main storage
to secondary storage.
a. Fetch b. Placement c. Replacement d. All the three
18. ___________ data is brought in to the main storage is referenced by a running
program.
a. Demand Fetch b. Placement c. Replacement d. Anticipatory Fetch
19. ___________ Strategies are concerned with determining in main storage to place
incoming programs.
a. Fetch b. Placement c. Replacement d. All the three
20. Today many researchers feel that ___________ will yield improved system
performance.
a. Demand Fetch b. Placement c. Replacement d. Anticipatory Fetch
21. ___________ program had to occupy a single contiguous block of storage location.
a. Contiguous storage allocation b. Non-contiguous storage allocation
c. Overlay storage allocation d. All the three

7
 22. A program is divided into several blocks is called ___________
a. Segments b. Paging c. Partitions d. Blocks
23. Virtual storage system has obviated the need for programmer-controller
___________
a. Segments b. Paging c. Partitions d. Overlays
24. ___________ occurs in every computer system regardless of its storage
organizations.
a. Storage fragmentation b. Storage Overlay
c. Storage compaction d. None of the above

5 Marks

1. Write a brief note on functions of operating system.

2. Describe briefly about the Life cycle of process.
3. Make notes on history of DOS.
4. Discuss about interrupt processing.
5. Write note on overlay structure.
6. Elucidate the concept of protection in single user system.
7. Compare contiguous with non-contiguous storage allocation.

8 Marks

1. Discuss about variable partition multiprogramming.

2. Explain the concept of real storage management strategies.
3. Give a detailed note on single user contiguous storage allocation.
4. Discuss about fixed partition multiprogramming.
5. Elaborate the process state transition with neat diagram.

UNIT – 4 (OPERATING SYSTEM)

1. The page or segment should be brought from secondary to primary storage is called
___________ Strategy
a. Fetch b. Placement c. Replacement d. All the three
2. ___________ Strategy waits for a process to reference a page or segment before
loading it.
a. Demand Fetch b. Placement c. Replacement d. Anticipatory Fetch
3. ___________ Strategy attempt to determine what pages will be referenced for
process.
a. Demand Fetch b. Placement c. Replacement d. Anticipatory Fetch
4. ___________ Strategy determine where in primary storage to place an incoming
page or segment.
a. Demand Fetch b. Placement c. Replacement d. Anticipatory Fetch
8
5. Few placement strategies are ___________
a. First, Best, Worst & Buddy b. First, Best, Worst & Last
c. First, Second, Best & Worst d. First, Second, Best & Worst
6. The page or segment to remove from main memory to make more space is
___________ Strategy.
a. Demand Fetch b. Placement c. Replacement d. Anticipatory Fetch
7. Which of the following is/are replacement strategies ___________
a. First In First Out & Clock b. Second Chance & Random
c. Least Recently Used d. All of the above
8. Incoming page are placed in any available page frame so ___________ system are
trivializing the placement decision.
a. Paging b. Fragmentation c. Compaction d. Replacement
9. The process of which page in primary storage to displace (or) remove to make room
(or) space for an incoming page is ___________ Strategy.
a. Demand Fetch b. Placement c. Replacement d. Anticipatory Fetch
10. The page to replace is the one that will not be used again for the furthest tie into the
future is called ___________
a. First In First Out b. Second Chance
c. Least Recently Used d. The Principle of Optimality
11. The principle of optimality is called ___________
a. OPT or MIN b. Second Chance c. Trivial d. Non Trivial
12. ___________ Replacement selects any page or random page for replacement.
a. First In First Out b. Second Chance
c. Random Page d. The Principle of Optimality
13. The random page replacement is rarely used ___________ approach.
a. Hit b. Miss c. Hit or Miss d. Static
14. ___________, choose the page that has been in storage the longest?
a. First In First Out b. Second Chance
c. Random Page d. The Principle of Optimality
15. ___________ strategy is placed at the fail of the queue and pages are replaced from
the head of the queue.
a. First In First Out b. Second Chance
c. Random Page d. The Principle of Optimality
16. ___________ Strategy selects that page for replacement that has not been used for
the longest time.
a. First In First Out b. Second Chance
c. Least Recently Used d. The Principle of Optimality
17. ___________ Strategy the cache block is removed whenever the cache is
overflowed?
a. First In First Out b. Second Chance
c. Least Recently Used d. The Principle of Optimality
18. In a referenced bit in LRU, the page has not been referenced s denoted as ________
a. Zero b. One c. Asterisk d. Hyphen
19. In a referenced bit in LRU, the page has been referenced is denoted as ___________
a. Zero b. One c. Asterisk d. Hyphen

9
20. The page to be replaced in least frequently used is called ___________
a. First In First Out b. Second Chance
c. Least Recently Used d. The Principle of Optimality
21. In a modified bit in LRU, the page has not been modified is denoted as _________
a. Zero b. One c. Asterisk d. Hyphen
22. In a modified bit in LRU, the page has been modified is denoted as ___________
a. Zero b. One c. Asterisk d. Hyphen
23. The modified bit in LRU, is often called the ___________
a. Dirty bit b. Refer bit c. Later bit d. Update bit
24. The CPU cannot be taken away from that process then the scheduling discipline is
called ___________
a. Preemptive b. Non Preemptive c. Static d. Dynamic
25. The CPU can be taken away from that process, then the scheduling discipline is
called ___________
a. Preemptive b. Non Preemptive c. Static d. Dynamic
26. ___________ does not change.
a. Preemptive b. Non Preemptive c. Static Priority d. Dynamic Priority
27. ___________ mechanisms are responsive to change.
a. Preemptive b. Non Preemptive c. Static Priority d. Dynamic Priority
28. A user with a rush job may be willing to pay a premium; the priority is called
___________
a. Purchased b. Assigned Priority c. Static Priority d. Dynamic Priority
29. Certain jobs are scheduled to be completed by a specific time is called
___________ Scheduling.
a. Static b. Dynamic c. Deadline d. Timing
30. The waste of storage due to excessively large tables is called ___________
a. Paging b. Segmentation c. Fragmentation d. None of the above
31. Real storage is normally divided into fixed-size page frames called ___________
system.
a. Paging b. Segmentation c. Fragmentation d. None of the above
32. Reducing the ___________ of a process's page waits is an important goal of storage
management strategies.
a. Space Time Product b. Space c. Time d. None of the three
33. The process of loading the page into memory is known as ___________
a. Demand Paging b. Segmentation c. Fragmentation d. Thrashing
34. The path of execution a program will take cannot be accurately predicted called
___________ Problem.
a. Exiting b. Halting c. Execution d. Path
35. The time between page faults, called the ___________
a. Inter fault time b. Inter page time c. Inter fetch time d. All the three
36. A view of program paging activity called working set theory of program behaviour
developed by ___________
a. Denning b. Ritchie c. Henry d. Bench
37. The program repeatedly requests pages from secondary storage are called ________
a. Demand Paging b. Segmentation c. Fragmentation d. Thrashing

10
5 Marks

1. Explain briefly about the working set model.

2. What are the basic concepts of virtual memory?
3. Discuss about virtual storage management strategies.
4. Compare and contrast preemptive with non- preemptive scheduling.
5. Write note on page size.
6. Compare paging with segmentation.
7. Short notes on scheduling objectives.
8. State the concepts of priorities.
9. Short notes on deadline scheduling.

8 Marks

1. Explain briefly about page replacement strategies.

2. Discuss in detailed about virtual storage management strategies.
3. Write short note on demand page memory management.
4. Explain about working sets in detail.
5. Discuss in detail about
(i) Paging
(ii) Segmentation
6. Elaborate job and processor scheduling.

UNIT – 5 (OPERATING SYSTEM)

1. Data is recorded on a series of ___________

a. Magnetic disks b. Platters c. Magnetic disks & Platters d. Hard disk
2. Disks are connected by a common ___________ that spins at very high speed.
a. Moving arm b. Boom c. Spindle d. Head
3. ___________ can access only data immediately adjacent to it.
a. Read head b. Write head c. Read/Write head d. Head
4. The time takes for data to rotate from its current position to a position adjacent to
the read-write head is called ___________
a. Latency time b. Transaction time c. Read time d. Writ time
5. The process of moving the boom to a new cylinder is called ___________
a. Read b. Write c. Seek d. Load
6. A particular position of the boom the set of track sketched out by all the read-write
heads forms a vertical ___________
a. Sketch b. Latency c. Selection d. Cylinder
7. ___________ are concerned with the manner in which data store in files.
a. Create b. Delete c. Access d. Remove
11
8. First Come First Serve exhibits a ___________ Pattern in which successive requests
can cause time consuming seeks from the inner most to the outermost cylinder.
a. Static Seek b. Random Seek c. Special Seek d. Purchased Seek
9. ___________ will not perform reordering process of the queue.
a. First Come First Serve b. Shortest Seek Time First
c. SCAN d. N Step SCAN
10. ___________ disk arm is positioned next at the request that minimizes arm
movement.
a. First Come First Serve b. Shortest Seek Time First
c. SCAN d. N Step SCAN
11. One simple modification to the basic scan strategy is called ___________
a. First Come First Serve b. Shortest Seek Time First
c. SCAN d. N Step SCAN
12. ___________ is concerned with providing the mechanism for files to be stored
referred shared and secured.
a. File management b. Storage management
c. Memory management d. All the three
13. ___________ concerned with allocating space for files on secondary storage device.
a. File management b. Primary storage management
c. Auxiliary storage management d. All the three
14. ___________ is concerned with guaranteeing that the information in file is
uncorrupted.
a. File integrity b. Information integrity c. Data integrity d. All the three
15. ___________ Organization refers to the manner in which the records of a file are
arranged secondary storage.
a. File b. Data c. Record d. Information
16. Records are directly accessed records by their physical address on a ___________
storage device.
a. Sequential b. Direct c. Indexed Sequential d. Partitioned
17. ___________ is a file of sequential sub-files.
a. Sequential b. Direct c. Indexed Sequential d. Partitioned
18. Sequential of sub file is called a ___________
a. Member b. Program c. Module d. Index
19. The starting address of each member is stored in the ___________ Directory.
a. File b. Member c. Module d. All the three
20. ___________ files are assigned to sequential areas of secondary storage.
a. Contiguous storage allocation b. Non-contiguous storage allocation
c. Overlay storage allocation d. All the three
21. A ___________ is a control block containing information the system needs to
manage a file.
a. File Descriptor b. File Control Block (FCB)
c. Both a & b d. File Control Matrix (FCM)

12
 22. A ___________ contains entries for all free sectors the disk.
a. Free space list b. Used space list c. Space list d. None of the above
23. One way to control access to file is to create a two-dimensional ___________
a. Process Description b. Process Control Block (PCB)
c. File Descriptor d. Access Control Matrix

5 Marks

1. Describe the characteristic of moving head-disk storage.

2. Write brief note on file descriptor.
3. Mention the manipulation of the file system.
4. What is the need for disk scheduling? Explain.
5. Narrate about access control matrix and file descriptor
6. Write about operation of moving head disk storage.
7. Discuss the following
(i) File characteristics
(ii) File components
8. Showcase the various schemes in file organization.
9. Write notes on allocating, freeing space and contiguous allocation.

8 Marks

1. Elaborate the concept of file system.

2. Write in detailed about access control matrix.
3. Write detailed note on File system implementation.
4. Discuss the following seek optimization techniques
(i) FCFS
(ii) SSTF
(iii) SCAN
5. Functions of file systems.
6. Discuss the following seek optimization techniques
(i) N Step SCAN
(ii) C- SCAN
(iii) Eschenbach scheme
7. Discuss the following block allocation techniques
(i) Block chaining
(ii) Index block chaining
(iii) File oriented file mapping

13