Week 01 - 01 Data Structures in AI

Question 1

What is a data structure?

Answer 1

A specialized format for a collection of data values, their relationships, and operations.

Question 2

What is a tree data structure?

Answer 2

A hierarchical model organizing data with a root and child nodes in a branching structure.

Question 3

What is the root of a tree?

Answer 3

The topmost node with no parent, origin of the tree.

Question 4

What is a node in a tree?

Answer 4

An element storing data with links to children nodes.

Question 5

What is an edge in a tree?

Answer 5

A link connecting a parent node to a child node.

Question 6

What is a subtree?

Answer 6

A node and all its descendants in a tree.

Question 7

What is a leaf node?

Answer 7

A node without any children.

Question 8

How is the height of a tree defined?

Answer 8

The length of the longest path from the root to any leaf.

Question 9

How is the depth of a node defined?

Answer 9

The number of edges from the root to that node.

Question 10

What defines a full binary tree?

Answer 10

Every node has 0 or 2 children.

Question 11

What defines a complete binary tree?

Answer 11

All levels fully filled except possibly last, filled left to right.

Question 12

What is a degenerate binary tree?

Answer 12

Each parent has only one child, forming a linked-list-like structure.

Question 13

What is a perfect binary tree?

Answer 13

A binary tree that is both full and complete; all leaves at same level.

Question 14

What is a balanced binary tree?

Answer 14

A tree where left and right subtree heights differ by no more than one.

Question 15

What is a binary search tree (BST)?

Answer 15

A binary tree where left subtree nodes are less than the node and right are greater.

Question 16

What is a B-tree?

Answer 16

A self-balancing tree generalized to nodes with more than two children.

Question 17

What is a trie?

Answer 17

A prefix tree used for storing associative data, especially strings, for efficient prefix search.

Question 18

What is pre-order traversal?

Answer 18

Visit root, then left subtree, then right subtree.

Question 19

What is in-order traversal?

Answer 19

Visit left subtree, then root, then right subtree.

Question 20

What is post-order traversal?

Answer 20

Visit left subtree, then right subtree, then root.

Question 21

What is level-order traversal?

Answer 21

Visit nodes level by level from root to leaves (breadth-first).

Question 22

What is a graph?

Answer 22

A set of vertices connected by edges representing relationships.

Question 23

What is the difference between directed and undirected graphs?

Answer 23

Directed graphs have oriented edges; undirected graphs have bidirectional edges.

Question 24

What is a weighted graph?

Answer 24

A graph where edges have associated weights like cost or distance.

Question 25

What is a sparse graph?

Answer 25

A graph with significantly fewer edges than the maximum possible.

Question 26

What is a cyclic graph?

Answer 26

A graph containing at least one cycle where you can return to the starting node.

Question 27

What is the difference between graphs and trees?

Answer 27

Trees are acyclic, hierarchical with a single root and one path between nodes; graphs are more general.

Question 28

What is a stack?

Answer 28

A LIFO linear data structure with push/pop operations on the top.

Question 29

What is a queue?

Answer 29

A FIFO linear data structure with enqueue at rear and dequeue at front.