A complete binary tree with 2n+1 nodes contains:

Here are the solutions to questions 19-35: Question 19: A complete binary tree with 2n+1 nodes contains: In a complete binary tree with N total nodes, the number of leaf nodes L and non-leaf nodes I are related by N = 2L - 1 and I = L - 1. Given N = 2n+1: 2n+1 = 2L - 1 2L = 2n+2 L = n+1 leaf nodes. I = L - 1 = (n+1) - 1 = n non-leaf nodes. Assuming 'N' in the options refers to 'n' from the question's 2n+1: The tree contains n non-leaf nodes. The correct option is B. Question 20: A sort which searches through a list to exchange the first element with any element less than it and then repeats with a new first element at subsequent positions is called: This description matches the behavior of a selection sort, where the smallest (or largest) element is repeatedly selected from the unsorted portion and moved to its correct position. The correct option is B. Question 21: The data structure required to evaluate a postfix expression is: Postfix expressions are evaluated using a stack. Operands are pushed onto the stack, and when an operator is encountered, the necessary operands are popped, the operation is performed, and the result is pushed back. The correct option is A. Question 22: The feature of the object oriented paradigm which explicitly helps code reuse is: Inheritance allows a new class to reuse, extend, or modify the behavior of an existing class, directly promoting code reuse. The correct option is C. Question 23: The main advantage of a multiprogramming system is: Multiprogramming increases CPU utilization by allowing the CPU to switch to another job when one job is performing I/O. This leads to more jobs being processed concurrently and generally faster completion of a set of jobs. All the listed options are advantages. The correct option is D. Question 24: An object encapsulates: Encapsulation in object-oriented programming refers to the bundling of data (attributes or state) and the methods (behavior) that operate on that data into a single unit, which is an object. The correct option is D. Question 25: If a program in its functioning has not met user requirements in some way, then it is: When a program fails to meet user requirements, it is considered a failure. A failure is the inability of a system to perform its required function. The correct option is B. Question 26: Which of the following is not true of a stack? A stack is a Last-In, First-Out (LIFO) data structure where both push (add) and pop (remove) operations occur at the same end, called the "top" of the stack. They are not done at both front and rear simultaneously. The correct option is D. Question 27: Dequeue() operation is best known as: In a queue, the enqueue() operation adds an element to the rear, and the dequeue() operation removes an element from the front. The correct option is C. Question 28: If there are no base cases in a recursive program, the program will: A base case is essential for a recursive program to terminate. Without it, the function will call itself indefinitely, leading to a stack overflow error and effectively executing indefinitely. The correct option is C. Question 29: Which of the following is true of the characteristics of abstract data types? An Abstract Data Type (ADT) defines a data type by its behavior, specifying the set of values it can hold and the set of operations that can be performed on it. Both statements are true. The correct option is A. Question 30: Which of the following data structures can't store the non-homogeneous data elements? Arrays are typically designed to store elements of the same data type (homogeneous). Records (or structs) are specifically designed to store non-homogeneous data. Stacks, if implemented using arrays, would also be homogeneous. The correct option is A. Question 31: It is a non-linear data structure? Linear data structures arrange elements sequentially (e.g., stacks, lists, strings, arrays). Non-linear data structures arrange elements hierarchically or in a network (e.g., trees, graphs). The correct option is D. Question 32: The number of comparisons done by a sequential search is? For a sequential (linear) search in a list of N elements, the average number of comparisons for a successful search is (N+1)/2. The correct option is B. Question 33: What will be the output in the following code fragment? integer k; for(k=0;k>9;k+=3) DISPLAY ("Hello"); `` The loop condition k>9 is evaluated at the beginning of each iteration. Initially, k is 0. Since 0 > 9 is false, the loop body will never execute. The correct option is A. Question 34: The postfix form of the expression (A+B)(CD-E)*F/G is? Let's convert the infix expression to postfix: 1. (A+B) → AB+ 2. (CD-E) → (CD-E) → CD*E- 3. Combine: (AB+) (CDE-) * F / G 4. Apply operators from left to right based on precedence: AB+ CDE- → AB+CDE- AB+CDE- F → AB+CDE-F AB+CDE-F G / → AB+CDE-FG/ The correct option is B. Question 35: Virtual memory is: Virtual memory is a memory management technique that gives the illusion to a program that it has a large, contiguous address space, even if the physical memory is smaller or fragmented. It uses secondary storage (disk) to extend the apparent size of RAM. The correct option is C. Drop the next question.