DESIGN YOUR OWN SETTING Task 5: Devise your own setting for storing and searching the data in an array of non-negative integers redundantly. You may just describe the setting without having to give an explicit algorithm to explain the process by which data is stored. You should explain how hardware failures can be detected in your method. Once you have described the setting, complete the following: Write a pseudocode function to describe an algorithm where the stored data can be searched for a value key: if the data is found, its location in the original array should be returned; -1 should be returned if the data is not found; -2 should be returned if there is a data storage error Include a short commentary explaining why your pseudocode works Describe the worst-case and best-case inputs to your search algorithm Derive the worst-case and best-case running times for the search algorithm Derive the Theta notation for the worst-case and best-case running times

DESIGN YOUR OWN SETTING Task 5: Devise your own setting for storing and searching the data in an array of non-negative integers redundantly. You may just describe the setting without having to give an explicit algorithm to explain the process by which data is stored. You should explain how hardware failures can be detected in your method. Once you have described the setting, complete the following: Write a pseudocode function to describe an algorithm where the stored data can be searched for a value key: if the data is found, its location in the original array should be returned; -1 should be returned if the data is not found; -2 should be returned if there is a data storage error Include a short commentary explaining why your pseudocode works Describe the worst-case and best-case inputs to your search algorithm Derive the worst-case and best-case running times for the search algorithm Derive the Theta notation for the worst-case and best-case running times

Related questions

Q: Design an algorithm for a function that accepts an Integer array as an argument and returnsthe total…

A: Algorithm is a step by step procedure defined to solve the given problem. It is very easy in…

Q: Modify the pseudocode design that you created so far for your ITP 100 Project. To do the following :…

A: Code in Step 2:

Q: Q3. This question requires you to manipulate arrays using slicing, splitting and/or array func-…

A: Code:- import numpy as np# create a 1-D array of range 1 to 20arr = np.arange(1, 21)print("1-D array…

Q: Complete the following function definition to recursively print the index of a unique value in an…

A: we have to write all code in the blanks

Q: DESIGN YOUR OWN SETTING Task: Devise your own setting for storing and searching the data in an…

A: As per the quidelines, I would be able to provide answer for first three parts of the…

Q: Written in code C and with clear and concise comments Extend your addition, subtraction,…

A: Code: #include<stdio.h>int main() { float a,b; printf("Please enter the first number:…

Concept explainers

Fundamentals of Multithreaded Algorithms

An algorithm that executes a single instruction in a uniprocessor system is called a serial algorithm. In the case of a multiprocessor computer system, a multiprocessor computer can execute multiple instructions in parallel. A multithreaded algorithm is an algorithm that enables multiple instances of the code to be executed concurrently.Multithreading is a concept that allows the CPU to execute threads independently while sharing similar resources. It is an important CPU feature that works on the process. Thread is a sequence of instructions that executes in parallel with other threads. Because of multithreading, multiple tasks can be performed within a single process, making the execution faster.

Question

DESIGN YOUR OWN SETTING

Task 5: Devise your own setting for storing and searching the data in an array of non-negative integers redundantly. You may just describe the setting without having to give an explicit algorithm to explain the process by which data is stored. You should explain how hardware failures can be detected in your method. Once you have described the setting, complete the following:

Write a pseudocode function to describe an algorithm where the stored data can be searched for a value key: if the data is found, its location in the original array should be returned; -1 should be returned if the data is not found; -2 should be returned if there is a data storage error
Include a short commentary explaining why your pseudocode works
Describe the worst-case and best-case inputs to your search algorithm
Derive the worst-case and best-case running times for the search algorithm
Derive the Theta notation for the worst-case and best-case running times

Maximum word count for whole task: 750 words. The word count does not include the pseudocode for the search algorithm, any picture figures and any mathematical formula.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1: Introduction :-

VIEW

Step 2: Checksums :-

VIEW

Step 3: Pseudocode function :-

VIEW

Step 4: Explanation:-

VIEW

Step 5: Worst-case and best-case input scenarios :-

VIEW

Step 6: Worst-case and best-case running times:-

VIEW

Solution

VIEW

Step by step

Solved in 7 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Fundamentals of Multithreaded Algorithms

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, data-structures-and-algorithms and related others by exploring similar questions and additional content below.

Similar questions

Task - Median elements (C Langugage) Given an array of integer elements, the median is the value that separates the higher half from the lower half of the values. In other words, the median is the central element of a sorted array. Since multiple elements of an input array can be equal to the median, in this task you are asked to compute the number of elements equal to the median in an input array of size N, with N being an odd number. Requirements Name your program project4_median.c. Follow the format of the examples below. The program will read the value of N, then read in the values that compose the array. These values are not necessarily sorted. The program should include the following function. Do not modify the function prototype. int compute_median(int *a, int n); a represents the input array, n is the length of the array. The function returns the median of the values in a. This function should use pointer arithmetic– not subscripting – to visit array elements. In other…
Task using C language Write a program that checks both of the following conditions hold for a given array a1, a2, …, an. If the conditions hold, display “yes”, otherwise, display “no”. a1 < a2 < … < an For every i from 2 to n, ai isn’t divisible by ai-1. Requirements Follow the format of the examples below. The program reads in the number of elements of the array, for example, 4, then read in the numbers in the array, for example, 3 6 8 9. In the main function, declare the input array after reading in the number of elements of the array, then read in the elements. Examples (your program must follow this format precisely) Example #1 Enter the length of the input array: 7Enter the array elements: 2 5 4 1 6 9 12Output: no Example #2 Enter the length of the input array: 6Enter the array elements: 2 7 13 19 23 43Output: yes
Task- Median elements (C Language) Example #4 expected output is 5, but from the program below its coming out to 4. Please help make it come out to 5 as expected Given an array of integer elements, the median is the value that separates the higher half from the lower half of the values. In other words, the median is the central element of a sorted array. Since multiple elements of an input array can be equal to the median, in this task you are asked to compute the number of elements equal to the median in an input array of size N, with N being an odd number. Requirements Name your program project4_median.c. Follow the format of the examples below. The program will read the value of N, then read in the values that compose the array. These values are not necessarily sorted. The program should include the following function. Do not modify the function prototype. int compute_median(int *a, int n); a represents the input array, n is the length of the array. The function returns the…
It's important to note that the name of an array by itself is really a pointer to the first element of the array. Therefore passing an array to function is simple since you can just specify the name of the array. Are these statements true?
Python language
DESIGN YOUR OWN SETTING Task: Devise your own setting for storing and searching the data in an array of non-negative integers redundantly. You may just describe the setting without having to give an explicit algorithm to explain the process by which data is stored. You should explain how hardware failures can be detected in your method. Once you have described the setting, include the following to your answer: Write a pseudocode function to describe an algorithm where the stored data can be searched for a value key: if the data is found, its location in the original array should be returned; -1 should be returned if the data is not found; -2 should be returned if there is a data storage error Include a short commentary explaining why your pseudocode works Describe the worst-case and best-case inputs to your search algorithm Derive the worst-case and best-case running times for the search algorithm Derive the Theta notation for the worst-case and best-case running times
Problem2: A square matrix can be represented by a two-dimensionalarray with N rows and N columns. You may assume a maximum size of 50 rows and 50 columns. 1. Write an algorithm MakeEmpty(n), which sets the first n rows and n columns to zero. 2. Write an algorithm Add(M1, M2, M3), which adds two matrices M1 and M2 together to produce matrix M3. 3. Write an algorithm Subtract(M1, M2, M3), which subtracts matrix M2 from matrix M1 to produce matrix M3. 4. Write an algorithm Copy(M1, M2), which copies matrix M1 into matrix M2.