Sawaal
  • Home/
  • Searching for i

 Searching for "i"

Q:

What is page cannibalizing?

Answer

Page swapping or page replacements are called page cannibalizing.

Report Error

View answer Workspace Report Error Discuss

Subject: Operating Systems

Q:

What is the use of MAU?

Answer

In token Ring , hub is called Multistation Access Unit(MAU).

Report Error

View answer Workspace Report Error Discuss

Subject: Networking
Job Role: Network Engineer

Q:

A loan of $15 000 is taken out. If the interest rate on the loan is 7%, how much interest is due and what is the amount repaid if the loan is due in seven months

A) 15612.50 B) 14612.50
C) 13612.50 D) 17612.50
 
Answer & Explanation Answer: A) 15612.50

Explanation:

We have P = 15 000, r = 0.07 and since the actual date the loan was taken out
is not given, we use t =7/12

I = Prt=$15 000* 0.07* 7/12 = $612.50

Amount repaid = Future or accumulated value,

S = P + I = $15 000 + $612.50 = $15 612.50

Report Error

View Answer Report Error Discuss

Filed Under: Simple Interest
Exam Prep: Bank Exams
Job Role: Bank PO

Q:

What are demand-paging and pre-paging?

Answer

With demand paging, a page is brought into memory only when a location on that page is actually referenced during execution. With pre-paging, pages other than the one demanded by a page fault are brought in. The selection of such pages is done based on common access patterns, especially for secondary memory devices.

Report Error

View answer Workspace Report Error Discuss

Subject: Operating Systems

Q:

MAU-Multiple access unit

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

Explanation:

MAU is Multistation Access Unit

Report Error

View Answer Workspace Report Error Discuss

Subject: Networking
Job Role: Network Engineer

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:

If P(A)=4/9;then the odd against the event A is:

A) 4:9 B) 4:5
C) 5:4 D) 4:14
 
Answer & Explanation Answer: C) 5:4

Explanation:

Here,P(A)=4/9=p/(p+q)

P(odd against event A)=q/p=5/4

Report Error

View Answer Report Error Discuss

Filed Under: Probability

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