midterm_1_uofzona

debugg help  def print_categories(main_list):    if id not in main_list:         print("There are no categories.")         return 0         idx = 0         for items in main_list:             item = items[i:]             print("{idx + 1} . {item[0]} - {item[1]}%")             idx += 1             return idx            """    Given a list of lists, for each list    stored in main_list, output its contents    as follows: f"{index of category}. {item[0]} - {item[1]}%".    note that indexing must start at 1 for the first item,    not 0, which is first item's actual index in main_list.    If `main_list` is empty, the function prints    "There are no categories."    Returns the number of categories.    """ def is_valid_index(idx, in_list):    if (idx in in_list - 1):        if len(idx) != 0:            """    Checks whether the provided index `idx`    is a valid positive index that can retrieve    an element from `in_list`.    Returns False if `idx` is negative or exceeds    the size of…

find_last(my_list, x): Takes two inputs: the first being a list and the second being any type. Returns the index of the last element of the list which is equal to the second input; if it cannot be found, returns None instead. >>> find_last(['a', 'b', 'b', 'a'], 'b') 2 >>> ind = find_last(['a', 'b', 'b', 'a'], 'c') >>> print(ind) None • find_first(my_list, x): Takes two inputs: the first being a list and the second being any type. Returns the index of the first element of the list which is equal to the second input; if it cannot be found, returns None instead. >>> find_first(['a', 'b', 'b', 'a'], 'b') 1 >>> ind = find_first(['a', 'b', 'b', 'a'], 'c') >>> print(ind) None In python

find_last(my_list, x): Takes two inputs: the first being a list and the second being any type. Returns the index of the last element of the list which is equal to the second input; if it cannot be found, returns None instead. >>> find_last(['a', 'b', 'b', 'a'], 'b') 2   >>> ind = find_last(['a', 'b', 'b', 'a'], 'c') >>> print(ind) None

python code easy way pls thank you

Odd Even Number Using List CLOSE START Tags: List iterator Write a java program that read list of integer numbers from input user. If the number is even add it into evenList. Otherwise add to odd List. At the end of the code, display the elements of the odd and even numbers list respectively with ascending order. Display your output in the following format: (): [Note: The code must use list and iterator] Input: 230-15 8 22-11 6-7 18 Output: Odd List (4): -15-11-73 Even List (6): 0 2 6 8 18 22

JAVA CODE PLEASE Linked List Practice ll by CodeChum Admin Write a function printNodes that takes in the head of a linked list and prints all the values of that linked list using a while loop. Print the values separated by a [space]->[space] In the main function, write a program that asks the user to input five integers and assign these values to the nodes. Arrange the nodes in ascending order first before printing them using the printNodes function. Input 1. One line containing an integer 2. One line containing an integer 3. One line containing an integer 4. One line containing an integer 5. One line containing an integer Output Enter·number·1:·1 Enter·number·2:·2 Enter·number·3:·3 Enter·number·4:·4 Enter·number·5:·5 1·->·2·->·3·->·4·->·5

Python

Solve the following Program Using C++ solve it correctly and quickly please.

Contact list: Binary Search   A contact list is a place where you can store a specific contact with other associated information such as a phone number, email address, birthday, etc. Write a program that first takes as input an integer N that represents the number of word pairs in the list to follow. Word pairs consist of a name and a phone number (both strings). That list is followed by a name, and your program should output the phone number associated with that name. Define and call the following function. The return value of FindContact is the index of the contact with the provided contact name. If the name is not found, the function should return -1 This function should use binary search. Modify the algorithm to output the count of how many comparisons using == with the contactName were performed during the search, before it returns the index (or -1). int FindContact(ContactInfo contacts[], int size, string contactName) Ex: If the input is: 3 Frank 867-5309 Joe 123-5432 Linda…

Remove Char This function will be given a list of strings and a character. You must remove all occurrences of the character from each string in the list. The function should return the list of strings with the character removed.  Signature: public static ArrayList<String> removeChar(String pattern, ArrayList<String> list) Example:list: ['adndj', 'adjdlaa', 'aa', 'djoe']pattern: a Output:  ['dndj', 'djdl', '', 'djoe']

JAVA CODE PLEASE Linked List Practice l by CodeChum Admin Write a function printNodes that takes in the head of a linked list and prints all the values of that linked list using a while loop. Print the values separated by a [space]->[space] In the main function, write a program that asks the user to input five integers and assign these values to the nodes then print the five nodes using the printNodes function. An initial code is provided for you. Just fill in the blanks. Input 1. One line containing an integer 2. One line containing an integer 3. One line containing an integer 4. One line containing an integer 5. One line containing an integer Output Enter·number·1:·1 Enter·number·2:·2 Enter·number·3:·3 Enter·number·4:·4 Enter·number·5:·5 1·->·2·->·3·->·4·->·5

tails_same(number_list:list) -> bool This function should return true if the value at the beginning and the end of the list are equal. False otherwise. Example: number_list = [1, 239, 949, 0, 84, 0, 1] output: True   number_list = [1, 239, 949, 0, 84, 0, 13] output: False

Python

HAPTER 5: Lists and Dictiona st membership > 51621 O WorkArea Instructions eadline: 03/ 11:59pm EDT Given that k contains an integer and that play_list has been defined to be a list, write a expression that evaluates to True if the value assigned to k is an element of play_list. Additional Notes: play_list and k should not be modified

Starter Code: def find_zero(L): pass   def bubble(L, left, right): pass   def selection(L, left, right): pass   def insertion(L, left, right): pass   def sort_halfsorted(L, sort): '''Efficiently sorts a list comprising a series of negative items, a single 0, and a series of positive items   Input ----- * L:list a half sorted list, e.g. [-2, -1, -3, 0, 4, 3, 7, 9, 14] <---neg---> <----pos----->   * sort: func(L:list, left:int, right:int) a function that sorts the sublist L[left:right] in-place note that we use python convention here: L[left:right] includes left but not right   Output ------ * None this algorithm sorts `L` in-place, so it does not need a return statement   Examples -------- >>> L = [-1, -2, -3, 0, 3, 2, 1] >>> sort_halfsorted(L, bubble) >>> print(L) [-3, -2, -1, 0, 1, 2, 3] '''   idx_zero = find_zero(L) # find the 0 index sort(L, 0, idx_zero) # sort left half sort(L, idx_zero+1, len(L)) # sort right half

Output in C please String is: abcdef String is: 1234 String is: cm I can’t get my code to output the strings

Ocaml Mode Write a function mode : ’a list -> ’a = that given a (nonempty) list it returns an element that repeats the most times (if ties exist, return the element among them that appears first in the list). examples mode [1;2;1;4;2;5;1;2;6];; - : int = 1 mode [’a’;’b’;’c’;’b’;’a’;’b’;’d’;’c’;’d’];; - : char = ’b’

dict = {   'a': [1,2,3,4]   'b': [3,6,7,8]   'c': [9,1,9,1]{ Iterate over the above dictionary 1- display letter and highest value2- display letter and mean of values in corresponding list3- display the letter that the highest value among all lists Example output:highest value in each letters lista : 4b : 8c : 9 Mean value for each letter:a : 2.5b : 6c : 5 The highest valuec : 9

Don't copy from other websties    a) Write a function to get the value of the Nthnode in a Linked List. [Note: The first (N=1) item in the list means the item at index 0.] It takes two parameters: the list or its head, and N. Return False if the list has fewer than N elements. The Linked List structure supports the following function. def getHead(self):     return self.head # it points to a Node structure The Node structure supports the following functions. def getData(self):     return self.data # it returns the value stored in the Node def getNext(self):     return self.next # it points to the next Node b) Write a function that counts the number of times a given integer occurs in a Linked List. Assume similar structures as defined in 1.

In Python please

python help Q5: Compose Write the procedure composed, which takes in procedures f and g and outputs a new procedure. This new procedure takes in a number x and outputs the result of calling f on g of x. (define (composed f g)    'YOUR-CODE-HERE   ) Q6: Remove Implement a procedure remove that takes in a list and returns a new list with all instances of item removed from lst. You may assume the list will only consist of numbers and will not have nested lists. Hint: You might find the filter procedure useful. (define (remove item lst)    'YOUR-CODE-HERE   )     ;;; Tests (remove 3 nil) ; expect () (remove 3 '(1 3 5)) ; expect (1 5) (remove 5 '(5 3 5 5 1 4 5 4)) ; expect (3 1 4 4)

a) Write a function to get the value of the Nu node in a Linked List. [Note: The first (N=1) item in the list means the item at index 0.] It takes two parameters: the list or its head, and N. Return False if the list has fewer than N elements. The Linked List structure supports the following function. def getlead(self): return selt.head # it points to a Node structure The Node structure supports the following functions. def getData(self): return self.data # it returns the value stored in the Node def getNext(self): return self next # it points to the next Node b) Write a function that counts the number of times a given integer occurs in a Linked List. Assume similar structures as defined in 1.

PYTHON CODE - WRITE PYTHON FUNCTION

By python

def small_index(items: list[int]) -> int:"""Return the index of the first integer in items that is less than its index,or -1 if no such integer exists in items.>>> small_index([2, 5, 7, 99, 6])-1>>> small_index([-5, 8, 9, 16])0>>> small_index([5, 8, 9, 0, 1, 3])3"""

Circular linked list is a form of the linked list data structure where all nodes are connected as in a circle, which means there is no NULL at the end. Circular lists are generally used in applications which needs to go around the list repeatedly. struct Node * insertTONull (struct Node *last, int data) // This function is only for empty list 11 5 15 struct Node insertStart (struct Node +last, int data) In this question, you are going to implement the insert functions of a circular linked list in C. The Node struct, print function and the main function with its output is given below: struct Node { int data; struct Node *next; }; struct Node insertEnd (struct Node *last, int data) void print(struct Node *tailNode) struct Node *p; if (tailNode -- NULL) struct Node * insertSubseq (struct Node *last, int data, int item) puts("Empty"); return; p - tailNode → next; do{ printf("%d ",p→data); p - p > next; while(p !- tailNode →next); void main(void) { struct Node *tailNode - NULL; tailNode -…

PYTHON: LINKED LIST

nums = [9,-8,7,-6,3,2,-1,3,10,9] Use enumerate to iterate through the index and values of the nums list, and output the index where userNum is found. For example, if userNum is 3, your output should be: Number 3 found at index 4 Number 3 found at index 7

java data structure

static List<String> findWinners(String pattern, int minLength, boolean even, Stream<String> stream) This function will receive a stream of strings and it will return a sorted list of strings that meet all of the following criteria: They must contain the pattern The strings length must be equal to or greater than the min length number The strings length must be an even or odd number This Function must take no longer 10000 milliseconds to return. pattern - A pattern that all the strings in the list returned must containminLength - The length that all the strings in the list returned must be equal to or greater thaneven - True if even false if odd. Denotes a condition that all the strings in the list returned must have a length that is even or odd.stream - A stream of strings to be filteredreturn - A list of strings that meets the criteria outlined above sorted by their length from small to large

python help Q3: Make Adder Write the procedure make-adder which takes in an initial number, num, and then returns a procedure. This returned procedure takes in a number x and returns the result of x + num. (define (make-adder num)    'YOUR-CODE-HERE   )   ;;; Tests (define adder (make-adder 5)) (adder 8) ; expect 13   Q4: Make a List Create the list with the following box-and-pointer diagram:   (define lst    'YOUR-CODE-HERE   )

my_list = [1,2,3,4] for x in my_list:

write codes in python

Focus on: Basic list operations, methods, use of functions, and good programming style Part 1. Write a program that does the following: 1. Create a list of length N where N is a randomly selected integer between 10 and 20 and whose elements are randomly selected integers between 0 and 19. 2. Print out the list. 3. Create a copy of the list. Sort the copy into decreasing order and print it. 4. Report the distinct elements in the list Before continuing with the next two parts, add a function user_input(lo, hi) to your program. It should ask the user for an integer between lo and hi and return the value. Use appropriate error handling and input validation. (You should already have one of these from back in Module 05) Part 2. Write a function named how_many(a_list, a_num) that that expects a list of numbers and a number as arguments. It returns how many times the number is found in the list. If the number is not in the list, return 0. For example how_many( [12, 15, 16, 4, 10, 3, 5, 7, 9,…