Adds val to the end of the deque. Time complexity: O(1) >>> our_deque_1 = Deque([1, 2, 3]) >>> our_deque_1.append(4)

Pop an element off of the top of the stack. >>> S = Stack() >>> S.push(-5) >>> S.push(10) >>> S.pop()

Adds Operation object to the related Variable objects for creating computational graph for calculating gradients. Args:

Adds the given node to the end of the list (before rear)

Returns the value for the input key and updates the Double Linked List. Returns None if key is not present in cache

Inserts label into the subtree rooted at self, performs any rotations necessary to maintain balance, and then returns the new root t

Tries to find word in a Trie :param word: word to look for :return: Returns True if word is found, False otherwise

copies this vector and returns it.

:param key: Key to insert. :param value: Value associated with given key. >>> skip_list = SkipList() >>> skip_list.i

Removes and returns the given node from the list Returns None if node.prev or node.next is None

Put a new node in the tree >>> t = BinarySearchTree() >>> t.put(8) >>> assert t.root.parent is None >>> asse

:param key: Search key. :return: Value associated with given key or None if given key is not present. >>> skip_list = SkipLi

Checks to see if a number is a prime in O(sqrt(n)). A number is prime if it has exactly two factors: 1 and itself. >>> is_prime(0) False

Returns the color of a node, allowing for None leaves.

Appends every value of iterable to the end of the deque. Time complexity: O(n) >>> our_deque_1 = Deque([1, 2, 3]) >>>

Implement sin function. >>> sin(0.0) 0.0 >>> sin(90.0) 1.0 >>> sin(180.0) 0.0 >>> sin(270.0) -1.0 >>> sin(0.

input: positive integer 'n' returns the factorial of 'n' (n!) >>> factorial(0) 1 >>> factorial(20) 2432902008176640000 >

Deterministic Miller-Rabin algorithm for primes ~< 3.32e24. Uses numerical analysis results to return whether or not the passed number is pri

Plot the membership function of the fuzzy set.

This reverses the linked list order. >>> linked_list = LinkedList() >>> linked_list.insert_tail("first") >>> linked_l

Removes the first element of the deque and returns it. Time complexity: O(1) @returns topop.val: the value of the node to pop

<method Matrix.transpose> Return self^T. Example: >>> a = Matrix(2, 3) >>> for r in range(2): ...

input: index (0-indexed) output: the i-th component of the vector.

Find the convex hull of a set of points using the Graham scan algorithm. The algorithm works as follows: 1. Find the bottom-most point (

Appends a new node with the given data to the end of the LinkedList. >>> linked_list = LinkedList() >>> str(linked_list) ''

Add edge going from node u to v and v to u with weight w: u (w)-> v, v (w) -> u Examples: >>> graph_test = Graph(1)

Returns True if the graph contains the vertex, False otherwise.

Returns True if the graph contains the vertex, False otherwise.

Returns the largest element in this tree which is at most label. This method is guaranteed to run in O(log(n)) time.

The keys function returns a dictionary containing the key value pairs. key being the index number in hash table and value being the d

Returns True if the graph contains the edge from the source_vertex to the destination_vertex, False otherwise. If any given vertex do

Returns True if the graph contains the edge from the source_vertex to the destination_vertex, False otherwise. If any given vertex do

:param key: Key to remove from list. >>> skip_list = SkipList() >>> skip_list.insert(2, "Two") >>> skip_list.insert(

Removes a node in the tree >>> t = BinarySearchTree() >>> t.put(8) >>> t.put(10) >>> t.remove(8) >>>

Returns the output of the function called with current x and y coordinates. >>> def test_function(x, y): ... return x + y

Applies signum function on the number Custom test cases: >>> signum(-10) -1 >>> signum(10) 1 >>> signum(0) 0 >>>

Adds a directed edge from node u to node v with weight w. >>> g = Graph(3) >>> g.add_edge(0, 1, 5) >>>

input: positive integer 'number' returns true if 'number' is prime otherwise false. >>> is_prime(3) True >>> is_prime(10) Fa

Find the convex hull of a set of points using the Jarvis March algorithm. The algorithm starts with the leftmost point and wraps around the

>>> segment_tree = SegmentTree(15) >>> segment_tree.left(1) 2 >>> segment_tree.left(2) 4 >>> segment_

Utilize various methods in this class to simulate the Banker's algorithm :Return: None >>> BankersAlgorithm(test_claim_v

Push an element to the top of the stack. >>> S = Stack(2) # stack size = 2 >>> S.push(10) >>> S.push(20) >>>

>>> segment_tree = SegmentTree(15) >>> segment_tree.right(1) 3 >>> segment_tree.right(2) 5 >>> segmen

Emulate time passing by looping `iteration_count` times >>> wt = WaTor(WIDTH, HEIGHT) >>> wt.run(iteration_count=PREDATOR_IN

r""" 8 / \ 3 10 / \ \ 1 6 14 / \ / 4 7 13

Return the highest priority element in FIFO order. If the queue is empty then an under flow exception is raised.

Return the highest priority element in FIFO order. If the queue is empty then an under flow exception is raised.

Return the encoded version of message according to the polybius cipher >>> BifidCipher().encode('testmessage') == 'qtltbdxrxlk'

coordinates is a two dimensional matrix: [[x, y], [x, y], ...] number of points you want to use >>> points_to_polynomial([]) Traceba

Right rotate a given unsigned number by a certain amount of rotations

>>> apply_table("0123456789", list(range(10))) '9012345678' >>> apply_table("0123456789", list(range(9, -1, -1))) '8765432109'

Function to reshape a row Numpy array into a column Numpy array >>> input_array = np.array([1, 2, 3]) >>> column_reshape(input_array) arra

Isolates the decimal part of a number. If digitAmount > 0 round to that decimal place, else print the entire decimal. >>> decimal_isolate

Return the decoded version of message according to the polybius cipher >>> BifidCipher().decode('qtltbdxrxlk') == 'testmessage'

Add an element to a queue based on its priority. If the priority is invalid ValueError is raised. If the queue is full an Ove

This function enters the element into the queue If the queue is full an Exception is raised saying Over Flow!

Return the floor of x as an Integral. :param x: the number :return: the largest integer <= x. >>> import math >>> all(floor(n) ==

Find mean of a list of numbers. Wiki: https://en.wikipedia.org/wiki/Mean >>> mean([3, 6, 9, 12, 15, 18, 21]) 12.0 >>> mean([5, 1

Converts the given angle from degrees to radians https://en.wikipedia.org/wiki/Radian >>> radians(180) 3.141592653589793 >>> rad

Computes the sign perpendicular distance of a 2d point c from a line segment ab. The sign indicates the direction of c relative to ab. A

Return the ceiling of x as an Integral. :param x: the number :return: the smallest integer >= x. >>> import math >>> all(ceil(n

Returns the smallest element in this tree which is at least label. This method is guaranteed to run in O(log(n)) time.

Comparing local neighborhood pixel value with threshold value of centre pixel. Exception is required when neighborhood value of a center pixe

Check if a stack is empty. >>> S = Stack() >>> S.is_empty() True >>> S = Stack() >>> S.push(10)

Returns true iff this node is the left child of its parent.

Peek at the top-most element of the stack. >>> S = Stack() >>> S.push(-5) >>> S.push(10) >>> S.peek()

Removes the given vertex from the graph and deletes all incoming and outgoing edges from the given vertex as well. If the given verte

Removes the given vertex from the graph and deletes all incoming and outgoing edges from the given vertex as well. If the given verte

Creates an edge from source vertex to destination vertex. If any given vertex doesn't exist or the edge already exists, a ValueError

Creates an edge from source vertex to destination vertex. If any given vertex doesn't exist or the edge already exists, a ValueError

Adds a vertex to the graph. If the given vertex already exists, a ValueError will be thrown.

Adds a vertex to the graph. If the given vertex already exists, a ValueError will be thrown. >>> g = GraphAdjacencyList(vert

Returns the number of different combinations of k length which can be made from n values, where n >= k. Examples: >>> combinations(1