Docsity
Docsity
Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity

Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips
Guidelines and tips
Sell on Docsity
Sell on Docsity
Docsity AI
Docsity AI
Log inSign up

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search for your university

Find the specific documents for your university's exams

Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents
download point icon20 Points

For each uploaded document

Answer questions
download point icon5 Points

For each given answer (max 1 per day)

All the ways to get free points
Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

topics for presentation, Study Guides, Projects, Research of Data Structures and Algorithms

University of Management and Technology (UMT)Data Structures and Algorithms

this document can be used for data structures topics selection

Typology: Study Guides, Projects, Research

2020/2021

Uploaded on 06/09/2021

sheikh_
sheikh_ 🇵🇰

2 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
PRESENTATION/PROJECT TOPICS
DATA STRUCTURE AND ALGORITHM
Instructor Name: Mr. Tahir Iqbal
Program: BSCS 4A/4B
Presentation Topics:
1. N-Queen algorithm
2. Back tracking
3. Enhancement of any sorting algorithm e.g. Merge, Quick, Bubble, Insertion, Selection
etc.
4. Bucket, Radix, Count sorting algorithms or any of two
5. Application of Graphs
6. Longest common subsequence
7. AVL Trees
8. Balanced Trees
9. Difference between 01 Knapsack/Fractional knapsack
10. Greedy Algorithm e.g. activity selection problem
11. Huffman Coding
12. Spanning Trees
13. Clustering e.g. K-Means Algorithm
Please Note:
Demonstration of code is compulsory along with presentation. Bonus marks for code execution
Presentations Date (25-May-2017 for section A) and (26-May-2017 for section B)
Presentation time: 10-15Minutes, Q/A session 10minutes
Report of 5-6 pages has to be submitted before 23-May-2017. (Late submission will not be
accepted)
Max group of three members, each member would be assessed individually
Good luck

Partial preview of the text

Download topics for presentation and more Study Guides, Projects, Research Data Structures and Algorithms in PDF only on Docsity!

PRESENTATION/PROJECT TOPICS

DATA STRUCTURE AND ALGORITHM

Instructor Name: Mr. Tahir Iqbal Program: BSCS 4A/4B

Presentation Topics:

1. N-Queen algorithm

2. Back tracking

3. Enhancement of any sorting algorithm e.g. Merge, Quick, Bubble, Insertion, Selection

etc.

4. Bucket, Radix, Count sorting algorithms or any of two

5. Application of Graphs

6. Longest common subsequence

7. AVL Trees

8. Balanced Trees

9. Difference between 01 Knapsack/Fractional knapsack

10. Greedy Algorithm e.g. activity selection problem

11. Huffman Coding

12. Spanning Trees

13. Clustering e.g. K-Means Algorithm

Please Note:

 Demonstration of code is compulsory along with presentation. Bonus marks for code execution  Presentations Date ( 25 - May- 2017 for section A) and ( 26 - May- 2017 for section B)  Presentation time: 10 - 15Minutes, Q/A session 10minutes  Report of 5 - 6 pages has to be submitted before 23 - May- 2017. (Late submission will not be accepted)  Max group of three members, each member would be assessed individually Good luck 