A
Stack
Queue
Array
Linked List
Which data structure uses LIFO?
B
Stack
Queue
Heap
Tree
Which data structure is used for BFS?
A
O(1)
O(log n)
O(n)
O(n^2)
What is the time complexity of accessing an element in an array?
<|start_header_id|>system<|end_header_id|>Generate 3 MCQs on data structures<|eot_id|><|start_header_id|>user<|end_header_id|> This is the question: MCQ Data Structures <|eot_id|><|start_header_id|>assistant<|end_header_id|>[{'correct_answer': 'A', 'options': {'A': 'Stack', 'B': 'Queue', 'C': 'Array', 'D': 'Linked List'}, 'question_text': 'Which data structure uses LIFO?'}
 {'correct_answer': 'B', 'options': {'A': 'Stack', 'B': 'Queue', 'C': 'Heap', 'D': 'Tree'}, 'question_text': 'Which data structure is used for BFS?'}
 {'correct_answer': 'A', 'options': {'A': 'O(1)', 'B': 'O(log n)', 'C': 'O(n)', 'D': 'O(n^2)'}, 'question_text': 'What is the time complexity of accessing an element in an array?'}]<|eot_id|>