Data Structure Quiz 15

If the weight of an edge already in a Minimum Spanning Tree (MST) is decreased, it remains the smallest possible edge for that cut, thus the tree remains an MST.

Inserting 1, 2, 3, 4, 5 into an AVL tree: 1, then 2 (right), then 3 (causes rotation, 2 becomes root), then 4 (right of 3), then 5 (causes rotation, 4 becomes right child of 3). The root is 2.

If all edge weights in a graph are unique, the greedy choice at each step of Kruskal's or Prim's algorithm is unambiguous, resulting in a unique MST.

After inserting 1, 2, 3, 4, 5, the tree structure is: 2 is root, 1 is left child, 4 is right child, 3 is left child of 4, 5 is right child of 4. The height is 2 (root at 0, children at 1, grandchildren at 2).

The expression ((a + b * c)) * d + e * (f + g) results in a tree where the root is the final '+'. The depth of the tree is 4 levels.

Inserting 1, 2, 3 requires one left rotation at 1. Inserting 4, 5 requires one left rotation at 3. Total rotations: 2.

&p is the address of variable p, which is given as 2568.

The expression is ((a + b * c)) * d + e * (f + g). The left subtree of the root (+) is ((a + b * c)) * d. This sub-expression has 7 nodes.

A spanning tree of a graph with V vertices always has V - 1 edges. If each edge has a cost of 2, the total cost is 2 * (V - 1).

The expression tree for ((a + b * c)) * d + e * (f + g) has a maximum depth of 4. At depth 4, there are 2 leaf nodes (e.g., 'a' and 'b' or similar depending on tree construction).

The expression is ((a + b * c)) * d + e * (f + g). The right subtree of the root (+) is e * (f + g). This sub-expression has 5 nodes.

To print array elements using a pointer, *(ptr + i) correctly dereferences the pointer offset by i.

Static variables or global variables (often referred to as S in such contexts) are allocated memory at compile time.

The expression '1 2 3 + * 3 2 1 - + *' is in postfix notation. Evaluating it: (1 * (2 + 3)) * (3 + (2 - 1)) = 5 * 4 = 20.

&q is the address of q (4284). *(&q) is the content at that address, which is 2568.

Graph traversal algorithms (like BFS/DFS) typically use White (unvisited), Grey (visiting), and Black (visited) colors. Red is not a standard color in this context.

The struct contains two char arrays of 10 bytes each (20 bytes), one char (1 byte), and one int (typically 4 bytes). Due to structure padding for alignment, the compiler often adds bytes to align the int, resulting in 24 bytes, but 23 is the raw sum. Given the options, 23 is the intended answer representing the total size of the members.

To read a string into a character array, you pass the base address of the array. S.first_name refers to the array, which decays to a pointer to its first element, making it the correct argument for scanf with the %s format specifier.

A stack is known as a push down list because it follows the Last-In-First-Out (LIFO) principle, where elements are added (pushed) and removed (popped) from the same end.

The other options pair a data structure with its primary application or property (Priority Queues with Heaps, B-Trees with indexing). A Binary Search Tree is a data structure, not a sorting algorithm itself, though it can be used for sorting.

Postfix expressions require a specific balance of operands and operators. Option D has too many operands relative to the number of operators, making it an invalid postfix expression.