Automated testing is required
Your solutions can use:
• the [] operator to get and set list elements (e.g., lst[i] and lst[i] = a)
• the in and not in operators (e.g., a in lst)
• the list concatenation operator (e.g., lst1 + lst2)
• the list replication operator (e.g., lst * n or n * lst)
• Python's built-in len, min and max functions, unless otherwise noted.
Your solutions cannot use:
• list slicing (e.g., lst[i : j] or (lst[i : j] = t)
• the del statement (e.g., del lst[0])
• Python's built-in reversed and sorted functions.
• any of the Python methods that provide list operations, e.g., sum, append, clear, copy, count, extend, index, insert, pop, remove, reverse and sort
• list comprehensions
using python language Use the function design recipe to develop a function named unique_list. The function takes a list of strings, which may be empty. The function returns a new list that includes the first occurrence of each value in a list and omits later repeats. The returned list should include the first occurrences of values in a list in their original order. For example, if a list contains the following animals ['cat', 'dog', 'cat', 'bug', 'dog', 'ant', 'dog', 'bug'], the unique_list function returns a unique list: ['cat', 'dog', 'bug', 'ant'].
Step by stepSolved in 2 steps
- 2. listAverage() returns the average number in a list. Which of these functions does this correctly? O A. function listAverage (1ist) ( var sum - for ( var 8 0: 0< list length sum- sum + 1ist A return sum / ist.length O B. tunction listAverage (list){ var sum for( var 8 0: Ise. 1ength sum sum + Ist O return sum / 1ist length . function listAverage (list) ( var sum= return sum / HElength) for ( var 0 0arrow_forwardASSUMING C LANGUAGE True or False: You can have the data portion of a Linked List be a Struct containing a Linked List itselfarrow_forwardQuestion 30 If N represents the number of elements in the list, then the index-based add method of the LBList class is O(N). True False Question 31 A header node does not contain actual list information. True False Question 32 Any class that implements the Comparable interface must provide a compareTo method. True False Question 33 A SortedABList list can only be kept sorted based on the "natural order" of its elements. True False Question 34 O(N) is the order of growth execution time of the add operation when using the SortedArrayCollection class, assuming a collection size of N. True False Question 35 The iterator operation is required by the Iterable interface. Group of answer choices True False Question 36 O(N) is the order of growth execution time of the remove operation when using the SortedArrayCollection class, assuming a collection size of N. True False Question 37 O(N) is the order of growth execution time of the index-based add operation when…arrow_forwardWhat is the biggest advantage of linked list over array? Group of answer choices Unlike array, linked list can dynamically grow and shrink With linked list, it is faster to access a specific element than with array Linked list is easier to implement than array Unlike array, linked list can only hold a fixed number of elementsarrow_forwardWith Head node or not? statement is: if(p->rlink == null) output << "The data doesn't exist."; O a. It is a Doubly linked list without Head node. O b. It is a Doubly linked list with Head node.arrow_forward5. The following function indexCounter aims to find and return all the indices of the element x in a list L. if x is not in the list L, return an empty list. However, the implementation has a flaw, so that many times it will return error message. Can you fix the flaw? def indexCounter(L, x): indexList [] startIndex = 0 while startIndex < len(L): indexList.append (L.index (x, startIndex)) startIndex = L.index (x, startIndex) + 1 return indexListarrow_forwardplease go in to the detail and explain the purpose and function to each line & function of code listed below. #include <stdio.h> //Represent a node of the singly linked list struct node{ int data; struct node *next; }; //Represent the head and tail of the singly linked list struct node *head, *tail = NULL; //addNode() will add a new node to the list void addNode(int data) { //Create a new node struct node *newNode = (struct node*)malloc(sizeof(struct node)); newNode->data = data; newNode->next = NULL; //Checks if the list is empty if(head == NULL) { //If list is empty, both head and tail will point to new node head = newNode; tail = newNode; } else { //newNode will be added after tail such that tail's next will point to newNode tail->next = newNode; //newNode will become new tail of the list tail = newNode; } }…arrow_forwardQ1: Write a method to insert an array of elements at index in a single linked list and then display this list. The method receives this array by parameters. 12:54 AM Q2: Write a method to multiply the odd numbers and add the even numbers for a single linked list data structure, then display the results. The method receives this list by parameters. 12:54 AM Q3: Write a complete project and test it to execute the single-linked list data structure with all functions including the methods in questions 1 & 2. 12:54 AM all in javaarrow_forwarddef print_categories(main_list): for i in all_categories: main_list = all_categories.split() print(i,":",all_categories[i]) return "" """ 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.arrow_forwardWith Head node or not? statement is: if(first->llink == first) output << "List is empty"; O a. It is a Doubly linked list without Head node. O b. It is a Doubly linked list with Head node.arrow_forwardQuestion 44 Computer Science A list of elements has a size of 100. Choose the operations where an ArrayList would be faster than a LinkedList. (Select all that apply) Question 5 options: removing from index 99 inserting at index 1 removing from index 4 inserting at index 4 Full explain this question and text typing work onlyarrow_forwardstruct insert_at_back_of_sll { // Function takes a constant Book as a parameter, inserts that book at the // back of a singly linked list, and returns nothing. void operator()(const Book& book) { /// TO-DO (3) /// // Write the lines of code to insert "book" at the back of "my_sll". Since // the SLL has no size() function and no tail pointer, you must walk the // list looking for the last node. // // HINT: Do not attempt to insert after "my_sll.end()". // ///// END-T0-DO (3) ||||// } std::forward_list& my_sll; };arrow_forwardarrow_back_iosSEE MORE QUESTIONSarrow_forward_ios
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education