1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
A
Planning desserts
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
Ingredients (per serving) of each dessert
Snack bar Ice cream
Calories
120
160
Fat (grams)
5
10
Grams per
Data Section
Product A
Selling Price
Quantity
$
Product B
2.50 $
457
Product C
3.75 $
787
Product D
4.95 $
87
2.85
987
Report Section
Product A
Revenue
Product B
Product C
$ 1,142.50 $ 2,951.25 $ 430.65 $ 2,812.95
Data Section
Product A
Product B
Product
Business and Economics
ACW2851 Accounting Information Systems and Financial Modelling
Lecture 6
Documenting Accounting Information Systems
Adapted from:
Simkin, Rose, & Norman (2012) Core Concepts of Accounting Information Systems (12th ed.) and
Gelinas &
Monash students to pass their unit MUST
pass their hurdle in the exam
and total marks must be more / equal to 50
=IF(logical_test, do this if true , do this if false)
And
Logical_test => AND(logical condition 1, logical condition 2)
StudentID
CseWork Fina
Step2ans
TUTORIAL EXERCISE
NAME:
FILENAME: Loan2851
TUTE:
LOAN REPAYMENT SCHEDULE (DONOT contain Data Table see next tutorial)
* * * * * *
DATA SECTION:
AMOUNT OF LOAN
INTEREST PER ANNUM
$100,000
10.00%
PERIODS PER ANNUM
2
TERM OF LOAN (in years)
5 YEARS
FIT1047 S1 2016
Assignment 1
Submission guidelines
This is an individual assignment, group work is not permitted.
Deadline: April 17, 2016, 11:55pm
Submission format: PDF for the written tasks, LogiSim circuit files for task 1, MARIE
assembly files for ta
Tutorial 01
[Solutions to the tasks and some additional explanations]
Task 1
A. List of parts available in a PC or a Laptop:
Name of the Parts
Related element in von Neumann
Architecture
Central Processing Unit (CPU)
CPU
Monitor, Speakers
Input/Output
Key
CH116 - General Chemistry 2 - Solutions to HW Problems - Chapter 11 HW: Chapter 11: Problems 28, 32, 34, 44, 50, 52, 56, 58, 62, 64, 66, 72, 76 28. In lab you need to prepare at least 100 mL of each of the following solutions. Explain how you would procee
Chapter 2
Probability
2.1
Reference books
1. D.S. Moore and G.P. McCabe, Introduction to the practice of statistics,
Freeman: New York, 7th edition, 2011.
2. G. James, Modern Engineering Mathematics, 4th edition, Prentice
Hall, 2007.
2.2
Elementary probab
MAT2003
Continuous Mathematics for
Computer Science
Lecture notes, Semester 2 2015
Dr Jennifer Flegg
These notes have been adapted from previous lecture
notes written by several members of the School of
Mathematical Sciences
Contents
1 Combinatorics
1.1 R
Chapter 3
Experimental design and
analysis
3.1
Reference books
1. D.S. Moore and G.P. McCabe, Introduction to the practice of statistics,
Freeman: New York, 7th edition, 2011.
2. G. James, Advanced Modern Engineering Mathematics, 3rd edition,
Prentice Hal
Monash University
School of Mathematical Sciences
MAT2003 Continuous Mathematics for Computer Science
(Semester 2, 2015)
Assignment 2
This is the second of three assignments worth 10% each. It is to be submitted to your support
class instructor in your su
MONASH UNIVERSITY
SCHOOL OF MATHEMATICAL SCIENCES
MAT2003 Continuous Mathematics for Computer Science
Laboratory 4 2015 Semester 2
(Week 5, beginning Monday 24 August 2015)
SOLUTIONS
As part of answering all lab questions in this unit, give reasons and ma
MONASH UNIVERSITY
SCHOOL OF MATHEMATICAL SCIENCES
MAT2003 Continuous Mathematics for Computer Science
Laboratory 2 2015 Semester 2
(Week 3, beginning 10 August 2015)
SOLUTIONS
As part of answering all lab questions in this unit, give reasons and mathemati
MONASH UNIVERSITY
SCHOOL OF MATHEMATICAL SCIENCES
MAT2003 Continuous Mathematics for Computer Science
Laboratory 3 2015 Semester 2
(Week 4, beginning Monday 17 August 2015)
SOLUTIONS
As part of answering all lab questions in this unit, give reasons and ma
MONASH UNIVERSITY
SCHOOL OF MATHEMATICAL SCIENCES
MAT2003 Continuous Mathematics for Computer Science
Mathematics Laboratory 1 2015 Semester 2
(Week 2, beginning 3 August 2015)
SOLUTIONS
The more problems you have solved, the more likely it is that you wi
MAT1830
Discrete Mathematics for Computer Science
Lecture Notes
Prepared by John Stillwell and Daniel Delbourgo.
Edited by Chris Hough and Tom Hall.
Contents
Lecture
Lecture
Lecture
Lecture
Lecture
Lecture
Lecture
Lecture
Lecture
Lecture
Lecture
Lecture
L
MAT1830 - Discrete Mathematics for Computer Science
Assignment #9
To be handed in at your support class in week 11 (1923 May)
Show your working for all questions.
1. An airline demands that all carry-on bags must have length + width + height at most 90cm.
MAT1830 - Discrete Mathematics for Computer Science
Assignment #10
To be handed in at the beginning of your support class in week 12 (2630 May)
Show your working for all questions.
1. Consider the following graph.
P
Q
R
S
T
U
(a) What are the degrees of t
MAT1830 - Discrete Mathematics for Computer Science
Assignment #8
To be handed in at the beginning of your support class in week 10 (12 16 May)
Show your working for all questions.
1. Let s0 , s1 , s2 , . . . be a sequence dened recursively by
s0 = 3,
s1
MAT1830 - Discrete Mathematics for Computer Science
Assignment #5
To be handed in at the beginning of your support class in week 7 (14 17 April)
Note: Fri 18 April is a holiday and classes will not run then. If your usual support class is on Friday, feel
MAT1830 - Discrete Mathematics for Computer Science
Assignment #7
To be handed in at the beginning of your support class in week 9 (5 9 May)
1. Write down the rst ve values of each of the following recurrence relations.
(a) r0 = 1,
rn = 2(rn1 )2 2
(b) s0
MAT1830 - Discrete Mathematics for Computer Science
Assignment #4
To be handed in at the beginning of your support class in week 6 (711 April)
Show your working for all questions.
(1) Dene a sequence of integers a1 , a2 , a3 , . . . by
a1 = 2, a2 = 8,
and