Computer & IT

note!Answer: D) synthesize the target program.
Pass I builds the symbol table and intermediate code. Pass II uses them to generate the final target (machine) program.

note!Answer: C) links the program with other programs needed for its execution.
A linker combines object modules and library routines the program needs into one executable. Relocation is done by the loader, and placing the program in memory is also loader work.

note!Answer: C) Round-Robin.
Round-Robin gives each process a fixed time slice in turn, which suits interactive time-sharing. The other policies do not give fair, responsive time slices.

note!Answer: A) 4.
With n processes each needing m units, deadlock is avoided when total units = n(m−1)+1 = 3(2−1)+1 = 4.

note!Answer: B) is likely to be the one of the pages used in the last few page references.
Locality of reference means that recently used pages are likely to be referenced again soon.

note!Answer: B) Secure it for transmission
Encryption protects data confidentiality, especially when the file is sent over a network.

note!Answer: A) Structured into two halves called top half and bottom half
UNIX device drivers are divided into a top half (called from processes) and a bottom half (interrupt handling).

note!Answer: C) RU policy (Recurrently used)
LRU, FIFO and Optimal are standard page replacement policies; 'RU' is not one.

note!Answer: C) 70000
The relocation register holds the actual start address of the allocated memory, which is 70000.

note!Answer: A) low level programming language
Assembly language is a low-level language that closely maps to machine instructions.

note!Answer: B) Long term scheduler.
The long term (job) scheduler selects jobs from secondary storage and loads them into memory. The short term scheduler picks from the ready queue.

note!Answer: B) Shortest job first Scheduling
Shortest Job First (SJF) gives the CPU to the process with the smallest next CPU burst.

note!Answer: A) time since its submission to the time its results become available.
Turnaround time is the interval from submission of a job to the availability of its results.

note!Answer: A) forced de allocation of the CPU from a program which is executing on the CPU.
Preemption means the operating system forcibly takes the CPU away from a running process.

note!Answer: C) machine dependant.
An assembler translates assembly code into machine code for a specific processor, so it is machine dependent.

note!Answer: C) Least Recently Used.
LRU (Least Recently Used) replaces the page that has not been used for the longest time.

note!Answer: C) Both (A) and (B).
Both block ciphers and stream ciphers are encryption techniques. 'Steam' in option B is a typo for 'Stream'.

note!Answer: D) None of the above
Reliability, incremental growth and resource sharing are all advantages of distributed systems, so none is excluded.

note!Answer: D) Both a and b
Queries let you view, change and analyze data, and they also act as a record source for forms and reports.

note!Answer: D) All of above
Access supports creating queries by drag and drop in the query design grid, by typing SQL in SQL view, and by using the Query Wizard or Design View.