CSCI$4200$FA$24$HW$4$

Search $($Cmd $+$ Ctrl $+$ U$)$

Home

Insert

Design

Layout

References

Mailings

Review

View

Share

Subscription Required to Edit and Save Start your free one month trial of Microsoft $365$ or sign in to activate an existing subscription.

CSCI $4200$ Fall $2024$

HW $4$

$60$ points

Due: $11$:$59$ PM$,(10)/(21)()/(2024)$

The answers must be typed. Please do not change the number or the order of the questions.

Question $1$:

Assume the following rules of associativity and precedence for expressions:

Preedence Highest $*,()/(),$ not

$,,+-\backslash$epsi $,$ mod

$($unary$)$

$=(,)/()=,<,<=,>=,>$

and or$,$ xor

Lowest

Associativity

Left to right

Show the order of evaluation of the following expressions by parenthesizing all subexpressions and placing a superscript on the right parenthesis to indicate order. For example, for the expression

a$+$b$*$c$+$a

the order of evaluation would be represented as

$(($a$+($b$*$c$)^(2))^(2)+$d$)^(2)$

$-$a$+$b

a$+($b$-1)/($c$)$modd

$-$a or c$=$d and e

Hint: For question $1,($atb$)$ is calculated first, then compute negative $($atb$),$ which is $-$

$($ath$).$ Please add $1$ and $2$ of the order of calculation.

Question $2$:

Show the order of evaluation of the expressions in question $1,$ assuming that there are no precedence rules and all operators associate right to left.

$-$a$+$b

$-$a$+$b

a$+($b$-1)/($c$)$modd

or c$=$d and e

Page $1$ of $1$

$123$ words

English $($United States$)$

Accessibility: Investigate