Data Structures: Multiple Choice

Unit 3: Data Structures - Multiple Choice Questions

• A binary tree can have at most two children.
• A complete binary tree contains the maximum possible nodes at all levels.
• A complete binary tree contains the maximum possible number of nodes at all levels, except possibly at the last level.
• In a linear representation of a binary tree, the left child node of a node at position N is at position 2 * N.
• In a linear representation of a binary tree, the right child node of a node at position N is at position 2*N + 1.
• A linked list is a linear type of data structure.
• A linked list is an example of dynamic memory allocation.
• A storage representation of a linked list in memory is typically non-sequential.
• A singly linked list is a one-way list.
• A data structure that contains a data field and a pointer field is a linked list.
• In a circular linked list, the last node points to the first node.
• In doubly linked lists, traversal can be performed in both directions.
• In a linked list, each node contains at least two fields: a data field and a pointer to the next node.
• A circular linked list is a type of linked list in which none of the nodes contains a NULL pointer.
• A node in a doubly linked list has a minimum of three fields.
• A singly linked list is also known as a one-way list.
• A double linked list is also known as a two-way list.
• Each node in a singly linked list typically has 2 fields.
• In the context provided, LLINK / LPTR is the pointer pointing to the predecessor node.
• A linear list where the pointer points only to the successor node is a singly linked list.

Unit 4: Graphs and Searching - Multiple Choice Questions

• A digraph is known as a directed graph.
• In a digraph's ordered pair (Vi, Vj), the edge is directed from Vi to Vj.
• A directed edge is known as an arc.
• A graph or digraph is termed weighted if all edges have labels representing weights.
• An edge where the start and end vertices are the same (Vi, Vi) is a self-loop.
• Multiple edges between the same pair of vertices are parallel edges.
• A graph with self-loops or parallel edges is a multi-graph.
• A graph without self-loops or parallel edges is a simple graph.
• A graph G where each vertex Vi is adjacent to every other vertex Vj is a complete graph.
• A path starting and ending at the same vertex is a cycle.
• If a graph has no cycles, it's an acyclic graph.
• A vertex with no connected edges is an isolated vertex.
• The number of edges connected to a vertex is the degree of the vertex.
• A node with an in-degree of 0 is a source node.
• A node with an out-degree of 0 is a sink node.
• A vertex with an in-degree of 1 and out-degree of 0 is a pendant vertex.
• A graph where every pair of distinct vertices is connected is a connected graph.
• Sorting is arranging data in ascending or descending order.
• Finding the closest pair requires sorting first.
• The process to find a particular element from the array is Search.
• For an unordered array the sorting used for an array is Sequential Search.
• For searching ordered array the most appropriate algorithm is Binary Search.
• Binary Search makes the minimum possible comparisons.
• Sequential file organization is used in all types of storage devices.
• Serial processing involves accessing records one after the other in physical order.
• Sequential processing involves accessing records in ascending order by a key or index item.