ability to Describe several applications for various data structures.ability to Describe several applications for various data structures.

INSTRUCTIONS TO CANDIDATES

ANSWER ALL QUESTIONS

course learning outcomes (CLOs):

CLO (1.2, 1.2) ability to Describe several applications for various data structures.

CLO (1.1, 1.2) ability to Recognize several different ways to implement data structures.

CLO (2.1, 2.2, 2.3) ability to Write programs that support various data structures.

CLO (2.1, 2.2, 2.3) ability to Analyze objects and data structures composed of objects.

Q1: Complete the following code segments and state its functionality: (6 Marks, 2 each)

protected class QueueNode

    { 

 }

What the method does:

public void initializeQueue()

    {

}

What the method does:

 public DataElement front() throws QueueUnderflowException

    {

}

What the method does:

Q2: Write Java code for each of the following: (4 Marks, 2 each)

Stack practices:

a.      Creating a Stack and Performing basic operations like push, pop and peek

b.      Other Stack Operations

• Check if the stack is empty.

• Find the size of the stack.

• Search for an element in the Stack.

Q3: Answer the following: (14 Points)

Process Burst               Time                Priority

P1                    10                    3

P2                    1                      1

P3                    2                      3

P4                    1                      4

P5                    5                      2

The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0

1. Draw Gantt charts illustrating the execution of these processes using FCFS, SJF scheduling.

2. What is the waiting time of each process for each of the scheduling algorithms in part A?

3. Which of the schedules in part A results in the minimal average waiting time (over all processes)?

4. What are the problems that might be encountered in SJF scheduling algorithm?

 

Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of