Fundamentals of Data Structures Quiz

What is the main difference between arrays and linked lists?

• Arrays and linked lists both have the same time complexity for accessing elements

• Arrays store elements in contiguous memory locations, while linked lists store elements in nodes with pointers to the next node.

• Arrays and linked lists both store elements in nodes with pointers to the next node

• Arrays and linked lists both use non-contiguous memory locations

What is the time complexity for accessing an element in an array?

• O(1)

• O(n)

• O(log n)

• O(n^2)

What is the time complexity for accessing an element in a linked list?

• O(n)

• O(1)

• O(log n)

• O(n^2)

What is a stack and how is it different from a queue?

• A stack is a data structure that follows the Last In First Out (LIFO) principle, while a queue follows the First In First Out (FIFO) principle.

• A stack is a type of computer program, while a queue is a type of transportation.

• A stack is used for storing liquids, while a queue is used for storing solids.

• A stack is a type of chair, while a queue is a type of line.

What is the concept of 'LIFO' in a stack?

• First In, Last Out

• Last In, First Out

• First In, First Out

• Last In, Last Out

What is the concept of 'FIFO' in a queue?

• First In, First Out

• First In, Last Out

• Random In, First Out

• Last In, First Out

What are the advantages of using an array over a linked list?

• Arrays have slower access time compared to linked lists.

• Arrays cannot dynamically resize like linked lists.

• Arrays use more memory than linked lists.

• Arrays have constant time access to elements using index.

What are the advantages of using a linked list over an array?

• Dynamic size, easy insertion and deletion, no contiguous memory allocation

• Limited size, easy insertion and deletion, contiguous memory allocation

• Fixed size, difficult insertion and deletion, contiguous memory allocation

• Dynamic size, difficult insertion and deletion, contiguous memory allocation

What are the disadvantages of using an array?

• Arrays are efficient for inserting or deleting elements.

• Arrays have a fixed size and inserting or deleting elements can be slow and inefficient.

• Arrays have no limitations on size and can handle any amount of data.

• Arrays have a dynamic size and can easily insert or delete elements.

What are the disadvantages of using a linked list?

• Limited storage capacity

• Difficulty in implementing algorithms

• Memory allocation limitations and inability to access elements directly by index.

• Inefficient for searching