All of the work you submit must be done by only you, and your work must not be submitted by someone else. Plagiarism is academic fraud and is taken very seriously. For Comp251, we will use software that compares programs for evidence of similar code. This software is very effective and it is able to identify similarities in the code even if you change the name of your variables and the position of your functions. The time that you will spend modifying your code, would be better invested in creating an original solution.

Compressing data means reducing the number of bits needed to represent it. Compressed data, due to its reduced size, is a lot faster to transfer and less expensive to store, freeing up storage and increasing network capacity. Algorithms that perform data compression are known as data compression algorithms. Data compression algorithms are divided into two categories: lossy and lossless. Lossy compression algorithms compress more than lossless compression algorithms, but at the cost of losing some information, which can’t be recovered. Lossy compression algorithms are typically used for audio and video files, where a loss in quality is tolerable and often not noticeable. Lossless compression algorithms on the other hand don’t compress as much, but do not lose any data, meaning compressed information can be exactly reconstructed back into its uncompressed form. Lossless compression algorithms are used for data that must maintain integrity, such as binaries, text documents, and source code.

You will find below the specs for assignment 3. It is a rehash of A3, with some slight differences:  no simultaneous proposers  ability to use socket communication or communication through files - that is, the proposer writes the proposal to a file, and all other entities do a busy wait on reading that file  the assessment is focused on testing

1. This is a collection of possible exam questions . Some of them are taken from previous assignments and tutorials, sometimes with slight changes to make them more suitable for an exam. Question 1 is actually from one of the previous exams. 2. Please note that the questions, the number of sub-questions and the weighting are just examples. The exam will somewhat differ... 3. The final exam will be a partially-open book exam: Your are allowed to bring one doublesided A4 sheet of paper of your own notes to the exam, but otherwise no course materials or textbooks are allowed. 4. There will be common questions to be answered by all streams, plus a few dedicated questions per stream (either INFO2120 or INFO2820). Check your exam thoroughly for which parts you are expected to answer. Do not miss any subquestion (the exam will be printed double-sided) nor answer a question for the wrong stream... 5. Try to answer all questions within the space provided on this question paper.

In this final project, you will create a substantial portion of a 3D Lander-style game from scratch in C++ using the components you have worked on from pervious assignments including lighting, physics, octree subdivision, particle simulation and more. The player will be able move the “vehicle” using physics and thrust forces to control landing of the spacecraft on a highly detailed terrain model. The player will have control over the motion of the craft, camera views. Upon successful decent, the game will do collision detection between the craft and the surface of the planet while the player touches down. Accompanying sounds will enhance the experience. The example shown in class is a “Lunar Lander” style, but you can customize the experience to any type of vehicle-terrain interaction game if you meet the technical requirements.

In this coursework we will continue our study of mortgages in the US, but now we will analyze results at a zipcode level. The question that we want to answer is “can satellite images help our modelling process?”. For this, you are given two datasets:

1. Please write the following statement “”I have not given or received any unauthorized assistance on this examination” and sign it. Your work will not be graded without such a signed statement. 2. For the Calculations questions, be sure to show your computations and to write down whatever equation you use. In order to receive full credit for a problem, you should show all of your work and explain your reasoning. Circle your final answer. Good work can receive substantial partial credit even if the final answer is incorrect. 3. If you make a mistake in a multi-part question, later parts will be graded for following through correctly. You should try all parts of a problem even if you get stuck on an early part. If necessary, state and assume a value from an earlier part. 4. If you are unsure of what a question is asking for, do not hesitate to ask the instructor for clarification via email. 5. You may need to use a calculator to answer some questions.

• questions for students with student numbers ending in 0,1,2,3,4. − if the incorrect assignment is submitted, this is a mark of zero (0) − you can use previous exercises & solutions, lectures notes, and the internet…but the work is your own! • complete the questions below, with marks for each distributed against, − providing valid solutions, that are well-written and for programs that are efficient and well-structured − programs with proper & adequate documentation (program header & comments), and well-named identifiers − when required, clear & informative user interaction (clear prompts) − sufficient output capture showing/proving program solutions solve the given problem • some questions may have multiple parts, and with marks given across all parts included in the solution (partial marks given for parts completed…output capture still required to show functionality for your completed work)

• This part is about the shunting yard algorithm by Dijkstra. The prelim‑ inary part is due on 4 December at 5pm and worth 3%. Any 1% you achieve in the preliminary part counts as your “weekly engagement”. • Make sure the files you submit can be processed by just calling scala <<filename.scala>> on the commandline.1 Use the template files provided and do not make any changes to arguments of functions or to any types. You are free to implement any auxiliary function you might need. • Do not leave any test cases running in your code because this might slow down your program! Comment out test cases before submission, otherwise you might hit a time‑out. • Do not use any mutable data structures in your submissions! They are not needed. This means you cannot create new Arrays or ListBuffers, for example. • Do not use return in your code! It has a different meaning in Scala than in Java. It changes the meaning of your program, and you should never use it. • Do not use var! This declares a mutable variable. Only use val! • Do not use any parallel collections! No .par therefore! Our testing and marking infrastructure is not set up for it. Also note that the running time of each part will be restricted to a maximum of 30 seconds on my laptop.

In this assignment, you will investigate memory access patterns, simulate the operation of page tables and implement several page replacement algorithms. This will give you some practice working with the algorithms we have been talking about in class.