Discrete mathematics for CS

College of Computing and Informatics

Assignment 1
Deadline: Wednesday 19/02/2025 @ 23:59
[Total Mark for this Assignment is 10]
Student Details:
Name: ###

ID: ###

CRN: ###
Instructions:

• You must submit two separate copies (one Word file and one PDF file) using the Assignment Template on
Blackboard via the allocated folder. These files must not be in compressed format.

• It is your responsibility to check and make sure that you have uploaded both the correct files.
• Zero mark will be given if you try to bypass the SafeAssign (e.g. misspell words, remove spaces between
words, hide characters, use different character sets, convert text into image or languages other than English
or any kind of manipulation).

• Email submission will not be accepted.
• You are advised to make your work clear and well-presented. This includes filling your information on the cover
page.

• You must use this template, failing which will result in zero mark.
• You MUST show all your work, and text must not be converted into an image, unless specified otherwise by
the question.

• Late submission will result in ZERO mark.
• The work should be your own, copying from students or other resources will result in ZERO mark.
• Use Times New Roman font for all your answers.

Restricted – ‫مقيد‬

Question One

Pg. 01
Learning
Outcome(s):CLO1
, CLO2

Question One

2.5 Marks

Explain the fundamental concept of sets in discrete mathematics and evaluate their
significance in the field of computer science. In your explanation, include the following:

Instructors: CLO1:
Describe
fundamental
concepts of
discrete
mathematics and
their applied role
in computer
science.
CLO2: Employ
techniques of
discrete
mathematics to
solve problems in
the field of
computer science.

Restricted – ‫مقيد‬

1. Define sets and explain how they are represented using the roster method and
set-builder notation.
2. Discuss real-world applications of sets in computer science, focusing on
database operations and algorithmic optimization.

Question Two

Pg. 02
Learning
Outcome(s):CLO3
, CLO4
Instructors: CLO3:
Illustrate complex
mathematical and
computational
problems by
applying
mathematical and
algebraic
techniques.
CLO4: Examine
the problems in
Computer
Science using
mathematical
induction,
transformations,
methods, proofs
and inferences.

Restricted – ‫مقيد‬

Question Two

2.5 Marks

Illustrate the process of matrix multiplication in discrete mathematics and examine its
application in computational problem-solving. Address the following in your
explanation:
1. Provide a detailed step-by-step example of matrix multiplication.
2. Analyze two practical applications of matrix operations in computer science,
such as image processing and graph theory.

Question Three

Pg. 03
Learning
Outcome(s):
CLO1
Instructors:
Describe
fundamental
concepts of
discrete
mathematics and
their applied role
in computer
science.

Restricted – ‫مقيد‬

Question Three

2.5 Marks

Compare between Linear search and Binary search in terms of how it works and the
worst case time complexity (big-O).

Question Four

Pg. 04
Learning
Outcome(s):
CLO2
Instructors:
Employ
techniques of
discrete
mathematics to
solve problems in
the field of
computer science.

Restricted – ‫مقيد‬

Question Four
How does the RSA encryption algorithm use number theory?

2.5 Marks

Purchase answer to see full
attachment