Data Structure › Time Complexity › Question #15254
MCQ Single Best Answer Easy

QWhat is the time complexity of a push operation in a stack implemented using an array?

ID: #15254 Time Complexity 137 views
Question Info
#15254Q ID
EasyDifficulty
Time ComplexityTopic
Start Quiz on This Topic
 Your Answer

Choose the Best Option

Click any option to instantly check if you're correct.

  • A O(1) ✔ ✖
  • B O(log n) ✔ ✖
  • C O(n) ✔ ✖
  • D O(n log n) ✔ ✖
Correct Answer: Option A

Explanation

In a stack implemented using an array, the push operation inserts an element at the top of the stack. Since the top position is known, the push operation can be performed in constant time by simply incrementing the top index and storing the element in the corresponding array position. Therefore, the time complexity of the push operation is O(1).

 Continue Practice
Previous Question Next Question
 Share

Share This Question

Challenge a friend or share with your study group.

 More from This Topic

Related MCQ Questions

What is the time complexity of a depth-first search (DFS) algorithm on a directed acyclic graph (DAG) with V v What is the time complexity of a merge sort algorithm for sorting an array of n elements in the worst case? What is the time complexity of a delete operation in a binary heap in the worst case? What is the time complexity of a selection sort algorithm for sorting an array of n elements in the worst case What is the time complexity of a selection sort algorithm for sorting an array of n elements in the worst case What is the time complexity of a bubble sort algorithm for sorting an array of n elements in the worst case? What is the time complexity of a linear search algorithm for an unsorted array of n elements in the worst case What is the time complexity of a binary search algorithm for finding an element in a sorted array of n element What is the time complexity of a depth-first search (DFS) algorithm on a graph with V vertices and E edges? What is the time complexity of a topological sort algorithm on a directed acyclic graph (DAG) with V vertices