CSC 243 Introduction to Object-Oriented Programming

Final Exam
Section 15

December 17, 2021

• The duration of this exam is 3 hours. Keep in mind that you need around 10 minutes
at the end of the duration of the exam to submit your answers.
• It is your responsibility to make sure your files are correctly submitted.
• The exam consists of 5 problems for 135 points.
• You are not allowed to use the internet or previously stored material.
• Active cell phones and any other unauthorized electronic devices are absolutely not
allowed in the exam rooms. They should be turned off and put away.
• If you get caught violating the above rules or if you communicate with a person other
than the exam proctors during the exam, you will immediately get zero and you will
be referred to the appropriate disciplinary committee.
• The problems are of varying difficulty. Below is a rough ordering estimate of the
problems in order of increasing difficulty.
– Level 0 (25 points): Problem 1
– Level 1 (75 points): Problem 2, Problem 3, Problem 4.a
– Level 2 (35 points): Problem 4.b, Problem 5
• Detailed comments are worth partial credit.
• Read through all of them first and start them in the order that allows you to make
the most progress.
• Plan your time wisely. Do not spend too much time on any one problem.
• Good luck!

NAME:
LAU ID#:

1
Problem 1: Relax with Collatz (25 points)
Write a Python program which asks the user to enter an integer n. Then, your program
should print n/2 if n is even and 3n + 1 if n is odd. You may assume that the user will
always input an integer.
Example 1:

>>> % Run relax.py

Enter an integer n: 1
4
Example 2:

>>> % Run relax.py

Enter an integer n: 2
1
Example 3:

>>> % Run relax.py

Enter an integer n: 3
10
Example 4:

>>> % Run relax.py

Enter an integer n: 4
2

2
Problem 2: Mode Finder (25 points)
In statistics, the mode m of a set of data values is the value that appears most often in the
set. For instance, in the set of the following values:

• 1, 1, 2, 3, 0, 1, 1, 2, 8, 3, 1, 0: the mode is 1 since it appears 5 times.

• 1, 2, 3, 0, 1, 1, 2, 8, 3, 2, 0: there are two modes, which are 1 and 2 since they both
appear 3 times.

• 1, 2, 3, 4, 5: all are modes because they all appear once.

Write a Python function getMode(L) that takes a list of real numbers L as input and returns
the mode of the list L.
Any correct solution is worth 20/25 points. To get full grade, aim for O(n) expected
time complexity, where n =len(L).
Hint #1 : Use a dictionary to achieve the best efficiency.
Hint #2 : If you feel stuck, you may use the list.count() method to get you started.
Example 1:

>>> % Run mode.py

Enter a sequence of integers: 1 1 2 3 0 1 1 2 8 3 1
Mode(s): [1]
Example 2:

>>> % Run mode.py

Enter a sequence of integers: 1 2 3 0 1 1 2 8 3 2 0
Mode(s): [1, 2]
Example 3:

>>> % Run mode.py

Enter a sequence of integers: 1 2 3 4 5
Mode(s): [1, 2, 3, 4, 5]

3
Problem 3: Smart Cart (30 points)
In a grocery store, items are placed on counters and each item has a name and a price.
When customers enter the store to purchase things, they use a ‘smart’ shopping cart inside
of which they place their desired items. The shopping cart can identify each item placed
inside of it and displays the total amount to pay to the customer.
In this exercise, your task is to implement the logic that governs the shopping cart.
Specifically, you will need to create two classes: StoreItem and ShoppingCart.

a) StoreItem Class. A StoreItem object has two data attributes: name and price.
Implement the following method attributes for this class:

– init (self, n, p), which sets the name to the string n and price to the
real number p. Write the necessary assertions to make sure the inputs to the
constructor are of appropriate data types.
– str (self), which casts the StoreItem into a string of the following format:
Name: n, price: p.

Test your code by executing the following:

chocolate = StoreItem ( " Bounty " , 9000)
print ( chocolate )
chips = StoreItem ( " Chips " , 5000)
print ( chips )
water = StoreItem ( " Water " , 4000)
print ( water )

Output:

>>> % Run smartCart.py

Name: Bounty, price: 9000
Name: Chips, price: 5000
Name: Water, price: 4000

b) ShoppingCart Class. A ShoppingCart is composed of 0 or more items. Customers

can add items to the cart. Also, a specific item may be added multiple times by a cus-
tomer. Thus, the ShoppingCart data attribute can be assigned to be a dictionary,
with keys being StoreItem objects and values being the quantity of each StoreItem
object. To achieve this structure, implement the following method attributes for this
class:

– init (self), which takes no arguments and sets the data attribute self.cart
= {} (an empty dictionary).
– add item(self, item), which checks if type(item)==StoreItem and then in-
serts item into the dictionary self.cart.

4
– get total(self), which loops over all the elements of self.cart and returns
the total price to be paid by the customer.

Test your code by executing the following:

items = [ chocolate , water , chips , water ]
cart = ShoppingCart ()
f o r item in items :
cart . add_item ( item )
amount = cart . get_total ()
print ( amount )

– str (self), which allows one to print all the items inside the cart (including
the quantity) and the total price to be paid.
Test your code by executing the following:
print ( cart )

Output:

>>> % Run smartCart.py

Name: Bounty, price: 9000, quantity: 1
Name: Water, price: 4000, quantity: 2
Name: Chips, price: 5000, quantity: 1
Total: 22000

5
Problem 4: Square Test (30 points)
a) Square Test. Write a Python script which asks the user to enter an integer n, and
checks whether or not n is a square of another integer. That is, your program should
check whether or not there exists an integer x such that n = x2 .
If the answer is YES, your program is supposed to print x as shown below.
Example 1:

>>> % Run square.py

Enter an integer n: 1
YES square: 1 = 1 ** 2

Example 2:

>>> % Run square.py

Enter an integer n: 3
3 is not a square

Example 3:

>>> % Run square.py

Enter an integer n: 9
YES square: 9 = 3**2

b) Faster test using the bisection method. To see why faster tests are needed, try
your solution of Part (a) on the integer
705346989381573741216180447274035273700409226922028309041200370362778813583574934801 =
8398493849384982083498209484893849389438492 .
It won’t stop! In this part, you are asked to implement a much faster Square Test
using ideas from the bisection method covered in class. For instance, it should run in
a split second on the above integer. Hints:

– Handle the cases n < 0 and n = 0 separately.

√
– If n ≥ 1, we have 1 ≤ n ≤ n. Hence, the initial search interval is [1, n].
– Keep the boundaries of the search interval integers: instead of setting mid
to the float (low+high)/2, set it to (low+high)//2, i.e., the integer part of
(low+high)/2. One advantage of keeping mid an integer is that it enables check-
ing if mid*mid==n, without having to worry about approximation errors which
can be significant for large values of n.

6
Problem 5: Check Inclusion (25 points)
Write a function checkInclusion(a,b) that, given two strings a and b, returns True if
b contains a permutation of a, or returns False otherwise. In other words, the function
should check if b contains an anagram of a. The table below contains a number of examples
of what the function is expected to return:

a b Output Reason
“live” “alive” True “alive”
“alive” “live” False len(a)>len(b)
“listen” “aiejsilentoaxr” True “aiejsilentoaxr”
“listen” “silen” False len(a)>len(b)
“listen” “aiejslnoaxr” False b does not contain anagram(s) of a
“civil” “lcviiiokeidl” True “lcviiiokeidl”
“civil” “dcxiiiokeidl” False b does not contain anagram(s) of a
“cece” “xvicaceec” True “xvicaceec”
“123abba1” “123abba1” True “123abba1”

Table 1: Examples of anagramic substrings of a string.

Hint: It is very useful to define the isAnagram(s1, s2) function, which checks if s2 is
an anagram of s1.