Instructions in JOGL Project 1 Info.txt Programming OpenGL using the Java OpenGL

Instructions in JOGL Project 1 Info.txt
Programming OpenGL using the Java OpenGL (JOGL) wrapper library, follow all instructions in the .txt file, relevant textbooks and lecture notes (Week 8 Notes – 2D Transformation.pptx) included.
All JOGL2020 files used to derive/extend classes for the class is also attached in a zip file (JOGL2020.zip) for easy installation on Eclipse IDE on your Windows machine, setup instructions from the first class PowerPoint is attached in a screenshot to follow along (JOGL Setup in Windows.png). I recommend using Eclipse IDE since that’s what they use to set up the environment.
MUST be good in OpenGL, specifically JOGL/Java!

*See attachment for clear understanding* This lab presumes that you have a Raspb

*See attachment for clear understanding*
This lab presumes that you have a Raspberry Pi computer configured with a recent version of the Raspbian operating system.
Pre-lab reading:
•    ARM assembler in Raspberry Pi – Chapter 1
•    ARM assembler in Raspberry Pi – Chapter 2
The focus for this lab is not to learn new ARM instructions, but to learn how to write, assemble, and link ARM assembly on your Raspberry Pi computer.
Instructions:
Part 1:
1.    Complete the “first program” example outlined in the Chapter 1 tutorial link above, but use the linker rather than the C compiler to create your executable. Your program will look like this: Please note that the comments start with a different symbol from AAL #1. Save the file as first.s (the extension of assembly files is s).
/* — first.s */
/* Jie Liu */
.global _start @ declare entry point
_start:        @ label for the entry point
mov r0, #2 @ Put a 2 in r0
mov r7, #1 @ setup system call to exit to terminal
swi 0      @ system call to exit – just need to do this
2.    Use the Unix shell (similar to Windows’ cmd) and make sure you are in the same directory as the file first.s (use ls -al to list all files in the current directory and make sure you see first.s), the do the following:
Assemble your code with as –o first.o first.s,
link it into an executable with ld –o first first.o,
run it with ./first,
look at the returned error code with echo $?.
3.    Save a screenshot of your interaction with the Raspbian shell showing how you assembled, linked, executed, and inspected the return code from your program. You can take a screenshot from the command line using the scrot command.
Part 2: 
1.    Write an ARM assembly program that subtracts 50 from 300 and allows you to inspect the results in the shell. From the tutorial you’ll see that this requires you to store the result in R0 before returning from your main function.
2.    Save a screenshot of your interaction with the Raspbian shell showing how you assembled, linked, executed, and inspected the return code from your program.
Part 3:
1.    Create and run a “Hello world!” program based on this example:
/* — helloworld.s */
.global _start
_start:       
mov r0, #1      @ stdout is monitor
ldr r1, =string1 @ location of string to write
mov r2, #13      @ number of characters to write
mov r7, #4      @ setup system call to write
swi 0            @ system call to write
mov r7, #1      @ setup system call to exit
swi 0            @ system call to exit
.data
string1:
.ascii “Hello World!n”
2.    Save a screenshot of your interaction with the Raspbian shell showing how you assembled, linked, executed, and inspected the return code from your program.
Turn in:
Again, for this week, just turn in a SINGLE document with your 3 screenshots as specified in the above assignment instructions. Submit the result as a pdf file.

The code must not be plagiarized. When doing the assignment the A or B option is

The code must not be plagiarized. When doing the assignment the A or B option isn’t expected but if done correctly I will pay more. Please go for the C option though. This code must be done in Ada. Attached is the words we are supposed to hash. Please help me I am so close to graduating and I only need this class to graduate.

I’m struggling and I need help. I don’t have enough time to complete the assignm

I’m struggling and I need help. I don’t have enough time to complete the assignment and I need someone to complete this before or by the desired time. If you decide to help, thank you and I will deliver on the reward. I’m supposed to be using Linux to run these programs. (No Windows or Mac specific code please.)

Python Classwork Using the code create a pie chart that will show the Average te

Python Classwork
Using the code create a pie chart that will show the Average temperatures across the USA for all seasons. Such that the pie labels would include
Winter,Spring,Summer,Fall and it would show the percentage of when in each season has the avg temperature.
Remember to consult your diagram of the weather dataset and
the weather dataset documentation at:
https://corgis-edu.github.io/corgis/python/weather/
For this question, upload the Python file with the code that answers
the question above.
Answer:
Summer = 32.7%
Fall = 26.4%
Spring = 24.4%
Winter = 16.5%

”’
import weather
import matplotlib.pyplot as plt
reports = weather.get_report()
temperature_listSummer = []
temperature_listWinter = []
temperature_listSpring = []
temperature_listFall = []
summer = [6,7,8]
winter = [12,1,2]
spring = [3,4,5]
fall = [9,10,11]

Problem Description This assignment asks you to implement a solution to the stab

Problem Description
This assignment asks you to implement a solution to the stable matching problem. In our case, we will
consider the problem of matching coop employers to coop students. In particular, we consider the
problem of n employers and n students where each employer will hire a single student. Each employer
produces a ranking of students according to their preference to hire for the coop term and each student
rank all employers according to their preference to work for. Based on these preferences your mission is
to write a program that will match each employer with one student such that all players will be as
satisfied as possible with their match (in the sense that there will be no incentive for a pair of employerstudent
that are not matched to each other, to both agree to be matched).
You will be given a list of employers. For example
0. Thales
1. Canada Post
2. Cisco
And a list of students. For example:
0. Olivia
1. Jackson
2. Sophia
The two lists will always be of the same size.
_________________________________________________________________________________________________
Students and employers will enter their ranking. For example:
• Employer preferences :
0. Thales: 0.Olivia, 1.Jackson, 2.Sophia
1. Canada Post: 2. Sophia, 1.Jackson, 0.Olivia
2. Cisco: 0.Olivia, 2.Sophia, 1.Jackson
• Student preferences:
0. Olivia: 0.Thales, 1.Canada Post, 2.Cisco
1. Jackson: 0.Thales, 1.Canada Post, 2.Cisco
2. Sophia: 2.Cisco, 0.Thales, 1.Canada Post
These ranking will be given to you in a text file formatted accordingly.
A stable matching solution for this problem is as follows:
Thales – Olivia
Canada Post – Jackson
Cisco – Sophia
Why is this solution stable? We have to look at the definition of a stable match. A stable match is
defined such that neither party to the match has a preferred party that also prefers them over their current
match. E,g., Canada Post would prefer to hire Olivia over Jackson but Olivia is currently matched with
Thales which she prefers over Canada Post. While Jackson would prefer to work for Thales over Canada
Post but Thales is matched with Olivia which Thales prefers over Jackson. As a result, while neither
Canada Post nor Jackson got their first choice, the match is stable as neither of them have a way to
improve their current match.
As a result, the solution provided is a stable matching and is also perfect. A perfect match is actually a
simpler criterion, just requiring each employer being matched to a student and each student being
matched to an employer.
In summary, in this assignment you will need to find a perfect and stable matching given preference
tables by coop employers and by students. There will always be the same number of employers and
students and every employer will only hire one student.
_________________________________________________________________________________________________
Algorithm to be used
The stable matching can be found with an iterative algorithm, the Gale-Shapley algorithm. The
pseudocode implementing this algorithm is given below. The input will be given as a simple text file. It
will contain the list of employers, the list of students and an nxn matrix of ranking pairs.
Gale-Shapley algorithm
Input:
• A list of n employers, indexed 0 to n-1
• A list of n students, indexed 0 to n-1
• An nxn matrix in which each entry is a pair (employer_ranking, student_ranking); (each
ranking being in the interval [1,n]). One row corresponds to one employer. One column
corresponds to one student.
Initialization:
• Create Sue, a stack of unmatched employers
• Push all employers in this stack starting from employer 0
• Create two arrays of size n, students and employers, used to represent the current
matches; (if student s is matched with employer e then students[s]=e and
employers[e]=s; value -1 is used to designate an unmatched student or employer)
• Initialize all entries in these arrays to -1
• Create 2D array A of size nxn with A[s][e]being the ranking score given by student s to
company e
• Initialize each entry with the student rankings.
• Create n priority queues with PQ[e] being the queue of employer e
• For each student s
o For each employer e
§ PQ[e].insert(employer_ranking,s)
_________________________________________________________________________________________________
Procedure:
• while ( !Sue.empty() )
o e= Sue.pop() // e is looking for a student
o s= PQ[e].removeMin() // most preferred student of e
o e’= students[s]
o if (students[s] == -1) // student is unmatched
§ students[s]= e
§ employers[e]= s // match (e,s)
o else if (A[s][e] < A[s][e’]) // s prefers e to employer e’ § students[s]= e § employers[e]= s // Replace the match § employers[e’]= -1 // now unmatched § Sue.push(e’) o else s rejects offer from e § Sue.push(e) • return the set of stable matches Refer to the annex for an example of this algorithm in action. Input file format A text file will be given as input. The first number will be the number of students and employers, followed by the list of employers, the list of students and a matrix of ranking pairs (employer ranking, student ranking). Employers correspond to the rows of this matrix and students correspond to columns. For the simple example given on the first page, this input file will be as follows: 3 Thales Canada Post Cisco Olivia Jackson Sophia 1,1 2,1 3,2 3,2 2,2 1,3 1,3 3,3 2,1 _________________________________________________________________________________________________ Output file format Your program must simply produces as output a textfile. If the input file is called ABC.txt then the output file must be called matches_ABC.txt that contains the list of match pairs employers – students keeping the same order for the company names as listed in the input file. Match 0: Thales - Olivia Match 1: Canada Post - Jackson Match 2: Cisco - Sophia You must follow this exact format in which matches are listed from 0 to n-1 (match i being the match for company i). Company and student names are separated by a dash symbol (-). If you do not follow this format, your solution will not be evaluated. Requirements • You must create a program following the Gale-Shapley algorithm exactly as described above. You have to use the data structures and the procedure as described. You cannot propose your own variant of the algorithm. • You must create a class called Gale-Shapley with the data structure Sue, PQ, A, students, employers as described. For the implementation of these ADTs, you are free to use the standard Java classes, the implementations given in the book or in the class notes or using your own implementations. But the stack used must have pop and push methods each running in O(1) and the priority queue must have insert and a removeMin methods each running in O(log n). • Your class must have an initialize(filename) method that reads the input file and performs all initialization steps as described above. • Your class must have an execute() method that perform the Gale-Shapley algorithm as described above. _________________________________________________________________________________________________ Annex: algorithm walkthrough This is a step-by-step analysis of the algorithm for the simple case given on pages 1-2. Sue= [ 0 1 2 Students= {-1, -1, -1} Employers= {-1, -1, -1} A= {1, 2, 3} {1, 2, 3} {2, 3, 1} PQ[0]= {(1,0),(2,1),(3,2)} PQ[1]= {(3,0),(2,1),(1,2)} PQ[2]= {(1,0),(3,1),(2,2)} Step 1: 2 <- Sue.pop() Sue= [ 0 1 0 <- PQ[2].removeMin() PQ[2]= {(3,1),(2,2)} -1 <- e’=Students[0] Students[0]= 2 Employers[2]= 0 Match: Cisco-Olivia Step 2: 1 <- Sue.pop() Sue= [ 0 2 <- PQ[1].removeMin() PQ[1]= {(3,0),(2,1)} -1 <- e’=Students[2] Students[2]= 1 Employers[1]= 2 Match: CanadaPost-Sophia Step 3: 0 <- Sue.pop() _________________________________________________________________________________________________ Sue= [ 0 <- PQ[0].removeMin() PQ[0]= {(2,1),(3,2)} 2 <- e’=Students[0] (1<-A[0][0]) < (3<-A[0][2]) Students[0]= 0 Employers[0]= 0 Employers[2]= -1 Sue= [ 2 Match: Thales-Olivia Step 4: 2 <- Sue.pop() Sue= [ 2 <- PQ[2].removeMin() PQ[2]= {(3,1)} 1 <- e’=Students[2] (1<-A[2][2]) < (3<-A[2][1]) Students[2]= 2 Employers[2]= 2 Employers[1]= -1 Sue= [ 1 Match: Cisco-Sophia Step 5: 1 <- Sue.pop() Sue= [ 1 <- PQ[1].removeMin() PQ[1]= {(3,0)} -1 <- e’=Students[1] Students[1]= 1 Employers[1]= 1 Match: CanadaPost-Jackson Sue is empty!

The pseudo code for a procedure that swaps the values of its two parameters is s

The pseudo code for a procedure that swaps the values of its two parameters is
swap(a, b)
temp := a
a = b
b := temp
end swap
Translate the pseudo code procedure to a two register parameter masm procedure
Create an array of randomly ordered integers in the main procedure. Write a two parameter procedure whose first parameter is an array and whose the second parameter is the number of elements in the array. The procedure exchanges each consecutive pair of integers in the array.  Use the invoke and proto directives to write the procedure.

Hello! I’m wondering if you can do this following project for me within the atta

Hello!
I’m wondering if you can do this following project for me within the attachment in Java. I just don’t have time to work on this myself due an emergency.
This is Data Stuctures, so you have to make your own ADTs and such.
For example, if you need to use an ArrayList, you can’t use the built-in ones in Java, you have to make your own. My previous project which involves a Priority Queue/Binary Tree, we had to build them from scratch using my ArrayList which I built. Each new class/adt needs to be its own file. (Ex. PriorityQueue.java)
The only things you can import is stuff for importing/reading/writing a file (java.io.File/PrintStream, util.Scanner, etc) but everything else must be built from scratch. I’ve provided my ArrayList which you can freely used, named ArrayListStack.java and StackADT.java. If something is unclear, please let me know.
The input files are all in “Input Files.zip” and the output files must be named pretty much the same, but with Output at the end. (Ex. Input: asc1K.dat -> asc1KOutput.dat) and format it in a nice output if possible.
So, the idea is, if using Eclipse, when you run the program, it will take those input files, compute the results, and store them in the output file. When running the program, it should also display (via System.out.println) on what “string” or “input” is currently being processed. There should also be error cases that should print out.
The assignment mentions to use either iteration or recursion. Please use iteration for both sorts.
tl;dr
Can’t use most built-in import Java libraries except for file reading/writing/runtime, must create classes.
How the program will work (If Eclipse), Run -> Takes Input .dat Files -> Processes/Let User know via System.println -> Output files
Also print the run times as well as mentioned at the bottom of the assignment.
—-
Also once you finished this, can you answer some questions for me on a notepad? For I also need to write a report about it.
1) What is the time and space complexity, and why?
2) Why iteration over recursion?
3) What happens if recursion was chosen?
Once you read the assignment (assignment.png), and if you can do all of it, please let me know!

You will be designing an Algorithm and developing a C++ Program for the problem

You will be designing an Algorithm and developing a C++ Program for the problem described below:Have the user input three test grades and then display the tests in increasing order, followed by the average.
For example:
Enter score 1: 88.8
Enter score 1 :50
Enter score 1 :100
The average of 50, 88.8 and 100 is: 79.6
(( Please view the file for full set of instructions ))

Have to follow format for the assignment including all the functions that are al

Have to follow format for the assignment including all the functions that are all pre-imported. No use of print instead uses stdio.write and no def. Also have to fill out the report file, doesn’t have to be too long for each problem as long as you explain the approach, issues and resolution (can be anything you think would be difficult for a new cs student)