Data Structure & Algorithm Solved Paper-2022|Solved Paper-Data Structure & Algorithm-BCA

1. Choose the correct option:                        (10 x 1=10)

(i) How many binary tree can be created with 3 nodes?

(a) 5

(b) 6

(c) 7

(d) None of the above

(ii) If an array is declared as int a[5][5], how many elements can be stored in it?

(a) 10

(b) 20

(c) 25

(d) None of the above

(iii) Which of the following is an application of stack?

(a) Recursion

(b) Evaluation of postfix expression

(c) Conversion of arithmetic expression from one notation to another

(d) All of the above

(iv) Which of the following data structure is used in Depth First Search?

(a) Stack

(b) Queue

(c) Array

(d) Tree

(v) Pop operation in a stack is performed

(a) At the middle of the stack

(b) At the bottom of the stack

(c) At the top of the stack

(d) None of the above

(vi) Which of the following rotation is called double rotation?

(a) LR

(b) RL

(c) Both (a) and (b)

(d) None of the above

(vii) Total number of nodes in the n^th level of a binary tree is given by

(a) 2ⁿ

(b) 2^n-1

(c) 2ⁿ⁺¹

(d) 2n

(viii) In queue insertion is done at

(a) Front end

(b) Middle end

(c) Rear end

(d) None of the above

(ix) A graph without any self-loop and parallel edge is called

(a) Complete graph

(b) Simple graph

(c) Acyclic graph

(d) None of the above

(x) Which of the following traversal prints the values in ascending order of a binary search tree?

(a) Pre order

(b) In order

(c) Post order

(d) None of the above