Midterm Exam (BSIS 2-A)

Data structures can be applied in stacks, queues, arrays, and linked lists only.

• true

• false

Data structures are also used in linked lists and hash tables.

• true

• false

A linear data structure is one in which the data elements are stored in sequential order.

• true

• false

A dynamic data structure is a collection of data in which memory size is fixed during runtime.

• true

• false

Primitive data structures are the fundamental data structures that are more complicated.

• true

• false

Stack principle is Last-In, First-Out (LIFO) or First-In, Last-Out (FILO).

• true

• false

Queue is a collection of objects with the principle of First-In, First-Out (FIFO).

• true

• false

Linked lists are dynamic; that is, memory is deallocated when required.

• true

• false

The address part of the last node stores a primitive value called NULL.

• true

• false

The advantage of a linked list over arrays is that now it is easier to insert and delete data elements.

• true

• false