Understanding Linked Lists

What is the primary structure that linked lists are built from?

• Arrays

• Classes

• Nodes and pointers

• Indexes

Which data structure can be constructed using linked lists?

• Constants

• Variables

• Hash Maps

• Queues

What additional pointer does a doubly linked list have?

• Both previous and next items

• Previous item only

• Next item only

• No additional pointers

How does a circular linked list differ from a standard linked list?

• Nodes use two index registers

• Nodes are stored in non-contiguous memory

• Last node points to the first node

• Last node points to null

What type of linked list allows traversal in both directions?

• Single linked list

• Static linked list

• Doubly linked list

• Simple linked list

What is the benefit of a circular linked list over a standard linked list?

• Simpler coding

• Faster access times

• Continuous traversal

• Less memory usage

What is a key advantage of using object-oriented techniques for linked lists?

• Data must be stored contiguously

• Any memory address can be used

• Nodes require additional memory

• Static arrays are more efficient

In what scenario might a linked list be preferred over an array?

• When data needs to be accessed randomly

• When memory usage needs to be contiguous

• When adding or removing nodes frequently

• When a fixed size is required

Which of the following is a dynamic data structure?

• Character

• Integer

• Array

• Linked List

What allows linked lists to change dynamically at runtime?

• Static memory allocation

• Dynamic data structure property

• Predefined node paths

• Fixed data types