Я занима́юсь йо́гой ______ я гото́влю за́втрак.

In _________ values, the number of significant digits in the answer equals the number of significant digits in the value with the least number of them.

Calculate with significant figures:  483 372.298 + 34

Consider the Traveling Salesman Problem which is NP-complete. In this problem, you are given a list of cities and the distance between each pair of cities. Typically, this is represented by a complete graph G(V,E) of vertices V representing the cities and edge lengths E representing the distance between each pair of cities. The goal of this problem is to find the shortest path that visits each city exactly once and returns to the origin city. How would you design a fitness function to use in a genetic algorithm for the Traveling Salesman Problem? You may assume that paths that do not meet the requirements of the problem have fitness zero.

Organisms, road networks, and computer chips all share a design challenge related to the problem of delivering resources through a network to every node in the system. How does the size of the resource distribution network of these three systems grow with respect to system size?

In the paper “Immunity by Design: An Artificial Immune System,” detection of foreign material is simulated by partial string matching using the r-contiguous bits rule. This rule states that two strings match iff they have the same symbols in at least r contiguous bit positions. The value of r determines how specific the detectors are. The authors of the paper mention a tradeoff that using this rule presents. What is this tradeoff?

For which of the following problems would Textor’s algorithm be appropriate? (Select all that apply)

Suppose you are finding colorings for the following graph such that no two adjacent nodes have the same color. Which of the following are reasonable ways to represent a coloring? (Select all that apply)

Which tribe is not included in the original Five Nations of Iroquois?

The graph below shows two ROC curves produced using Textor’s negative selection algorithm. The blue dotted-dashed line (LINE A) represents a classifier that was trained on English and classified anomalous strings from mystery language A. The red solid line (LINE B) represents a classifier that was trained on English and classified anomalous strings from mystery language B. The black dotted line plots the function x=y. Using your knowledge from the negative selection assignment and with the possible language choices Hilgaynon, English, Middle English, which languages are closest to the mystery languages A and B? (Select all that apply)