Scribd
Upload
4 views1 page

Class Test1

This document outlines the B. Tech Odd Semester Class Test-1 for the Department of Computer Science and Engineering at ABES Engineering College, Ghaziabad. It includes instructions for the test, a breakdown of questions across different sections, and the maximum marks for each question. The test focuses on algorithm performance analysis, sorting algorithms, and solving recurrence relations.

Uploaded by

peep8158
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

Class Test1

This document outlines the B. Tech Odd Semester Class Test-1 for the Department of Computer Science and Engineering at ABES Engineering College, Ghaziabad. It includes instructions for the test, a breakdown of questions across different sections, and the maximum marks for each question. The test focuses on algorithm performance analysis, sorting algorithms, and solving recurrence relations.

Uploaded by

peep8158
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

ABES Engineering College, Ghaziabad

Department of Computer Science and Engineering


B. Tech Odd Semester Class Test-1

Semester: V Session: 2023-24


Course Code: KCS503 Roll No.:
Course Name: DAA Time: 1.Hrs.
Maximum Marks: 20
Instructions:
1. Attempt Allsections.
2. If require any missing data, then choose suitably.

Q. No. Question Marks CO KL PI


Section-A Total Marks : 20
1 Attempt ALL part from the following Same K Levels Questions

a) Explain how algorithms performance is analyzed? 2 CO1


Solve the recurrence using master’s theorem.
b) 2 CO1
T (n) = 4T(n/2) + 𝑛2
2 Attempt ALL part from the following Same K Levels Questions

Write an algorithm for insertion sort. Discuss best case time


a) 3 CO1
complexity of insertion sort and prove it.
Illustrate the operation of counting sort on the following
b) array: A= {2,5,3,0,2,3,0,3} 3 CO1

3 Attempt ALL part from the following Same K Levels Questions


Solve the given recurrence relation using recursion tree
method.
a) 5 CO1
T (n) = 3T (n/4) + cn2

Write Merge Sort Algorithm. And sort the following


b) sequence {12, 31, 25, 8, 32, 17, 40, 42} using merge 5 CO1
sort.

CO Course Outcomes mapped with respective question


KL Bloom's knowledge Level (K1, K2, K3, K4, K5, K6)
K1-Remember,K2-Understand,K3-Apply,K4-Analyze,K5:Evaluate,K6-Create

You might also like