Chapter 10. Datatypes and Structures

Question 1

What is an algorithm?

Answer 1

• A step-by-step procedure or formula for solving a problem.
• Consists of a finite set of instructions that produce a desired outcome.

Question 2

What are the characteristics of a good algorithm?

Answer 2

• Clear and unambiguous.
• Finite: Has a clear end point.
• Effective: Produces the correct result.
• Efficient: Uses minimal resources.

Question 3

What are flowcharts used for in algorithm design?

Answer 3

• Visual representations of the steps in an algorithm.
• Use symbols like ovals for start/end, rectangles for processes, and diamonds for decision points.

Question 4

What are pseudocode and its purpose?

Answer 4

• A high-level description of an algorithm using structured, natural language.
• Bridges the gap between human language and programming code.

Question 5

What are the basic control structures in algorithms?

Answer 5

• Sequence: A set of instructions executed in order.
• Selection: Decision-making (if-else statements).
• Iteration: Repeating a set of instructions (loops).

Question 6

What is the difference between linear search and binary search?

Answer 6

• Linear search: Checks each element one by one.
• Binary search: Divides the search interval in half, requires a sorted list.

Question 7

What is a recursive algorithm?

Answer 7

• An algorithm that calls itself to solve smaller instances of the same problem.
• Example: Factorial calculation, Fibonacci series.

Question 8

What are the advantages of recursive algorithms?

Answer 8

• Simplifies the code for problems that have a recursive nature.
• Reduces the need for complex loops and conditionals.

Question 9

What are the disadvantages of recursive algorithms?

Answer 9

• Can lead to high memory usage (stack overflow) if not properly managed.
• Often less efficient than iterative solutions.

Question 10

What is the purpose of sorting algorithms?

Answer 10

• To arrange data in a specific order (ascending or descending).
• Examples: Bubble sort, quicksort, merge sort.

Question 11

What is the difference between bubble sort and quicksort?

Answer 11

• Bubble sort: Simple but inefficient, compares adjacent elements.
• Quicksort: More efficient, uses a divide-and-conquer approach.

Question 12

What is a greedy algorithm?

Answer 12

• An algorithm that makes the best choice at each step with the hope of finding the global optimum.
• Example: Dijkstra’s algorithm for shortest path.

Question 13

What is dynamic programming?

Answer 13

• A method for solving complex problems by breaking them down into simpler subproblems.
• Stores the results of subproblems to avoid redundant computations.

Question 14

What is the difference between breadth-first search (BFS) and depth-first search (DFS)?

Answer 14

• BFS: Explores all neighbors at the current depth before moving to the next level.
• DFS: Explores as far as possible along each branch before backtracking.

Question 15

What is a heuristic in problem-solving?

Answer 15

• An approach to finding a satisfactory solution where finding an optimal solution is impractical.
• Often used in artificial intelligence and optimization problems.

Question 16

What is a backtracking algorithm?

Answer 16

• An algorithm that tries to build a solution incrementally, removing solutions that fail to satisfy the problem constraints.
• Example: Solving a maze or Sudoku puzzle.

Question 17

What is the role of a decision table in problem-solving?

Answer 17

• A tabular method for representing and analyzing decision rules.
• Helps in systematic identification of different possible actions.

Question 18

What is the difference between a deterministic and a non-deterministic algorithm?

Answer 18

• Deterministic: Produces the same output for a given input every time.
• Non-deterministic: May produce different outputs for the same input on different runs.

Question 19

What is a divide-and-conquer algorithm?

Answer 19

• An algorithm that divides the problem into smaller subproblems, solves them independently, and combines their solutions.
• Example: Merge sort, quicksort.

Question 20

What are the typical steps in algorithm design?

Answer 20

• Understand the problem.
• Plan the algorithm (pseudocode or flowchart).
• Implement the algorithm.
• Test and debug the algorithm.