- Computer Science Engineering (CSE)
- Data Structures (DS)
- Linear Data Structures - List
- What is the time complexity of inserting...

Q. |
## What is the time complexity of inserting at the end in dynamic arrays? |

A. | O(1) |

B. | O(n) |

C. | O(logn) |

D. | Either O(1) or O(n) |

Answer» D. Either O(1) or O(n) |

View all MCQs in:
Data Structures (DS)

- What is the worst case time complexity of inserting a node in a doubly linked list?
- What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?
- Which of the following concepts make extensive use of arrays?
- What are the advantages of arrays?
- What are the disadvantages of arrays?
- If binary trees are represented in arrays, what formula can be used to locate a left child, if the node has an index i?
- Associative arrays can be implemented using
- Arrays are best data structures for _____________________________.
- What are the advantages of arrays?
- Allocating memory for arrays during program compilation is___________.

Login to Continue

It will take less than 2 minutes

Report MCQ