Consider the following pseudocode of algorithm. Input: number n and list L Steps: a. Read the input number n and list L. b. Set value of variable flag to false c. For each next number x in the list L, do the following: if x is equal to n, then set flag to true d. Print the value of flag Answer the ff: 1. What is the output of the algorithm when the input is the number 3 and list (1, 5, 8, 9, 3, 4)? 2. What is the problem being solved by the previous item? 3. Present the pseudocode as a flowchart.

Consider the following pseudocode of algorithm. Input: number n and list L Steps: a. Read the input number n and list L. b. Set value of variable flag to false c. For each next number x in the list L, do the following: if x is equal to n, then set flag to true d. Print the value of flag Answer the ff: 1. What is the output of the algorithm when the input is the number 3 and list (1, 5, 8, 9, 3, 4)? 2. What is the problem being solved by the previous item? 3. Present the pseudocode as a flowchart.

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

Simple Python Coding Exercise Code your program according to the following algorithm 1. Prompt the user for a string of words on one line separated by spaces.2. Convert the input string a list of words called input_list. (Hint: use split())3. Create a new empty list called output_list (i.e., output_list=[])4. Scan input_list to find the smallest word. When the smallest word is found, append that word to output_list and remove it from input_list.5. If input_list still has words in it, go to step 4.6. When input_list is empty, convert output_list into a string of words separated by spaces. (Hint: use join())7. Print the string.
When analyzing data sets, such as data for human heights or for human weights, a common step is to adjust the data. This adjustment can be done by normalizing to values between 0 and 1, or throwing away outliers. For this program, adjust the values by dividing all values by the largest value. The input begins with an integer indicating the number of floating-point values that follow. Assume that the list will always contain fewer than 20 floating-point values. Output each floating-point value with two digits after the decimal point, which can be achieved as follows:System.out.printf("%.2f", yourValue); Ex: If the input is: 5 30.0 50.0 10.0 100.0 65.0 the output is: 0.30 0.50 0.10 1.00 0.65 The 5 indicates that there are five floating-point values in the list, namely 30.0, 50.0, 10.0, 100.0, and 65.0. 100.0 is the largest value in the list, so each value is divided by 100.0. For coding simplicity, follow every output value by a space, including the last one. import…
I need to write an algorithm pseudocode that sorts a list of n elements in non-increasing order by finding the largest and smallest elements and exchanging those elements with the elements in the first and last positions. Then the size of the list is reduced by 2, excluding the two elements that are already in the proper positions, and the process is repeated on the remaining part of the list until the entire list is sorted. I also need to analyze the algorithm and show the results using order notation. I was trying to use arguments but I got stuck.
Given a sorted list of integers, output the middle integer. Assume the number of integers is always odd. Ex: If the input is: 2 3 4 8 11 the output is: 4 The maximum number of inputs for any test case should not exceed 9. If exceeded, output "Too many inputs". Hint: First read the data into a list. Then, based on the list's size, find the middle item. simple python
The government publishes a list of the 10,000 most popular baby names along with their frequency each year (the number of babies with that name). This only has a problem with some names having different spellings. For instance, even if "John" and ".Jon" have almost the same name, they are included individually in the list. Write an algorithm to print a new list of the true frequencies of each name from two lists: one of names/frequencies and the other of pairings of equivalent names. Be aware that John and Johnny are synonyms if John and Jon are as well as Jon and Johnny. (It is symmetric and transitive.) Any name may be used as the "actual" name on the final list. 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 a version of the sequential search algorithm that can be used to search a sorted list. Write a program to test the sequential search algorithm. Use either the function bubbleSort or insertionSort to sort the list before the search. Your program should prompt the user to enter 10 digits and then prompt the user to enter a digit to search - if the list contains this digit, output its position to the console: x is found at position y If the digit is not contained in the list, output the following: x is not in the list
Write a program that reads a list of words. Then, the program outputs those words and their frequencies. The input begins with an integer indicating the number of words that follow. Assume that the list will always contain fewer than 20 words. Ex: If the input is: 5 hey hi Mark hi mark the output is: hey - 1 hi - 2 Mark - 1 hi - 2 mark - 1 Hint: Use two arrays, one array for the strings and one array for the frequencies.
When analyzing data sets, such as data for human heights or for human weights, a common step is to adjust the data. This can be done by normalizing to values between 0 and 1, or throwing away outliers. For this program, adjust the values by subtracting each value from the maximum. The input begins with an integer indicating the number of integers that follow. Assume that the list will always contain between 1 and 20 integers. Ex: If the input is: 5 30 50 10 70 65 the output is: 40 20 60 0 5 For coding simplicity, follow every output value by a space, even the last one. Your program must define and call a method:public static int getMaxInt(int[] listInts, int listSize) import java.util.Scanner; public class LabProgram { public static void main(String[] args) { Scanner scnr = new Scanner(System.in); // Read the number of integers int listSize = scnr.nextInt(); // Create an array to store the integers int[] listInts = new int[listSize]; //…
When analyzing data sets, such as data for human heights or for human weights, a common step is to adjust the data. This can be done by normalizing to values between 0 and 1, or throwing away outliers. For this program, adjust the values by subtracting each value from the maximum. The input begins with an integer indicating the number of integers that follow. Assume that the list will always contain between 1 and 20 integers. Ex: If the input is: 5 30 50 10 70 65 the output is: 40 20 60 0 5 For coding simplicity, follow every output value by a space, even the last one. Your program must define and call a method:public static int getMaxInt(int[] listInts, int listSize) import java.util.Scanner; public class LabProgram { public static void main(String[] args) { Scanner scnr = new Scanner(System.in); // Read the number of integers int listSize = scnr.nextInt(); // Create an array to store the integers int[] listInts = new int[listSize]; //…
When analyzing data sets, such as data for human heights or for human weights, a common step is to adjust the data. This adjustment can be done by normalizing to values between 0 and 1, or throwing away outliers. For this program, adjust the values by dividing all values by the largest value. The input begins with an integer indicating the number of floating-point values that follow. Assume that the list will always contain positive floating-point values. Output each floating-point value with two digits after the decimal point, which can be achieved as follows:print(f'{your_value:.2f}')
Given a reference string followed by four (4) more strings, create a program that determines whether those 4 strings are anagrams of the reference string. The output should be a list of boolean values that show if those strings are anagrams (respectively). For our purposes, there’s no need to check if a string is a valid word or not (i.e. it’s in the English dictionary). NOTE: Do not use sorted()
in python Given a list of characters and an integer n, create a new list that is the original list split into n evenly sized chunks. Print out the new list. The first input is the list (use .split()), the second input determines the n parts of the evenly sized chunks. Sample Input 1 a,b,c,d,e,f 2 Sample Output 1 [['a', 'b'], ['c', 'd'], ['e', 'f']] Sample Input 2 a,b,c,d,e,f 3 Sample Output 2 [['a', 'b', 'c'], ['d', 'e', 'f']]