## For each of the following multiple-choice questions, select the correct answers.

For each of the following multiple-choice questions, select the correct

(1) The function of a geonet is primarily:

A. Reinforcement

B. Drainage

C. Filtration

D. Containment

E. Separation

(2) The following geosynthetics can be used for reinforcement

purposes:

A. Geotextile

B. Geomembrane

C. Geogrid

D. Geonet

E. Geosynthetic clay liner

F. Geofoam

(3) The following geosynthetics can be used for containment

purposes:

A. Geotextile

B. Geomembrane

C. Geonet

D. Geosynthetic clay liner

E. Geofoam

(4) The following geosynthetics can be used for both filtration and

drainage purposes:

A. Geotextile

B. Geomembrane

C. Geogrid

D. Geonet

E. Geosynthetic clay liner

F. Geofoam

(5) The following geosynthetics can be used as the liner of a retention

pond:

A. Geotextile

B. Geomembrane

C. Geogrid

D. Geonet

E. Geosynthetic clay liner

F. Compacted clay liner

(6) The advantages of MSE walls are:

A. Increased internal integrity because of the geosynthetics’ ten-

sile strength and the friction between the soil and the rein-

forcement.

B. Increased shear resistance to resist slope failure.

C. Rapid construction.

D. Flexible wall system can accommodate large differential set-

tlement.

E. Suited for seismic region.

### Prove that the hypothesis class of all conjunctions over d variables is PAC learnable and bound its sample complexity.

1.  In this question, we study the hypothesis class of Boolean conjunctions defined as follows. The instance space is X ={0,1}d and the label set is Y ={0,1}. A literal over the variables x1, . . ., xd is a….

### Show that for every probability distribution D, the Bayes optimal predictor fD is optimal, in the sense that for every classifier g from X to {0,1}, LD( fD) ≤ LD(g).

1. Let H be a hypothesis class of binary classifiers. Show that if H is agnostic PAC learnable, then His PAC learnable as well. Furthermore, if A is a successful agnostic PAC learner for H, then A is also a….

### . Show that the algorithm just described satisfies the requirements for being a RP solver for ERMH.

1. On the basis of the preceding, prove that for any k ≥ 3, the ERMHnk problem is NP-hard. 2 In this exercise we show that hardness of solving the ERM problem is equivalent….