Assignment 2: MARIE and ISA Value: 15% Due date: 12-May-2018 Task 1. (a) The Fibonacci numbers are the numbers in the following integer sequence, called the Fibonacci sequence, and are characterised by the fact that every number after the first two is the sum of the two preceding ones: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 114, … etc. By definition, the first two numbers in the Fibonacci sequence are 0 and 1, and each subsequent number is the sum of the previous two. We define Fib(0)=0, Fib(1)=1, Fib(2)=1, Fib(3)=2, Fib(4)=3, etc. The first 22 Fibonacci numbers given below:Fib(0) Fib(1) Fib(2) Fib(3) Fib(4) Fib(5) Fib(6) Fib(7) Fib(8) Fib(9) Fib(10)0 1 1 2 3 5 8 13 21 34 55Fib(11) Fib(12) Fib(13) Fib(14) Fib(15) Fib(16) Fib(17) Fib(18) Fib(19) Fib(20) Fib(21)89 144 233 377 610 987 1597 2584 4181 6765 10946Write a MARIE program to calculate Fib(n), where the user inputs n. For example, if the user inputs 7, the program outputs the value 13; if the user inputs 15, the program outputs the value 610; if the user inputs 20, the program outputs the value 6765 etc. You need to write and run the program using MARIE simulator. Please include appropriate comments to make your code readable.[10 marks] (b) For some values of n, your program will not produce correct results. You can check this by gradually increasing the values of n and checking for the correct outputs. What is the maximum value of n for which your program produces a correct result? Why? Please comment on this [5 marks]. 2. You are designing an instruction set for your computer. All the instructions are of same size (11 bits long). The size of an address field is 4 bits. You have already designed six 2-address instructions and 30 1-address instructions. How many 0-address instructions still you can fit? Justify your answer. [7 marks] 3. Write codes to implement the expression: A= (B + C) * (D – E) on 3-, 2-, 1- and 0-address machines. In accordance with programming language practice, computing the expression should not change the values of its operands. [8 marks] Rationale This assessment task covers topics on CPU operation and Instruction Set Architecture, and has been designed to ensure that you are engaging with the subject content on a regular basis. More specifically it seeks to assess your ability to:? be able to investigate the internal operation of the Central Processing Unit (CPU) and describe how it is used to execute instructions; ? be able to investigate and describe in detail the essential elements of computer organisation including internal bus, memory, Input/Output ( I/O) organisations and interfacing standards and discuss how these elements function; ?Presentation File naming convention: When you upload files to the TURNITIN for this subject, please use your student ID and Assignment number to name your files. For example, 123456_Assignment2.doc or 123456_Assignment2.mas (where 123456 is your Student ID) Please also adhere to the following formatting rules: 1. For Q1(a) you need to submit a *.mas file. 2. Please compose the answers of 1(b), 2 and 3 in a document file (doc or docx format). Please do not submit in pdf formats. Please upload the document in the TURNITIN within deadline. 3. You may put the mas file and document file in a folder, compress the folder and upload the compressed file to the TURNITIN. You may also upload the two files separately. 4. The first page (cover page) of the document file should have the following information clearly mentioned: a. Your full name b. Your Student ID c. Subject Code (ITC544) d. Assessment item number and name (Assignment 2: MARIE & ISA) 4. Each page should have page numbers in “page x of y” format (including the cover page). 5. You DO NOT need to provide any references for any of the questions.

Order Now For this paper or similar assignments, Trust us today & live to tell a success tale of best grades & plagiarsim free work!!

Let’s block ads! (Why?)

Send us your paper details now

We’ll find the best professional writer for you!

This template supports the sidebar's widgets. Add one or use Full Width layout.

This website uses cookies to improve your experience. We'll assume you're ok with this, but you can opt-out if you wish.Accept Read More

Privacy & Cookies Policy

error: Content is protected !!