False
A stack follows the FIFO principle.
False
A binary tree can have more than two children per node.
True
Linked lists allow dynamic memory allocation.
True
A hash table uses a hash function for indexing.
False
A queue operates on a LIFO basis.
<|start_header_id|>system<|end_header_id|>Generate 5 true/false questions on data structures<|eot_id|><|start_header_id|>user<|end_header_id|> This is the question: True/False Data Structures <|eot_id|><|start_header_id|>assistant<|end_header_id|>[{'correct_answer': 'False', 'options': None, 'question_text': 'A stack follows the FIFO principle.'}
 {'correct_answer': 'False', 'options': None, 'question_text': 'A binary tree can have more than two children per node.'}
 {'correct_answer': 'True', 'options': None, 'question_text': 'Linked lists allow dynamic memory allocation.'}
 {'correct_answer': 'True', 'options': None, 'question_text': 'A hash table uses a hash function for indexing.'}
 {'correct_answer': 'False', 'options': None, 'question_text': 'A queue operates on a LIFO basis.'}]<|eot_id|>