Scribd Logo
Upload

Welcome to Scribd!

  • Homework 3 (Priority Scheduling)

    Uploaded by

    mohammed
    8 views2 pages
    This document provides instructions for Homework 3 on priority scheduling for a Data Structures course. Students are asked to write a simulation program with a menu that allows adding new processes, serving processes, displaying waiting process information, and checking the number of waiting processes. The program needs to use a suitable data structure to schedule processes with the highest priority first based on a priority field, breaking ties with FIFO ordering. Hints include adjusting the queue abstract data type to solve this problem. Students will submit both hard and soft copies of their assignment next week.

    Original Description:

    Original Title

    CS214_HW3_Fall2016.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document provides instructions for Homework 3 on priority scheduling for a Data Structures course. Students are asked to write a simulation program with a menu that allows adding new processes, serving processes, displaying waiting process information, and checking the number of waiting processes. The program needs to use a suitable data structure to schedule processes with the highest priority first based on a priority field, breaking ties with FIFO ordering. Hints include adjusting the queue abstract data type to solve this problem. Students will submit both hard and soft copies of their assignment next week.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    8 views2 pages

    Homework 3 (Priority Scheduling)

    Uploaded by

    mohammed
    This document provides instructions for Homework 3 on priority scheduling for a Data Structures course. Students are asked to write a simulation program with a menu that allows adding new processes, serving processes, displaying waiting process information, and checking the number of waiting processes. The program needs to use a suitable data structure to schedule processes with the highest priority first based on a priority field, breaking ties with FIFO ordering. Hints include adjusting the queue abstract data type to solve this problem. Students will submit both hard and soft copies of their assignment next week.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    Faculty of Computers and Information

    CS214: Data Structures


    Fall 2016

    Dr. Marwa M. A. Fattah & Dr. Sarah Nabil


    Faculty of Computers and Information

    HomeWork 3 (Priority Scheduling)


    In some systems, a priority is associated with each process and the CPU is allocated to the
    process with the highest priority (small value). Equal priority processes are scheduled in FIFO
    order.

    Define a suitable data structure, and then write a simulation program for the system
    described above. The program should display the following menu:

    1. Add a New Process.


    2. Serve a Process.
    3. Display Information about Waiting Process.
    4. Number of Waiting Process
    5. Exit menu

    Hints:

    You have to adjust the QUEUE ADT in implementation level to be suitable for solving this
    problem.

    The process should have the following fields: process ID and priority.
    Turning in Homework:
    You will turn in your assignment as a hard copy accompanied by a soft copy on a rewritable
    CD. Submission is due at the beginning of your Section next week. Your submitted homework
    (hard & soft copies) will be graded by your TA and returned to you.

    You might also like