Wednesday
March 29, 2017

Post a New Question

Posted by on .

Hi, I need help with these questions. I have tried to find them but could not.

1.OLE is now referred to as ActiveX by Microsoft.



2.Embedded objects will travel with the destination document.


3.Linked objects will travel with the destination object.



4.A(n) ____ is a file that contains a list of commands that Windows XP can process to draw a graphic image.



5.An object's path is updated by ____ when its name is changed.


6.You can view properties of a linked object from the ____ menu of the toolbar.



7.In pasting objects from one application to another, you may need to use ____ to choose the correct format.


8.Links can be displayed in their entirety or as ____.



9.You can create ____ scrap objects from a single file.


10.The original copy of the object is called the ____ data.

  • OPERATING SYSTEM - ,

    . Given that main memory is composed of three page frames for public use and that a program requests pages in the following order:
    d c b a d c e d c b a e
    a. Using the FIFO page removal algorithm, do a page trace analysis indicating page faults with asterisks (*). Then compute the failure and success ratios.
    b. Increase the size of memory so it contains four page frames for public use. Using the same page requests as above and FIFO, do another page trace analysis and compute the failure and success ratios.
    c. Did the result correspond with your intuition? Explain.
    7. Given that main memory is composed of three page frames for public use and that a program requests pages in the following order:
    a b a c a b d b a c d
    a. Using the FIFO page removal algorithm, do a page trace analysis indicating page faults with asterisks (*). Then compute the failure and success ratios.
    b. Using the LRU page removal algorithm do a page trace analysis and compute the failure and success ratios.
    c. Which is better? Why do you think it is better? Can you make general statements from this example? Why or why not?
    d. Let us define “most-recently-used” (MRU) as a page removal algorithm that removes from memory the most recently used page. Do a page trace analysis using the same page requests as before and compute the failure and success ratios.
    e. Which of the three page removal algorithms is best, and why do you think so?

  • OPERATING SYSTEM - ,

    I do not know

  • OPERATING SYSTEM - ,

    Patern:

    adcdetfa

Answer This Question

First Name:
School Subject:
Answer:

Related Questions

More Related Questions

Post a New Question