Arrays and Linked Lists

In the linked list data structure where a node contains only two variables, what do you call the very first node?

• index 0

• head

• tail

• null

In a linked list whose nodes have 2 variables, where does the tail node point to?

• head if linked list is circular

• null if linked list is singly

• null if linked list is doubly

• head if linked list is singly

• null if linked list is circular

The following are true of linked lists except:

• is not limited to a unidirectional implementation

• is better than arrays in terms of memory usage

• is comprised of node objects

• cannot be used to create more complex data structures

Array elements are stored in contiguous blocks of memory meaning:

• memory blocks are the same size as each other

• memory blocks are right next to each other

• memory location is fixed on run time

• memory blocks for each element vary in size

The following are practical uses of linked lists (choose 1 or more)

• web browsers

• music player / playlist

• operating system scheduler

• blockchain

• photo editing, word processing

arrays are faster in terms of inserting new elements vs linked lists

• True

• False

Assuming a linear search algorithm on an array, singly linked lists are faster in terms of search vs arrays

• True

• False

Multi-dimensional arrays whose row and column sizes are similar are called ____.

Choose the statements that describe (traditional) arrays

• fixed number of elements

• dynamic number of elements

• can be stored in any memory location

• requires a contiguous block of memory locations

These are linked lists which have more than one pointer variable that links both the next and previous node

• Single Linked List

• Singly Linked List

• Double Linked List

• Doubly Linked List

• Circular Linked List