Scribd
Upload
213 views1 page

DSA Assignment - 1

The document outlines an assignment for a Data Structures and Algorithms course. It includes 8 questions: 1) Defining key terms, 2) Discussing performance analysis of algorithms, 3) Explaining asymptotic notations, 4) Writing the precondition and algorithm for binary search, 5) Writing and discussing the efficiency of selection sort, 6) Writing an insertion sort algorithm with an example, 7) Applying bubble sort to a list of numbers and reporting the result after 3 passes, and 8) Sorting a list of numbers using quick sort and heap sort, showing the step-by-step processes.

Uploaded by

Project Tims
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
213 views1 page

DSA Assignment - 1

The document outlines an assignment for a Data Structures and Algorithms course. It includes 8 questions: 1) Defining key terms, 2) Discussing performance analysis of algorithms, 3) Explaining asymptotic notations, 4) Writing the precondition and algorithm for binary search, 5) Writing and discussing the efficiency of selection sort, 6) Writing an insertion sort algorithm with an example, 7) Applying bubble sort to a list of numbers and reporting the result after 3 passes, and 8) Sorting a list of numbers using quick sort and heap sort, showing the step-by-step processes.

Uploaded by

Project Tims
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

PARUL UNIVERSITY

Course code: 203105205


Course title: Data Structures and Algorithms
Assignment-1
1) Define the following terms
a. Data Structures
b. Algorithm
c. Primitive and Non-Primitive Data Types
d. Linear and Non-Linear Data Structures
e. Stable Sorting Algorithms
f. In-place Sorting Algorithms

2) Write short note on performance analysis and performance measurement of an algorithm.

3) Why do we use asymptotic notations in the study of algorithms? Briefly describe the commonly
used asymptotic notations.

4) Write down precondition and algorithm of binary search method.

5) Write a selection sort algorithm and also discuss its efficiency.

6) Write an algorithm for Insertion sort method. Explain each step with an example.

7) Sort the following values using Bubble Sort. Give the result after pass-3.
80 60 90 50 40 30 10 100 20 10

8) Sort the following values using Quick Sort and Heap Sort. (Show the step-by-step process)
10 80 30 90 40 50 70

You might also like