In November 2024
Search & Filtering
What is the output of the first round of the DES algorithm when the plaintext
and the key are both all ones?
Given two numbers X and Y. Write a program to determine the difference between X and Y. If X – Y is negative, compute R = X + Y; if X – Y is zero, compute R = 2X + 2Y; and if X – Y is positive, compute R = X*Y. Print out the value of X, Y, and R.
the following assumptions in your computation: (15)
ALGORITHM 1
True Positive = 65
True Negative = 70
False Positive = 80
False Negative = 90
ALGORITHM 2
True Positive = 75
True Negative = 80
False Positive = 40
False Negative = 45
Compute the following Machine Learning metrics by showing your working:
Accuracy
Precision
Recall
F1-Measure
2.2 Compare the performance of the selected algorithms from Question 1 based on the Accuracy and
Precision values. (5)
2.3 Contrast the performance of the selected algorithms based on the Recall and F1- Measure
Examine what Big-O notation is and explain its role in evaluating efficiencies of algorithms. Write the Python program code for the above two algorithms and critically evaluate their efficiencies using Big-O notation.
Use Prim’s algorithm starting at node A to compute the Minimum Spanning Tree (MST) of the following graph. In particular, write down the edges of the MST in the order in which Prim’s algorithm adds them to the MST. Use the format (node1; node2) to denote an </span>edge.
1. Write a java program that allows a user to choose the searching or sorting algorithm and request the list of items to search or sort.
2. Compute the running time of the algorithms
3. Determine the time complexity of your algorithm the searching and sorting algorithms.
4. Display the search value or the sorted list to the user.
1. Be innovative and design a user-friendly application
Note: the programming should take the list to search or sort at the running time, not compile time. [You are submitting the java code and the computed running time/time complexity of the algorithms
1. Write a java program that allows a user to choose the searching or sorting algorithm and request the list of items to search or sort.
2. Compute the running time of the algorithms
3. Determine the time complexity of your algorithm the searching and sorting algorithms.
4. Display the search value or the sorted list to the user.
5. Be innovative and design a user-friendly application
Note: the programming should take the list to search or sort at the running time, not compile time. [You are submitting the java code and the computed running time/time complexity of the algorithms]
b. For the same graph as above, write down the edges of the MST in the order in which Kruskal’s algorithm adds them to the MST.
-
![Help me with my assignment!]()
Who Can Help Me with My Assignment
There are three certainties in this world: Death, Taxes and Homework Assignments. No matter where you study, and no matter…
-
![How to finish assignment]()
How to Finish Assignments When You Can’t
Crunch time is coming, deadlines need to be met, essays need to be submitted, and tests should be studied for.…
-
![Math Exams Study]()
How to Effectively Study for a Math Test
Numbers and figures are an essential part of our world, necessary for almost everything we do every day. As important…
#340153 on Dec 2023