Data Structures and Algorithms Flashcards by Zachary Radtka

Q

What is a skip list

A

A probabilistic data structure that allows O(log n) search as well as O(log n) average complexity for insertion within an ordered sequence of n elements.

Wikipedia Source

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

What is TF-IDF

A

Term frequency-inverse document frequency, is a measure of importance of a word to a document in a collection or corpus adjusted for the fact that some words appear more frequently in general.

Wikipedia Source

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

What is a Finite-State Transducer (FST)

A

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

What is a BKD Tree

A

How well did you know this?

1

Not at all

2

3

4

5

Perfectly