Register

Stack

6,885 views
0 0 votes
Consider a stack is implemented using an array. What is worst case time complexity of push operation?

A) O(n)

B) O(log n)

C) O(n log n)

D) O(1)

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · geek mock 2017 #38Next → · ACE test series
← Previous in category · testbookNext in category → · Array
Position:
Show:

Related questions

9 9 votes
2 2 answers
434
434 views
GO Classes asked Jul 27
434 views
GO Classes DPP | GATE CS, DA | Data Structure | Stack and Queue Transfer
Given a stack $S$ with $5$ elements from top to bottom as:$2, 4, 6, 8, 10$and an empty queue $Q$.First, remove the elements one by one from $S$ and insert them into $Q$.T...
7 7 votes
1 1 answer
506
506 views
GO Classes asked Jul 27
506 views
GO Classes DPP | GATE CS, DA | Data Structure | Stack & Queue
Which of the following statements are true?$\text{S1.}$ Stack operations $\texttt{push}$, $\texttt{pop}$, and $\texttt{isEmpty}$ can be worst-case $O(1)$ for a linked-lis...
7 7 votes
1 1 answer
323
323 views
GO Classes asked Jul 10
323 views
GO Classes DPP | GATE CS, DA | Data Structure | Stack Implementation & DFS
Assume there are $n$ elements in the data structure. Consider the following statements:$\text{S1}:$ A stack can be implemented using a linked list such that each individu...
6 6 votes
3 3 answers
333
333 views
GO Classes asked Jul 8
333 views
GO Classes DPP | GATE CS, DA | Data Structure | Stack Permutation
Suppose an intermixed sequence of stack push and pop operations is performed. The push operations push the integers $0$ through $9$ in order. The pop operations print the...