======================================================================= Guidelines for exam preparation. ======================================================================= Note: There will be two main types of questions: (1) Questions of descriptive nature (e.g. describing components, definitions, modes of operations etc., derivations of the equations defining the various optimization methods from the course) and (2) Questions of computational nature (e.g. involving the use of different operators etc). Which topics are included in the exam? Basically as defined on the course web page. See below also: =============================== Chapter 1 Introduction: Everything. =============================== Chapter 2 Classical optimization: Nothing, is not a part of this course. =============================== Chapter 3: Everything except: 3.4 and 3.6 (but the examples in 3.6 may serve as good illustrations of the usage of EAs in realistic applications). See also Appendix B. =============================== Chapter 4: Everything. Note, however, that 4.3 Applications mainly serve as an illustration of the usage of the ACO. =============================== Chapter 5: Everything. Note, however, that 4.3 Applications mainly serve as an illustration of the usage of the PSO. =============================== Chapter 6: Everything except: 6.2. =============================== Appendix A: Everything except: A.2.2.3 Backpropagation =============================== Appendix B: Everything except: B.1, B.2.2, B.2.4, B.3, B.4, B.4 =============================== Appendix C: Everything except: C.1 =============================== Appendix D: You do not have to memorize the benchmark functions. =============================== You are also required to read paper the paper about LGP. Specifically, you should be able to explain the LGP concept in detail! Refer also to the book, pp. 72-78 for that. You should also be able to explain the concept of the UF method, and how GAs are used in the UF method, as described in the mandatory paper.