python The FlipList class defined below is intended to be identical to a list, except that the append method only adds new elements to the back of the list when the length of the list is odd. When the length is even, append should instead add the new element to the front of the list. class FlipList(list):

python The FlipList class defined below is intended to be identical to a list, except that the append method only adds new elements to the back of the list when the length of the list is odd. When the length is even, append should instead add the new element to the front of the list. class FlipList(list):

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter9: Advanced Array Concepts

Section: Chapter Questions

Problem 18RQ

See similar textbooks

Similar questions

2) Suppose you have a linked list class that provides the following methods: // constructor. // returns size of the list. LinkList () int size (); void insertHead (Object data) // insert new data at the head of // the list. // remove and return the Object at // the head of the list. Object removeHead () void insertTail (Object data) // insert new data at the tail of // the list. The class below is an implementation of a stack using the linked list class. Fill in the method implementations: class Stack { private Stack s; public Stack () { public void push (Object x) { } public Object pop () // assume stack is not empty { } public boolean isEmpty() { }
It is a class that is part of the java.util package which can store a list of values and reference them with an index. (a) None of the Choices (b) Variable List (c) Array List (d) Object List Please provide an explanation. Thank you!
Python: Take your searching and sorting functions and put them into a class. The constructor should take a list as a parameter use the classes sort method and store the sorted list in a class property. A "search" method should return true or false if the item is found. A "count" method should return 0 or the number of times the item is found. For fun, you can create a method to generate a list of random numbers (and then sort it).
In the C programming language Suppose you are given an array of integers. You want to insert a number x to the array and rearrange so that all the elements are less than or equal to x are before x, and the elements after x are greater than x. For example, suppose the list is {3, 2, 7, 0 1, 5}and x is 4, since3, 2, 0, and 1,are less than or equal to 4,7and 5 are greater than 4, the new array is {3, 2, 0, 1, 4, 7, 5}.The new array has the length of n+1 where n is the length of the input array. Example input/output #1: Enter the length of the array: 10 Enter the elements of the array: 3 5 14 03 92 8 11 Enter the number for insertion: 3 Output: 3 1 0 3 2 3 5 4 9 8 11 Example input/output #2: Enter the length of the array: 8 Enter the elements of the array: 5013 4 1 7 3 5 Enter the number for insertion: 6 Output: 5 0 4 1 356 13 7 1) Name your program arrays.c 2) Include the rearrange( ) function to rearrange the array: void rearrange(int *a, int n, int insert, int *b); a…
this is for Python and can you explain what the code is doing with comments and test case you DONT use any of the list methods (append, pop etc.). class mystack(): def __init__(self, m = 10): self.maxsize = m self.TOP = -1 self.array = [None]*m def push(self, item): # Inserts item at the top of the stack and returns True. If unable to insert the item returns false ####################################################################### # Remove the pass statement and write your code ####################################################################### pass def pop(self): # Removes the item from the top of the stack and returns it. For unsuccessful pop return False ####################################################################### # Remove the pass statement and write your code ####################################################################### pass…
Create a Flowchart for this code. import random #Define a function to pick 5 numbers from 1 to 38 def getNJCash5lottery_numbers(): #Return the list return random.sample(range(1, 39), 5) def playNJCash5lottery(): #Call the method and assign the list to variable lottery_number = getNJCash5lottery_numbers() print("These are the cash 5 numbers."), #Iterate over list elements for number in lottery_number: #Print the number on one line print(number) #Define a function def main(): while(True): #Call the method to print the list elements playNJCash5lottery() #Prompt the user if they want to play again decide = input("\nDo you want to play again? Yes/No : ") #If they entered "no " or "No" if decide.lower() == "no": #Exit break #Call the "main()" function if __name__ == "__main__": main()
getListRowIndices Method public static java.util.ArrayList<java.lang.Integer> getListRowIndices(int[][] array, int rowLength) This method returns an ArrayList with the indices of rows of the two-dimensional having a length that corresponds to rowLength. You may only use one auxiliary method. The method should create an ArrayList that is passed to the auxiliary in order to place the indices (if any). If no indices are found, an empty (size of 0) ArrayList will be returned. You can assume the array parameter will not be null and every row of the two-dimensional array has an array with a size of at least 0. Your implementation must be recursive and you may not use any loop construct. Do not use ++ or -- in any recursive call argument. It may lead to an infinite recursion. For example, use index + 1, instead of index++. Parameters: array - rowLength - Returns: ArrayList<Integer>
Java/Data Structures: If myList is a declared ADT list and the front of the list is on the left, what does the method getEntry(3) return after applying the following pseudo code? myList.add(“horse”) myList.add(“goat”) myList.add(1, “fish”) myList.add(“cat”) myList.add(2, “dog”) myList.remove(4) Multiple choice. A) cat B) dog C) fish D) horse
Computer Science Write a program in the Java language that includes: 1. A class for books, taking into account the encapsulation and getter, setter. 2. Entering books by the user using Scanner 3. LinkedList class for: (Adding a new book - Inserting a book- Searching for a book using the ISBN Number - Viewing all books,delete book). 4. Serial number increases automatically with each book that is entered. 5. Printing the names of books is as follows: Serial - ISBN - Name - PubYear - Price - Notes. 6-Design a main menu that includes: • Add Book • Insert Book • Delete Book • Search . Display . Exit
Python: Work with one other class member (if you can--if you can't coordinate, you can have a group of 1) DO Create several python lists of a variety of lengths, but they should be >10 elements and probably less than 100 Here's some code to create a list of random numbers and random size: import randommylist=random.sample(range(100),random.randrange(10, 101, 1)) # unique values# mylist=random.choices(range(100),k=random.randrange(10, 101, 1)) # contains duplicates Use python's search method to find out if certain numbers are in the list and to count them. Write a bubble sort to sort the list in place Write a binary search function to find items in the sorted lists binary search will start in the middle of the list, then determine if it should look in the left half or right half of the remaining list... then continue until it finds a result or it isn't there. Write a search to count the items in the list (not using the list.search method) in your sorted lists You may need longer…
Use arrays in creating your classes. Java language. void insert(Object, int index): Add the object at the specified index. void append(Object): Add the object at the end of the list. Object remove(int index): Remove and return the object at the specified index. int size() String toString() boolean isEmpty() int getIndexOf(Object): Returns -1 if not found boolean contains(Object): Return true if the object is in the list. Use equals of the object for comparison. boolean equals(Object): Compare sizes and elements in the data structure. Object get(int index): Returns the object at index specified. System.out.println("ArrayList Tests"); // todo: make more tests here ArrayList a = new ArrayList(); System.out.println("Check empty array isEmpty:" + a.isEmpty()); a.insert('B', 0); a.insert('a', 0); a.insert('t', 1); System.out.println("Check non-empty array isEmpty:" + a.isEmpty()); System.out.println(a.toString()); while (a.isEmpty() == false) { System.out.println(a.remove(0)); }…
def find_index(self, value): Finds the index of the given value in the data list. Returns either the index of the item in the list, or None if the item doesn't exist. Keeps track of the number of comparisons between value and items in the list via self.comparisons. For example, you don't need to count any index comparisons you might make as part of a while statement. # Counter for how many comparisons are done is set to zero self.comparisons = 0 # Loop through each item in the self.data list # Add one to comparisons for each comparison #involving a list element # If the item is equal to our search value # return the index this item is at # If we loop through everything and haven't found. # the item, return None