Scribd
Upload
33 views1 page

Assignment Unit 3

This document contains an assignment on data structures for a third semester B.Tech computer science course. It includes 10 questions covering topics like binary search, insertion sort, quick sort, merge sort, heap sort, radix sort, hashing, bubble sort, selection sort, and algorithms for quick and merge sort. Students are asked to write programs, explain sorting algorithms, determine algorithm complexities, sort example values, and describe hashing and hash functions.

Uploaded by

itsm8011
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
33 views1 page

Assignment Unit 3

This document contains an assignment on data structures for a third semester B.Tech computer science course. It includes 10 questions covering topics like binary search, insertion sort, quick sort, merge sort, heap sort, radix sort, hashing, bubble sort, selection sort, and algorithms for quick and merge sort. Students are asked to write programs, explain sorting algorithms, determine algorithm complexities, sort example values, and describe hashing and hash functions.

Uploaded by

itsm8011
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

Dronacharya Group of Institutions, Greater Noida

#27, Knowledge Park-III, Greater Noida, U.P.


ODD Semester 2023-24
Course/Branch: B. Tech /CSIT/AIML
Semester: III
Subject Name: Data Structures
Subject Code: BCS301

ASSIGNMENT- UNIT-3

Q1. Differentiate sequential search and binary search. Write the program for binary search
(Recursive and Non-recursive)

Q2. Write a short note on insertion sort. AKTU 2014-15, Marks 05

Q3. What is Quick sort method? Determine its complexity. Sort the given values using quick
sort. Present all steps/iterations 38,81,22,48,13,69,93,14,45,58,79,72. AKTU 2016-17, 2018-
19, Marks 07

Q4. Write an algorithm for merge sorting. Using the algorithm sort in ascending order: 10,
25, 16, 5, 35, 48, 8 and derive the complexity of merge sort.
AKTU 2014-15, Marks 10

Q5. Explain heap sort. AKTU 2014-15, 2017-18, Marks 10

Q6. Explain radix sort. AKTU 2017-18, Marks 5

Q7. What is hashing? Give the characteristics of hash function. Explain collision resolution
technique in hashing AKTU 2014-15, 2017-18 Marks 10

Q8. How does bubble sort work? Explain.

Q9. How does selection sort work? Explain.

Q10. Write the Algorithm of Quick and Merge Sort.

You might also like