Overview

Question 1

List all language agnostic data structure types.

Answer 1

Array, Linked List, Stack, Queue, Deque, Set, Hash Table, Matrix, Heap, Tree, Graph, Trie, Bloom Filter and Skip List.

Question 2

What is the alternative name of a Hash Table?

Answer 2

Hash Map

Question 3

How many language-agnostic data structures are there?

Answer 3

14

Question 4

How do you pronounce “trie”

Answer 4

“try”

Question 5

What is another name for Trie?

Answer 5

Prefix Tree

Question 6

What is another name for Deque?

Answer 6

Double-Ended Queue

Question 7

Which language-agnostic data structures have subtypes?

Answer 7

Tree and Graph

Question 8

How many subtypes of Trees are there?

Answer 8

4

Question 9

How many subtypes of Graphs are there?

Answer 9

4

Question 10

What are the subtypes of Trees?

Answer 10

Binary Tree, Binary Search Tree, AVL Tree, Red-Black Tree

Question 11

What does the AVL in AVL Tree stand for?

Answer 11

Adelson-Velsky and Landis

Question 12

What are the subtypes of Graphs?

Answer 12

Directed Graph, Undirected Graph, Weighted Graph and Unweighted Graph.

Question 14

Language-Agnostic Data Structure Catagories

Answer 14

Linear, Tabular, Network, and Probabilistic.

Question 15

How many language-agnostic data structure categories are there?

Answer 15

4

Question 16

What are the linear language-agnostic data structure categories.

Answer 16

Array, linked list, set, stack, queue, deque.

Question 17

What are the tabular language-agnostic data structure categories?

Answer 17

Hash map (i.e. hash table) and Matrix.

Question 18

What are the Netwotk language-agnostic data structures?

Answer 18

Heap, Tree, Graph, and Trie.

Question 19

What are the probabilistic language-agnostic data structures?

Answer 19

Bloom Filter and Skip List