Algorithms / Data Structures

Question 1

Abstract data type (ADT)

Answer 1

A model of a data structure (properties, operations, etc); from the POV of its user

Question 2

Algorithm

Answer 2

A finite set of well-defined instructions typically used to solve a particular class of problem; must have a sequence of operations, a control flow, and a stopping condition

Question 3

Binary tree

Answer 3

A tree whose nodes have at most two children

Question 4

Data structure

Answer 4

The implementation of an ADT (queue => array); from the POV of its programmer

Question 5

Graph

Answer 5

A collection of nodes and their edges

Question 6

Internal node

Answer 6

A node that has children

Question 7

Leaf node

Answer 7

A node that does not have children

Question 8

Linked list

Answer 8

A linear data structure; has head (first node), tail (last node) and length properties; its data is stored non-contiguously

Question 9

Queue

Answer 9

A first-in-first-out, linear data structure

Question 10

Linear data structure

Answer 10

A data structure whose nodes are ordered sequentially and each have references to their adjacent nodes; easier to implement but less memory efficient than nonlinear

Question 11

Nonlinear data structure

Answer 11

A data structure whose nodes are ordered hierarchically; harder to implement but more memory efficient than linear

Question 12

Stack

Answer 12

A last-in-first-out, linear data structure

Question 13

Tree

Answer 13

A graph that doesn’t contain any cycles (loops back to a previous node); ‘rooted’ if it has a single root node