IBDP Computer Science: abstract data structures

What is the main advantage of using arrays in data structures?

• Automatic sorting of elements

• Constant time access to elements based on index

• Dynamic resizing capabilities

• Linear time access to elements based on index

Explain the concept of a linked list and its advantages over arrays.

• Linked lists are less memory efficient than arrays

• Linked lists can only store primitive data types

• Linked lists are slower than arrays for random access

• Linked lists have efficient insertion/deletion operations, and not requiring contiguous memory allocation.

How does a stack data structure work?

• A stack data structure works adding and removing elements from the end with the last aded elements

• A stack data structure works by randomly accessing elements in the stack

• A stack data structure works by removing elements from the middle of the stack

• A stack data structure works adding from the end with the last aded elements, but removing from the front

Provide an example of a real-life scenario where a stack can be used.

• A real-life scenario where a stack can be used is tracking the number of visitors on a website

• A real-life scenario where a stack can be used is waiting digitally to but concert tickets

• A real-life scenario where a stack can be used is accessding sorted elements quickly. For example, a list of student names.

• A real-life scenario where a stack can be used is the 'undo' feature in software applications. .

Differentiate between a queue and a stack data structure.

• A queue allows random access while a stack does not.

• A queue is LIFO while a stack is FIFO.

• In summary, a queue is FIFO while a stack is LIFO.

• A queue is a linear data structure while a stack is a non-linear data structure.

What is a binary tree and how is it different from other tree data structures?

• A binary tree is a tree data structure where each node has at most three children.

• A binary tree is a tree data structure where each node has at most one child.

• A binary tree is a tree data structure where each node has at most four children.

• A binary tree is a tree data structure where each node has at most two children, referred to as the left child and the right child. This is different from other tree data structures like n-ary trees, where nodes can have more than two children.

Explain the concept of a doubly linked list and its advantages over a singly linked list.

• A doubly linked list has nodes with references to both the next and previous nodes, enabling bidirectional traversal and easier deletion compared to a singly linked list.

• A doubly linked list does not support dynamic resizing of the list, unlike a singly linked list

• A doubly linked list only allows traversal in one direction, making it less efficient than a singly linked list

• A doubly linked list requires more memory compared to a singly linked list

Queue?

• queues have a fixed size

• queues are used only for integers

• elements in a regular queue are dequeued in the order they were added.

• element are dequeued based on their priority level.

Discuss the concept of a binary search tree and its applications.

• Binary search trees are only used for sorting algorithms

• Binary search trees are primarily used for image processing

• Binary search trees are not efficient for search and retrieval tasks

• Binary search trees are commonly used in computer science for implementing data structures like sets, maps, and dynamic sets. They are also utilized in database indexing, network routing, and many other applications where quick search and retrieval are essential.

What is the significance of balanced trees in data structures?

• Balanced trees lead to linear time complexity

• Balanced trees ensure efficient operations by maintaining a balanced height, leading to logarithmic time complexity.

• Balanced trees have no significance in data structures

• Balanced trees are only used for aesthetic purposes