Understanding ADTs and Linked Lists

Which of the following is not a type of Abstract Data Type (ADT)?

• Stack

• Queue

• Array

• Binary Tree

What is the primary operation used to add an element to the end of a linked list?

• Insert

• Append

• Push

• Enqueue

In a singly linked list, what is the time complexity of accessing the nth element?

Which of the following is a common application of Abstract Data Types (ADTs)?

• Operating System Design

• Web Development

• Database Management

• All of the above

What is the main advantage of using a doubly linked list over a singly linked list?

• Easier to implement

• Requires less memory

• Allows traversal in both directions

• Faster insertion at the end

In terms of memory management, what is a potential drawback of using linked lists?

• Fixed size

• Memory fragmentation

• High memory usage

• Slow access time

Which operation is used to remove the first element from a linked list?

• Pop

• Dequeue

• Delete

• Remove

What is the primary purpose of a stack ADT?

• To store elements in a queue

• To allow random access to elements

• To manage function calls and recursion

• To sort elements

Which of the following is a characteristic of a circular linked list?

• The last node points to the first node

• It has a fixed number of nodes

• It does not allow duplicate values

• It is always sorted

What is a common use case for a queue ADT?

• Reversing a string

• Implementing a call centre system

• Sorting a list

• Calculating factorials