Project$/$Assignment

$1.$ Given two $\backslash (\backslash$mathrm$\{$m$\}\backslash$times $\backslash$mathrm$\{$n$\}\backslash )$ Boolean matrices, find their meet and join.

$2.$ Given a square Boolean matrix $\backslash ($ A $\backslash )$ and a positive integer $\backslash ($ n $\backslash ),$ find $\backslash (\backslash$mathrm$\{$A$\}^\{[$n$]\}\backslash ).$

$3.$ Given an integer n $,$ use the greedy algorithm to find the change for n cents using quarters, dimes, nickels, and pennies.

$4.$ Given the starting and ending times of n talks, use the appropriate greedy algorithm to schedule the most talks possible in a single lecture hall.

$5.$ Given a list of n integers, sort them using a bubble sort.

Submission Requirements:

Please provide inputs and output screens.

Please keep exceptions in mind.