1. What kind of search is the breadth-first search?

A. First in, last out

B. Last in, first out

C. Last in, last out

D. First in, first out

2. Which approach uses the distance between two points without using diagonals?

A. Inadmissible approach

B. Admissible approach

C. Manhaltan distance

D. Hamming distance

3. Which is not a search problem component?

A. Middle state

B. Path Cost

C. Goal Cost

D. Transition model

4. A recurrent layer is a layer that feeds what?

A. independent chains

B. unique copies of units

C. output into itself

D. input into itself

5. Which is not a type of machine learning?

A. reinforced

B. unsupervised

C. supervised

D. reiterative

Answers:      1 (D), 2 (C), 3 (A), 4 (C), 5 (D)

Apply for certification

https://www.vskills.in/certification/artificial-intelligence-certification-course