Execute the following algorithm on given list and find what this algorithm computes? procedure negative(a1, a2, . . . , an: integers) count := 0 for i := 1 to n if ai < 0 then count := count+1 return count{count has total number of negative elements in the list} 2 , - 5 , 6 , -11 , 2 , 7 , - 23 , 4 , -8 , 19 i ai count 1 2 2 -5 3 6 4 -11 5 2 6 7 7 -23 8 4 9 -8 10 19

Execute the following algorithm on given list and find what this algorithm computes? procedure negative(a1, a2, . . . , an: integers) count := 0 for i := 1 to n if ai < 0 then count := count+1 return count{count has total number of negative elements in the list} 2 , - 5 , 6 , -11 , 2 , 7 , - 23 , 4 , -8 , 19 i ai count 1 2 2 -5 3 6 4 -11 5 2 6 7 7 -23 8 4 9 -8 10 19

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

Q2: a. 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. Dry run the above algorithm to find the value 240. A[] = {10,15,20,60,65,110,150,220,240,245,260,290,300,460,470,501}
For a list L, L.insert(i, item) operation is a ____ operation, if L has not already reached its capacity. Question 14 options: O(n) O(exp(n)) O(log(n)) O(1)
Using the Select kth element algorithm discussed in the class to find the 8th element from the list of 25 integers below. Show the steps up to the partition of the list into two lists L and R, and indicate which list (L or R) you will continue according to the select kth element algorithm. 7,2, 106, 99, 120, 41, 18, 113, 112, 110, 111, 110, 110, 112, 115, 1, 3, 99, 120, 190, 3, 4, 116, 129, 800.
Index Element 00 25 01 62 02 76 03 471 Considering all the elements and its indexes at the right side: 04 243 05 99 06 07 81 111 Write a sequence of List operations that 08 719 would result to a LIST that contains 09 186 ONLY the elements with its respective indexes: {index[00]=104, index[01]=165, index[02]=115, index[03]=384, index[04]=248, index[05]=117}. 10 66 11 506 12 290 13 359 14 121 15 102 16 818 17 34 18 499 19 620 20 103 21 444 22 904 23 972 24 193
NOTE: A complete linked list program show (0..7) choices.. 1 to Insert at the beginning 2 to Insert at the end 3 to Insert at mid 4 to Delete from beginning 5 to Delete from the end 6 to Delete from mid 7 to Display O to Exit Display the result of choice 7 according to the following choices: Enter Your Choice: 2 Enter Element: Z Enter Your Choice: 2 Enter Element:X Enter Your Choice: 1 Enter Element: C Enter Your Choice: 3 Enter Element: Y Enter Position ( zero-indexed ): 2 Enter Your Choice: 1 Enter Element: P Enter Your Choice: 5 Element Deleted: X Enter Your Choice: 7 Enter Your Choice: 0 EXIT
Assume that list consists of the following elements. What is the result after the first pass of the selection sort algorithm? Assume the list is to be sorted in ascending order. int list [] = {34, 56, 12, 25, 73, 4, 85, 13, 46, 16}; O None of these O 4 12 13 16 25 34 46 56 73 85 O 4 56 12 25 73 34 85 13 46 16 O 16 56 12 25 73 4 85 13 46 34 O 85 73 56 46 34 25 16 13 12 4
NOTE: A complete linked list program show (o.7) choices. 1 to Insert at the beginning 2 to Insert at the end 3 to Insert at mid 4 to Delete from beginning S to Delete from the end 6 to Delete from mid 7 to Display O to Exit Display the result of choice 7 according to the following choices: Enter Your Choice: 2 Enter Element: F Enter Your Choice: 2 Enter Element: H Enter Your Choice: 2 Enter Element: L Enter Your Choice: 1 Enter Element: 0 Enter Your Choice: 2 Enter Element: Z Enter Your Choice: 4 Element Deleted: 0 Enter Your Choice: 7 required print the 7e result op option Enter Your Choice: 0 no 7 EXIT
The function interleave_lists in python takes two parameters, L1 and L2, both lists. Notice that the lists may have different lengths. The function accumulates a new list by appending alternating items from L1 and L2 until one list has been exhausted. The remaining items from the other list are then appended to the end of the new list, and the new list is returned. For example, if L1 = ["hop", "skip", "jump", "rest"] and L2 = ["up", "down"], then the function would return the list: ["hop", "up", "skip", "down", "jump", "rest"]. HINT: Python has a built-in function min() which is helpful here. Initialize accumulator variable newlist to be an empty list Set min_length = min(len(L1), len(L2)), the smaller of the two list lengths Use a for loop to iterate k over range(min_length) to do the first part of this function's work. On each iteration, append to newlist the item from index k in L1, and then append the item from index k in L2 (two appends on each iteration). AFTER the loop…
Using Clojure Write a procedure remove-third that takes a list, and returns the same list with the third value removed. For example, given (list 3 1 4), remove-second should return (list 3 1)
def eliminate_neighbours (items): Given the sequence of integer items that are guaranteed to be some permutation of positive integers from 1 to n where n is the length of the list, find the smallest number among those that still remain in the list, and remove from the list both that number and whichever of its current immediate neighbours is larger. The function should repeat this basic operation until the largest number in the original list gets eliminated. Return the number of removal operations that were needed to achieve this goal. For example, given the list [5, 2, 1, 4, 6, 31, the operation would remove element 1 and its current larger neighbour 4, resulting in the list [5, 2, 6, 3]. Applied again, that operation would remove 2 and its current larger neighbour 6, thus reaching the goal in two steps. items Expected result [1, 6, 4, 2, 5, 3] 1 [8, 3, 4, 1, 7, 2, 6, 5] 3 [8, 5, 3, 1, 7, 2, 6, 4] 4 [1, 2, 3, 4, 5, 6, 7, 8, 9, 10] 5 range (1, 10001) 5000 [1000] + list(range (1, 1000))…
Circular Lists - All One Problem! A linear list is being maintained circularly in an array c[0…n-1] with front, and rear set up as for circular queues. Draft a formula/algorithm in terms of front, rear, and n for the number of elements in the list. Write an algorithm to delete the k-th element in the list. Write an algorithm to insert an element y immediately after the k-th element. Calculate the time complexity of your algorithms for b) and c).
True/False You can perform reduce operation with a list comprehension Looking for even numbers in a list of N numbers can be accomplished in O(N) True / False range(5, 35, 5) will generate a sequence of 7 elements True/False If I double the number of items in a sorted list of numbom gorith الن...