1. A binary tree of depth 𝑑 is a complete binary tree if:

1. Each leaf in the tree is either at level 𝑑 or at level (𝑑 −1)
2. For any node n𝑑 in the tree with a right descendent at level 𝑑 all the left descendents of n𝑑 that are leaves are also at level 𝑑

Which of the above statements is/are correct?
(a) 1 only
(b) 2 only
(c) Both 1 and 2
(d) Neither 1 nor 2

Answer: (a)

2. A binary tree has 𝑛 levels and the root level is zero. Then the maximum total number of nodes will be:

Answer: (b)

3. A complete binary tree having 𝑛 leaf nodes has how many nodes of degree 2?

Answer: (b)

4. Which one of the following registers facilitates referencing parameters passed on the stack in 8086 architecture?

(a) DI and SI index registers
(b) CS and DS segment registers
(c) SP and BP pointer registers
(d) AX and DX general purpose registers

Answer: (c)

5. Consider the following statements:

1. Clear instruction register
2. Clear accumulator
3. Initialize program counter
4. Reset the processor
5. Clear all flags

Which of the above statements is/are essential in a program which uses subroutines?
(a) 1 only
(b) 1 and 4 only
(c) 5 only
(d) 1, 2, 3, 4 and 5

Answer: (a)

6. The contents of DE and HL register pairs after the execution of the following
instructions are:
(a) 0200𝐻 ,2700𝐻
(b) 2700𝐻 ,0200𝐻
(c) 2500𝐻 ,0200𝐻
(d) 0200𝐻 ,2500𝐻

Answer: (b)

7. How many times does the loop execute before coming out of the loop from the following instructions?
(a) 0
(b) 255
(c) 256
(d) 555

Answer: (c)

8. The effective and well established technique to catch inconsistency in programs is called:

(a) Type checking
(b) Error checking
(c) Type casting
(d) Bounds checking

Answer: (a)

9. The category of software maintenance which fixes errors in the original system design and implementation is:

(a) Perfective maintenance
(b) Adaptive maintenance
(c) Corrective maintenance
(d) Software maintenance

Answer: (c)

10. Which one of the following techniques can be used for implementing different type of Virtual memory?

(a) Segmentation
(b) Fragmentation
(c) Reassembly
(d) Reallocation

Answer: (a)