Scribd
Upload
52 views1 page

Design & Analysis of Algorithms Lab: (Using Java and Dot Net Framework)

This document outlines an algorithms lab that includes programming assignments for common sorting algorithms like heap sort, merge sort, quick sort, selection sort and insertion sort using Java and .NET. It also covers the theoretical study of NP-complete problems, Cook's theorem and sorting networks.

Uploaded by

Dr. Smita Agarwal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
52 views1 page

Design & Analysis of Algorithms Lab: (Using Java and Dot Net Framework)

This document outlines an algorithms lab that includes programming assignments for common sorting algorithms like heap sort, merge sort, quick sort, selection sort and insertion sort using Java and .NET. It also covers the theoretical study of NP-complete problems, Cook's theorem and sorting networks.

Uploaded by

Dr. Smita Agarwal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Design & Analysis of Algorithms Lab

(Using Java and Dot Net Framework )

1. Program for Recursive Binary & Linear Search.


2. Program for Heap Sort.
3. Program for Merge Sort.
4. Program for Selection Sort.
5. Program for Insertion Sort.
6. Program for Quick Sort.
7. Study of NP-Complete theory.
8. Study of Cook’s theorem.
9. Study of sorting network.

You might also like