architecture Online Quiz - 34

An extended binary tree (also called a full binary tree or proper binary tree) is defined as a binary tree where every node has either 0 or 2 children - never just 1 child. A complete binary tree fills all levels except possibly the last, which must be left-filled. A binary search tree is ordered by key values, not by child count. Option C is correct.

A variable P is called a pointer if it contains the address of an element in DATA. Option A correctly states this fundamental definition - pointers store memory addresses, not the data itself. Option B is incorrect because pointers can point to any element, not just the first. Option C is too restrictive. Option D is wrong because pointers store addresses, not both data and addresses.

Arrays are designed to store homogeneous data elements - all elements must be of the same type. Records can store heterogeneous data (different types), pointers store addresses (not data elements per se), and 'None' is incorrect. Therefore Arrays is the correct answer.

Records are designed to store heterogeneous data elements - fields can be of different types (e.g., name:string, age:integer, salary:decimal). Arrays require homogeneous elements. Pointers store addresses. Therefore Records is the correct answer.

Indecomposable items in a record that cannot be broken down further are called elementary items, atoms, or scalars - all three terms refer to the same concept of primitive data types that contain a single value. Therefore 'all of the above' is correct.

The memory address of the very first element of an array is known as the base address, which is used as the starting reference point to calculate the addresses of subsequent elements. Other terms like floor, foundation, or first address are incorrect terminology.

Linear arrays are indexed structures because they allow direct access to any element using its index in constant time O(1). The index is used to calculate the memory address directly. Linked lists are sequential structures that require traversal from the head to access a specific element, making them non-indexed.

Binary search requires the search space/list to be sorted and allows random access to the middle element to achieve logarithmic time complexity. It does not require a mechanism to insert or delete elements; in fact, binary search is often performed on static arrays.

Binary search has O(log n) time complexity, which remains efficient even for large datasets. The efficiency depends on the logarithmic growth rate, not on a fixed number like 1000. Options A, B, and C are actual limitations: binary search requires sorted data and direct access to the middle element, which can be expensive to maintain with frequent insertions/deletions.

Two-dimensional arrays are commonly referred to as both tables (for tabular data representation) and matrices (especially in mathematical contexts involving rows and columns). Both terms describe the same conceptual structure of data arranged in a grid format with rows and columns.

The address of any array element is calculated as: Base Address + (Index - Lower Bound) × Word Size. For the 5th element, this is LOC(Array[5]) = Base(Array) + w(5 - lower bound), where w represents bytes per memory cell. Options B and C are incorrect because they omit the word size multiplier or use wrong bounds.

A deque (double-ended queue) specifically allows insertion and deletion at both ends. Stacks only allow operations at one end (LIFO), queues restrict insertion to rear and deletion to front (FIFO), and linked lists allow insertion/deletion anywhere but not with the same efficiency at both ends as a deque.

The inorder sequence E A C K F H D B G and preorder F A E K C D H G B correspond to a specific binary tree structure. Preorder traversal always visits root first, then left subtree, then right subtree. Option B is the correct preorder for this tree configuration.

A two-way list (doubly linked list) has nodes with pointers to both next and previous nodes. None of the given options (grounded header list, circular header list, linked list with header and trailer) specifically describe a doubly linked list. These are variations of singly linked lists or specific implementations, not two-way lists.

Arrays store homogeneous elements (same type) with natural ordering by index. Records can store heterogeneous elements (different types) without requiring a natural ordering among fields. Records can form hierarchical structures through nested records, unlike simple linear arrays. All three statements correctly distinguish arrays from records.

Option C is false because pointers store the ADDRESS of the next node, not the data element itself. Options A, B, and D are true: arrays are dense static structures, linked list elements need not be adjacent in memory (linked by pointers), and linked lists are collections of nodes with data and pointer fields.

Binary search requires O(1) direct access to the middle element, which is not possible in linked lists as they require sequential traversal. Binary search CAN be applied to sorted linear arrays (direct index access), sorted binary trees (balanced BSTs allow O(log n) access), and pointer arrays (also support direct access).

Overflow occurs when trying to insert data into a data structure that has no remaining space. Underflow is the opposite - attempting to remove from an empty structure. 'Housefull' and 'saturated' are not standard computer science terminology for this condition.

When START=NULL in a linked list, the list is empty. Attempting to delete from an empty data structure is called underflow. Overflow refers to being unable to insert due to lack of space, which is the opposite scenario.

Stacks operate on LIFO (Last In First Out) principle, meaning the last element added is the first one removed. FIFO (First In First Out) is the characteristic of queues, not stacks. LIFO, piles, and push-down lists are all names associated with stack data structures, while FIFO specifically describes queue behavior.