Question #1. Below is the pseudocode that we saw in the previous lesson for the linear search algorithm: for each item in list if item = target then output: true stop output:false Rewrite this pseudocode so that, instead of indicating whether or not the target was found in the list, the output is the number of occurrences of the target. For instance, if list were {8, 3, 5, 1, 3, 9, 2, 8, 3, 3} and target were 3, then the output should be 4, since the number 3 occurs four times in the list. The pseudo code above uses <- as assignment operators for this assessment. Question #2. Below is the flowchart for the "find two smallest" algorithm that we saw in a previous assignment. The algorithm identifies the two smallest items in the collection by making one pass through the collection and keeping track of the two smallest values seen so far: 1. Initialize the two smallest values so far to be the first two items of the list 2. For each remaining value in the list: if the value is smaller than either of the two smallest so far, replace the larger of the two In this case, the input is a list of items and the outputs are min1 and min2, which are the two smallest items, not necessarily in that order.

Question #1. Below is the pseudocode that we saw in the previous lesson for the linear search algorithm: for each item in list if item = target then output: true stop output:false Rewrite this pseudocode so that, instead of indicating whether or not the target was found in the list, the output is the number of occurrences of the target. For instance, if list were {8, 3, 5, 1, 3, 9, 2, 8, 3, 3} and target were 3, then the output should be 4, since the number 3 occurs four times in the list. The pseudo code above uses <- as assignment operators for this assessment. Question #2. Below is the flowchart for the "find two smallest" algorithm that we saw in a previous assignment. The algorithm identifies the two smallest items in the collection by making one pass through the collection and keeping track of the two smallest values seen so far: 1. Initialize the two smallest values so far to be the first two items of the list 2. For each remaining value in the list: if the value is smaller than either of the two smallest so far, replace the larger of the two In this case, the input is a list of items and the outputs are min1 and min2, which are the two smallest items, not necessarily in that order.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Consider the problem of sorting a list of 10 elements from smallest to largest. Which of the following statements must be true of the state of the list after five iterations of the outer loop of selectionsort? (Select all that apply) Question 2 options: A) The list is sorted. B) The first five elements are sorted. C) The last five elements are the largest in the list. D) The last five elements are sorted.
Baby Names: Each year, the government releases a list of the 10,000 most common baby namesand their frequencies (the number of babies with that name). The only problem with this is thatsome names have multiple spellings. For example, "John" and ''.Jon" are essentially the same namebut would be listed separately in the list. Given two lists, one of names/frequencies and the otherof pairs of equivalent names, write an algorithm to print a new list of the true frequency of eachname. Note that if John and Jon are synonyms, and Jon and Johnny are synonyms, then John andJohnny are synonyms. (It is both transitive and symmetric.) In the final list, any name can be usedas the "real" name.EXAMPLEInput:Names: John (15), Jon (12), Chris (13), Kris (4), Christopher (19)Synonyms: (Jon, John), (John, Johnny), (Chris, Kris), (Chris, Christopher)Output: John (27), Kris (36)
WRITE THE MAIN.CPP FOR THIS PROGRAM a. Write a version of the sequential search algorithm that can be used to search a sorted list. (1, 2) b. Consider the following list: 2, 20, 38, 41, 49, 56, 62, 70, 88, 95, 100, 135, 145 Using a sequential search on ordered lists, that you designed in (a), how many comparisons are required to determine whether the following items are in the list? (Recall that comparisons mean item comparisons, not index comparisons.) (1, 2) 2 57 88 70 135 Write a program to test the function you designed. Note: Have the function,seqOrdSearch, return -1 if the item is not found in the list. (return the index of the item if found).
We will start by finding the largest value. Initially, we assume that the first element in the list is the largest element and create a variable maxValue that is initialized to the first element in the array. We then compare the element that maxValue is storing with every element in the list. Whenever we find an element in the array larger than the element that maxValue is storing, we update maxValue so that it stores the value of the newer larger element. Algorithm ArrayLargestElement Declare and initialize maxValue to the first element in the array. Use a FOR loop to traverse the array. // You already checked the first element, so you should start the loop at the second element. If the element at this index is larger than maxValue Update maxValue Output maxValue. Write a program MyArray_ABC that declares an array containing the following elements: 45, 38, 27, 46, 81, 72, 56, 61, 20, 48, 76, 91, 57, 35, and 78, and outputs the largest value. PART B. Modify the program described…
Need help in solving the problem explained in the screenshot in python. Need the time complexity to be a minimum as possible, so using Binary Search would be the best approach. The code def solve(n,k): # solve problem here. Return correct answer n, k = list(map(int,input().rstrip().split(" ")))print(solve(n,k))
Write an algorithm that searches a sorted list of n items by dividing it into three sublists of almost n/3 items. This algorithm finds the sublist that might contain the given item and divides it into three smaller sublists of almost equal size. The algorithm repeats this process until it finds the item or concludes that the item is not in the list. Analyze your algorithm and give the results using order notation.
We can use an array to create a priority queue. Choose from the following options: a. sort the objects by priority b. store data at random and then seek for the highest priority a. neither sorting nor searching b. neither sorting nor searching c. neither sorting nor searching d. neither sorting nor
Implement the following two sorting algorithms in a program called p3.py. Write two separate functions for these algorithms. Both functions must take a list of integers as the input parameter.1) Bogosort: first shuffle the list argument (i.e., randomize the positions of every element) and then check to see if the result is in sorted order. If it is, the algorithm terminates successfully and returns True, but if it is not then the process must be repeated.2) Bozosort: choose two elements in the list at random, swap them, and then check if the result is in sorted order. If it is, the algorithm terminates successfully and returns True, but if it is not then the process must be repeated.Write a main() function and call both sorting functions using the same list as their arguments. The list can be of any size (try a small list first). Does any of your algorithms terminate? If yes, count the number of iterations it uses to sort the list. Does it always use the same number of repetitions? If…
We learnt this week that lists can be multi-dimensional. For e.g., the following is another example of 2-D multidimensional list. Each row contains student name followed by their grades in 5 subjects: students = [ ['Anna', 98.5, 77.5, 89, 93.5, 85.5], ['Bob', 77, 66.5, 54, 90, 85.5], ['Sam', 98, 97, 89.5, 92.5, 96.5] ] To access, a specific row, you would use students[row_number][column_number]. students[0][0] would print 'Anna' students[0][1] would print 98.5 and so on.. Write a program that defines a function that takes a list as an argument, adds the scores of each student, calculate average for each student (append them to a separate list) and display them. Your program should: Define a function display_average(students) that takes in a 2-D list as an argument. Display the original list using for/while loop. Calculate and display the average of each student. You do not need to ask user for input. You can use your own 2-D lists with at-least 2-rows.
c++ (the question in the photo,plz don't tell me that you are not able to solve it, take your time and solve it all) class cAssignmentOprOverload{public:const cAssignmentOprOverload&operator=(const cAssignmentOprOverload& otherList);//Overload assignment operator void print() const;//Function to print the list void insertEnd(int item);//Function to insert an item at the end of the list//Postcondition: if the list is not full, length++;// list[length] = item// if the list is full// output an appropriate messagevoid destroyList();//Function to destroy the list//Postcondition: length = 0; maxSize = 0;// list = NULL cAssignmentOprOverload(int size = 0);//constructor//Postcondition: length = 0; maxSize = size;// list is an arry of size maxSize private:int maxSize;int length;int *list;}; #include <iostream> #include "classAssignmentOverload.h" using namespace std; int main(){cAssignmentOprOverload intList1(10); //Line 10cAssignmentOprOverload intList2; //Line…
c++ (the question in the photo,plz don't tell me that you are not able to solve it, take your time and solve it all) class cAssignmentOprOverload{public:const cAssignmentOprOverload& operator=(const cAssignmentOprOverload& otherList);//Overload assignment operator void print() const;//Function to print the list void insertEnd(int item);//Function to insert an item at the end of the list//Postcondition: if the list is not full, length++;// list[length] = item// if the list is full// output an appropriate messagevoid destroyList();//Function to destroy the list//Postcondition: length = 0; maxSize = 0; // list = NULL cAssignmentOprOverload(int size = 0);//constructor//Postcondition: length = 0; maxSize = size; // list is an arry of size maxSize private:int maxSize;int length;int *list;}; #include <iostream> #include "classAssignmentOverload.h" using namespace std; int main(){cAssignmentOprOverload intList1(10); //Line 10cAssignmentOprOverload intList2; //Line…
Complete the examples in the docstring and then write the body of thefollowing function:def same_first_last(L):""" (list) -> boolPrecondition: len(L) >= 2Return True if and only if first item of the list is the same as thelast.>>> same_first_last([3, 4, 2, 8, 3])True>>> same_first_last(['apple', 'banana', 'pear'])>>> same_first_last([4.0, 4.5])"""