a3 - McGill University COMP251 Assignment 3 Worth 10 Due...

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

View Full Document Right Arrow Icon
McGill University COMP251: Assignment 3 Worth 10%. Due October 29 at the beginning of lecture (10am sharp!) Question 1 Give an algorithm that sorts (into non-decreasing order) an input array of n integers in the range 0 to n 3 - 1. Your algorithm must run in O ( n ) time. Question 2 For this question, an arithmetic expression (or just expression) is built from integers and variables x 1 ,x 2 ,..., using the operations + , - , × , ÷ as follows: any number is an expression, any variable is an expression, if A and B are expressions, then so are ( A - B ) and ( A ÷ B ), if A 1 , A 2 , ... , A k are expression, then so are ( A 1 + A 2 + ... + A n ) and ( A 1 × A 2 × ... × A n ) For example, (( x 1 + 5 + ( x 2 × 3 × x 6 ) + ( x 2 ÷ x 1 )) - 4) is an expression. (a) Give a data structure for representing arithmetic expressions as trees of unbounded branch- ing. Clearly explain the ±elds you are using. (b) Give an algorithm that on input (
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/05/2009 for the course COMP COMP 251 taught by Professor Phuongnguyen during the Fall '09 term at McGill.

Page1 / 2

a3 - McGill University COMP251 Assignment 3 Worth 10 Due...

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

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