last

What will happen if you try to add an arriving plane to a full queue?

• The program crashes due to a segmentation fault.

• The program adds the plane to the queue anyway, overwriting existing planes.

• A warning message "Queue is full!" is displayed, and the plane is not added.

• he oldest plane in the queue is removed to make space for the new one.

Which of the following conditions is used to decide the position of a plane in the priority queue?

• Only the fuel level.

• Priority level and fuel level.

• Both priority and flight number.

• Only the priority level.

What is the purpose of the strcmp function in the code?

• To compare plane priorities.

• To verify if a flight number is valid.

• To check if the queue is full.

• To check if the returned plane structure is empty.

How does the program ensure that arrivingPlanes are sorted correctly?

• It sorts the queue after each insertion.

• It does not ensure sorting; the planes are appended to the end.

• It uses a heap-based priority queue.

• It shifts elements one position ahead in the array while inserting a plane based on its priority and fuel level.

Why are front and rear used in the Stack structure for departing planes?

• Front is used to track the next departing plane, and rear is used to manage the last added plane.

• Front is used for storing all planes, and rear is for tracking the first departing plane.
• Front is used to manage the last added plane, and rear is used to track the next departing plane.
• Front and rear are used interchangeably for any departing plane.

What is the correct way to create a new node in a binary tree in C?

• Allocate memory for the node, assign the value, and leave left and right uninitialized.

• Use malloc, assign the value, and do not set left and right explicitly.

• Allocate memory for the node, assign the value, and set left and right to NULL.

• Use calloc to allocate memory and initialize all fields to 0.

How can you perform an in-order traversal of a binary tree using recursion?

• In-order traversal visits nodes in the order: left subtree, current node, right subtree.
• In-order traversal visits nodes in the order: left subtree, right subtree, current node.
• In-order traversal visits nodes in the order: right subtree, current node, left subtree.
• In-order traversal visits nodes in the order: current node, left subtree, right subtree.

How can you count the total number of nodes in a binary tree?

• Use a recursive function to traverse the tree and count each node.
• Count nodes by checking the height of the tree.
• Use an iterative approach with a stack to count nodes.
• Count nodes by summing the values of all nodes.

Select the correct answer.

• Tree level by level.

• Root, left subtree, right subtree.

• Right subtree, root, left subtree.

• Left subtree, root, right subtree.

Explain the code how to checks if a binary tree is a binary search tree.

• The code checks if a binary tree is balanced by comparing the heights of its subtrees.
• The code verifies if all nodes have unique values regardless of their position in the tree.
• The code counts the number of nodes in the binary tree to determine if it is a binary search tree.
• The code checks if a binary tree is a binary search tree by validating that each node's value is within the allowed range defined by its ancestors.