Pimpri Chinchwad Education Trust’s

Pimpri Chinchwad College of Engineering & Research

Ravet, Pune
Academic Year: 2020 - 21 Assignment No. : 3 Term: I

Department: Computer Engineering Class: S.E Div:-A

Subject Name: Fundamentals of Data Structures

Course Objectives

To understand various data searching and sorting methods.

Course Outcomes

C202.3 Analyze the different searching and sorting techniques based on

BT4
computational efficiency of the algorithms.

No. Question CO

1 Search for 81 using Fibonacci search in the list {6, 14, 23, 36, 55, 67,76, 78, C202.3
81, 89}, where n =10. BT4

2 Write down the iteration for bubble sort for sorting 76,67,36,55,23,14,06. Also C202.3
calculate the time complexity. BT4
3 Consider the given unsorted array. Sort this array in ascending order C213.3
using insertion sort. Calculate time complexity. BT4

4 Implement a pseudo code to search an element in an array by using Binary C202.3

Search. Explain Time complexity for the same. Also write down advantages BT4
and disadvantages of Binary Search.
5 Implement a program to sort the elements using Quick sort also explain its C202.3
time complexity. BT4

Subject I/C
Mrs. Madhuri H Badole

Rev.: 00 Date: 03-12-2018 Page 1 of 1