Write LISP functions GEFILTER and LFILTER. GEFILTER takes a numeric atom and a list of numbers and returns a list consisting all numbers in the list which are greater than or equal to the given number. LFILTER takes a numeric atom and a list of numbers and returns a list consisting of all numbers in the list less than the given number. For example: (GEFILTER 4 ‘(3 5 8 2 4 1 9)) Returns the list (5 8 4 9) and (LFILTER 4 ‘(3 5 8 2 4 1 9)) Return the list (3 2 1)

(Programming Language: Python)

Complete the function remove number such that given a list of integers and an integer n, the function removes every instance of
n from the list. Remember that this function needs to modify the list, not return a new list.

# DO NOT ADD ANY OTHER IMPORTS from typing import List

def remove_number(lst: List[int], number: int) -> None:

"""

Remove every instance of number in lst. Do this *in-place*, i.e. *modify* the list. Do NOT return a new list.

>>> lst = [1, 2, 3]

>>> remove_number(lst, 3)

>>> lst

[1, 2]

"""

pass

Plz, use NETBEANS 8.1 or 8.2 to solve it. Mention every answer to it's question

Thank u

Create a new Java Application to manage Linked Lists: (Note: Do not use java.util.LinkedList)

a) Create a Clock class

1. Add hour, minute, and second as attributes

2. Add a constructor and a toString() method

3. Implement the Comparable interface, and add a CompareTo() method

4. Add methods to get and set all attributes.

b) Add to MyLinkedList class the following methods:

1. Insert a node at the front of the list

2. Insert a Node in place, assuming that the list is ordered in ascending order.

3. Delete node in front

4. Delete last node

5. Method to return the size of the list

6. Method to find the node with the minimum value in the list – getMinimum()

c) Create a Test3 class to do the following in the main method:

1. Create a new List (call it clockList) of type MyLinkedList

2. Insert five Clock objects numbers to the list (not ordered).

3. Display all the clocks in the List

4. Sort the List and display it in both ascending and descending

5. Display the largest element in the list

6. Display the smallest element in the list

7. Display the size of the list

8. Search for a particular clock in the List by printing true if found or false.

9. Delete a clock from the front of the list

10. Delete a clock from the back of the list

11. Order the list in ascending order

12. Insert a new clock elements to its appropriate position in the List and display it

Python

This part involves creating a function that will manage a List of unique strings. The function is passed a string and a list as arguments. It passes a list back.

1. The function to add a word to a List if word does not exist in the List. If the word does exist in the List, the function does nothing.

2. Create a test program that takes a string as input and then calls the function over and over until the user enters "Done." If the string "Done" is entered, the program sorts the list and prints it out line by line.

You are to write a C++ program which does the following:

1. Reads in the size of a list of characters.
2. Reads in the list of characters.
3. Prints the list of characters in the opposite order read in.
4. Prints the list of characters in the order read in.
5. Sorts the list.
6. Prints the sorted list.

You may assume there will be no more than 1000 characters in the list. (You should use a constant to make this limit easily changeable.)

You MUST write at least three functions (in addition to 'main') in your program.

JAVA

Write a test program that prompts the user to enter a list and displays whether the list is sorted or not. Here is a sample run. Note that the program first prompts the user to enter the size of the list. Using Array

My output should look like this

Enter the size of the list: 8

Enter the contents of the list: 10 1 5 16 61 9 11 1

The list has 8 integers 10 1 5 16 61 9 11 1

The list is not sorted

Method: DoublyLinkedList reverse(DoublyLinkedList list) Reverse() method accepts a DoublyLinkedList of Character as the argument, reverses the elements in the list, and returns the resulting list. For example:

The given list is

'a' 'b' 'c' 'd' 'e'

The return list should be

'e' 'd' 'c' 'b' 'a'

Java the goal is to create a list class that uses an array to implement the interface below. I'm having trouble figuring out the remove(T element) and set(int index, T element). I haven't added any custom methods other than a simple expand method that doubles the size by 2. I would prefer it if you did not use any other custom methods. Please use Java Generics, Thank you.

import java.util.*;

/**
* Interface for an Iterable, Indexed, Unsorted List ADT.
* Iterators and ListIterators provided by the list are required
* to be "fail-fast" and throw ConcurrentModificationException if
* the iterator detects any change to the list from another source.
* Note: "Unsorted" only means that it is not inherently maintained
* in a sorted order. It may or may not be sorted.
*
* @author CS 221
*
* @param - class of objects stored in the list
*/
public interface IndexedUnsortedList extends Iterable
{
/**
* Adds the specified element to the front of this list.
*
* @param element the element to be added to the front of this list
*/
public void addToFront(T element);

/**
* Adds the specified element to the rear of this list.
*
* @param element the element to be added to the rear of this list
*/
public void addToRear(T element);

/**
* Adds the specified element to the rear of this list.
*
* @param element the element to be added to the rear of the list
*/
public void add(T element);

/**
* Adds the specified element after the specified target.
*
* @param element the element to be added after the target
* @param target the target is the item that the element will be added after
* @throws NoSuchElementException if target element is not in this list
*/
public void addAfter(T element, T target);
  
/**
* Inserts the specified element at the specified index.
*
* @param index the index into the array to which the element is to be inserted.
* @param element the element to be inserted into the array
* @throws IndexOutOfBoundsException if the index is out of range (index < 0 || index > size)
*/
public void add(int index, T element);

/**
* Removes and returns the first element from this list.
*
* @return the first element from this list
* @throws NoSuchElementException if list contains no elements
*/
public T removeFirst();

/**
* Removes and returns the last element from this list.
*
* @return the last element from this list
* @throws NoSuchElementException if list contains no elements
*/
public T removeLast();

/**
* Removes and returns the first element from the list matching the specified element.
*
* @param element the element to be removed from the list
* @return removed element
* @throws NoSuchElementException if element is not in this list
*/
public T remove(T element);

/**
* Removes and returns the element at the specified index.
*
* @param index the index of the element to be retrieved
* @return the element at the given index
* @throws IndexOutOfBoundsException if the index is out of range (index < 0 || index >= size)
*/
public T remove(int index);
  
/**
* Replace the element at the specified index with the given element.
*
* @param index the index of the element to replace
* @param element the replacement element to be set into the list
* @throws IndexOutOfBoundsException if the index is out of range (index < 0 || index >= size)
*/
public void set(int index, T element);

/**
* Returns a reference to the element at the specified index.
*
* @param index the index to which the reference is to be retrieved from
* @return the element at the specified index
* @throws IndexOutOfBoundsException if the index is out of range (index < 0 || index >= size)
*/
public T get(int index);

/**
* Returns the index of the first element from the list matching the specified element.
*
* @param element the element for the index is to be retrieved
* @return the integer index for this element or -1 if element is not in the list
*/
public int indexOf(T element);

/**
* Returns a reference to the first element in this list.
*
* @return a reference to the first element in this list
* @throws NoSuchElementException if list contains no elements
*/
public T first();

/**
* Returns a reference to the last element in this list.
*
* @return a reference to the last element in this list
* @throws NoSuchElementException if list contains no elements
*/
public T last();

/**
* Returns true if this list contains the specified target element.
*
* @param target the target that is being sought in the list
* @return true if the list contains this element, else false
*/
public boolean contains(T target);

/**
* Returns true if this list contains no elements.
*
* @return true if this list contains no elements
*/
public boolean isEmpty();

/**
* Returns the number of elements in this list.
*
* @return the integer representation of number of elements in this list
*/
public int size();

/**
* Returns a string representation of this list.
*
* @return a string representation of this list
*/
public String toString();

/**
* Returns an Iterator for the elements in this list.
*
* @return an Iterator over the elements in this list
*/
public Iterator iterator();

/**
* Returns a ListIterator for the elements in this list.
*
* @return a ListIterator over the elements in this list
*
* @throws UnsupportedOperationException if not implemented
*/
public ListIterator listIterator();

/**
* Returns a ListIterator for the elements in this list, with
* the iterator positioned before the specified index.
*
* @return a ListIterator over the elements in this list
*
* @throws UnsupportedOperationException if not implemented
*/
public ListIterator listIterator(int startingIndex);
}

Please TYPE your answer

What do students learn from their experiences such as Gram stain, HMB, and persistent the bacteria to penicillin (P10) in microbiology course that will continue to influence them for many years to come?  

Using specific MORE examples for your statement AND How will students learn these things? at least 500 words

You are doing research on how much sleep students get who are in a Master's degree program. You randomly select 300 students and determine what the mean number of hours they slept was 5.5 hours, with a standard deviation of .50 hours. What are the upper and lower confidence limits at the 95 percent confidence level?