Data Structures and Algorithms Quiz

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

• O(n)

• O(log n)

• O(1)

• O(n^2)

Which data structure uses LIFO (Last In, First Out) principle?

• Queue

• Stack

• Array

• Linked List

What is the worst-case time complexity of bubble sort?

• O(n)

• O(n log n)

• O(n^2)

• O(n^3)

Which of the following is not a type of tree?

• Binary Tree

• AVL Tree

• Hash Tree

• B-Tree

In a linked list, what is the time complexity to insert a node at the beginning?

• O(n)

• O(log n)

• O(1)

• O(n^2)

Which algorithm is used for finding the shortest path in a weighted graph?

• Depth-First Search

• Dijkstra's Algorithm

• Bubble Sort

• Prim's Algorithm

What is the main disadvantage of a linked list over an array?

• No dynamic sizing

• Slower access time

• More memory usage

• No flexibility in data types

Which data structure is used in breadth-first search (BFS)?

• Stack

• Queue

• Array

• Hash Table

What is the time complexity of binary search on a sorted array?

• O(n)

• O(log n)

• O(n log n)

• O(n^2)

Which of the following is a characteristic of a hash table?

• Uses a tree structure

• Provides O(1) average time complexity for search

• Requires sorting of elements

• Stores elements in a sequential order