- Computer Science Engineering (CSE)
- Data Structures (DS)
- Linear Data Structures -Stacks and Queue...
- What is the space complexity of a linear...

Q. |
## What is the space complexity of a linear queue having n elements? |

A. | O(n) |

B. | O(nlogn) |

C. | O(logn) |

D. | O(1) |

Answer» A. O(n) |

View all MCQs in:
Data Structures (DS)

- In a circular queue, how do you increment the rear end of the queue?
- An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of
- What is the time complexity to insert a node based on key in a priority queue?
- What is the time complexity to insert a node based on position in a priority queue?
- A linear collection of data elements where the linear node is given by means of pointer is called?
- If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?
- What is the best case and worst case complexity of ordered linear search?
- The complexity of linear search algorithm is____________.
- What is the space complexity for deleting a linked list?
- What is the space complexity of the post-order traversal in the recursive fashion? (d is the tree depth and n is the number of nodes)

Login to Continue

It will take less than 2 minutes

Report MCQ