Algorithms Answers

If X is the random variable model ‘the number on a biased die’, and the probability distribution function of X is as shown below,

1. Using the Internet and any other appropriate resources, conduct further research into the ways in which different types of link/packet scheduling algorithms contribute to quality of service (QoS) in network systems.
2. Using any application of your choice, create a concept/mind map of the different types of packet scheduling algorithms.
3. Briefly discuss the role that each type of link scheduling algorithm plays in ensuring QoS in a network system. Use examples, where appropriate, to support your discussion.

A program is needed that will determine the larger of two numbers entered by the user. Draw the IPO table with the necessary details for the program

A. The Fibonacci numbers are the numbers in the following integer sequence.

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ……..

B. Factorial of a non-negative integer, is multiplication of all integers smaller than or equal to n. For example, factorial of 6 is 6*5*4*3*2*1 which is 720.

         n! = n * (n - 1) * …….. 1 

Define what an algorithm is and outline the characteristics of a good algorithm. Write the algorithms to display the Fibonacci series and the factorial value for a given number using Pseudo code. Determine the steps involved in the process of writing and executing a program. 

Take a sample number and dry run the above two algorithms. Show the outputs at the end of each iteration and the final output. 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.

Define what an algorithm is and outline the characteristics of a good algorithm. Write the algorithms to display the Fibonacci series and the factorial value for a given number using Pseudo code. Determine the steps involved in the process of writing and executing a program.

Take a sample number and dry run the above two algorithms. Show the outputs at the end of each iteration and the final output. 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.

 Compute the following Machine Learning metrics by showing your working:    

Accuracy

Precision

Recall

F1-Measure