Practical Uses of Different Data Structures Flashcards
1
Q
Hash Table
A
(fast data lookup)
- symbol table for compilers
- database indexing
- caches
- unique data representation
2
Q
Trie
A
(dictionary)
- used in mobile telephone for auto completion or spell-checking
3
Q
Suffix Tree
A
- fast full text search in word processors
4
Q
Stack
A
- undo / redo operations
- expression evaluation and syntax parsing
5
Q
Queue
A
- transport and operations research
- buffer
6
Q
Priority Queeu
A
- process scheduling in the kernel
7
Q
Graphs
A
- routing
- networks of communication