Department of Computer Science & Engineering

MBM University, Jodhpur

Subject: Design & Analysis of Algorithms Name:
Time: 01 Hour Roll No.:

Q1. Write an algorithm to find out the middle element in the given unsorted list. The
algorithm must complete in minimum time.

Q2. The postfix form of the expression (A + B) * (C * D - E) * F / G is

Q3. A binary tree in which if all its levels except possibly the last, have the maximum
number of nodes and all the nodes at the last level appear as far left as possible, is
known as

Q4. Calculate the complexity of the insertion sort/bubble sort.

Q5. Find the complexity of the following functions

(a) T(n) = T(n/2) + n

(b) T(n) = 2T(n/2) + 2n

Page 1 of 2
 Department of Computer Science & Engineering
MBM University, Jodhpur
Subject: Design & Analysis of Algorithms Name:
Time: 01 Hour Roll No.:
(c)
Q6. ABCDE-FG /

Page 2 of 2