Lists where controlled insertions and deletions take place such that insertions at the rear end and deletions from the front end, are queues.

A ragged list has same shape of all its elements.

Assertion. A linear list refers to a named list of finite number of similar data elements.

Reason. Similar type of elements grouped under one name make a linear list.

Assertion. A list having one or more lists as its elements is called a nested list.

Reason. Two or more lists as part of another data structure such as dictionaries or tuples, create nested lists.