Course 1 challenge :Introduction to AI (Google AI Essentials Specialization) Answers 2026

Question 1

What would you be expecting to demonstrate in your technical interview?

❌ Your general background and hobbies
❌ Your soft skills
✅ Your ability to code

Explanation:
A technical interview primarily evaluates problem-solving and coding ability, not hobbies or general background.

Question 2

How do computers store and represent information?

❌ HTML
✅ Binary
❌ Java

Explanation:
All data in computers is ultimately represented using binary (0s and 1s).

Question 3

If an application returns a result after one computation, it runs in which complexity?

❌ O(n)
❌ O(log n)
✅ O(1)

Explanation:
A constant-time operation always takes the same time regardless of input size.

Question 4

Which of the following equations is true?

❌ input space = space complexity + auxiliary space
✅ space complexity = input space + auxiliary space
❌ auxiliary space = space complexity + input space

Explanation:
Space complexity includes input space + extra (auxiliary) space.

Question 5

Which of the following are linear structures?

❌ Trees
✅ Arrays
❌ Graphs

Explanation:
Arrays are linear data structures; trees and graphs are non-linear.

Question 6

Which of the following statements is true?

✅ LinkedLists can grow without having to copy their values when expanding
❌ An array-based approach is the only way of creating a list
❌ Array-based lists can grow without copying values

Explanation:
Linked lists grow dynamically by linking nodes—no resizing or copying needed.

Question 7

In relation to coding, what is modularization?

✅ Wrapping code into functions so it can be reused
❌ Creating a data structure for storing data
❌ Using modern techniques

Explanation:
Modularization improves reusability, readability, and maintainability by breaking code into modules.

Question 8

What is the difference between depth-first and breadth-first search?

❌ BFS is more thorough and faster
❌ DFS travels sibling-to-sibling, BFS travels level-by-level
✅ DFS goes deep into a branch, BFS explores level by level

Explanation:

• DFS explores depth first

• BFS explores breadth (level by level)

Question 9

Which of the following statements is true?

❌ A hash table decreases space usage to increase speed
❌ A hash table decreases speed to decrease space usage
✅ A hash table increases space usage to increase speed

Explanation:
Hash tables trade extra memory for fast access (O(1) average time).

Question 10

The process of storing results for later lookup to save computation time is an example of what?

❌ Modularization
✅ Memoization
❌ Recursion

Explanation:
Memoization stores previously computed results to avoid repeated calculations.

🧾 Summary Table