Write a program to nead 10 number and start them asending order

I need all the map assignments that I have not done did by tomorrow and the ones that are due as well.they are pretty easy its for a class name GY 208 you will have to log into my canvas

Find problems corresponding to homework 2 within attached PDF document. Submit your answers either within a Word or a PDF document.

The question solve a student then he improve his coding, language and theory based part. The question is very useful for this.

Week 4: Bonus R Programming GGPLOT on HMEQ data – 25 points (LO1)(LO2)

Completion requirementsOpened: Monday, March 30, 2026, 11:59 PM

Due: Sunday, April 5, 2026, 11:59 PM

The library, ggplot, is one of the most powerful and widely used data visualization tools in the R programming language. In this assignment, we will get up to speed using this library.

For this assignment, we will expand upon the ggplot assignment by using real world data.

HMEQ Scrubbed Data set provided below.

You have complete freedom to decide upon the graphs you generate. The only condition is that you must use ggplot to create the graph.

As you create each graph, either download it to your computer or take a screen shot of it.

Hand in the following:

• A File with your R program. This file should contain only the code (no output) and must have the typical r extension. No other file extensions will be accepted. The reason is that the assignment be graded based on your R code and not the output file. The output file will be used to verify the code commands. Also, please make sure that all comments, discussion, and conclusions regarding results are also annotated as part of your code.
• A PDF/DOC file with your output code. We are giving you more flexibility regarding how you want to present your output (tables, plots, etc.). You can either use RMD files that combine code, narrative txt, and plots or you can use word document with copy and paste from the R platform you are using. However, please remember that all output (tables, plots, comments, conclusions, etc.) shown in this file has to be generated by the same R code that you submit. This is important! Output shown that is generated using a separate code or output shown that is not supported by the submitted code will not be graded. Screenshots will not be accepted.
• Under each graph, describe in a few sentences what the graph is presenting. The sentences must be useful and understandable to a manager who does not understand technical concepts. Interesting and advanced graphs with good descriptions will get more points. So push yourself!

Essential Activities:

1. Watch all the training videos
2. Execute the example code while watching the training videos.

Notes:

1. You may only use the HMEQ data set. If you use any other data, you will not receive any points.
2. This assignment is due Sunday at 11:59 PM EST

To complete this assignment, consider the following scenario:

• Eight unique processes (which terminate in the following order: 21 KB, 77 KB, 199 KB, 380 KB, 489 KB, 212 KB, 139 KB, and 302 KB) must be placed into ten memory partitions organized in the following order: 150 KB, 275 KB, 425 KB, 300 KB, 80 KB, 117 KB, 500 KB, 35 KB, 313 KB, and 269 KB.

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. Identify the memory partitions that remain after placing each process. Visually illustrate each algorithm with a chart or diagram. An was created in Excel, but you may also choose to use a graphics editing software (PowerPoint, Paint, PhotoShop, etc.) or upload a photo of a hand-drawn sketch.

Compare the algorithms and explain which model makes the most efficient use of memory and which model executes the quickest.

The Memory Allocation Algorithms paper

• Must be a minimum of two double-spaced pages (500 words) in length (not including title, reference page, and diagrams) and formatted according to APA style as outlined in the .
• Must include a separate title page with the following:
  • Title of paper
  • Students name
  • Course name and number
  • Instructors name
  • Date submitted

Carefully review the grading rubric below and follow the .

Rubric

CPT304 W3A1 01.26

CPT304 W3A1 01.26

Criteria	Ratings	Pts
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

the attachment I send is the example.

Instructions: Our initial portfolios will be setup on WordPress. This is for several reasons; a significant reason is the dominance of WordPress as a website engine. You have the option of using the free or self-hosting a site on your own hosting. I personally use but there are a number of choices. It is likely that this portfolio has the potential to grow into your professional portfolio so care should be taken with regard to design and professionalism. I strongly recommend you use “FirstNameLastName.com” as an URL since it is the most flexible and adaptable.

Your initial portfolio install should have the following pages and if this isnt your first ePortfolio class you should check your overall portfolio for content and update as needed:

• About You (a page that will highlight what you do for others and will grow to include your instructional design philosophy)
• Contact/Work with You page (a page that will at the minimum have a contact form)
• Blog (With a blog category and a portfolio category, you can do sub-categories under portfolio if youd like but at this point its not necessary)

Question 1: Working with MARIE (10 Marks)

Write a MARIE assembly program that performs the following tasks:

Reads TWO decimal numbers A and B from the keyboard.

If A = B, Result= 0.

If A<B, store -1 in Result

If A>B, Result= A-B

Display the Result.

You should include the MARIE code in your answer (not a screenshot!), with an explanation of your code, especially the critical instructions.

Provide 3 screenshots of the MARIE simulator after running the program, showing the code and result for each of the above three cases.

Instructions:

Use the ORG instruction to start your program at address equivalent to 33610.

Change the representation of the Input and Output windows in the simulator to Decimal.

Make sure to include proper labels and directives at the end of your program.

Question 2: Working with Logic Gates (10 Marks)

You are asked to watch the video, Boolean Simplification using Karnaugh Map (Credit: ENGRTUTOR) which is found on the CLMS week 5 section of the course, and answer the following question:

In a 4-variable Karnaugh map, some cells may be marked d (or X) to represent dont-care conditions. A dont-care means the output is unspecified for that input combination. When simplifying a function using a K-map, a dont-care cell may be treated as 1 only when it helps create a larger valid group (thus simplifying the expression). Otherwise, it is treated as 0 and ignored. There is no requirement to include all dont-cares in groups.

Rule: Use a dont-care in a group only if it results in a simpler expression.

Given the 4-variable K-map for F(A,B,C,D) below, answer the following:

F C’D’ C’D CD CD’

A’B’ 1 1 d 1

A’B 0 d d 0

AB d 1 d 0

AB’ d 1 1 d

a) Grouping decision (4 marks)

Identify and clearly show the groups you will use in the given K-map to obtain a minimal simplified expression.

You may treat selected dont-care (d) cells as 1 only if doing so allows the formation of a larger valid group and leads to further simplification.

Any dont-care cell that is not required for simplification must be treated as 0 and left ungrouped.

Clearly distinguish the dont-care cells that you chose to use (for example, by marking them in a different color or notation on the K-map).

Briefly justify your grouping choices, explaining how the selected dont-care cells contribute to achieving the minimal expression.

b) Minimal simplified expression (2 marks)

Write the simplified expression of F.

c) Complement using De Morgan (2 marks)

Find F by applying De Morgans Law to your simplified result from part (b).

Show steps clearly.

Your final answer must be in POS (Product of Sums) form (you may keep it without simplification beyond De Morgan).

d) NAND-only implementation (2 marks)

Draw the minimal logic diagram of F using NAND gates only.

You may use NAND as NOT (inverter) where needed.

Your final diagram must implement the same function as in part (b).

Question 1: Working with MARIE (10 Marks)

Write a MARIE assembly program that performs the following tasks:

Reads TWO decimal numbers A and B from the keyboard.

If A = B, Result= 0.

If A<B, store -1 in Result

If A>B, Result= A-B

Display the Result.

You should include the MARIE code in your answer (not a screenshot!), with an explanation of your code, especially the critical instructions.

Provide 3 screenshots of the MARIE simulator after running the program, showing the code and result for each of the above three cases.

Instructions:

Use the ORG instruction to start your program at address equivalent to 33610.

Change the representation of the Input and Output windows in the simulator to Decimal.

Make sure to include proper labels and directives at the end of your program.

Question 2: Working with Logic Gates (10 Marks)

You are asked to watch the video, Boolean Simplification using Karnaugh Map (Credit: ENGRTUTOR) which is found on the CLMS week 5 section of the course, and answer the following question:

In a 4-variable Karnaugh map, some cells may be marked d (or X) to represent dont-care conditions. A dont-care means the output is unspecified for that input combination. When simplifying a function using a K-map, a dont-care cell may be treated as 1 only when it helps create a larger valid group (thus simplifying the expression). Otherwise, it is treated as 0 and ignored. There is no requirement to include all dont-cares in groups.

Rule: Use a dont-care in a group only if it results in a simpler expression.

Given the 4-variable K-map for F(A,B,C,D) below, answer the following:

F C’D’ C’D CD CD’

A’B’ 1 1 d 1

A’B 0 d d 0

AB d 1 d 0

AB’ d 1 1 d

a) Grouping decision (4 marks)

Identify and clearly show the groups you will use in the given K-map to obtain a minimal simplified expression.

You may treat selected dont-care (d) cells as 1 only if doing so allows the formation of a larger valid group and leads to further simplification.

Any dont-care cell that is not required for simplification must be treated as 0 and left ungrouped.

Clearly distinguish the dont-care cells that you chose to use (for example, by marking them in a different color or notation on the K-map).

Briefly justify your grouping choices, explaining how the selected dont-care cells contribute to achieving the minimal expression.

b) Minimal simplified expression (2 marks)

Write the simplified expression of F.

c) Complement using De Morgan (2 marks)

Find F by applying De Morgans Law to your simplified result from part (b).

Show steps clearly.

Your final answer must be in POS (Product of Sums) form (you may keep it without simplification beyond De Morgan).

d) NAND-only implementation (2 marks)

Draw the minimal logic diagram of F using NAND gates only.

You may use NAND as NOT (inverter) where needed.

Your final diagram must implement the same function as in part (b).

answer this please and i need it asap
Question 1: (7 marks)We have a list containing employees working hours. Rearrange the list sothatemployees who worked overtime ( 40 hours) appear first, and employees whoworkedless than 40 hours appear at the end. Example:Input: [35, 45, 50, 30, 42, 38]Output after rearranging: [45, 50, 42, 35, 30, 38]To answer question 1, you need to do the following:1. Write an algorithm to do the above task2. Implement the algorithm using OUBuild script following the above steps. 3. Provide 2 screenshots for different output?4. If we need to sort the values the odd and even which sorting algorithmwecanuse as an efficient one?Question 2: (3 marks)Consider a video with a resolution of 640 480, 8-bit pixels (grayscale). The videohasaframe rate of 15 frames per second (fps) and a total duration of 5 minutes. Question:How many bits and bytes are required to store the entire video?Good luckEnd of the questions