Scribd
Upload
112 views3 pages

List ADT Array Implementation MCQ

The document contains multiple-choice questions (MCQs) focused on the List Abstract Data Type (ADT) and its array-based implementation. Key topics include the definition of ADT, characteristics of list storage, operations on array-based lists, and performance implications of various operations. It highlights the importance of understanding data structures and their efficiency in programming.

Uploaded by

Jeeva Sadhasivam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
112 views3 pages

List ADT Array Implementation MCQ

The document contains multiple-choice questions (MCQs) focused on the List Abstract Data Type (ADT) and its array-based implementation. Key topics include the definition of ADT, characteristics of list storage, operations on array-based lists, and performance implications of various operations. It highlights the importance of understanding data structures and their efficiency in programming.

Uploaded by

Jeeva Sadhasivam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

MCQs on List ADT and Array-Based Implementation

1. What does the 'T' in ADT stand for?

A. Template

B. Tree

C. Type

D. Token

Answer: C. Type

2. List ADT stores data in:

A. Hierarchical structure

B. Tabular structure

C. Sequential order

D. Unordered format

Answer: C. Sequential order

3. The abstract nature of List ADT means:

A. It cannot be implemented

B. It can only be used in linked lists

C. Only interface is defined, not implementation

D. It is not usable in real programs

Answer: C. Only interface is defined, not implementation

4. Which is not a linear data structure?

A. Array

B. Stack

C. Queue

D. Tree

Answer: D. Tree

5. In an array-based list, insertions at the end take:

A. O(n)

B. O(log n)

C. O(1)

Page 1
MCQs on List ADT and Array-Based Implementation

D. O(n log n)

Answer: C. O(1)

6. What happens when we insert at the start of an array-based list?

A. All elements must be shifted

B. List becomes sorted

C. No operation is required

D. Memory doubles automatically

Answer: A. All elements must be shifted

7. In an array-based list, which operation is most expensive (time-wise)?

A. Accessing the middle element

B. Deleting at the front

C. Traversing the list

D. Printing all elements

Answer: B. Deleting at the front

8. The initial size of a statically allocated array is:

A. Defined at runtime

B. Defined at compile-time

C. Based on the OS

D. Grows automatically

Answer: B. Defined at compile-time

9. What is the result of inserting an element at index 0 in an array list?

A. It is placed at the end

B. The element is discarded

C. All existing elements shift right

D. The program crashes

Answer: C. All existing elements shift right

10. Array-based implementation is not suitable when:

A. Frequent insertions at end

Page 2
MCQs on List ADT and Array-Based Implementation

B. Random access is needed

C. Frequent insertions at front

D. List is small

Answer: C. Frequent insertions at front

Page 3

You might also like