Shri Ramdeobaba College of Engineering and Management, Nagpur-13

Department of Information Technology

Assignment-01
Course: Data Structures, ITT 258, IV Semester IT

Date: 27-04-2022, Wednesday

Last date of Submission: 04-05-2022

Marks: 05

Course Outcomes: CO1, CO2, CO4

Q1. Write a Recursive program for Binary Search. Write the recurrence relation for the algorithm and
solve it to derive the complexity of the algorithm.

Q2. Write a Recursive program for computing a n using Divide and Conquer paradigm. Write the
recurrence relation for the algorithm and solve it to derive the complexity of the algorithm.

Q3. Write separate programs:

1. To merge two sorted List to create a single sorted list

2. To merge two unsorted lists to create a sorted list

Compare the complexities of above two algorithms

Important Instructions:

1. Explain the logic of your code before execution.

2. Write generic programs taking inputs from the user wherever necessary.
3. Explain the purpose of different variables / functions used and assumptions, if any.
4. Do not forget to mention and justify Time Complexity of your code. Derive complexity
wherever asked.
5. Create a single pdf containing the three assignments and name them as “Ass-I<Name>-
<RollNo> . For example if name is Sandeep Agrawal and roll number is 10 then the pdf name
is: Ass-I-Sandeep Agrawal-10
Note: Assignment Submission will be considered for evaluation only if a single pdf
containing all three assignments is submitted as per the naming format specified.
Submit your assignments to: 4sit2022@gmail.com on or before 04-05-2022 (5 pm).
6. Please do not send multiple submissions and generic messages on the above mail.
7. Late submission will be considered as no submission.

Dr. D.S. Adane

(Course Coordinator)