Project Proposal: Implementing a Bubble Sort Algorithm in Assembly Language (PDF)

**Project Proposal** **Submitted by** 1^st^ Student Name {Enrolment Number } 2^nd^ Student Name {Enrolment Number } **Faculty of Computing and Engineering Sciences** Shaheed Zulfiqar Ali Bhutto Institute of Science and Technology, Larkana. **Project Proposal: Implementing a Bubble Sort Algor...

**Project Proposal** **Submitted by** 1^st^ Student Name {Enrolment Number } 2^nd^ Student Name {Enrolment Number } **Faculty of Computing and Engineering Sciences** Shaheed Zulfiqar Ali Bhutto Institute of Science and Technology, Larkana. **Project Proposal: Implementing a Bubble Sort Algorithm in Assembly Language** 1\. Introduction Sorting algorithms constitute a critical component of computer science. The following project will attempt to implement the bubble sort algorithm in assembly language. That is, the assembly language is a very low-level programming language and creates a possibility to understand how algorithms work at the machine level. This is a simple sorting algorithm, known as the bubble sort, which has the algorithm repeatedly step through the list, compares adjacent elements, and swaps them if they are in the wrong order. This project will not only enhance my understanding of sorting algorithms but also improve my skills in data manipulation and low-level programming. This will involve setting up an array of integers, running the bubble sort algorithm on it, and then outputting the array sorted. By this, I will be able to find out how efficient the bubble sort is when compared with other methods of sorting along with its time complexity. Also, while practicing it, I will be able to know more about the process of memory management in the assembly language. In all, this project is one of the basic exercises of algorithm design and implementation with deeper understanding of the problems in the process of data sorting. 2\. Objective A software to design the representation of the given problem-to implement bubble sort-through the coding of implementation for sorting in ascending the numbers in (8086)x86 assembly. 3\. Problem Description What Implement the bubble sort algorithm in assembly language. The goal will be to sort a list of integers, so an exploration of algorithmic efficiency and data manipulation at the level of assembly language can take place. Why Sorting is one of the basic operations in computer science. Understanding the different types of sorting algorithms is necessary to handle data efficiently. Though not the most efficient algorithm, bubble sort is a very clear example of basic principles of sorting. The transition from high-level programming to assembly language is challenging because one has to manually manage memory and use registers, which are essential for developing a full understanding of how computers process data. Advantages and Features I will learn the algorithm structure and performance metrics while implementing bubble sort. This will also help in understanding why we need to have better algorithms like quicksort or mergesort for our next projects. 4\. Methodology To approach the project, the following will be implemented: Algorithm: Choose to implement the bubble sort algorithm because it is very straightforward and easy to understand. Assembly Language: Use x86 assembly language to manipulate registers and access memory. Testing and Verification Create a set of test cases involving predefined inputs for validating that the sorting implementation works properly. Performance Analysis: Test for the time complexity and the efficiency of the bubble sort algorithm with different test scenarios. 5\. Project Scope The project involves only the implementation of the assembly language for the purpose of using the bubble sort algorithm. It will not engage with other sorting algorithms nor advanced optimizations. The assumed working conditions are that of a single-threaded environment and that given data size is manageable through the constraints of assembly level programming. 6\. Feasibility Study i\. Risks Associated Potential risks include: This assembly language is quite complex. Though with considerable study and practice, I will be able to decrease such complexity. Debugging Difficulty: Debugging low-level code can be complex; I will use systematic testing and debugging tools. ii\. Resource Needs I will need: A computer with x86 architecture. An assembler, such as NASM to assemble the assembly code. A text editor to type in the code. 7\. Tools/Technology Hardware: A personal computer with x86 architecture. Software: NASM assembler, a text editor (e.g., Visual Studio Code), and a terminal for running the code. 8\. References Wirth, Niklaus. Algorithms + Data Structures = Programs. Englewood Cliffs: Prentice-Hall, 1976. Pp. 123-130. Knuth, Donald E. The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley: Boston, 1998: pages 1-10. Internet Web page: \"Bubble Sort Algorithm.\" GeeksforGeeks, 2023. Accessed October 1, 2023. https://www.geeksforgeeks.org/bubble-sort-algorithm/.