Scribd
Upload
4 views1 page

Cs206 Design and Analysis of Algorithm (Mid - sp23)

This document is a mid-semester examination paper for the course CS206 Design and Analysis of Algorithms at Birla Institute of Technology, Mesra, Ranchi. It consists of 5 questions, each worth 5 marks, covering topics such as algorithm efficiency, recurrence relations, quicksort, divide-and-conquer, and AVL trees. Students are instructed to attempt all questions and can assume any missing data suitably.

Uploaded by

All TechFact
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views1 page

Cs206 Design and Analysis of Algorithm (Mid - sp23)

This document is a mid-semester examination paper for the course CS206 Design and Analysis of Algorithms at Birla Institute of Technology, Mesra, Ranchi. It consists of 5 questions, each worth 5 marks, covering topics such as algorithm efficiency, recurrence relations, quicksort, divide-and-conquer, and AVL trees. Students are instructed to attempt all questions and can assume any missing data suitably.

Uploaded by

All TechFact
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

BIRLA INSTITUTE OF TECHNOLOGY, MESRA, RANCHI

(MID SEMESTER EXAMINATION SP2023)


CLASS: BTECH SEMESTER: VI
BRANCH: CP&P/MECH/PROD/ECE SESSION: SP/2023

SUBJECT: CS206 DESIGN AND ANALYSIS OF ALGORITHM


TIME: 02 Hours FULL MARKS: 25

INSTRUCTIONS:
1. The question paper contains 5 questions each of 5 marks and total 25 marks.
2. Attempt all questions.
3. The missing data, if any, may be assumed suitably.
4. Tables/Data handbook/Graph paper etc., if applicable, will be supplied to the candidates
-----------------------------------------------------------------------------------------------------------------------------

CO BL
Q.1(a) How do you measure the efficiency of an Algorithm? [2] CO-1 CO-5 BT-4
Q.1(b) Determine the best and worst conditions for the insertion sort algorithm's [3] CO-1 CO-3 BT-3
complexity?

Q.2(a) Define recurrence relation? [2] CO-1 BT-3


Q.2(b) Solve the recurrence relation using back substitution method [3] CO-1 CO-3 BT-4

Q.3(a) Solve using master theorem: T(n) = 4T(n/2) + n2log2n [2] CO-1 BT-2
Q.3(b) Explain quicksort with an example? [3] CO-2 BT-5

Q.4(a) What do you know about the divide-and-conquer algorithm? [2] CO-2 BT-2
Q.4(b) Briefly describe the maximum subarray problem using the divide-and-conquer [3] CO-2 CO-4 BT-3
method.

Q.5(a) What is the main idea of Transform and Conquer? [2] CO-3 BT-3
Q.5(b) Construct an AVL tree having the following elements: [3] CO-2 CO-4 BT-5
H, I, J, B, A, E, C, F, D, G, K, L

::::::28/02/2023::::::M

You might also like