Project Proposal- DSA

docx

School

University of New South Wales *

*We aren’t endorsed by this school

Course

COMP9313

Subject

Computer Science

Date

Nov 24, 2024

Type

docx

Pages

Uploaded by MateRose10751

NAME- Sajeev Singh NETID- ss4801 Project Proposal: Enhancing Merge Sort Efficiency - A Research-Based Exploration Introduction: Merge Sort is a classic sorting algorithm known for its stability and efficiency. This project aims to delve into enhancements and optimizations proposed by researchers to improve the efficiency of Merge Sort, as outlined in the research paper titled "Parallel Merge Sort" ( https://arxiv.org/abs/1406.2628 ) and "Efficient Parallel Implementation of Merge Sort Algorithm" ( https://ieeexplore.ieee.org/document/10151579 ). This exploration will involve understanding the proposed improvements, implementing them in Python, and conducting a comprehensive performance analysis. Objectives: 1. Literature Review:  Analyze the research paper "Parallel Merge Sort" ( https://arxiv.org/abs/1406.2628 ) and "Efficient Parallel Implementation of Merge Sort Algorithm" ( https://ieeexplore.ieee.org/document/10151579 ) to understand the enhancements proposed by researchers. 2. Implementation and Extension:  Implement the original Merge Sort algorithm in Python as a baseline.  Incorporate the enhancements proposed in the research papers to explore parallelization and other optimizations. 3. Performance Analysis:  Conducting a thorough performance analysis of the enhanced Merge Sort algorithm.  Evaluating time complexity, space complexity, and practical performance under various input scenarios. 4. Documentation and Presentation:  Documenting the entire process, including insights gained from the research papers and challenges faced during implementation.  Providing clear and well-documented Python code for the implemented enhancements.  Recording a five-minute video presentation explaining the chosen topic, insights gained, and a walkthrough of the implemented enhancements. Methodology:

1. Research Paper Analysis:  Conducting a detailed analysis of the research papers, focusing on the proposed enhancements to Merge Sort. 2. Implementation:  Developing Python implementations for both the original and enhanced versions of Merge Sort.  Experimenting with modifications suggested in the research papers, such as parallelization strategies. 3. Performance Analysis:  Design a suite of test cases to evaluate the performance of the enhanced Merge Sort algorithm.  Measure and analyze time complexity, space complexity, and practical performance metrics under different scenarios. 4. Documentation and Presentation:  Create comprehensive documentation summarizing your findings, including insights gained and challenges faced.  Provide clear and well-documented Python code for the implemented enhancements.  Record a five-minute video presentation providing an overview of the research, explaining your implementation choices, and showcasing the performance analysis results. Expected Outcomes: 1. Implementation of Enhanced Merge Sort:  Successfully implement the enhancements proposed in the research papers. 2. Insights into Performance Improvements:  Gain insights into how the enhancements affect the time and space complexity of Merge Sort. 3. Documentation and Presentation:  Provide a clear and well-documented project report along with a video presentation summarizing the research and implementation. Resources:  Research papers: "Parallel Merge Sort" ( https://arxiv.org/abs/1406.2628 ) and "Efficient Parallel Implementation of Merge Sort Algorithm" ( https://ieeexplore.ieee.org/document/10151579 ).

Your preview ends here

Eager to read complete document? Join bartleby learn and gain access to the full version

Access to all documents
Unlimited textbook solutions
24/7 expert homework help

Related Documents

MCV4U Implicit Differentiation.docx

MSIT 5216 Portfolio Activity Unit 7.docx

DBA 1.07 Study Guide.docx

Identifying claims and support for argumentative Assignment.docx

Quiz 6 Q 8.png

WhatsApp Image 2023-11-17 at 1.20.20 PM.jpeg

Module 12; NS Quiz 3_ Attempt review.pdf

Screenshot (520).png

Week 3 Data Analysis_Multi_Dimensional Visualization.docx

Long Quiz 001 - (27).png

módulo 4 tarea (ensayo) (815)_Page_12.png

project 3.docx

Recommended textbooks for you

C++ Programming: From Problem Analysis to Program...

Computer Science

ISBN:9781337102087

Author:D. S. Malik

Publisher:Cengage Learning

C++ for Engineers and Scientists

Computer Science

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Course Technology Ptr

Systems Architecture

Computer Science

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Cengage Learning

Programming Logic & Design Comprehensive

Computer Science

ISBN:9781337669405

Author:FARRELL

Publisher:Cengage

EBK JAVA PROGRAMMING

Computer Science

ISBN:9781337671385

Author:FARRELL

Publisher:CENGAGE LEARNING - CONSIGNMENT

Np Ms Office 365/Excel 2016 I Ntermed

Computer Science

ISBN:9781337508841

Author:Carey

Publisher:Cengage

SEE MORE TEXTBOOKS

Recommended textbooks for you

C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Np Ms Office 365/Excel 2016 I Ntermed
Computer Science
ISBN:9781337508841
Author:Carey
Publisher:Cengage