3. A list of numbers is considered increasing if each value after the first is greater than or equal to the precedingvalue. The following procedure is intended to return true if numberList is increasing and return falseotherwise. Assume that numberList contains at least two elements.PROCEDURE isIncreasing(numberList)Tue 61Line 1:Line 2: {Line 3:count 2Line 4:REPEAT UNTIL(count > LENGTH(numberList))Line 5:}IF(numberList[count] < numberList[count - 1])Line 6:Line 7:To entdLine 8:RETURN(true):80 onij{count count + 1Line 9:Line 10:er onilLine 11: }Line 12:RETURN(false)BELAS(ConuE)Line 13: }Which of the following changes is needed for the program to work as intended?Lines 8 and 12 should be interchanged.c. In line 6, < should be changed to >=.a.b. Lines 10 and 11 should be interchanged. d. In line 3, 2 should be changed to 1.3.

3. A list of numbers is considered increasing if each value after the first is greater than or equal to the preceding value. The following procedure is intended to return true if numberList is increasing and return false otherwise. Assume that numberList contains at least two elements. Line 1: PROCEDURE isIncreasing(numberList) Line 2: { Line 3: count 2 Line 4: REPEAT UNTIL(count > LENGTH (numberList)) { Line 5: Line 6: IF(numberList[count] < numberList[count - 1]) { RETURN(true) Line 7: Line 8: Line 9: } :80 anlj Line 10: count count + 1 res ank Line 11: } Line 12: RETURN (false) Line 13: } Which of the following changes is needed for the program to work as intended? Lines 8 and 12 should be interchanged. In line 6, < should be changed to >=. а. с. b. Lines 10 and 11 should be interchanged. d. In line 3, 2 should be changed to 1.

3. A list of numbers is considered increasing if each value after the first is greater than or equal to the preceding value. The following procedure is intended to return true if numberList is increasing and return false otherwise. Assume that numberList contains at least two elements. Line 1: PROCEDURE isIncreasing(numberList) Line 2: { Line 3: count 2 Line 4: REPEAT UNTIL(count > LENGTH (numberList)) { Line 5: Line 6: IF(numberList[count] < numberList[count - 1]) { RETURN(true) Line 7: Line 8: Line 9: } :80 anlj Line 10: count count + 1 res ank Line 11: } Line 12: RETURN (false) Line 13: } Which of the following changes is needed for the program to work as intended? Lines 8 and 12 should be interchanged. In line 6, < should be changed to >=. а. с. b. Lines 10 and 11 should be interchanged. d. In line 3, 2 should be changed to 1.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 18PE

See similar textbooks

Similar questions

Q4 Suppose, alist is a 2-dimensional list that is defined as follows. alist = [ [1], [2,3], [5,6,7] ] Which is the best option to access the last element of the last element of this list (i.e., 7)? Question 4 options: alist[ len(alist) - 1 ][len(alist[len(alist) - 1]) - 1] alist[ len(alist) - 1 ][len(alist[len(alist) - 1])] alist[3][3] alist[ len(alist) - 1 ][1]
Write the following function that sorts and merges two lists into a new sorted list. The new list contains only even numbers. def myMergeEvenList(list1, list2): Enter list1: 10,5,6,7 Enter list2: 12,8,5,0,1 The merged list is: 0,6,8,10,12
Q2. Write a java program to perform the following task: a) Create a collection ArrayList<String> for Customer class b) Add 5 elements into ArrayList c) Display the element at index 4 d) Display all the elements in the ArrayList using for-each loop e) Remove the values at index 2 f) Add “cst2” in location 2. g) Check if st2 existing inside the collection.
def bubble_up(values: list, left: int, right: int) -> None: """Bubble up through values[left: right+1], swapping items that are out of order. Note that use of this slicing notation means that items values[left], values[left + 1], values[left + 2], ..., values[right] could be modified. Precondition: left and right are valid indexes in values. >>> list_example_1 = [4, 3, 2, 1, 0] >>> bubble_up(list_example_1, 0, 3) >>> list_example_1 [3, 2, 1, 4, 0] >>> list_example_2 = [4, 3, 2, 1, 0] >>> bubble_up(list_example_2, 2, 4) >>> list_example_2 [4, 3, 1, 0, 2] """ for i in range(left, right): if values[i] > values[i + 1]: temp = values[i] values[i] = values[i + 1] values[i + 1] = temp # Use the bubble_up function as a starting point to help you complete the# bubble_down function.def bubble_down(values: list, left: int, right: int) -> None:…
Implement a list of employees using a dynamic array of strings.Your solution should include functions for printing list, inserting and removingemployees, and sorting lists (use Bubble sort in C++ language).Keep list of employees sorted within the list after insertion.See the following example:How many employees do you expect to have?5 (Carriage Return)Menu :1 . Print full list of employees2 . Insert new employee3 . Remove employee from list0 . Exit2 (Carriage Return)Input name of new employee : MikeMenu :1 . Print full list of employees2 . Insert new employee3 . Remove employee from list0 . Exit1(Carriage Return)1 . MaryMenu :1 . Print full list of employees2 . Insert new employee3 . Remove employee from list0 . Exit
complete the following function. // It is the same as observeCounter except that f has a parameter of type List[Counter] not Counter. // f will insist that the List[Counter] has length 3. // You must return a List[Int] not an Int. // The first element of the result List[Int] must correspond to the number of times that increment/decrement were called on the first element of type List[Counter], similarly for the second and third elements. def observeCounterList (f : List[Counter] => Unit) : List[Int] = { // TODO: Provide definition here. List (-1, -1, -1) }
def get_legal_word_scores(letters, dictionary, value_dict): """ Given a str of letters that we can use, and a dictionary that contains all legal words allowed in scrabble game, and a value_dict that maps each letter to a score, Returns a dictionary that contains all possible scores earned by any legal word as the key, and for each score, the score/key maps to a list of words that are from the dictionary made from the given letters and computes to that score. The list should be in alphabetical order. """
hello guys. can you solve the question next? thank you. here is an example that solution should be like in pic. QUESTION: Write a function randomList() that gets three integers as parameters, start, bound and k. This function will create a list of k randomly generated integer numbers between start and bound values (both inclusive), and return the created list. Write a function sqrtList() that gets a list as parameter, print the numbers in the list and their square root. The square roots will be printed with 3 decimal digits. Write Python statements that ask the user to input start, bound and k values, then call the method to perform the calculations and produce the output. At the end print average of numbers by calling the function calculateAverage().
Question 20 A list is a collection with additional index- and iteration- related operations. True False Question 21 O(N) is the order of growth execution time of the size operation when using the SortedArrayCollection class, assuming a collection size of N. True False Question 22 If N represents the number of elements in the list, then the index-based set method of the ABList class is O(1). True False Question 23 O(N) is the order of growth execution time of the remove operation when using the LinkedCollection class, assuming a collection size of N. True False Question 24 It is not possible to use an array to implement a linked list. True False Question 25 O(N) is the order of growth execution time of the remove operation when using the ArrayCollection class, assuming a collection size of N. True False Question 26 Our linked implementation of lists implements a bounded list. True False Question 27 O(N) is the order of growth execution time of the contains operation…
Given two lists(List1, List2) of INTs create a third list such that should contain only odd numbers from the first list and even numbers from the second list def mergeList(listOne, listTwo): thirdList = [] #complete the function
Python You and your neighbor have equal sized gardens. Your gardens are represented as 2D-lists, where garden[i] [j] gives an element at position (i, j). Every element in a garden is represented as an string, and can be "grass", "moss", "strawberry" , "rock", "raspberry". Latley you have noticed more moss and rock in your garden and espects its to be your neighbor. To fix it, complete the function clean_mygarden(my_garden, neighbors_garden) At the end , swap every rock and moss in your garden with the first stawberry and raspberry from neighbor (they dont need to be at the same position MAKE A FUNCTION "find_items" that inputs two arguments: (garden, item) , and returns a (i, j) position as a tuple if item is in garden. If not, return None. Make a function swap_items that swaps two elements between two gardens. Let the function Input these arguments (garden1, garden2, pos1, pos2), where pos1 and pos2 is (i,j) tuples.def swap_items(garden1,garden2,pos1,pos2):Here you are not going…
1- Start by writing your choice from the list given above. Part a. Explain the important technical details about your choice. 2-(continued) Start by again writing your choice from the list given above. Part b. Most of the ADTs in this class were implemented using arrays and linked lists. If appropriate for the ADT you chose in part a., explain which one (an array or a linked list) you would choose to implement it and why. If it doesn’t make sense to implement your ADT using an array or a linked list, explain which other data structure you would use to implement your ADT.