previous exam questions (for exam 1/3)

Question 1

Consider the overall ”picture” of AI which will be represented as sets. In total we have a set for DL, ML and AI. Which of the following 6 statements are true?

1. Machine Learning is the direct subset of AI
2. Machine Learning is the direct subset of Deep Learning
3. Deep Learning is the direct subset of Machine Learning
4. Machine Learning is the direct superset of Deep Learning
5. Deep Learning is the direct superset of AI
6. AI is the direct superset of Deep Learning

Answer 1

1, 3 and 4 are correct

Question 2

True or False: AI is about making computer based humans.

Answer 2

False

Question 3

True or False: The Turing Test is about to beat humans in chess.

Answer 3

False

Question 4

What is Machine Learning?

Answer 4

• a subsector of Artificial Intelligence
• Computer programs that automatically improve with experience
• makes use of algorithms and statistics to analyse and draw inferences from patterns in data

Question 5

When can a machine be considered as intelligent?

Answer 5

When it can pass the Turing Test

Question 6

What is true for an algorithm?

Answer 6

• is a step by step procedure
• different algorithms can lead to the same result
• a good algorithm solves the task in less time

Question 7

What is the Turing test about? Choose the correct statements.

1. If the judge has successfully passed the test, it can be considered intelligent.
2. There is a human and a computer that pretends to be a human.
3. There is a woman and a man who pretends to be a woman.
4. The test is about defining a long and controversial list of necessary prerequisites for intelligence.
5. The judge has to find out who the human is.
6. The result should be that the computer is considered to be intelligent.

Answer 7

2, 5 and 6 are correct

Question 8

Who showed how to write logic in the form of analytical equations?

Answer 8

George Boole

Question 9

Which British mathematician is often credited as being the key founder of AI?

Answer 9

Alan Turing

Question 10

Who defined the first chess program in Plankalkul?

Answer 10

Konrad Zuse

Question 11

Map the following important contributions in the history of Artificial Intelligence to their associated names.

1. showed how to write logic in the form of analytical equations.
2. designed at around 1495 a humanoid mechanical knight.
3. was the first to recognise that the machine had applications beyond pure calculation, and to have published the first algorithm intended to be carried out by such a machine.
4. defined the first chess program in Plankalkü.

Answer 11

1. George Boole
2. Leonardo daVinci
3. Ada Lovelace
4. Konrad Zuse

Question 12

True or False: The first ideas about AI systems where in the 20th century.

Answer 12

False

Question 13

What was the first mythical automaton with artificial intelligence?

Answer 13

Talos (built by Hephaistos, killed by Jason of the argonauts)

Question 14

Who said: ”all B’s are A, All C’s are B therfore all C’s are A’s”

Answer 14

Aristotle

Question 15

When was the ”Birth” of AI?

Answer 15

1956

Question 16

Which of the following disciplines are main contributers to AI?

1. Mathematics
2. Logic
3. Psychology
4. Neuroscience
5. Information Technology
6. Social Sciences

Answer 16

2, 3, 4 are correct

Question 17

True or False: Alan Turing coined the term ”Artificial Intelligence” in 1956 at the Dartmouth Conference.

Answer 17

False.
He wasn’t there, but the term was coined at that conference.

Question 18

Which of the following were present at the Dartmouth conference and then dominated the field for the next 20 years?

1. John McCarthy
2. George Boole
3. Herbert Simon
4. Frank Rosenblatt
5. Alan Turing
6. Allan Newell

Answer 18

1, 3 and 6 are correct

Question 19

Map the following statements to the correct person.

1. is one of the founding fathers of AI.
2. has invented a Lingua Charististica.
3. has invented the first digital computer.
4. has published ”The Mathematical Analysis of Logic”

Answer 19

1. Marvin Minsky
2. Leibniz
3. Konrad Zuse
4. George Boole

Question 20

Name the following calculation machines based on their capabilities.

1. could calculate mathematical tables using the method of finite differences.
2. could perform the four basic arithmetic operations.
3. could perform addition
4. could pe programmed to the type of operation to perform.

Answer 20

1. Babbage’s Difference Engine
2. Leibnitz’ Reckoning Machine
3. Pascaline
4. Babbage’s Analytical Engine

Question 21

Why brought Deep Learning unexpected breakthroughs in diverse areas? Choose the correct answer/s.

1. It was the first successfull knowledge-intensive system.
2. It came up with fundamentally new ideas and techniques.
3. Smaller models and less training data were needed.
4. Much more training data, bigger models and computational power were available.

Answer 21

4 is correct

Question 22

Which of the following machines are NOT covered in the ancienct history of artificial intelligence?

• Talos the giant intelligent bronze robot
• James Watt’s steam engine
• The chess playing turk
• clay Golem from Prague

Answer 22

James Watt’s steam engine

Question 23

Match the following years correctly with the associated definitions!

1. Z3, the first digital computer
2. Dartmouth Conference
3. Eniac, the first Turing complete digital computer
4. first neural network computer

Answer 23

1. 1941
2. 1956
3. 1945
4. 1951

Question 24

Why is ”local search” not the optimal strategy for sudoku solving?

Answer 24

no guarantee for completeness

Question 25

True or False: In search algorithms, a heuristic often denotes a function that estimates the quality of a given state?

Answer 25

True

Question 26

True or False: State representation describes the current state of the solving process.

Answer 26

True

Question 27

What is NOT true about Heuristics? 1. knowledge that is helpful for solving a problem 2. can also go wrong 3. guarantees a result that satisfies our problem 4. mostly a function that estimates the quality of a state

Answer 27

3 is not true

Question 28

What is the main problem with Hill-Climbing search?

Answer 28

maybe reaches a local optima

Question 29

Match the following optimizations for the Hill Climbing Search: 1. Stochastic Hill Climbing 2. Beam Search 3. Simulated Annealing Search 4. Random Restart Hill Climbing a. selects the successor nodes randomly but the nodes are weight b. makes several iterations with different starting positions c. combination of hill climbing and random walk d. keeps track of k-states rather than just one

Answer 29

1a 2d 3c 4b

Question 30

What is one principle of solving problems like the towers of hanoi?

Answer 30

Divide-and-Conquer

Question 31

True or False: Simple Exhaustive Search uses either heuristics or constraints.

Answer 31

False

Question 32

What is one negative characteristic of depth-first search? 1. depth-first search never finds the worst solution 2. depth-first search could be exponentional 3. depth-first search can never finds the perfect solution 4. depth-first search is deprecated

Answer 32

2 is correct

Question 33

Map the following contributions in the history of Al to their originators. 1. is one of the participants in the Dartmouth workshop in 1956 2. has built the first digital computer 3. has proposed a mathematical calculus for formal logic 4. has proposed a first formal language for representing scientific knowledge a. Gottfried Wilhelm Leibniz b. Marvin Minsky c. George Boole d. Konrad Zuse

Answer 33

1b 2d 3c 4a

Question 34

In a game, each side can make 4 possible moves in each position. If a machine makes a complete look-ahead search for 3 plies (half moves). How many possible leaf positions will it consider? Enter a number as an answer.

Answer 34

4 to the power of 3 = 64

Question 35

Which of the following techniques have we considered to be particularly useful for different steps when solving a Sudoku puzzle? 1. check which value can be filled in a selected square 2. try out one of several possible values and possibly come back later if it doesn't work out 3. use the value that has been filled in for reducing the set of possible values in neighboring squares 4. selecting the next square that could be filled in a. constraint satisfaction b. heuristics c. constraint propagation d. backtracking search

Answer 35

1a 2d 3c 4b

Question 36

True or False: Machine Learning is an essential part of every AI system because an agent that does not learn cannot be considered to be an AI.

Answer 36

False

Question 37

True or False: At the heart of genetic algorithms is an operator called "cross-over" which combines parts of two solutions into a new solution.

Answer 37

True

Question 38

Which of the following general heuristics for constraint solving does NOT aim at selecting a variable? 1. Degree Heuristics 2. Minimum Remaining Values Heuristic 3. Least Constraining Value Heuristic 4. Min-Conflicts Heuristic

Answer 38

3 is not aiming at selecting a variable

Question 39

Map the following important contributions in the history of AI to their associated names. 1. suggested an algebra for logic 2. defined general patterns for logical reasoning 3. proved that any logical system powerful enough to formalize mathematics is either incomplete or inconsistent 4. constructed the first programmable computer a. Kurt Gödel b. Aristotle c. Edward Feigenbaum d. George Boole e. Charles Babbage f. Ada Lovelace

Answer 39

1d 2b 3a 4e

Question 40

True or False: Deep Learning is a sub-discipline of Machine Learning.

Answer 40

True

Question 41

Which of the following statements is false? 1. An AI beat the best chess player in 2017. 2. Until the present day, an AI hasn't been able to beat the best GO player. 3. Until the present day, an AI hasn't been able to beat the best chess player. 4. An AI beat the best GO player in 2017.

Answer 41

1, 2 and 3 are false.

Question 42

True or False: According to John McCarthy AI has to confine itself to biologically observable methods since it is related to using computers to understand human intelligence.

Answer 42

False

Question 43

The "Imitation Game" by Alan Turing focusses on which one of the following definitions of AI? 1. system that acts rationally 2. system that acts like humans 3. system that thinks rationally 4. system that thinks like humans

Answer 43

2 is correct

Question 44

Which programming language did John McCarthy invent? 1. Java 2. C++ 3. Python 4. Lisp

Answer 44

4 is correct

Question 45

Match the following names of contributors to the history of AI to their associated work. 1. Ada Lovelace 2. Claude Shannon 3. Konrad Zuse 4. Hephaistos a. first digital computer b. algorithm for playing chess c. crafting Talos and other artifical devices d. programming for Analytical Engine

Answer 45

1d 2b 3a 4c

Question 46

What is the difference (from the perspective of AI research) between rational thinking and high-level human-like thinking (i.e. that researched by symbolic AI field)? 1. Human thinking often makes intuitive and not entirely explainable decisions, which rational thinking based entirely on rules of logic cannot comprehend 2. The main goal of think-like-human machines is to pass the Turing test. Rationaly thinking machines maximize predefined utility in given enviroment instead. 3. Rationally thinking AIs usually need precise logical reasoning and knowledge representation while human-like model neurons and their nets. 4. There is no distinct difference.

Answer 46

1. and 3. are correct

Question 47

True or False: Deep Learning has been particularly successful in pattern recognition.

Answer 47

True

Question 48

Which three of the following people were 2019 Turing Awardees? 1. Yoshua Bengio 2. Geoffrey Hinton 3. Yann LeCun 4. Tim Berners-Lee 5. Alan Kay 6. Jack Dongarra

Answer 48

1, 2 an 3 are correct

Question 49

Map the following important contributions to the topic of what Artificial Intelligence is. 1. Described what Machine Learning is 2. The Turing Award was named after him 3. One of the first people who defined what Artificial Intelligence is. 4. Was the first person who formalized algorithms a. Tom Mitchell b. Al-Chwarizmi c. John McCarthy d. Alan Turing

Answer 49

1a 2d 3c 4b

Question 50

What is NOT a problem of Systems that think rationally? 1. Not all intelligence is mediated by logic behavior 2. Practical constraints 3. to define comprehensible commands 4. It is hard to formalize knowledge exactly

Answer 50

3 is not a problem of systems that think rationally

Question 51

True of False: The basic idea of the Turing Test is to compare computers with undeniably intelligent beings (humans), instead of defining a long and controversial list of necessary prerequisites for intelligence.

Answer 51

True

Question 52

Which statements about the ”Turing test” are correct? 1. Requires the cooperation of the most important components of AI: Knowledge, reasoning, language comprehension, learning,... 2. The Turing Test is not suitable for mathematical analysis. 3. The idea came from Fred Lois Ture (1914-1972). 4. The Turing Test is reproducible. 5. Definitions of necessary prerequisites for intelligence are necessary. 6. The imitation game is an operational test of intelligence for computing machinery

Answer 52

1, 2 and 6 are correct.

Question 53

True or False: Deep Learning is a form of machine learning that makes use of artificial neural networks.

Answer 53

True

Question 54

True or False: Machine Learning is the science ”concerned with the question of how to construct computer programs that automatically improve with experience”. (Tom Mitchell)

Answer 54

True

Question 55

Which statements about ”Algorithms” are correct? 1. An algorithm is a step-by-step procedure for finding a solution to a class of problems 2. Algorithms do not terminate in finite time. 3. Algorithms are not deteministic 4. Algorithms are deterministic 5. An algorithm is an intuitiv procedure for finding a solution to a class of problems. 6. Algorithms terminate in finite time.

Answer 55

1, 4 and 6 are correct

Question 56

True or False: The Turing Test is meant to evaluate if a model can think rationally.

Answer 56

False

Question 57

True or False: An algorithm has only two main characteristics. These are that it is deterministic and that it terminates in finite time.

Answer 57

False

Question 58

Map the concepts with their definitions: 1. ”It is the science and engineering of making intelligent machines ... and does not have to confine itself to me- thods that are biologically observa- ble.” -John McCarthy, Stanford(1956) 2. It is a field that bring together com- putational models from AI and experi- mental techniques from psychology to consutruct precise and testable theo- ries of the mind. 3. It is the science ”concerned with the question of how to construct compu- ter programs that automatically im- prove with experience.” -Tom Mitchell (1997) CMU 4. A form of machine learning that makes use of artificial neural networks a. Machine Learning b. Deep Learning c. Cognitive Science d. Artificial Intelligence

Answer 58

1d 2c 3a 4b

Question 59

Map the inventors to their invents. 1. Rabbi Loew 2. Kempelen 3. Hephaestos 4. Leonardo da Vinci a. The Golem of clay b. Talos, a giant intelligent bronze robot c. The Chess-Playing Turk d. humanoid mechanical knight

Answer 59

1a 2c 3b 4d

Question 60

Which machine/automat was NOT built in the 19th century? 1. Babbage’s Difference Engine 2. Leibnitz' reckoning machine 3. Euphonia (Joseph Faber’s Amazing Talking Machine) 4. The Automaton Trumpeteer

Answer 60

2 was not built in the 19th century

Question 61

True or False: Ada Lovelace was the first computer programmer in 1840s

Answer 61

True

Question 62

Hephaisto built artificial... 1. tripods 2. brazen heads 3. waiters 4. talking machines (Euphonia) 5. bellows 6. humanoid mechanical knights

Answer 62

1, 3 and 5 are correct

Question 63

True or False: Rene Descartes (1596-1650) proposed that animals are machines, because their bodies (heart, lungs, muscles, etc.) can be explained by physics. He also thought that the soul made the difference between humans and animals.

Answer 63

True

Question 64

Who showed how to write logic in the form of analytical equations? 1 Reverend George Boole 2 Aristotle 3 Joseph Faber 4 Leibnitz

Answer 64

1

Question 65

Complete the sentences on the subject of robots. 1. Talos, a giant intellligent bronce robot was built by ... 2. The origin of the word ”Robot” is from ... 3. The Three (later four) Laws of Robotics are from ... 4. The autonomous robots, that look like turtles, was constructed by ... a. Grey Walter. b. Hephaisto. c. science fiction writer (e.g. I Robot) Isaac Asimov. d. author Karel Capek who produced the play R.U.R. (Rossum’s Universal Robots).

Answer 65

1b 2d 3c 4a

Question 66

True or False: Kurt Gödel’s paper, ”On Formally Undecidable Propositions”from 1931, in which he proved that it is in priniciple not possible that a sufficiently complex axiomatization is both complete and consistent, is a setback for logic reasoning.

Answer 66

True

Question 67

For Artificial Neural Networks found Frank Rosenblatt (1928-1971) some Inspiration from the brain: 1. learning happens by changing the strength of connections (synapses) 2. For learning it is necessary that the strenght of connections (synapses) will be the same. 3. many small discontiguous units (neurons) 4. behavior of the whole is is equal to the sum of the parts 5. behavior of the whole is more than the sum of the parts 6. many small interconnected units (neurons

Answer 67

1, 5 and 6 are correct

Question 68

About the history of the first chess programs. Assign correctly! 1. chess algorithm computed with paper and pencil; first recorded man-machine (chess) game 2. defined the first chess program 3. algorithm for playing chess foresees strategies that are still used today. (Type-A Strategy; Type-B Strategy) 4. the first lost from a Chess world champion versus a chess programm (Deep Blue) a. 1950; Claude Shannon b. 1951; Alan Turing c. 1997; Garry Kasparov d. 1942-45; Konrad Zuse

Answer 68

1b 2d 3a 4c

Question 69

True or False: Simon and Newell’s all predictions about AI (1958) came more or less true within 10 years.

Answer 69

False

Question 70

Progress of AI in the beginning was slower than (unrealistic) expectations. What was NOT the reason? 1. Fundamental limitations on techniques and representations 2. Lack of scalability 3. Difficulty of knowledge representation 4. Creation of Lisp (second-oldest high-level language)

Answer 70

4 was not a reason

Question 71

Deep Learning brought unexpected and unprecedented breakthroughs in diverse areas such as computer vision, language understanding, game playing, etc. Why did this start only a few years ago? 1. We have the computationalpower for doing training deep networks 2. Readily available programming libraries make it much easier 3. The models are smaller 4. There was too little demand for such programmes 5. Introducing fundamentally new ideas was neccessary 6. We have much more data for training deep networks

Answer 71

1, 2 and 6 are correct

Question 72

True or False: Konrad Zuse’s Z3 was the first digital computer.

Answer 72

True

Question 73

A heuristic is ...? 1. a function describing the position of the search space 2. a function estimating the quality of a state 3. an (e.g. exponential) function describing the complexity (e.g. O(n2)) of a search algo- rithm 4. a binary function checking whether or not the problem is solved

Answer 73

2 is correct

Question 74

What are operations done between generations in genetic algorithms? 1 Divide and Conquer 2 Cross Over 3 Mutation 4 Exhaustive search 5 Selection 6 Local Search

Answer 74

2, 3 and 5 are correct

Question 75

Which steps belong to which algorithms? 1. try to find solutions by looking at near elements 2. applying random changes 3. trying to improve the current state step by step using an heuristic 4. combine multiple partial solutions into one a. Local Search b. Greedy Hill-Climbing Search c. Divide and Conquer d. Genetic algorithms

Answer 75

1a 2d 3b 4c

Question 76

Which of the following statements about stochastic search are true? 1. It usually fails completely when it encounters local maximum. 2. It is non-deterministic. 3. It is sometimes called greedy search. 4. It is inspired by evolution of biological species. 5. It chooses its steps with probability corresponding to their attractivity. 6. It belongs to heuristic algorithms.

Answer 76

2 and 5 are correct

Question 77

Map phases of genetic algorithms to their description. 1. Fitness 2. Cross-over 3. Mutation 4. Selection a. Evaluate usefulness of generation states. b. Perform small and random changes of the newly generated states. c. Create new states by combining selected pairs. d. Select states to reproduce with probability corresponding to their fitness.

Answer 77

1a 2c 3b 4d

Question 78

There are many specialized tricks to solve a Sudoku, but the most follow a general pattern. Match the sentences correctly. 1. check all possibilities for the selected square(s) 2. propagate the information to other squares 3. select a square (or a set of squares) 4. repeat these steps until the solution is complete a. Constraint Propagation b. Constraint Satisfaction c. Search d. Heuristics

Answer 78

1b 2a 3d 4c

Question 79

For defining a search problem, we need 1 - A state description and a goal description 2 - A state function and a goal function 3 - A state function and a goal description 4 - A state description and a goal function

Answer 79

4

Question 80

True or False: A state description is an abstract representation of the current state of a puzzle. The set of all such descriptions is called the state space.

Answer 80

True

Question 81

Which statements about ”Local Search” are true? 1 - The Approach is to keep a single ”current” state (or a fixed number of them) and to try to improve it by maximizing a heuristic evaluation. 2 - It uses a lot of memory. 3 - It needs much time to find solutions in large or infinite state spaces. 4 - It guarantees completeness (that a solution is always found) and optimality (that the best/shortest solution is found). 5 - They often quickly finds solutions in large or infinite state spaces. 6 - There are no guarantees for completeness (that a solution is always found) or optimality (that the best/shortest solution is found).

Answer 81

1, 5 and 6 are correct

Question 82

True or False: Choosing a good state representation may already be crucial for finding a good solution.

Answer 82

True

Question 83

Which statements about ”Heuristic” are true? 1 - In search algorithms, a heuristic always denotes a function that compute the quality of a given state. 2 - It denotes a rule and it should to be note that heuristics may never go wrong! 3 - In search algorithms, a heuristic often denotes a function that estimates the quality of a given state. 4 - The word is derived from the russian word ”heurestika” and translates as ”always valid”. 5 - The word is derived from the greek word ”heurisko” and translates as ”I find”. 6 - It informally denotes a ”rule of thumb“ and it should to be note that heuristics may also go wrong!

Answer 83

3, 5 and 6 are correct

Question 84

True or False: The Algorithm from the Beam Search is... - Start with randomly generated states. - At each iteration, all the successors of the current state are generated. - Select the k best successors from the complete list and repeat.

Answer 84

True

Question 85

Match the statements to the correct area of Hill-climbing- search 1. States may be refined in multiple ways; → similarity along various dimensions 2. select the successor node ramdomly; better nodes have a higher probability of being selected 3. Different initial positions result in different local optima; → make several iterations with different starting positions 4. location: states; elevation: heuristic value (objective function); Assumption: states have some sort of (linear) order; continuity regarding small state changes a. State Space Landscape b. Stochastic Hill-Climbing c. Random Restart Hill-Climbing d. Multi-Dimensional State-Landscape

Answer 85

1d 2b 3c 4a

Question 86

If the algorithm will stop as soon as is at the top of a hill, this will e named ”Local Optima” and is a main problem. Of which Search variant? 1 Simulated Annealing Search 2 Beam Search 3 Every of the three named Search variants. 4 Hill-Climbing Search

Answer 86

4

Question 87

True or False: Information from different beams is combined so the Beam search is different from k parallel hill-climbing searches, but the effectiveness suffers from lack of diversity of the k states.

Answer 87

True

Question 88

Simulated Annealing Search is ... 1 . . . modelled after mutation of DNA and comperable to a stochastic hill-climbing step. 2 . . . a combination of hill-climbing and random walk. 3 . . . only used to find the right temperature in metallurgy. 4 . . . the same idea as in Stochastic Beam Search but uses ”sexual” reproduction.

Answer 88

2

Question 89

True or False: In the Genetic Algorithms there will be the next generation produced by selection, cross-over, and mutation.

Answer 89

True

Question 90

True or False: The Genetic Programming is popularized by David Fogel.

Answer 90

True

Question 91

”Divide-and-Conquer” is a general problem solving strategy with many applications. Match the sentences correctly! 1. - Decompose the problem into simpler partial problems 2. - Solve each of these simpler problems by possibly solving them again by division 3. - Solve each of these simpler problems 4. - Combine the partial solutions to a ... a. recursive programming b. DIVIDE c. CONQUER d. complete solution

Answer 91

1b 2a 3c 4d

Question 92

What can happen, if the analysis of the solutions of a recursive solution rise to a simple non-recursive solution? 1 - Much less memory is needed and the length of the solution is greatly reduced. 2 - Much less memory is needed, but the solution length cannot be reduced. 3 - Nothing changes. 4 - The same memory is needed, but the length of the solution is reduced.

Answer 92

2

Question 93

Which of the following techniques have we considered to be particularly useful for different steps when solving a Sudoku puzzle? 1. check which values can be filled in a selected square 2. use the value that has been filled in for reducing the set of possible values in neighboring squares 3. selecting the next square that could be filled in 4. try out one of several possible values and possibly come back later if it doesn't work out a. heuristics b. backtracking search c. constraint propagation d. constraint satisfaction

Answer 93

1d 2c 3a 4b

Question 94

Which three of the following people did write early chess programs? 1. John McCarthy 2. Arthur Samuel 3. Claude Shannon 4. Konrad Zuse 5. Marvin Minsky 6. Alan Turing

Answer 94

3, 4 and 6 are correct

Question 95

True or False: Minimax search can, in principle, solve any deterministic 2-person zero-sum perfect information game.

Answer 95

True

Question 96

True or False: the constraint graph can be used to identify to which variables constraints have to propagate.

Answer 96

True

Question 97

True or False: Beam search is the same as k parallel hill-climbing searches.

Answer 97

False

Question 98

Choose what those terms refer to: 1. Method to check whether a state description satisfies the goal: 2. The abstract representation of the current state of a puzzle: 3. Trying a potential solution and revising it later: 4. The set of all possible descriptions: a. backtracking b. state space c. state description d. goal function

Answer 98

1d 2c 3a 4b