Algorithms can be expressed as pseudocode and flowcharts.

Table, Trees, and List are types of nonlinear data structure.

Statically allocated arrays require predetermined maximum length.

Memory for dynamic data structures is assigned at compile time.

The queue is initialized by having the rear set to “1”, and front set to “0”.

Nodes of linear linked list consist of data and reference(s) to other node(s).