3. find_movies_by_director This function takes a list of tuples (representing movies) and a string (representing a name of a director) and returns a list containing *only* those movie tuples where the movie director is equal to the requested director. Movie tuples are of the shape (title, year, director). You can use this list for testing purposes! my_inovies = [("Blade", 1998, "Stephen Norrington"), ("Underworld", 2003, "Len Wiseman"), ("The Lost Boys", 1987, "Joel Schumacher"), ("The Hunger", 1983, "Tony Scott")] Sample calls should look like this. >>> find movies_by_director (my_movies, "Stephen Norrington") [('Blade', 1998, 'Stephen Norrington')] >>> find movies_by_director (my_movies, "Sofia Coppola") []

3. find_movies_by_director This function takes a list of tuples (representing movies) and a string (representing a name of a director) and returns a list containing only those movie tuples where the movie director is equal to the requested director. Movie tuples are of the shape (title, year, director). You can use this list for testing purposes! my_inovies = [("Blade", 1998, "Stephen Norrington"), ("Underworld", 2003, "Len Wiseman"), ("The Lost Boys", 1987, "Joel Schumacher"), ("The Hunger", 1983, "Tony Scott")] Sample calls should look like this. >>> find movies_by_director (my_movies, "Stephen Norrington") [('Blade', 1998, 'Stephen Norrington')] >>> find movies_by_director (my_movies, "Sofia Coppola") []

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

create a function my_code(u) that sorts a list of words alphabetically using a FOR loop. example: my_code(u) will output the list ['apple', 'bear', 'cat', 'dog'] u = "dog cat bear apple"
C++ I'm interested in knowing if there are two adjacent strings in a list that are very similar to each other. For instance, "Zach" and "Zack" are only one character apart. Write a function, named "CloseEnough" that takes a const reference to a vector of strings and an int. The vector is a list of strings (each of the same length). The int represents how many characters can be different between any two strings next to each other. This function should return the index (an int) of the string that is within the second arguments distance to the next string in the vector. If no index fulfills this criteria, it should return -1. You should be using the STL algorithms to achieve this and no while or for loops.
Computer Science (in picat) 10. split list(Lst,N): split Ist into two parts with the first part having N elements, and return a list that contains these two parts. 12. min max median(st): a function that takes a simple list of numbers Ist as a parameter and returns a list with the min, max, and the median of Ist. Can you devise an algorithm that has an expected linear running time?
Assume that L is a list of Boolean values, True and False. Write a program in python with a function longestFalse(L) which returns a tuple (start, end) representing the start and end indices of the longest run of False values in L. If there is a tie, then return the first such run. For example, if L is False False True False False False False True True False False 0 1 2 3 4 5 6 7 8 9 10 then the function would return (3, 6), since the longest run of False is from 3 to 6.
list_n_perfect_squares This function takes a positive integer, n, and returns a list containing n perfect square numbers, starting with 1 and counting up to n2 Use a list comprehension and a range! Sample runs should look like: >>> list_n_perfect_squares(6)[1, 4, 9, 16, 25, 36]>>> list_n_perfect_squares(1)[1]>>> list_n_perfect_squares(20)[1, 4, 9, 16, 25, 36, 49, 64, 81, 100, 121, 144, 169, 196, 225, 256, 289, 324, 361, 400]
Write a function filter_words_end_ie(word_list) that uses a regex to filter (select) the words from a given list that end with ie. Examples: >> filter_words_end_ie(['hello', 'bye', 'goalie', 'newbie', 'zero', 'rieb', 'zombie', 'zoom', 'ierapetra']) ['goalie', 'newbie', 'zombie']
Write a function inde which returns the index (start from 1) of the occurrence of a given value. Use helper function. Two functions are enough.inde(1, [1,2,1,1,2,2,1]) → [1,3,4,7] Write a function nele which repeats each element in a list n times. Use helper function. Two functions only.nele([1,2],3) → [1,1,1,2,2,2] Write a function isfact to determine if a positive integer is a factorial number. Do not use any formula such as T(n)=n(n+1)/2. Do it in recursive fashion. Two functions are enough.isfact(120) → true
program to be written in C Write a program that gets a list of integers from input, and outputs the integers in ascending order (lowest to highest). The first integer indicates how many numbers are in the list. Assume that the list will always contain less than 20 integers. Ex: If the input is: 5 10 4 39 12 2 the output is: 2 4 10 12 39 For coding simplicity, follow every output value by a space, including the last one. Your program must define and call the following function. When the SortArray function is complete, the array passed in as the parameter should be sorted.void SortArray(int sortingList[], int numVals
Write a function called remove_odd that takes a list of numbers that have both even and odd numbers mixed.# Function should remove all the odd numbers and return a compact list which only contains the even numbers. Example1: Function Call:remove_odd ([21, 33, 44, 66, 11, 1, 88, 45, 10, 9])Output:[44, 66, 88, 10]
Brussel's choice def brussels_choice_step(n, mink, maxk): This problem is adapted from another jovial video "The Brussel's Choice" of Numberphile (a site so British that you just know there has to be a Trevor and a Colin somewhere in there) whose first five minutes you should watch to get an idea of what is going on. This function should compute and return the list of all numbers that the positive integer n can be converted to by treating it as a string and replacing some substring m of its digits with the new substring of either 2*m or m/2, the latter substitution allowed only when m is even so that dividing it by two produces an integer. This function should return the list of numbers that can be produced from n in a single step. To keep the results more manageable, we also impose an additional constraint that the number of digits in the chosen substring m must be between mink and maxk, inclusive. The returned list must contain the numbers in ascending sorted order.
Use Standard ML Code: Write a function that returns the factorial of a number. Write a function that sums all numbers in a list of pairs. e.g.: sum_of_pairs [(1, 2), (4, 3), (2, 5)] should return 17 (which is equal to 1 + 2 + 4 + 3 + 2 + 5) Write a function to return a list of second elements in a list of pairs. e.g.: sends [(1, 2), (4, 3), (2, 5)] should return [2, 3, 5]।
rite a function numPairs that accepts two arguments, a target number and a list of numbers. The function then returns the count of pairs of numbers from the list that sum to the target number. In the first example the answer is 2 because the pairs (0,3) and (1,2) both sum to 3. The pair can be two of the same number, e.g. (2,2) but only if the two 2’s are separate twos in the list.In the last example below, there are three 2’s, so there are three different pairs (2,2) so there are 5 pairs total that sum to 4. Sample usage: >> numPairs( 3, [0,1,2,3] )2