Sawaal
  • Home/
  • Searching for and

 Searching for "and"

Q:

In loading programs into memory, what is the difference between load-time dynamic linking and run-time dynamic linking?

Answer

For load-time dynamic linking: Load module to be loaded is read into memory. Any reference to a target external module causes that module to be loaded and the references are updated to a relative address from the start base address of the application module.


With run-time dynamic loading: Some of the linking is postponed until actual reference during execution. Then the correct module is loaded and linked.

Report Error

View answer Workspace Report Error Discuss

Subject: Operating Systems

Q:

In the context of memory management, what are placement and replacement algorithms?

Answer

Placement algorithms determine where in available real-memory to load a program. Common methods are first-fit, next-fit, best-fit. Replacement algorithms are used when memory is full, and one process (or part of a process) needs to be swapped out to accommodate a new program. The replacement algorithm determines which are the partitions to be swapped out.

Report Error

View answer Workspace Report Error Discuss

Subject: Operating Systems

Q:

What is the difference between routable and non- routable protocols?

Answer

Routable protocols can work with a router and can be used to build large networks. Non-Routable protocols are designed to work on small, local networks and cannot be used with a router

Report Error

View answer Workspace Report Error Discuss

Subject: Networking
Job Role: Database Administration

Q:

OSI Reference Model provides a framework for discussing network operations and design

A) TRUE B) FALSE
Answer & Explanation Answer: A) TRUE

Explanation:

It provides a framework for discussing network operations and design

Report Error

View Answer Workspace Report Error Discuss

Subject: Networking
Job Role: Database Administration

Q:

Define latency, transfer and seek time with respect to disk I/O.

Answer

Seek time is the time required to move the disk arm to the required track. Rotational delay or latency is the time it takes for the beginning of the required sector to reach the head. Sum of seek time (if any) and latency is the access time. Time taken to actually transfer a span of data is transfer time.

Report Error

View answer Workspace Report Error Discuss

Subject: Operating Systems

Q:

What are local and global page replacements?

Answer

Local replacement means that an incoming page is brought in only to the relevant process address space. Global replacement policy allows any page frame from any process to be replaced. The latter is applicable to variable partitions model only.

Report Error

View answer Workspace Report Error Discuss

Subject: Operating Systems

Q:

What is the resident set and working set of a process?

Answer

Resident set is that portion of the process image that is actually in real-memory at a particular instant. Working set is that subset of resident set that is actually needed for execution. (Relate this to the variable-window size method for swapping techniques.)

Report Error

View answer Workspace Report Error Discuss

Subject: Operating Systems

Q:

What are turnaround time and response time?

Answer

Turnaround time is the interval between the submission of a job and its completion. Response time is the interval between submission of a request, and the first response to that request.

Report Error

View answer Workspace Report Error Discuss

Subject: Operating Systems