Unit 1.01

Which of the following best defines Artificial Intelligence (AI)?

• The study of complex algorithms used in data compression and network security.

• The science and engineering of making intelligent machines, especially intelligent computer programs.

• A field that enables computers to perform tasks by following explicit, pre-programmed instructions.

• A branch of software development focused on creating user-friendly interfaces.

Which of these concepts is most closely associated with the early evolution of AI in the 1950s and 1960s?

• Symbolic AI and Logic Programming

• Big Data Analytics

• Reinforcement Learning

• Deep Learning and Neural Networks

The concept of 'weak AI' (or narrow AI) refers to systems that:

• Are powered by renewable energy sources, making them environmentally 'weak'.

• Possess human-level intelligence across all cognitive tasks.

• Are easily defeated in strategic games like chess or Go.

• Can perform specific tasks intelligently but lack general cognitive abilities.

Which AI pioneer is credited with proposing the 'Turing Test' as a measure of machine intelligence?

• Herbert Simon

• John McCarthy

• Marvin Minsky

• Alan Turing

The 'AI winter' refers to a period characterized by:

• The development of AI systems capable of operating in extreme cold environments.

• Decreased funding and interest in AI research due to overly optimistic predictions and failed projects.

• The emergence of new programming languages specifically designed for AI development.

• Rapid advancements in AI algorithms and widespread commercial success.

In the context of problem-solving in AI, 'state space' refers to:

• The time complexity required to solve a problem using AI techniques.

• The graphical user interface (GUI) of an AI application.

• A set of all possible configurations or states that a problem can be in.

• The physical memory available on a computer system for storing data.

The 'Generate and Test' search strategy involves:

• Using a heuristic function to guide the search towards the most promising states.

• Learning from past experiences to avoid generating incorrect solutions.

• Systematically exploring all possible paths from the initial state until the goal is found.

• Creating candidate solutions and then checking each one to see if it satisfies the problem's constraints.

Which search algorithm always finds the shortest path in an unweighted graph if a path exists?

• Iterative Deepening Depth-First Search (IDDFS)

• Breadth-First Search (BFS)

• Depth-First Search (DFS)

• Uniform-Cost Search

What is a primary disadvantage of Breadth-First Search (BFS) in large state spaces?

• It can get stuck in infinite loops if cycles are present.

• It requires a significant amount of memory to store all visited nodes at each level.

• It is not guaranteed to find a solution if one exists.

• It cannot handle problems with multiple goal states.

When comparing Depth-First Search (DFS) and Breadth-First Search (BFS), which statement is generally true regarding their memory requirements?

• DFS typically requires more memory than BFS.

• BFS typically requires more memory than DFS.

• Memory requirements depend entirely on the specific problem instance and cannot be generalized.

• Both DFS and BFS have similar memory requirements.