School of Computer Science Engineering and Technology

Course-B.Tech Type- Core

Course Code- CSET206 Course Name- DAA (Tutorial-5)

Year- 2024 Semester- EVEN

Date- 08/02/2024 Batch- 2022-2026

CO-Mapping
CO1 CO2 CO3
Q1 √
Q2 √

Objectives
1. Students will be able to design an algorithm for merging k-sorted list.
2. Students will be able to find maximum and minimum both simultaneously from a list
of n numbers

1. Consider four sorted lists of integers: List-1, List-2, List-3, and List-4.
Each list is sorted in ascending order.
List-1: [1, 4, 7, 10]
List-2: [2, 5, 8, 11]
List-3: [3, 6, 9, 12]
List-4: [13, 14, 15, 16]
Merged List: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16]
a. Your task is to design an efficient algorithm that takes these four
sorted lists as input and produces a single sorted list as output using
the Divide and Conquer approach.
b. Analyse the time complexity of your algorithm if there are k-sorted
lists each containing n/k elements.

2. Given an array of n integers,

a. Design a divide-and-conquer and combine(dcc)algorithm to find
both the maximum and minimum elements in the array.
b. What is the recurrence relation of your DCC algorithm?
School of Computer Science Engineering and Technology

c. Analyse the performance of your algorithm.