Data structures

Which operation is used to add an item to a linear queue?

• enqueue
• dequeue
• peek
• pop

What is the main advantage of using an adjacency list over an adjacency matrix for graph representation?

• It uses more memory
• It is easier to implement
• It is more efficient for sparse graphs
• It allows for faster edge lookups

In a priority queue, how are items typically ordered?

• By their priority level
• By the order they were added
• Randomly
• By their size

How can you determine if a stack is empty?

• By checking if the top element is null
• By checking if the stack is full
• By counting the number of elements
• By attempting to pop an element

If a stack is full, what operation cannot be performed?

• Push
• Pop
• Peek
• Test for empty

What does the 'pop' operation do in a stack?

• Adds an item to the stack
• Removes the top item from the stack
• Returns the top item without removing it
• Tests if the stack is empty

What does the term 'edge' refer to in graph theory?

• A weighted node
• A type of graph
• A connection between two vertices
• A point where two edges meet

In what scenario would you prefer using an adjacency matrix over an adjacency list?

• When you want to save space
• When the graph has many edges
• When you need to quickly check for the existence of an edge
• When the graph is sparse

Which representation of a graph is more space-efficient for sparse graphs?

• Adjacency matrix
• Incidence matrix
• Adjacency list
• Edge list

Which of the following best describes a vertex in a graph?

• A point where edges meet
• A type of graph
• A connection between two nodes
• A weighted edge