If you perform an in-order traversal of a binary search tree, in what order are the nodes visited?

Left child, parent, right child

Which of the following is true about the traversal of a singly linked list?

It can only be traversed in one direction

In a doubly linked list, each node contains:

A reference to the previous node and the next node

What is a valid property of a binary search tree (BST)?

Nodes in the left subtree of a node will have values less than the node

Which of the following scenarios is best suited for using a 2D array?

Tracking daily temperatures for a month

In recursive functions, what is the base case?

The case that stops the recursion

Which of the following is a disadvantage of using a binary search tree?

Require more space compared to arrays

What defines a static data structure?

Size is decided at compile time

What is a linked list?

A data structure that consists of nodes and pointer to the next node.

What is the primary difference between a 1D array and a 2D array?

2D array stores data in rows and columns

What is a node in a linked list?

A data structure that holds the elements and a reference to the next node

What is a potential issue to be careful of when using recursion?

Recursion can lead to infinite loops

studbud

Unit 6 - Abstract data structure

21 termsStudBud Administration11 plays

Imported from external platform

Flashcards21 cardsFPractice quizPHost liveL

Questions 21

Answers

1
In a 2D array, how is data accessed?
Directly with an index pair
Through recursive functions only
Using a loop structure
By switching between 1D array subsets
2
If you perform an in-order traversal of a binary search tree, in what order are the nodes visited?
Parent, left child, right child
Left child, parent, right child
Parent, right child, left child
Left child, right child, parent
3
Which data structure enables efficient insertion and deletion operations?
Linked List
Queue
Static data structure
Array
4
Which of the following is true about the traversal of a singly linked list?
The traversal direction alternates between odd and even nodes
It can be traversed in both directions
It can only be traversed in one direction
It is not possible to traverse a linked list
5
Which of the following languages supports recursion?
JAVA
HTML
CSS
SQL
6
What data structure follows the Last In First Out (LIFO) principle?
Linked List
Stack
Array
Queue
7
In a stack, which operation removes the top element?
Dequeue
Push
Enqueue
Pop
8
In a doubly linked list, each node contains:
No references to other nodes
Only a reference to the previous node
Only a reference to the next node
A reference to the previous node and the next node
9
What is a valid property of a binary search tree (BST)?
odes do not store any values
Nodes can have an arbitrary number of children
Nodes in the left subtree of a node will have values less than the node
Nodes in the right subtree of a node will have values greater than the node
10
What is recursion in computer science?
A looping structure
An if-else statement
A function that calls itself
A while loop
11
Which of the following scenarios is best suited for using a 2D array?
Storing a list of student names
Managing a collection of different objects
Tracking daily temperatures for a month
Storing a simple sequence of numbers
12
In recursive functions, what is the base case?
The case that stops the recursion
The case with the largest value
The case that recurs infinitely
The case that calls another function
13
What allows a dynamic data structure to grow or shrink based on the number of elements?
Fixed memory allocation
Dynamic memory allocation
Pointers to elements
Array
14
Which of the following is a disadvantage of using a binary search tree?
Efficient adding and deletion of elements
Require more space compared to arrays
Fast search operation
Not suitable for storing hierarchical data
15
What defines a static data structure?
Size can be adjusted at runtime
Can change size during execution
Uses pointers for implementation
Size is decided at compile time
16
What is a linked list?
A data structure that consists of nodes and pointer to the next node.
A data structure that stores elements in contiguous memory locations
A data structure that can only store integers
A data structure where elements are stored based on key-value pairs
17
What is the primary difference between a 1D array and a 2D array?
2D array can only store integers
1D array stores data in rows and columns
1D array can store multiple elements of the different data types
2D array stores data in rows and columns
18
What is a node in a linked list?
A pointer to the middle element of the linked list
The last element in the linked list
The main function that processes the linked list
A data structure that holds the elements and a reference to the next node
19
In a queue, which operation adds an element to the rear end?
Dequeue
Pop
Enqueue
Push
20
What is a potential issue to be careful of when using recursion?
Recursion cannot handle any mathematical operations
Recursion is not supported in modern programming languages
Recursion can lead to infinite loops
Recursion is always slower than iteration
21
Which of the following problems is best solved using recursion?
Traversing a maze
Sorting a large dataset
Simple arithmetic calculations
Implementing a for loop

Unit 6 - Abstract data structure Flashcards | StudBud