Abstract Data Types in Computer Science

What is a stack in abstract data types?

• A stack is a data structure that allows elements to be accessed randomly

• A stack in abstract data types is a linear data structure that follows the Last In, First Out (LIFO) principle, where elements are added and removed from the same end called the top.

• A stack is a data structure that follows the First In, First Out (FIFO) principle

• A stack is a data structure that does not have a specific order for adding or removing elements

Explain the concept of LIFO in the context of stacks.

• LIFO stands for Last In First Out in the context of stacks.

• LIFO in the context of stacks means that the last element added to the stack is the first one to be removed.

• LIFO means the first element added to the stack is the first one to be removed.

• LIFO implies that elements are removed from the stack randomly.

How are stacks commonly implemented in programming languages?

• Arrays or linked lists

• Queues

• Binary trees

• Hash tables

Define a queue in abstract data types.

• A queue is an abstract data type that has no specific order for element removal.

• A queue allows elements to be inserted at the front and removed from the back.

• A queue is an abstract data type that follows the First In First Out (FIFO) principle. It allows elements to be inserted at the back and removed from the front.

• A queue is an abstract data type that follows the Last In First Out (LIFO) principle.

What is the main difference between a stack and a queue?

• LIFO vs FIFO

• FIFO vs LIFO

• Ordered vs Unordered

• First In First Out vs Last In First Out

Discuss the concept of FIFO in queues.

• FIFO in queues means processing elements in random order

• FIFO in queues refers to the order in which elements are processed, where the oldest element is processed first.

• FIFO in queues refers to processing the newest element first

• FIFO in queues is a concept unrelated to order of processing

What are linked lists and how are they different from arrays?

• Linked lists have a fixed size, unlike arrays which can dynamically resize.

• Linked lists store elements with pointers to the next element, while arrays store elements in contiguous memory locations.

• Linked lists are stored in reverse order compared to arrays.

• Arrays use pointers to access elements, while linked lists use direct indexing.

Explain the concept of nodes in linked lists.

• Nodes in linked lists store data and point to the next node, forming a chain-like structure.

• Nodes in linked lists are always sorted in descending order.

• Nodes in linked lists are used for storing images instead of data.

• Nodes in linked lists have a fixed size and cannot be modified.

How are binary trees different from general trees?

• Binary trees have nodes with only one child, while general trees have nodes with multiple children.

• Binary trees are always balanced, while general trees can be unbalanced.

• Each node in a binary tree can have at most two children, while nodes in a general tree can have any number of children.

• Binary trees are used for searching algorithms, while general trees are used for sorting algorithms.

A linked list abstract data type (ADT) is to be used to store and organise surnames. This will be implemented with a 1D array and a start pointer. Elements of the array consist of a user-defined type. The user-defined type consists of a data value and a link pointer. The 1D array is implemented with an array SurnameList of type LinkedList.

• (i) Liu

  (ii) 6

• (i) Wu

  (ii) 6

• (i) Wu

  (i) 4