Data Structures and Algorithms

Which of the following best describes an array?

• A dynamic collection of elements linked using pointers

• A fixed-size, sequential collection of elements of the same type

• A random collection of values

• A binary tree structure

In an array, how is an element accessed?

• Sequentially from the first element

• Through pointer jumping

• By using its index position directly

• By searching linearly only

What is the index of the first element in an array in most programming languages?

• 0

• 1

• -1

• Depends on the language

Which of the following is NOT an advantage of arrays?

• Random access to elements

• Fixed size

• Easy indexing

• Contiguous memory storage

Which of the following is NOT an advantage of linked lists over arrays?

• Dynamic size

• Easy insertion and deletion

• Random access to elements

• Efficient for frequently changing sizes

What does each node in a singly linked list contain?

• Data only

• Data and a pointer to the next node

• Data and pointers to both previous and next nodes

• A pointer only

In a doubly linked list, each node contains:

• Data and one pointer

• Only data

• Data and two pointers

• Data and a single array

Which operation in an array has O(1) time complexity in the best case?

• Insertion at the beginning

• Deletion at the beginning

• Accessing an element by index

• Searching for an element

Which linked list variant allows traversal in both directions?

• Singly linked list

• Doubly linked list

• Circular linked list

• Binary linked list

Which data structure is more memory efficient when the number of elements is known in advance?

• Array
  

• Linked list

• Graph

• Tree