I coded a program for a team management roster last week. This week I need to convert my list to dictionary and while loop to for loop.Team Management OOP StyleYour program for keeping track of team members is coming along, but now you want to be able to include phone numbers and jersey numbers along with your team member’s name. Modify your program from week 4 so that the program utilizes object-oriented programming to create a member object which can accept the player’s name, phone number, and jersey number. You will need to replace the list with a dictionary to help in locating objects for removal and editing. Again, File Access for long-term storage is not required for this assignment.For this project: You will submit your python code in either the original .py file, or copied into a .txt file. A screenshot of your code having been executed (run). How to Take a Screenshot Tips: While dictionaries resemble lists, remember that they are not the same! It is better to use FOR loops, not WHILE loops with index values.Your class structure does not need a full set of accessor and mutator methods getName(), setName(newName), however it they will be helpful in the next week.

Sources This assignment covers material presented in the chapter 'Memory Management & Operating Systems'. You can refer particularly to the following lessons in order to help you working through your solution: Memory Allocation Schemes: Definition & Uses Paged Memory Allocation: Definition, Purpose & Structure Memory Deallocation: Definition & Purpose Page Replacement: Definition & Algorithms Memory Management (MEM) Coding: Analysis & Example Prompt Consider the below settings to begin this project and keep them in mind: Total Memory size = 20 Kbyte Page size = 1 Kbyte Run the following list of jobs given the above considerations. Job IDStart TimeJob required sizeExecution intervalJob state at the end of the interval1127End2238Sleep3346End4436Sleep5529Sleep6636Sleep7726Sleep Using the functions you studied in the previously mentioned code that implement the different allocation, deallocation and replacement schemes, try three different scenarios in order to manage memory allocation for the following jobs Job IDStart TimeJob required sizeExecution intervalJob state at the end of the interval8834Sleep9955Sleep101028Sleep111146End121265Sleep21336End41334Sleep131353End71323End91744Sleep1019211End61936End520210Sleep421312Sleep1222613End82239End928511End53323Sleep434310End538210End Show the memory state for the different scenarios and analyze which choice is the best. Discuss the impact that Linux verses Windows might have on the ending memory state. Here's the sample code: #include <stdio.h> //Process struct to create an object with the attributes needed struct Process { int processID; int processingTime; int waitTime; int turnAroundTime; //add arrivingTime; int arrivingTime; //add is Processing int isProcessing; }; //This will calculate the Wait Time for each Process according to the algorithm struct Process * calculateWaitTime (struct Process queue[], int size) { for (int i = 1; i < size; i++) { queue[i].waitTime = queue[i - 1].processingTime + queue[i - 1].waitTime; } return queue; } //This will calculate how much time it takes for a process to wait and be executed struct Process * calculateTurnAround (struct Process queue[], int size) { for (int i = 0; i < size; i++) { queue[i].turnAroundTime = queue[i].processingTime + queue[i].waitTime; } return queue; } //This will give us an average of the waiting time for each process void averageWaitingTime (struct Process queue[], int size) { float average = 0; int count = 0; for (int i = 0; i < size; i++) { average += queue[i].waitTime; count++; } average = average / count; printf("Average Waiting Time: %f\n", average); } //This function helps to swap items in an array void swap(struct Process *a, struct Process *b) { struct Process t = *a; a = b; *b = t; } //This method aids the pivot for Quick Sort int partition (struct Process queue[], int low, int high) { int pivot = queue[high].processingTime; int i = low - 1; for (int j = low; j <= high - 1; j++) { if (queue[j].processingTime <= pivot) { i++; swap(&queue[i],&queue[j]); } } swap(&queue[i + 1], &queue[high]); return (i + 1); } //This is a recursive implementation of the Quick Sort void quickSort (struct Process queue[], int low, int high) { if (low < high) { int pi = partition(queue, low, high); quickSort(queue, low, pi - 1); quickSort(queue, pi + 1, high); } } //First Server First Come scheduling algorithm // void firstServeFirstCome (struct Process queue[], int size) { // queue = calculateWaitTime(queue, size); // queue = calculateTurnAround(queue, size); // averageWaitingTime(queue, size); // } //Shortest Job Next scheduling algorithm void shortestJobNext (struct Process queue[], int size) { quickSort(queue, 0, size - 1); queue = calculateWaitTime(queue, size); queue = calculateTurnAround(queue, size); averageWaitingTime(queue, size); } // Round Robin struct Process * roundRobin (struct Process queue[], int size, int quantum) { int iterator = 0; int flag = 0; int time = 0; //The time variable to manage waiting, turnaround and incoming processes quickSort(queue, 0, size - 1); //This while loop is to control the whole scheduling while (flag == 0) { //This loop is to make sure every process is only executed within the quantum for (int k = 0; k < quantum; k++) { queue[iterator].isProcessing = 1; int flagProcessingTime = 0; //Since we are not using Threading, this loop is to make sure every process is considered within each time unit for (int i = 0; i < size; i++) { //This will make sure that we only affect the process that has actually arrive at the scheduler if (queue[i].arrivingTime <= time && queue[i].processingTime > 0) { flagProcessingTime++; /** * If the process isProcessing, remove processing time. * It is not processing, just add to the wait time. */ switch (queue[i].isProcessing) { case 1: queue[i].processingTime--; queue[i].turnAroundTime++; break; case 0: queue[i].waitTime++; queue[i].turnAroundTime++; break; } } } time++; queue[iterator].isProcessing = 0; //Once all processes get to 0, this will finish execution of the scheduler if (flagProcessingTime == 0) { flag = 1; break; } } iterator++; iterator = iterator % size; } averageWaitingTime(queue, size); return 0; } //main int main() { //Array with processes with their id and processing time struct Process queue[] ={ {1, 6, 0, 0}, {2, 8, 0, 0}, {3, 7, 0, 0}, {4, 3, 0, 0}, {5, 1, 0, 0}}; //This will help determine the number of items in the array //int size = sizeof(queue)/sizeof(struct Process); int size = 5; //firstServeFirstCome(queue, size); shortestJobNext(queue, size); //roundRobin(queue, size, 1); printf("ProcessID Processing Time Wait Time Turnaround Time \n"); for (int i = 0; i < size; i++) { printf("\t %d \t\t\t %d \t\t\t\t %d \t\t\t %d \n", queue[i].processID, queue[i].processingTime, queue[i].waitTime, queue[i].turnAroundTime); } return 0; }  

This is the first part of a larger capstone project. I found a dataset that may work for the overall capstone but please let me know if you don't think this dataset will work for the project. I have also included the final capstone project requirements at the bottom of this post so you know if this dataset will work. We need to be able to create a few hypotheses and null hypotheses then try to prove or disprove them. Descriptive analytics and predictive analytics should be performed using SAS. I am open to using a different dataset if you don't think the one i attached will work. Here is the requirement for the first question: In this assignment, you will describe the public dataset and data analytics tools used to analyze your dataset in your Capstone Project. Examples of tools are found in the tools document. Tool instructions can be found in the Course Information section.The report should include:a description about the dataset that you chose;identifying two to three tools or techniques used to analyze your dataset;describing the type of variables (binary, interval);a visual model of your data (i.e., data dictionary);an explanation of the potential of the data within your dataset and what it means for the organization; anddefining future plans to analyze the data within the dataset.-----Final Project - ***This information is in the text below is just so you know what we are working towards.- It is not to be answered for this question. I plan to give you weekly questions to progress the project.-----For your Capstone Project, you will select a public dataset and identify two or three tools to analyze the data for an organization in the United States. The purpose is to show the organization how these tools can be used to analyze data in a project. You submitted your project write-up in Module 5 and a rough draft in Module 6. You will incorporate all feedback from your instructor and submit your Final Report, including a presentation with speaker notes.Your Final Report should include:information about the organization (history, services and products, location, employee size, and revenue) and why you chose it;an explanation about what dataset you selected and why you chose this data;identifying your research null and alternative hypotheses;identifying the tools and techniques you used to analyze the data;addressing security, privacy, and ethical concerns when handling and analyzing the data;explaining your data analysis outcomes and whether you could support your null or alternative hypothesis; (if you did not find support for your alternative hypothesis, what conclusions can you draw about your data?);programming code, and screenshots of data analysis outcomes;uploading your project (code and documents, for example) to your GitHub account and include the link in your project write-up; andthe write-up components submitted in Module 5.