Session 03 Flashcards

1
Q

String algorithms?

A

Algorithms designed to process, analyze, and manipulate strings efficiently

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Types of String Algorithms?

A
  • Pattern recognition algo
  • S searching algo
  • S matching algo
  • S compression algo
  • S distance & similarity algo
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Where String algos used?

A
  • Search engines
  • Cybersecurity
  • DNA analysis
  • NLP - Natural Language Processing
  • Data compression
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Brute Force string matching?

A

Compare the pattern sequentially with the text.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Rabin-Karp algorithm?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Component in Finite Automata?

A
  • Q: Finite set of states - The number of possible conditions of the FSM
  • q0​: Start state - Where the machine begins
  • A: Accepting states - States that signal valid input
  • Σ: Input alphabet - Allowed input symbols
  • δ: Transition function - Defines how the machine moves between states
How well did you know this?
1
Not at all
2
3
4
5
Perfectly