Data Structures And Algorithms

Step 1: Examine the Binary Tree.
In the given tree, the operators are located at the internal nodes, and the operands are located at the leaf nodes. The order of operations is determined by traversing the tree in an infix manner (i.e., left operand, operator, right operand).

Step 2: Perform the Infix Traversal.
The binary tree in the image represents the following infix expression:

- Start with the root: The operator is `-`. This operator applies to the left and right subtrees.

- The left subtree (rooted at `+`) gives us the expression `(a + b)`.

- The right subtree (rooted at `*`) gives us the expression `(c * d)`.

- The rightmost subtree (rooted at `/`) represents the expression `(g - h)`.

- Finally, the operator at the root of the tree `%` applies to the left expression `(a + b) - (c * d)` and the right expression `(f \^ g) / (h - i)`.

Thus, the final expression is:

Step 3: Conclusion.
The correct infix expression is option (3).

Step 1: Evaluate each statement.
- **A:** "The index specifies an offset from the beginning of the array to the element being referenced." This is true. In an array, the index is used to calculate the memory location of an element relative to the beginning of the array.

- **B:** "Declaring an array means specifying three parameters; data type, name, and its size." This is true. When you declare an array in most programming languages, you need to specify the data type, the array name, and the size of the array (the number of elements it can store).

- **C:** "The length of an array is given by the number of elements stored in it." This is true. The length of an array refers to the number of elements it holds.

- **D:** "The name of an array is a symbolic reference to the address of the first byte of the array." This is true. The name of the array typically refers to the base address, which is the memory location of the first element (or byte) of the array.

Step 2: Conclusion.
All the statements are true, so the correct answer is option (4) A, B, C and D.

Step 1: Evaluate each option.
- **A. The first index comes after the last index.** This is describing a **Head-tail Linked List**, where the first index is at the end after the last element. This matches with **I. Head-tail Linked List**.

- **B. More than one queue in the same array of sufficient size.** This describes a **Priority Queue**, where multiple queues can share the same memory space but have different priorities. This matches with **II. Priority Queue**.

- **C. Elements can be inserted or deleted at either end.** This describes a **Circular Queue**, where elements can be added or removed from both ends. This matches with **III. Circular Queue**.

- **D. Each element is assigned a priority.** This describes a **Multiple Queue**, where each element is assigned a specific priority. This matches with **IV. Multiple Queue**.

Step 2: Conclusion.
Thus, the correct answer is (1) A - I, B - II, C - III, D - IV.

Step 1: Understand the concept.
An **Abstract Data Type (ADT)** is a collection of data values and the operations that can be performed on them, but it is independent of any specific implementation. The operations on an ADT are specified logically, without concern for how they will be implemented.

Step 2: Evaluate other options.
- **Data Structure:** This is a concrete implementation of a collection of data and its operations, often tied to a specific programming language or machine.

- **Data Type:** Refers to the type of data (such as integer, float, etc.), but it does not involve a set of operations.

- **Array:** A type of data structure used to store a collection of elements, usually of the same type.

Step 3: Conclusion.
Thus, the correct term to describe a set of data values and operations that are abstracted from implementation details is **Abstract Data Type (ADT)**.