Search & Filtering
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.
the project. A WBS is a very useful tool for estimating the amount of work to be done and to
create a detailed work schedule
a. The class should contain functions to
i. Insert a new value, [5 marks]
ii. Delete a value. [5 marks]
iii. Change a value equal to X to a value equal to Y. [5 marks]
iv. Count all value equal to X in the queue. [5 marks]
b. For each function above perform an asymptotic analysis and state the worst case performance of the algorithm
implementation of the functions of an arrayList
The table below shows the tax that is applied to income. The tax value increases if someone earns more than a certain amount.
Income Tax Rate
Less than 11,000 0.0
11,000 – 50,000 0.2
Greater than 50,000 0.5
Write a pseudocode algorithm that accepts a value for income as its input and displays the tax rate that will be applied to that income.
The waterfall model is the traditional model for software development. Using a diagram, show the FIVE (5) main stages of the model and how they are related.
Explain, with ONE (1) example, a notation that can be used to compare the complexity of different algorithms.
Complete the truth table below for the logical equation (A OR B) AND (A OR C)
A B C A or B A or C (A or B) AND (A OR C)
FALSE FALSE FALSE FALSE FALSE FALSE
FALSE FALSE TRUE FALSE TRUE -
FALSE TRUE FALSE TRUE FALSE -
FALSE TRUE TRUE TRUE TRUE -
TRUE FALSE FALSE - - -
TRUE FALSE TRUE - - -
TRUE TRUE FALSE - - -
TRUE TRUE TRUE - - -
Write the following infix expression into prefix expression :
(((a-g) +(e/b))*c)
Also write each step
#339914 on Dec 2023