Exit Ticket - Linked Lists and HashTables

Which of the following best describes a data structure?

• A way of organizing and storing data efficiently

• A type of programming language

• An algorithm for sorting data

• A way of encrypting data

What are the key differences between a Linked List and an Array?

• Linked Lists use sequential access while Arrays use constant-time access

• Linked Lists store data in a contiguous block of memory while Arrays use nodes

• Arrays use a fixed size while Linked Lists can grow dynamically

• Linked Lists use indices to access data while Arrays use pointers

Which of the following is an advantage of using a Linked List data structure?

• Constant-time access to elements

• Fast search and retrieval of data

• Dynamic resizing of the data structure

• Efficient use of memory

What are the key differences between Linked List and Hash Table data structures?

• Linked Lists use key-value pairs while Hash Tables use nodes

• Linked Lists allow for constant-time access while Hash Tables use sequential access

• Linked Lists use nodes while Hash Tables use key-value pairs

How do you remove data from a Linked List using an array-based approach?

• Set the node's value to null

• Find the node to be removed and link the previous node to the next node

• Use a for loop to iterate through the array and remove the desired element

• Use a stack to remove the desired element from the Linked List

Which of the following helps 'Key-Values' to be mapped into memory address indexes?

• hash function

• separate chaining

• open addressing

• chaining using a linked list

What is the advantage of the hash table over a linked list?

• faster access of data

• easy to implement

• very efficient for less number of entries

• exhibit good locality of reference

Which of the following trait of a hash function is most desirable? (a)  

• it should cause less collisions
• it should cause more collisions
• it should occupy less space
• it should be easy to implement

In what type of scenario might a Hash Table data structure be useful? (a)  

• Fast lookups of data
• Storing data in a sequential order
• Sorting data into categories
• Storing data in a stack

What is the purpose of a hash function in a Hash Table data structure?

• To generate random keys for the data

• To create a sequence of nodes

• To sort the data in the table

• To map the data to an index in the table