An algorithm will be used to identify the maximum value in a list of one or more integers. Consider the two versions of the algorithm below. Algorithm I: Set the value of a variable max to - 1. Iterate through the list of integer values. If a data value is greater than the value of the variable max, set max to the data value. Algorithm II : Set the value of a variable max to the first data value. Iterate through the remaining values in the list of integers. If a data value is greater than the value of the variable max, set max to the data value, Which of the following statements best describes the behavior of the two algorithms? A Both algorithms work correctly on all input values. Algorithm I always works correctly, but Algorithm II only works correctly when the maximum value is not the first value in the list. Algorithm Il always works correctly, but Algorithm l only works correctly when the maximum value is greater than or equal to - 1. Neither algorithm will correctly identify the maximum value when the input contains both positive and negative input values.

An algorithm will be used to identify the maximum value in a list of one or more integers. Consider the two versions of the algorithm below. Algorithm I: Set the value of a variable max to - 1. Iterate through the list of integer values. If a data value is greater than the value of the variable max, set max to the data value. Algorithm II : Set the value of a variable max to the first data value. Iterate through the remaining values in the list of integers. If a data value is greater than the value of the variable max, set max to the data value, Which of the following statements best describes the behavior of the two algorithms? A Both algorithms work correctly on all input values. Algorithm I always works correctly, but Algorithm II only works correctly when the maximum value is not the first value in the list. Algorithm Il always works correctly, but Algorithm l only works correctly when the maximum value is greater than or equal to - 1. Neither algorithm will correctly identify the maximum value when the input contains both positive and negative input values.

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

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).
Design a type of sieve algorithm that would (1) Create a list of consecutive integers from 1 to n. (2) Initially, let k=2. (3) Consider each of the multiples of k less than or equal to n and either place or remove a mark on it as follows: - If you encounter an unmarked multiple, mark it with a zero. - If you encounter a multiple that has already been marked, remove the mark by restoring to its original value. (4) Increase k by one. (5) Repeat steps (3) and (4) as long as k <= n.
he algorithm below is used to find the largest element in a list of numbers.By modifying one of the lines in the program it is possible to make the algorithm find the SMALLEST element. Which line would need to be modified and how?01 target <- list[1] 02 FOR EACH num IN list 03 { 04 IF(num > target) 05 { 06 target <- num 07 } 08 } 09 DISPLAY(target) a. Line 01 becomes target <- list[2] b. Line 01 becomes list[0] <- target c. Line 04 becomes if (num <= target) d. Line 04 becomes IF (num < target)
Python Exercise: Given a sorted list of integers, output "Middle item: " followed by the middle integer. Assume the number of integers is always odd. Ex: If the input is: 2 3 4 8 11 the output is: Middle item: 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.
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.
Design and implement an algorithm that gets as input a list of k integer values N1, N2,..., Nk as well as a special value SUM. Your algorithm must locate a pair of values in the list N that sum to the value SUM. For example, if your list of values is 3, 8, 13, 2, 17, 18, 10, and the value of SUM is 20, then your algorithm would output either of the two values (2, 18) or (3, 17). If your algorithm cannot find any pair of values that sum to the value SUM, then it should print the message ‘Sorry, there is no such pair of values’
Answer the given question with a proper explanation and step-by-step solution. Java N people are arranged in a circle.(Each assigned a number in sequence). Starting from the first, countdown , removing each k-th person from the list, while closing the circle. Determine the number of the last one remaining in the circle (k<=N) Hint: to solve this problem, use a list in which the reference field of the last element contains a link to the first element
Write a simple code (python). Given a list of n elments with each element between 1 and n. determine whether there are any duplicates. Then find the following: 1. What does the algorithms compute? 2. What is its basic operation? 3. How many times is the basic operation executed? 4. What is the efficiency class of the algorithm? Keep in mind it's an Analysis of Algorithms course.
The list Q has numbers 1, square root of 2, x, and x^2, where x>0 and the range of the numbers in the list is 4. quanity A= x quanity b= 2 which quanity is greater?
A fibonacci series is defined as a series where the number at the current index, is the value of the summation of the index preceding it (index -1) and (index-2). Essentially, for a list fibonacci_numbers which is the fibonacci numbers series, fibonacci_numbers[i] = fibonacci_numbers[i-1] + fibonacci_numbers[i-2] The fibonacci series always begins with 0, and then a 1 follows. So an example for fibonacci series up to the first 7 values would be - 0, 1, 1, 2, 3, 5, 8, 13 Complete the fibonacci(n) function, which takes in an index, n, and returns the nth value in the sequence. Any negative index values should return -1. Ex: If the input is: 7 the output is: fibonacci(7) is 13 Important Note Use recursion and DO NOT use any loops. Review the Week 9 class recording to see a variation of this solution. def fibonacci(n): if (n < 0 ): return -1 else: return n fibonacci_numbers = (fibonacci[n - 1] + fibonacci[n - 2]) return fibonacci_numbers(n) # TODO: Write…
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)
Given a list of millions of words, design an algorithm to create the largest possiblerectangle of letters such that every row forms a word (reading left to right) and every column formsa word (reading top to bottom). The words need not be chosen consecutively from the list, but allrows must be the same length and all columns must be the same height.