Sponsored Links


Results 1 to 2 of 2

Thread: cs604 operating system current paper objective and subjective fall 2010 on 21-02-2011

  1. #1
    Administrator Xpert's Avatar
    Join Date
    May 2010
    Location
    Jhelum
    Posts
    6,217

    cs604 operating system current paper objective and subjective fall 2010 on 21-02-2011

    Sponsored Links


    Explain how Page Fault Frequency Model is used to Control Thrashing
    Summarize the tradeoffs among simple arrays, trees, and hash tables as implementations of a page table.

    Consider a logical address space of eight pages of 1024 words each, mamapped ont a physical memory of 32 frames.
    a. How many bits are there in the logical address?
    b. How many bits are there in the physical address?

    How Starvation can be caused in Priority Scheduling algorithm?

    Consider Round Robin scheduler. Do you think that Deadlock or Starvation can happen in Round Robin technique of scheduling?

    Write down the type of bits associated with each entry of segment table for protection?
    What are the three major frame allocation schemes?
    What is the main idea behind Overlays memory management technique?
    True or False (and explain): It is necessary to have a reference count
    within a file descriptor in order to implement soft links.

    Define Indexed Allocation as a Space Allocation Method.
    What are the possible ways to recover a system from deadlock?
    What are the problems that can occur while trying to violate the condition of Hold and wait for deadlock prevention?
    To resolve thrashing due to excessive paging, what can a user do?
    List the four events that cause the execution of a piece of code in kernel.
    How can you achieve memory protection in paging?
    Which command, displays permissions and some other attributes for prog1.c in your current directory?
    ls –l prog1.c
    ls –d prog1.c
    ls file prog1.c
    ls –l prog1.c /Directory
    ______________ is/are a memory management scheme that supports programmer’s view of
    memory.
    Paging
    Segmentation

    All of the given options
    Demand Paging
    Deadlocks can be described more precisely in terms of ...................................
    Directed Graph
    Critical path
    Resource allocation graph
    Mixed graph
    A set of processes are said to be in -------------- condition if each process in the set is waiting for an event that only another process in the set can cause (including itself).
    Mutual exclusion
    Deadlock
    Release
    Lock
    _______________ wastes CPU cycles and hence a problem in real multiprogramming system.
    Busy waiting
    Semaphore
    Critical section
    Mutex
    A time sharing system is
    Multi process
    Interactive
    Multi user
    All of these
    ………………………….that define the ways in which system resources are used to solve the computing problems of the users.

    Application programs
    Operating System
    Hardware
    Users
    The following requirement for solving critical section problem is known as ______________.
    “There exists a bound on the number of times that other processes are allowed to enter their critical sections after a process has made a request to enter its critical section and before that request is granted.”

    Progress
    Bounded Waiting
    Mutual Exclusion
    Critical Region
    When the process tries to access locations that are not in memory, the hardware
    traps the operating system. This is called as ___________.

    Page Fault
    Page replacement
    Segmentation

    Paging
    In the Scan algorithm the disk _______ starts at one end of the disk, and moves toward the
    other end, servicing requests as it reaches each cylinder, until it gets to the other end of
    the disk.
    Arm
    Cylinder
    Head
    non of these
    The size of a page is defined by _________
    CPU
    Page Table
    Physical Memory
    Logical Memory

    Overlays are implemented by the _________________
    Operating system
    Programmer
    Kernel
    Shell
    Secondary Storage memory devices have _______________ memory
    Volatile
    Non-volatile

    Non-volatile
    Temporary

    Temporary
    None of the option is correct
    We want a page replacement algorithm with the _____________ page-fault rate.
    Highest
    Lowest
    Normal
    None of above
    In _____________ page replacement algorithm oldest frame is replaced with another.
    LIFO
    FIFO
    LRU
    Optimal
    If a process continues to fault, replacing pages, for which it then faults and brings back in right away. This high paging activity is called ___________.
    Paging
    Thrashing
    page fault
    CPU utilization
    The integer value of ______________ semaphores can range over an unrestricted integer domain.
    Counting
    Binary

    Mutex
    Bounded buffer
    Shared libraries and kernel modules are stored in _____________ directory
    /bin
    /dev
    /boot
    /lib
    In _______, each file is a linked list of disk blocks: blocks may be scattered anywhere on the disk.

    Indexed Allocation
    Contiguous Allocation
    Linked Allocation
    None of the given options
    _________ contains the names of other files and/or directories.
    Block Special File
    Link File
    Ordinary File
    Directory
    The high paging activity is called _______
    Segmentation
    Page Fault
    Multiprogramming
    Thrashing
    -----------is the separation of user logical memory from physical memory


    ROM
    Virtual Memory
    None of the given options
    Physical memory
    Physical memory is broken down into fixed-sized blocks, called----------- and Logical memory is divided into blocks of the same size, called -----------
    Frames, pages
    Frames, pages
    Frames, holes
    Holes, segments
    The set of all physical addresses corresponding to the logical addresses is a ----------------- of the process
    Physical address space
    Process address space
    None of the given options
    Logical address space
    A -----------is a region of code where shared resources are accessed.
    critical region
    deadlock
    process
    thread
    The priorities of processes in the ----------Group remain fixed whereas the priorities of processes in the -----------Group are recalculated every second.
    Kernel, Kernel
    User, Kernel
    User, User
    Kernel, User
    Round-Robin Scheduling is a -------------- scheduling algorithm

    Preemptive
    non-preemptive
    Preemptive or non-preemptive.
    None of the given options
    Under ------------scheduling once the CPU has been allocated to a process the process keeps the CPU until either it switches to the waiting state, finishes its CPU burst, or terminates.
    non-preemptive
    both preemptive and non- preemptive
    none of the given options
    preemptive
    The creating process is called a--------------- process while the new processes are called the -------------- of that process
    None of the given options
    Parent, children
    Zombie, single
    Children, parent

    You can compile yours program in a UNIX/LINUX system by the ----------- command
    $rm

    $cp
    $cp
    $mv
    gcc

    Sponsored Links

  2. Sponsored Links
  3. #2
    Administrator Xpert's Avatar
    Join Date
    May 2010
    Location
    Jhelum
    Posts
    6,217
    You are welcome dear. Please share your paper.

Thread Information

Users Browsing this Thread

There are currently 1 users browsing this thread. (0 members and 1 guests)

Similar Threads

  1. Replies: 0
    Last Post: 02-21-2011, 04:48 AM
  2. Replies: 0
    Last Post: 02-21-2011, 04:46 AM
  3. Replies: 0
    Last Post: 02-21-2011, 04:45 AM
  4. Replies: 0
    Last Post: 02-19-2011, 11:45 PM
  5. Replies: 7
    Last Post: 01-29-2011, 10:17 PM

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •  
-: Vuhelp Disclaimer :-
None of the files shown here are hosted or transmitted by this server. The links are provided solely by this site's users. The administrator's or staff of Vuhelp.net cannot be held responsible for what its users post, or any other actions of its users. You may not use this site to distribute or download any material when you do not have the legal rights to do so. It is your own responsibility to adhere to these terms. If you have any doubts about legality of content or you have any suspicions, feel free to contact us.
Online Education | JhelumSoft