on 30-Oct-2018 (Tue)

Question

In linux, sed [...] 's/e/E/g' test.txt, will replace all occurences of e with E in file test.txt and print results to stdout (i.e. not changing original test.txt file).

Answer

-e

Question

In algorithms, stacks and queues are special types of [...] data structures.

Answer

list (more specifically: linked-list)

Question

In algorithms/python, you can use a list to implement a queue (although effeciency is not optimal), and to add an item you do list. [...] , and to delete an item you do list. [...] , one is O(1) while the other is O(n).
^^ NOTE: the two occlusions above are each a different answer!

Answer

list.append(item) to enqueue/add
list.pop(0) to dequeue/delete

Question

In algorithms, a queue can be implemented as a single linked list of nodes (although not of optimal efficiently due to the slow delete), as long as you 1) [...] and 2) each node points to the item in front of it in the queue.

Answer

keep a pointer to the end of the queue

Question

In algorithms, a queue can be implemented as a single linked list of nodes (although not of optimal efficiently due to the slow delete), as long as you 1) keep a pointer to the end of the queue and 2) [...]

Answer

each node points to the item in front of it in the queue.

Question

Answer

d’apprentissage

Question

Answer

problème

Question

In linux, sed [...] 's/e/E/g' test.txt, will replace all occurences of e with E in file test.txt (i.e. nothing is sent to stdout but the content of test.txt itself are changed).

Answer

-i

Question

In algorithms, for implementing a queue, instead of using a single linked list (which is slow on dequeue), a more effecient implementation (when enque and deques happen at the same rate) is using [...] (<-- could be more than one word:))

Answer

two stacks
^^ by adding all incoming items to an Insert stack, and removing from the Remove stack (if remove stack is empty, add all
items from insert stack to it one at a time, which preserves the queue order).

Question

In algorithms, a queue can be more effieciently implemented as two stacks (when enqueue vs dequeue is evenly distributed) compared to a single linked list, by having an [...] stack and a [...] stack (note: each occlusion is a different word)

Answer

insert stack AND remove/delete stack

Question

In algorithms, a queue can be more efiecntly implemented as two stacks (compared to a single linked list implementation), by [...] (<-- use multi-word description here) an Insert stack, and removing from the Remove stack (if remove stack is empty, add all items from insert stack to it one at a time).

Answer

adding all incoming items to (using simple list.append(item) )

Question

In algorithms, you create a queue (more efficiently than a single linked list) from two stacks, by always adding items to a Insert stack, and removeing items from a Remove stack, how?

Answer

Remove from top of remove stack (list.pop()). If remove stack is empty, add all items from insert stack to it one at a time (since items will be added in reverse order, remove order is kept in tact!), then do the pop()

Question

In algorithms/python, the most effecient implementation of a queue (more effiecient than using python list), where both enqueue and dequeue is O(1), is using a [...] (<-- use multi-word description here)

Answer

double linked list

Question

In algorithms, the most effecient implementation of a queue is a double linked list (i.e. O(1) on both enqueue and dequque), implemented by 1) [..use multi-word description here...] 2) having each node point to the person behind and infront of it in the queue.

Answer

having pointers to both the back and front of the queue

Question

In algorithms, the most effecient implementation of a queue is a double linked list (i.e. O(1) on both enqueue and dequque), implemented by 1) having pointers to both the back and front node of the queue 2) [...use multi-word description here...]

Answer

having each node in the queue point to the person behind and infront of it in the queue.

Question

In algorithms, the most effecient implementation of a queue is a double linked list, implemented by having a Queue class, with [...] and [...] methods, as well as properties to point to back and front of the queue, and Node class that implements the nodes in the queue (each node having pointers to node in front and behind it in the queue)

Answer

enqueue and dequeue

Question

In python, if you want to generate a random number (between for example 1 and 10), you would use the [...] method from the random module

Answer

randint

Question

In python, if you want to generate a random number (between for example 1 and 10), you would use the randint method from the [...] module

Answer

random

Question

In python, complete the following code to print out a random number between 1 and 10, inclusive:

from random import randint
print [...]

Answer

randint(1,10)

Question

In python, write code to sleep for 10 seconds (hint: it is 2 lines of code).

Answer

from time import sleep
sleep(10)

Question

In algorithms, a [...] is a hierarchical form of data structure where there is a distinct (i.e. easily recognizable/distinguishable) parent-child relationship between the items

Answer

tree

Question

In algorithms, a [...] tree is one in which each node has a maximum of two children.

Answer

binary

Question

In algorithms, what is the characteristic that makes a binary tree, a Binary Search Tree (BST)?

Answer

In a BST, for a given node with a value, all the nodes in the left sub-tree are less than or equal to the value of that node, and all the nodes in the right sub-tree of this node are greater than the value of that node.