Fundamentals of Data Structures

What is a data structure?

• A data structure is a specialized format for organizing, processing, and storing data.

• A data structure is a programming language.

• A data structure is a type of computer program.

• A data structure is a method for writing code.

Name three types of linear data structures.

• Graphs

• Stacks

• Trees

• Arrays, Linked Lists, Queues

What is the main difference between an array and a linked list?

• Arrays can grow dynamically while linked lists have fixed sizes.

• Linked lists allow index-based access while arrays do not.

• Arrays consist of nodes linked by pointers, while linked lists do not.

• The main difference is that arrays have fixed sizes and allow index-based access, while linked lists are dynamic and consist of nodes linked by pointers.

Define a stack and its main operations.

• A stack is a LIFO data structure with main operations: push (add), pop (remove), and peek (view top).

• A stack is a LIFO data structure with operations: push (add), pop (remove), and size (count elements).

• A stack is a data structure that allows random access with operations: insert (add), delete (remove), and access (view any element).

• A stack is a FIFO data structure with operations: enqueue (add), dequeue (remove), and front (view front).

What is a queue and how does it differ from a stack?

• A queue is a data structure that only allows insertion at the front.

• A queue is a LIFO data structure, while a stack is a FIFO data structure.

• A queue is a FIFO data structure, while a stack is a LIFO data structure.

• A queue allows random access, while a stack does not.

Explain what a binary tree is.

• A binary tree is a data structure where each node has at most two children.

• A binary tree is a data structure with no nodes.

• A binary tree is a type of graph with multiple roots.

• A binary tree is a structure where each node can have three children.

What is the purpose of a hash table?

• To store data in a linear format

• To create complex data structures

• To encrypt sensitive information

• The purpose of a hash table is to provide efficient data storage and retrieval.

Describe the concept of a graph in data structures.

• A graph is a collection of nodes connected by edges, representing relationships between entities.

• A graph is a collection of random data points without connections.

• A graph is a linear sequence of numbers.

• A graph is a type of database used for storing data.

What is the time complexity of accessing an element in an array?

• O(n^2)

• O(n)

• O(1)

• O(log n)

What are the advantages of using a linked list over an array?

• Advantages of linked lists over arrays include dynamic size, efficient insertions/deletions, and better memory management.

• Faster access to elements

• Fixed size allocation

• Simpler memory allocation