Data Structure Quiz

What is an Abstract Data Type (ADT)?

• A way of organizing and storing data in a computer

• A type of queue with FIFO principle

• A type for objects defined by a set of values and operations

• A type of list that can store different data types

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

• O(N^2)

• O(log N)

• O(N)

• O(1)

What is the main disadvantage of implementing Abstract Data Types (ADTs)?

• Encapsulation

• Overhead in terms of memory and processing

• Limited Flexibility

• Learning Curve

What is the core operation of a stack that inserts an element on the top?

• Delete

• Insert

• Push

• Pop

What is the main feature of a priority queue?

• It handles insertion and removal based on assigned importance

• It follows the LIFO principle

• It can only store one type of data

• It stores elements in alphabetical order

What is the time complexity for adding and removing elements in a queue?

• O(N)

• O(1)

• O(log N)

• O(N^2)

What is the purpose of a double-ended queue?

• To insert and remove elements from both ends

• To follow the FIFO rule

• To have a circular structure

• To store elements in alphabetical order

What is the type of list where elements are not arranged based on characteristics?

• Ordered List

• Unordered List

• Priority Queue

• Indexed List

What is the advantage of using a linked list implementation for a stack?

• Has a time complexity of O(N) for inserting and removing elements

• Updates 'Top' to point to the node before the most recently added one

• Requires shifting elements for insertion

• Allows for a fixed-size stack

What is the main feature of a circular queue?

• It can only store one type of data

• It has a circular structure

• It strictly follows FIFO

• It stores elements in alphabetical order