A two-dimensional array A of 4-byte elements is stored in column-major order starting at address 1000, with indices starting at 0. What is the address of A?
Correct answer A. 1212
Topic / 90 questions
Data Structures MCQs
Page 5 of Data Structures multiple-choice questions with answers. Tap an option to check yourself.
Page 5 of 5
An array A of 2-byte elements is stored in row-major order with base address 200, and indices start at 1. What is the address of A?
Correct answer B. 218
What is the worst-case time complexity of inserting an element at the beginning of an array that holds n elements and has spare capacity?
Correct answer C. O(n)
Advertisement
What is the average time complexity of deleting an element from a random position in an array while keeping the remaining elements contiguous?
Correct answer B. O(n)
Why does a dynamic array such as C++ std::vector achieve amortised O(1) time for appending elements?
Correct answer C. It grows its capacity geometrically, so expensive reallocations happen rarely
In a singly linked list, what does each node contain?
Correct answer C. Data and a pointer to the next node
What is the time complexity of inserting a new node at the head of a singly linked list?
Correct answer D. O(1)
Given a pointer to a node in a doubly linked list, what is the time complexity of deleting that node?
Correct answer D. O(1)
In a circular singly linked list, what does the last node point to?
Correct answer D. The first node
Advertisement
What does an abstract data type (ADT) specify?
Correct answer D. The operations on the data and their behaviour, without fixing the implementation