Lesson 12

Question 1

Finite State Machine

Answer 1

is a graphical approach to describe the behavior of an automated system.
The states of an FSM are represented as circles.
The action of the system when in a state is described in each circle
Translation between states are represented using arrow
Initial state should

Question 2

To program a FSM in Python

Answer 2

1. Initialize an integer variable to keep track of the current state
2. Record input values ( sensor, key presses, etc.)
3. Evaluate transition logic
4. Update the state
5. Apply the state actions
6. Repeat from step 2

Question 3

Sort

Answer 3

Problem: Arranging elements in collection
Common sorting algorithms

Question 4

Insertion sort

Answer 4

Efficient for small or nearly sorted datasets

Question 5

Bubble sort

Answer 5

simple to implement but slow for large datatsets

Question 6

Selection sort

Answer 6

Minimal swaps but slow for large datasets

Question 7

Merge Sort

Answer 7

Fast for large datasets but requires more memory

Question 8

Quick sort

Answer 8

Fast on average but poor worst case performance

Question 9

Insertion sort:

Answer 9

Pull elements from a list and insert them in order into a new list

Question 10

Common search algorithms

Answer 10

Linear search: checks elements one by one. Works on unsorted lists
Binary search: fast on sorted lists
Jump search: faster than linear on sorted lists, but slower than binary
Interpolation search: faster than binary for uniformly distributed and sorted data

Question 11

Binary search

Answer 11

Compare the middle of a sorted list with the target. If the target is greater than the middle element, it must appear to the right of the middle. Otherwise it must appear to the left of the middle. Repeat