Ass5 - Introduction to Computer Engineering 1 Assignment 5 Datapaths Due Date 5:00 PM Wednesday 31th March 2010 5 penalty for submission within 24

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Introduction to Computer Engineering 1 Assignment 5 Datapaths Due Date: 5:00 PM Wednesday 31 th March 2010 5% penalty for submission within 24 hrs after Question 1 Implement a “C” language function that computes the factorial of a number, recursively, according to the following prototype: void factorial (long argument, long *result); If you are unsure how to proceed, try Googling on the keywords recursive and factorial; the function is relatively straightforward to write. Demonstrate your function by writing an interactive test program that operates as follows: % factorial 6 6! = 720
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Question 2 The figure shown above shows a datapath for a 4-bit x 4-bit unsigned binary multiplier adapted from the one shown in Patterson and Hennessy. The corresponding algorithm, taken literally from the text, is reproduced below. 0. Init . Place Multiplicand in Multiplicand register. Place Multiplier in lower half of Product register. Clear upper half of Product register
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 05/06/2010 for the course ENG ECSE221 taught by Professor Ferri during the Winter '09 term at McGill.

Page1 / 3

Ass5 - Introduction to Computer Engineering 1 Assignment 5 Datapaths Due Date 5:00 PM Wednesday 31th March 2010 5 penalty for submission within 24

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online