True
A binary search algorithm works in O(log n) time.
False
The traveling salesman problem is a linear-time problem.
True
Depth-first search uses a stack for traversal.
<|start_header_id|>system<|end_header_id|>Generate 3 true/false questions on algorithms<|eot_id|><|start_header_id|>user<|end_header_id|> This is the question: True/False Algorithms <|eot_id|><|start_header_id|>assistant<|end_header_id|>[{'correct_answer': 'True', 'options': None, 'question_text': 'A binary search algorithm works in O(log n) time.'}
 {'correct_answer': 'False', 'options': None, 'question_text': 'The traveling salesman problem is a linear-time problem.'}
 {'correct_answer': 'True', 'options': None, 'question_text': 'Depth-first search uses a stack for traversal.'}]<|eot_id|>