Memory Allocation Algorithms

This criterion is linked to a Learning OutcomeExplains Step-by-Step how Each of the Dynamic Storage Allocation Algorithms (first-fit, best-fit, and worst-fit) Would Place the Given Processes within the Given Memory Partitions, and Identifies the Memory Partitions that Remain after Placing Each Process

2 ptsDistinguishedComprehensively explains step-by-step how each of the dynamic storage allocation algorithms (first-fit, best-fit, and worst-fit) would place the given processes within the given memory partitions, and clearly identifies the memory partitions that remain after placing each process.1.76 ptsProficientExplains step-by-step how each of the dynamic storage allocation algorithms (first-fit, best-fit, and worst-fit) would place the given processes within the given memory partitions, and identifies the memory partitions that remain after placing each process. Minor details are missing or slightly unclear.

1.52 ptsBasicMinimally explains step-by-step how each of the dynamic storage allocation algorithms (first-fit, best-fit, and worst-fit) would place the given processes within the given memory partitions and partially identifies the memory partitions that remain after placing each process. Relevant details are missing and/or unclear.1.28 ptsBelow ExpectationsAttempts to explain step-by-step how each of the dynamic storage allocation algorithms (first-fit, best-fit, and worst-fit) would place the given processes within the given memory partitions and identify the memory partitions that remain after placing each process; however, significant details are missing and entirely unclear.0 ptsNon-PerformanceThe explanation of how each of the dynamic storage allocation algorithms (first-fit, best-fit, and worst-fit) would place the given processes within the given memory partitions and identification of the memory partitions that remain after placing each process are either nonexistent or lack the components described in the assignment instructions.

2 pts

This criterion is linked to a Learning OutcomeVisually Illustrates Each Algorithm with a Chart or Diagram

2 ptsDistinguishedVisually illustrates each algorithm with a comprehensive chart or diagram.1.76 ptsProficientVisually illustrates each algorithm with a chart or diagram. Minor details are missing.

1.52 ptsBasicVisually illustrates each algorithm with a limited chart or diagram. Relevant details are missing.1.28 ptsBelow ExpectationsAttempts to visually illustrate each algorithm with a chart or diagram; however, significant details are missing.0 ptsNon-PerformanceThe illustration for each algorithm with a chart or diagram is either nonexistent or lacks the components described in the assignment instructions.

2 pts

This criterion is linked to a Learning OutcomeCompares the Algorithms, and Explains which Model Makes the Most Efficient Use of Memory

1 ptsDistinguishedThoroughly compares the algorithms, and comprehensively explains which model makes the most efficient use of memory, fully supporting the explanation with the quantitative analysis of the data.0.88 ptsProficientCompares the algorithms, and explains which model makes the most efficient use of memory, mostly supporting the explanation with the quantitative analysis of the data. Minor details are missing.

0.76 ptsBasicMinimally compares the algorithms, and partially explains which model makes the most efficient use of memory, somewhat supporting the explanation with the quantitative analysis of the data. Relevant details are missing.0.64 ptsBelow ExpectationsAttempts to compare the algorithms and explain which model makes the most efficient use of memory; however, does not support the explanation with the quantitative analysis of the data, and significant details are missing.0 ptsNon PerformanceThe comparison of algorithms and explanation of which model makes the most efficient use of memory are either nonexistent or lack the components described in the assignment instructions.

1 pts

This criterion is linked to a Learning OutcomeCompares the Algorithms, and Explains which Model Executes Quickest

1 ptsDistinguishedThoroughly compares the algorithms, and comprehensively explains which model executes quickest, fully supporting the explanation with accurate calculations.0.88 ptsProficientCompares the algorithms, and explains which model executes quickest, supporting the explanation with mostly accurate calculations. Minor details are missing or slightly inaccurate.

0.76 ptsBasicMinimally compares the algorithms and explain which model executes quickest, supporting the explanation with somewhat accurate calculations. Relevant details are missing and/or inaccurate.0.64 ptsBelow ExpectationsAttempts to compare the algorithms and explain which model executes quickest; however, does not support the explanation with accurate calculations, and significant details are missing and inaccurate.0 ptsNon PerformanceThe comparison of algorithms and explanation of which model executes quickest are either nonexistent or lack the components described in the assignment instructions.

1 pts

This criterion is linked to a Learning OutcomeWritten Communication: Control of Syntax and Mechanics

0.34 ptsDistinguishedDisplays meticulous comprehension and organization of syntax and mechanics, such as spelling and grammar. Written work contains no errors and is very easy to understand.0.3 ptsProficientDisplays comprehension and organization of syntax and mechanics, such as spelling and grammar. Written work contains only a few minor errors and is mostly easy to understand.

0.26 ptsBasicDisplays basic comprehension of syntax and mechanics, such as spelling and grammar. Written work contains a few errors which may slightly distract the reader.0.22 ptsBelow ExpectationsFails to display basic comprehension of syntax or mechanics, such as spelling and grammar. Written work contains major errors which distract the reader.0 ptsNon-PerformanceThe assignment is either nonexistent or lacks the components described in the instructions.

0.34 pts

This criterion is linked to a Learning OutcomeWritten Communication: APA Formatting

0.33 ptsDistinguishedAccurately uses APA formatting consistently throughout the paper, title page, and reference page.0.29 ptsProficientExhibits APA formatting throughout the paper. However, layout contains a few minor errors.

0.25 ptsBasicExhibits limited knowledge of APA formatting throughout the paper. However, layout does not meet all APA requirements.0.21 ptsBelow ExpectationsFails to exhibit basic knowledge of APA formatting. There are frequent errors, making the layout difficult to distinguish as APA.0 ptsNon-PerformanceThe assignment is either nonexistent or lacks the components described in the instructions.

0.33 pts

This criterion is linked to a Learning OutcomeWritten Communication: Page Requirement

0.33 ptsDistinguishedThe length of the paper is equivalent to the required number of correctly formatted pages.0.29 ptsProficientThe length of the paper is nearly equivalent to the required number of correctly formatted pages.

0.25 ptsBasicThe length of the paper is equivalent to at least three-quarters of the required number of correctly formatted pages0.21 ptsBelow ExpectationsThe length of the paper is equivalent to at least one half of the required number of correctly formatted pages.0 ptsNon-PerformanceThe assignment is either nonexistent or lacks the components described in the instructions..

0.33 pts