Higher Nationals - Internal Verification of Assessment Decisions - BTEC (RQF)

Higher Nationals -
Internal verification of assessment decisions – BTEC (RQF)

INTERNAL VERIFICATION – ASSESSMENT DECISIONS
Programme title BTEC Higher National Diploma in Computing
Assessor Internal Verifier
Unit(s) Unit 11 : Maths for Computing
Assignment title Importance of Maths in the Field of Computing
Student’s name BRINDHA SHREE RAVIDAAS
List which assessment Pass Merit Distinction

criteria the Assessor
has awarded.
INTERNAL VERIFIER CHECKLIST
Do the assessment criteria
awarded match those shown in the Y/N
assignment brief?
Is the Pass/Merit/Distinction grade
awarded justified by the assessor’s Y/N
comments on the student work?
Has the work been assessed Y/N
accurately?
Is the feedback to the student:
Give details:
• Constructive?
Y/N
• Linked to relevant
Y/N
assessment criteria?
Y/N
• Identifying
opportunities for Y/N
improved
performance?
• Agreeing actions?
Does the assessment decision need Y/N
amending?
Assessor signature Date
Internal Verifier signature Date

Programme Leader signature
Date
(if required)
I|P a g e B R I N D H A S H R EE R A V ID A A S M F C R EG N O - N EG / A - 0 1 6 4 6 9
Confirm action completed
Remedial action taken
Give details:
Assessor signature Date

Internal
Date
Verifier
signature
Programme Leader
Date
signature (if
required)
II | P a g e B R I N D H A S H R E E R A V I D A A S M F C R E G N O - N E G / A - 0 1 6 4 6 9
Higher Nationals – Summative Assignment Feedback Form
Student Name/ID BRINDHA SHREE RAVIDAAS/ NG09919

Unit Title Unit 11 : Maths for Computing
Assignment Number 1 Assessor
Date Received 1st
Submission Date
submission
Date Received 2nd
Re-submission Date
submission
Assessor Feedback:
LO1 Use applied number theory in practical computing scenarios.

Pass, Merit & P1 P2 M1 D1
Distinction Descripts
LO2 Analyse events using probability theory and probability distributions.
LO3 Determine solutions of graphical examples using geometry and vector methods.
LO4 Evaluate problems concerning differential and integral calculus.

Grade: Assessor Signature: Date:

Resubmission Feedback:
Grade: Assessor Signature: Date:
Internal Verifier’s Comments:
Signature & Date:
3|P a g e B R I N D H A S H R EE R A V ID A A S M F C R EG N O - N EG / A - 0 1 6 4 6 9
Student Declaration
I hereby, declare that I know what plagiarism entails, namely, to use another’s work
and to present it as my own without attributing the sources in the correct way. I further
understand what it means to copy another’s work.
1. I know that plagiarism is a punishable offence because it constitutes theft.

2. I understand the plagiarism and copying policy of the Edexcel UK.
3. I know what the consequences will be if I plagiaries or copy another’s work in any
of the assignments for this program.
4. I declare therefore that all work presented by me for every aspects of my program,
will be my own, and where I have made use of another’s work, I will attribute the
source in the correct way.
5. I acknowledge that the attachment of this document signed or not, constitutes a
binding agreement between myself and Edexcel UK.
6. I understand that my assignment will not be considered as submitted if this
document is not attached to the attached.
[email protected]
Student’s Signature: Date:
(Provide E-mail ID) (Provide Submission Date)
Feedback Form
Formative Feedback : Assessor to Student
Action Plan
Summative feedback
Feedback: Student to Assessor.

Mr. Nadheera is one of the supportive lecturers I got at college. He made me so
comfortable and made me complete this assignment successfully. I was really
impressed with the level of expertise and the understanding he had on me. My
sincere gratitude to Mr. Nadheera, without you this is not possible. Thank you so
much sir.
Assessor’s
Date
Signature
Student’s
Signature [email protected] Date
Assignment Brief
Student Name /ID BRINDHA SHREE RAVIDAAS/NG09919

Number
Unit Number and Title Unit 11 : Maths for Computing
Academic Year 2021/2022
Unit Tutor Mr. NADHEERA
Assignment Title Importance of Maths in the Field of Computing
Issue Date
Submission Date
IV Name & Date
Submission Format:
This assignment should be submitted at the end of your lesson, on the week stated at
the front of this brief. The assignment can either be word-processed or completed in
legible handwriting.
If the tasks are completed over multiple pages, ensure that your name and student
number are present on each sheet of paper.
PEARSON BTEC
HND
COMPUTING
UNIT 11: MATHS FOR COMPUTING
Table of Contents
ACTIVITY O1...................................................................................................................................................................10
LO1: Use applied number theory in practical computing scenarios........................................................................10
ACTIVITY 02....................................................................................................................................................................16
LO2: Analyze events using probability theory and probability distributions. .......................................................16
ACTIVITY 03....................................................................................................................................................................38
LO3: Determine solutions of graphical examples using geometry and vector methods. .......................................38
ACTIVITY 04....................................................................................................................................................................45
Bibliography ......................................................................................................................................................................55
LIST OF TABLES
Table 1: Probability distribution of X (author’s work) ................................................................................ 23
LIST OF FIGURES
Figure 1: Activity 1, Question 4(Authors Work) ........................................................................................... 12
Figure 2: Activity 01, question 5(author’s work) .......................................................................................... 13
Figure 3: Activity 01, question 5(author’s work) .......................................................................................... 14
Figure 4: Activity 02, question 2a (author’s work) ....................................................................................... 17
Figure 5: Activity 02, question 2b (author’s work) ....................................................................................... 18
Figure 6: Activity 02 question 03 a(author’s work) ...................................................................................... 19
Figure 7: Activity 02 question 03 b, c (author’s work) ................................................................................. 20
Figure 8: Activity 02, Question 4a,b (Author’s work) .................................................................................. 21
Figure 9: Activity 02, Question 4c (Author’s work) ...................................................................................... 22
Figure 10: Probability histogram of X (author’s work) ............................................................................... 23
Figure 11: continuous random variable pdf .................................................................................................. 24
Figure 12: p.d.f graph ...................................................................................................................................... 24
Figure 13: Activity 02, Question 6a (Author’s work) ................................................................................... 25
Figure 14: Activity 02, Question 6b (Author’s work) ................................................................................... 26
Figure 15: Activity 02, Question 6c (Author’s work) .................................................................................... 27
Figure 16: Activity 02, Question 6d (Author’s work) ................................................................................... 28
Figure 17: Activity 02, question 07 (Author's work)..................................................................................... 29
Figure 18: Activity 02, question 10 (Author's work)..................................................................................... 30
Figure 19: Activity 02, Question 11 (Author's work) .................................................................................... 31
Figure 20: Activity 02 Question 12a (Author’s work) .................................................................................. 32
Figure 21: Activity 02 Question 12b,c (Author’s work) ............................................................................... 33
Figure 22: Activity 02 Question 12d (Author’s work) .................................................................................. 34
Figure 23: Hash function ................................................................................................................................. 35
Figure 24: Balls and Bins ................................................................................................................................. 35
Figure 25: Hash Table...................................................................................................................................... 36
Figure 26: Activity 03 Question 1 (Author’s Work) ..................................................................................... 38
Figure 31: Activity 03 Question 5i (Author’s Work) ................................................................................... 43
Figure 32: Activity 03 Question 5ii (Author’s Work) ................................................................................... 43
Figure 36: Activity 04, Question 3 (Author's work) ...................................................................................... 46
Figure 40: Activity 04, Question 5 (Author's work)...................................................................................... 49
ACTIVITY O1
LO1: Use applied number theory in practical computing scenarios.
PART 01
a) 20 squares
b)
20M
REAM OF CLOTH 16M
• Finding the length of towel using HCF:

2 16, 20
2 8, 10
4, 5 4 and 5 aren’t divisible by 2

2x2=4
Therefore;
4 is the length of the
• Area of the
A= l x b
=4x4
= 16 m2
• Area of the ream of cloth;
A= l x b
= 16 x 20
= 320 m2
• Squared pieces that can be cut are;
320/16 = 20 pieces.
10 | P a g e B R I N D H A S H R E E R A V I D A A S M F C R E G N O - N E G / A - 0 1 6 4 6 9
2.0
a) 24th
b) Finding on which day the customers will come next using LCM;
2 2 4 6 8
2 1 2 3 4
2 1 1 3 2
2 1 1 3 1
3 1 1 3 1
3 1 1 1 1
Therefore the LCM is = 2x2x2x3 = 24
PART 02
3.0
a) 255 logs
b) Sn = n/2 ( a + l)
= 15/2 (10+24)
= 15/2 (34)
= 255
Sum of arithmetic progression equation is applied to find the total number of logs.
4.0
• 1st year salary = Rs. 50000 and 4% raise for every year.
At the 10th year his salary would be = Rs. 71,165.55
Total amount from the 1st to 10th year = Rs. 6,00,305.212
Working is shown below.
(Space left intentionally)
Figure 1: Activity 1, Question 4(Authors Work)
PART 03
5.0
Figure 2: Activity 01, question 5(author’s work)
Figure 3: Activity 01, question 5(author’s work)
6.0
Prime numbers are ordinary counting integers that can be divided by 1 and the prime number itself. Prime
numbers play important role in computing. E.g;
• Cryptography - the RSA system in cryptography uses prime numbers widely to calculate the public and
the private keys. The strength of this system relies on the difficulty of factoring large numbers-
specifically the difficulty associated with the finding of the specific pair of prime numbers selected to
create a large integer called the modulus.
• Diffie-Hellman Key Exchange in cryptography uses prime numbers. It uses a large prime number p as a
common modulus which is based on which two entities, let’s say A and B can communicate securely
using their private, undisclosed keys. It is mainly based on the property that if both A and B choose a
private key, let’s say „a‟ and „b‟ respectively, and agree upon a number, let’s say, „g‟ publicly, where
„g‟ is less than „p‟, then both A and B can send a message to the other one as follows:
A‟s message = M1 = g a modulo p
B‟s message = M2 = g b modulo p
Then,
X = M2 a modulo p = M1 b modulo p = g(a*b) modulo p,
Is the message shared. Its security lies in the difficulty involved in finding the shared message without
knowing either of the private keys.
• Calculating hash codes - A hash code is a number code for every object that is created by a program.
Hash codes are required for quick retrieval or storing of complex objects from or in a hash table. Hash
codes need to be reasonably unique for each object so that correctness is maintained. Prime numbers are
used in computing hash codes for this reason.
(9, September 2015)
Desai, T., 9, September 2015. Application of Prime Numbers in Computer Science. International Journal of
Science and Research (IJSR).

ACTIVITY 02
LO2: Analyze events using probability theory and probability distributions.
PART 01
1.0
Conditional probability is defined as the likelihood of an event or outcome occurring, based on the
occurrence of a previous event or outcome. Conditional probability is calculated by multiplying the
probability of the preceding event by the updated probability of the succeeding or conditional, event.
Formula;
P (B|A) = P (A ∩ B) ⁄ P (A)
E.g;
01)
Event A – an individual applying for college will be accepted.
80% is the chance that this individual will be accepted.
Event B – this individual will be given dormitory.
Only 60% of all students all accepted students.
P (Accepted and dormitory housing) = P (Dormitory housing/accepted) x P (Accepted)
= (60/100) x (80/100)
= 0.48 = 12/25
02)
The probability that it is Friday and that a student is absent is 0.03. Since there are 5 school days in a week,
the probability that it is Friday is 0.2. What is the probability that a student is absent given that today is
Friday?
P (Absent | Friday) = P (Absent and Friday)⁄P(Friday)
= 0.03/0.2
= 0.15
= 15 %
2.0
a)
Figure 4: Activity 02, question 2a (author’s work)
b)
Figure 5: Activity 02, question 2b (author’s work)
3.0
a)
Figure 6: Activity 02 question 03 a(author’s work)
b,c)
Figure 7: Activity 02 question 03 b, c (author’s work)
4.0
a,b)
Figure 8: Activity 02, Question 4a,b (Author’s work)
c)
Figure 9: Activity 02, Question 4c (Author’s work)
PART 02
5.0
i. Discrete Random Variable
Discrete random variable whose values are obtained by counting.
E.g;
• Number of pink marbles in a jar.
• Number students absent in a classroom.
• Number of tails when flipping a coin.
Discrete random variable X has a countable number of possible values.
For an example let’s say;
Let X represents the sum of two dices. The probability distribution of X will be;
x 2 3 4 5 6 7 8 9 10 11 12
P(X) 1/36 2/36 3/36 4/36 5/36 6/36 5/36 4/36 3/36 2/36 1/36
Table 1: Probability distribution of X (author’s work)
Probability distribution of a discrete random variable, constructs a histogram of probability.
0.18
0.16
0.14
0.12
Probability
0.1
0.08
0.06
0.04
0.02
0
2 3 4 5 6 7 8 9 10 11 12
Outcome
Figure 10: Probability histogram of X (author’s work)
ii. Continuous Random Variable
Continuous variable is a variable whose value is obtained by measuring, data can take infinitely many values.
E.g;
• Height of students in a classroom.
• Weight of students in classroom.
• Distance travelled between classes.
Probability function of the continuous random variable is called the probability density function, or briefly
p.d.f. It is denoted by f(x)f(x) where f(x)f(x) is the probability that the random variable XX takes the value
between xx and x+Δxx+Δx where ΔxΔx is a very small change in XX. ()
Figure 11: continuous random variable pdf
f(x)
f(x)
0 x x+ x
Figure 12: p.d.f graph
6.0
a)
Figure 13: Activity 02, Question 6a (Author’s work)
b)
Figure 14: Activity 02, Question 6b (Author’s work)
c)
Figure 15: Activity 02, Question 6c (Author’s work)
d)
Figure 16: Activity 02, Question 6d (Author’s work)
7.0
Figure 17: Activity 02, question 07 (Author's work)
PART 03
10.0
Figure 18: Activity 02, question 10 (Author's work)
11.0
Figure 19: Activity 02, Question 11 (Author's work)
12.0
a)
Figure 20: Activity 02 Question 12a (Author’s work)
b)
Figure 21: Activity 02 Question 12b,c (Author’s work)

d)
Figure 22: Activity 02 Question 12d (Author’s work)
13.0
13.1 Example for an application of Probability in Hashing.
A famous method to store a collection of items to support faster look-up is hashing them into a table; the issue
is when we attempt to store more than one item in the same slot. In hash tables, you store data in forms of key
and value pairs. The key, which is used to identify the data, is given as an input to the hashing function. The
hash code, which is an integer, is then mapped to the fixed size we have. We could store these in pairs in a
linked list but this requires a order of n ‘o(n)’ access time.
Figure 23: Hash function
Balls & Bins
Figure 24: Balls and Bins
• Throwing m balls into n bins uniformly and independently.
• I have added m items to an n- bucket hash table. What "interesting questions" can I ask about the
table's state?
Figure 25: Hash Table
• How large must m is such that it is likely there exists a bin with at least two balls? (Birthday Paradox)
P (all bins have at most one ball) = [n /n × n – 1/ n] × [n − 2 /n] × . . . × [n − m + 1/ n]
e.g;
For n = 365 and m ≥ 23 there is a greater than 1/2 chance that there exists a bin with two or more balls.
Recall that in this process we distribute k balls in n bins, where each ball is independently placed in a
uniformly random bin. We can ask questions such as:
• How large can we choose k while ensuring that with probability at least 1/2, no two balls land in the same
bin?
• If k = n, what is the maximum number of balls that are likely to land in the same bin?
As we shall see, these two simple questions provide important insights into two important computer science
applications: hashing and load balancing. Our answers to these two questions are based on the application of a
simple technique called the union bound, which states that P[A∪B] ≤ P[A] +P[B].
One of the basic issues in hashing is the trade-off between the size of the hash table and the number of
collisions.
Let’s see how this problem can be put into the balls and bins framework. The balls will be the m keys to be
stored, and the bins will be the n locations in the hash table T. Since the hash function maps each key to a
random location in the table T, we can see each key (ball) as choosing a hash table location (bin) uniformly
and independently from T. Thus the probability space corresponding to this hashing experiment is exactly the
same as the balls and bins space.
We are interested in the event A that there is no collision, or equivalently, that all m balls land in different
bins. Clearly Pr[A] will decrease as m increases (with n fixed). Our goal is to find the largest value of m such
that Pr[A] remains above 1/2 .
13.2 Load Balancing

Important practical issue in distributed computing is how to spread the workload in a distributed system
among its processors. Here we investigate an extremely simple scenario that is both fundamental in its own
right and also establishes a baseline against which more sophisticated methods should be judged. Suppose we
have m identical jobs and n identical processors. Our task is to assign the jobs to the processors in such a way
that no processor is too heavily loaded. Of course, there is a simple optimal solution here: just divide up the
jobs as evenly as possible, so that each processor receives either [m / n] or [m / n] jobs. However, this solution
requires a lot of centralized control, and/or a lot of communication: the workload has to be balanced evenly
either by a powerful centralized scheduler that talks to all the processors, or by the exchange of many
messages between jobs and processors. This kind of operation is very costly in most distributed systems. The
question therefore is: What can we do with little or no overhead in scheduling and communication cost?
Load Balancing: Balls & Bins
Each job simply selects a processor uniformly at random and independently of all others, and goes to that
processor. This scheme requires no communication. However, presumably it won’t in general achieve an
optimal balancing of the load. Let Ak be the event that the load of some processor is at least k.
Throwing m balls into n bins where each throw is independent.
• How full is the fullest bin? This has applications to load balancing.
What’s the probability that k or more items land in bin j?
• If X is the number of balls that land in bin j then X is a binomial distribution with m trials and p = 1/n
Let it be;
If m/n = 1 and k = 2 log;
And hence no bin has more than k = 2 log n balls in it with probability at least 1 − 1/n
(Anon., Spring 2015) , (McGregor, n.d.)
ACTIVITY 03
LO3: Determine solutions of graphical examples using geometry and vector
methods.
PART 01
1.0
Figure 26: Activity 03 Question 1 (Author’s Work)
2.0
3.0
4.0
y
(0,2) 2x-4y=3
0
(3/2,0) (10/3,)
x
3x+5y=10
(0,-3/4)
x=2.5 At
intersection
y=0.5
Therefore the point of intersection will be approximately (2.5, 0.5).
5.0
I.
z
x y
Figure 31: Activity 03 Question 5i (Author’s Work)
Equation y=4 shows all the set of pairs in R3 whose y coordinate is 4 ‘units’, it is the vertical line plane which
is parallel to ‘xz’ plane and 4 units right of it.
II.
z
x 0
Figure 32: Activity 03 Question 5ii (Author’s Work)
Equation z=5 shows the set [{x,y,z} Z=5 ] which is the set of all the points in the R3 where z coordinate is 5
‘units’ and this is the horizontal plane that is parallel to ‘xy’ plane and 5 units above it.
6.0
Tetrahedron’s volume a, b, c as co-terminal edges is obtained as follows:
Volume = 1/3*area of base*height

= V=1/3Bh=1/6||a×b||⋅h
Then,
h=||c||⋅|cos(θ)|.
V=1/6||a×b||⋅||c||⋅|cos(θ)|
|c⋅(a×b)|=||c||⋅||(a×b)||⋅|cos(θ)| and V=1/6|(a×b)⋅c
ACTIVITY 04
LO4: Evaluate problems concerning differential and integral calculus.
PART 01
1.0
2.0
PART 02
3.0
f(x) = 2x2 + 1
g(x) = 8 – 2x
4.0
PART 03
5.0
6.0
REFFERANCE
Works Cited
Attwood, Greg, et al. Edexcel as and a Level Modular Mathematics. Core Mathematics 1, C1. Harlow,
Pearson Schools, 2008.
---. Edexcel as and a Level Modular Mathematics. Core Mathematics 1, C1. Harlow, Pearson Schools, 2008.
---. Edexcel as and a Level Modular Mathematics. Further Pure Mathematics 1, FP1. Harlow, Pearson
Education Limited, 2009.
---. Further Pure Mathematics 2. Harlow, Pearson Education, 2009.
“Birthday Attack Probability | Hash Function Collisions.” Www.johndcook.com, 10 Jan. 2017,
www.johndcook.com/blog/2017/01/10/probability-of-secure-hash-
collisions/#:~:text=As%20a%20rule%20of%20thumb. Accessed 4 Mar. 2022.
CS 70 Discrete Mathematics and Probability Theory Spring 2015 Vazirani Note 15 Two Killer Applications:
Hashing and Load Balancing.
Desmos. “Desmos Graphing Calculator.” Desmos Graphing Calculator, 2021, www.desmos.com/calculator.
“Discrete Mathematics Tutorial - Javatpoint.” Www.javatpoint.com, www.javatpoint.com/discrete-
mathematics-tutorial.
“Example on Hashing + Probability | Techtud.” Www.techtud.com, www.techtud.com/example/example-
hashing-probability. Accessed 4 Mar. 2022.
HND in COMPUTING. Vol. UNIT 11: MATHS FOR COMPUTING, ESOFT METRO CAMPUS, 2019.
“Importance of Hashing.” GeeksforGeeks, 2 June 2020, www.geeksforgeeks.org/importance-of-hashing/.
Langmead, Ben. Hash Tables & Probability.
“Mathematics | Conditional Probability.” GeeksforGeeks, 13 Aug. 2015, www.geeksforgeeks.org/conditional-
probability/#:~:text=Conditional%20probability%20P(A%20%7C%20B. Accessed 4 Mar. 2022.
Mcgregor, Andrew. Balls into Bins CMPSCI 240: Reasoning about Uncertainty Lecture 19: Balls and Bins
and Hashing.
“Statistics - Random Variables and Probability Distributions | Britannica.” Encyclopædia Britannica, 2020,
www.britannica.com/science/statistics/Random-variables-and-probability-distributions.
“Tetrahedron - Definition, Properties, Formulas, Examples.” Cuemath,
www.cuemath.com/geometry/tetrahedron/.
“What Is Hashing? How Hash Codes Work - with Examples.” FreeCodeCamp.org, 26 Jan. 2020,
www.freecodecamp.org/news/what-is-hashing/#:~:text=Hashing%20is%20designed%20to%20solve.
Accessed 4 Mar. 2022.
Wieder, Udi. “Hashing, Load Balancing and Multiple Choice.” Foundations and Trends® in Theoretical
Computer Science, vol. 12, no. 3-4, 2017, pp. 275–379, 10.1561/0400000070. Accessed 22 Feb. 2022.
Bibliography
Anon., n.d. Discrete Mathematics and Probability Theory,Spring 2015.

Anon., n.d. Continous random variable. emathzone.
Anon., Spring 2015. Discrete Mathematics and Probability Theory. Discrete Mathematics and Probability
Theory.
Desai, T., 9, September 2015. Application of Prime Numbers in Computer Science. International Journal of
Science and Research (IJSR).
McGregor, A., n.d. Balls and Bins and Hashing. Volume Lecture 19:, p. 6.
REFERED TO FORMULAS AND VALUES ON: “Pearson Qualifications.” Qualifications.pearson.com,

qualifications.pearson.com/content/dam/pdf/International%20Advanced%20Level/Mathematics/2018/Specific
ation-and-Sample-Assessment/IAL-Mathematics-Formula-Book.pdf.

Higher Nationals - Internal Verification of Assessment Decisions - BTEC (RQF)

Uploaded by

Copyright:

Available Formats

Higher Nationals - Internal Verification of Assessment Decisions - BTEC (RQF)

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Higher Nationals - Internal Verification of Assessment Decisions - BTEC (RQF)

Uploaded by

Copyright:

Available Formats

Higher Nationals -

Internal verification of assessment decisions – BTEC (RQF)

List which assessment Pass Merit Distinction

Internal Verifier signature Date

Assessor signature Date

Student Name/ID BRINDHA SHREE RAVIDAAS/ NG09919

LO1 Use applied number theory in practical computing scenarios.

Pass, Merit & P7 P8 M4 D4

Grade: Assessor Signature: Date:

Grade: Assessor Signature: Date:

Internal Verifier’s Comments:

Signature & Date:

1. I know that plagiarism is a punishable offence because it constitutes theft.

Formative Feedback : Assessor to Student

Feedback: Student to Assessor.

Student Name /ID BRINDHA SHREE RAVIDAAS/NG09919

Academic Year 2021/2022

Unit Tutor Mr. NADHEERA

Assignment Title Importance of Maths in the Field of Computing

IV Name & Date

UNIT 11: MATHS FOR COMPUTING

Table 1: Probability distribution of X (author’s work) ................................................................................ 23

REAM OF CLOTH 16M

• Finding the length of towel using HCF:

4, 5 4 and 5 aren’t divisible by 2

(Space left intentionally)

Figure 2: Activity 01, question 5(author’s work)

(Space left intentionally)

Figure 4: Activity 02, question 2a (author’s work)

Figure 5: Activity 02, question 2b (author’s work)

Figure 6: Activity 02 question 03 a(author’s work)

Figure 7: Activity 02 question 03 b, c (author’s work)

Figure 8: Activity 02, Question 4a,b (Author’s work)

Figure 9: Activity 02, Question 4c (Author’s work)

Probability distribution of a discrete random variable, constructs a histogram of probability.

Figure 10: Probability histogram of X (author’s work)

Figure 11: continuous random variable pdf

Figure 12: p.d.f graph

(Space left intentionally)

Figure 13: Activity 02, Question 6a (Author’s work)

Figure 14: Activity 02, Question 6b (Author’s work)

Figure 15: Activity 02, Question 6c (Author’s work)

Figure 16: Activity 02, Question 6d (Author’s work)

Figure 17: Activity 02, question 07 (Author's work)

Figure 18: Activity 02, question 10 (Author's work)

Figure 19: Activity 02, Question 11 (Author's work)

Figure 20: Activity 02 Question 12a (Author’s work)

(Space left intentionally)

Figure 21: Activity 02 Question 12b,c (Author’s work)

Figure 22: Activity 02 Question 12d (Author’s work)

13.1 Example for an application of Probability in Hashing.

Figure 23: Hash function

Balls & Bins

Figure 24: Balls and Bins

• Throwing m balls into n bins uniformly and independently.

Figure 25: Hash Table

13.2 Load Balancing

If m/n = 1 and k = 2 log;

Figure 26: Activity 03 Question 1 (Author’s Work)

Volume = 1/3area of baseheight