Scribd
Upload
71 views3 pages

CPT212 2324-Assignment1

Uploaded by

nhmnirh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
71 views3 pages

CPT212 2324-Assignment1

Uploaded by

nhmnirh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

School of Computer Sciences

CPT 212 Design & Analysis of Algorithms

ASSIGNMENT I:

Objectives
1. Manipulate data structures or algorithms in problem solving and programming.
2. Perform complexity analysis of algorithms.

Specification
Part 1.
The multiplications of 2 numbers in base 10 can be done using simple multiplication
algorithm. The algorithm is explained below:

Step 1: Multiply each digit in the multiplicand by each digit of the multiplier, keep the partial
product and carriers if there is any (e.g. 3x8=24, “4” is the partial product and “2” is the
carrier). Print out the partial and carrier at every step.

Step 2: Add up all the properly shifted partial product and carriers.

Figure below shows an example where the multiplicand ‘52301’ is multiplied by the multiplier
‘380’ using the simple multiplication algorithm.

52301
x 380
00000 partial products for (=52301 x 0)
00000 carriers for (52301 x 0)
06408 partial products for (=52301 x 8)
41200 carriers for (52301 x 8)
56903 partial products for (=52301 x 3)
+ 10000 carriers for (52301 x 3)
19874380

Implement the algorithm above in Java. Assume the length of the two numbers is the same.
The algorithm must be implemented exactly as described. Insert counters at appropriate
location in the program to count the primitive operations (assignment, addition, …) executed
by the simple multiplication algorithm that you wrote. Randomly generate two numbers of n
digits, plot a graph (number of operation vs n). Compare and discuss the results obtained in
the experiment and the time complexity of the theoretical analysis in Big-O.
School of Computer Sciences

CPT 212 Design & Analysis of Algorithms

Part 2

Besides the standard multiplication algorithm, another algorithm that can be used to calculate
a multiplication is the Karatsuba algorithm. You are given the Karatsuba algorithm
implemented in Java. Insert counters at appropriate location in the program to count the
primitive operations (assignment, addition, …) executed by the Karatsuba algorithm. You
may modify the program to randomly multiply two numbers of n digits, plot a graph (number
of operation vs n). Compare and discuss the results obtained in the experiment and the time
complexity of the theoretical analysis. Compare the time complexity of simple multiplication
algorithm versus Karatsuba algorithm based on the experiment results.

This assignment is to be carried out in a group of 2. Any part submitted by a group for
the evaluation must not be the same or similar to other groups’ assignment. Copying from
any one/place will be given ZERO. No other API, other than Java SE can be used.

Program (including the dataset) and report submission deadline: Sunday, 12 May 2024
11.59 pm is through e-learning by one of the group member.

Assignment Assessment Rubric

Excellent (80-100%) Good (65-79%) Moderate (40-64%) Poor (0-39%) Total


Algorithm is
implemented in
Java as described. Algorithm is Algorithm
Part 1: Print out the partial implemented in does not run
Simple products and Java as described. or it is not
Multiplication carriers at every No sufficient implemented
algorithm step, and properly documentation exactly as
(50%) documented. - given. described.

Many counters are


Some counters are incorrectly added/
Part 2: All counters are incorrectly added/ not added. Some No counter is
Counting correctly added. not added. Graphs graphs are added. No
(20%) Graphs are plotted. are plotted. incorrectly plotted. graphs.
Correctly specify
the time complexity Correctly specify
of the algorithms the time Correctly specify
and correctly justify complexity of the the time complexity No time
by analyzing the algorithms and of the algorithms complexity
Part 5: graphs obtained. correctly justify by but do not analyze given. No
Analysis Compare the two analyzing the the graphs analysis being
(30%) algorithms. graphs obtained. obtained. carried out.
School of Computer Sciences

CPT 212 Design & Analysis of Algorithms

Does not compare


the algorithms.

You might also like