Write a rudimentary spreadsheet program. Display a grid of cellswith columns A through H and rows 1 through 20. Accept input in thefirst row of the screen. The commands are of the form column rowentry, where entry is a number, a cell address preceded by a plus(e.g., +A5), a string, or a function preceded by an at sign, @. Thefunctions are: max, min, avg, and sum. During execution of yourprogram, build and modify the graph reflecting the situation in thespreadsheet. Show the proper values in proper cells. If a value ina cell is updated, then the values in all cells depending on itshould also be modified. For example, after the following sequenceof entries: A1 10
B1 20
A2 30
D1 +A1
C1 @sum(A1..B2)
D1 +C1 both cells C1 and D1 should display the number 60. Considerusing a modification of the interpreter from Chapter 5 as anenhancement of this spreadsheet so that arithmetic expressionscould also be used to enter values, such as C3 2*A1
C4 @max(A1..B2) -(A2 + B2) in C++ please . . .
Consider this prolog program rainy(vancouver) rainy(sept_iles). snowy(x) :- rainy(x), cold(x) Draw the search tree for the query snowy(C) The search begins at snowy(C) and finds the rule snowy(X), which then becomes the goal, with C unified to X. Prolog must then establish both rainy(X) and cold (X). It establishes rainy (X) by finding rainy(vancouver), thus (temporarily) unifying X with vancouver. But then it must also find cold(vancouver). Because this fails, prolog backtracks and so it unifies rainy with sep tiles. Going back up the tree, it finds cold(sep tiles) and returns snowy(sept iles).
February 5, 2016
6:38 am
Read More »
