Lab Notes: Software Eng., Project Mgmt., Linear Search, Quick Sort, and Page Replacement, Summaries of Software Project Management

Download Lab Notes: Software Eng., Project Mgmt., Linear Search, Quick Sort, and Page Replacement and more Summaries Software Project Management in PDF only on Docsity!

LAB FILE

STUDENT DETAILS :

Faaizah Qadri 500109400 Batch 03 NH

PROGRAMME DETAILS :

Course : Software Engineering and Project Management Submitted to : Dr. Tanu Singh

Activity 1 : Linear Search

• Requirements of Linear Search A linear search is the simplest approach employed to search for an element in a data set. From the beginning to the end of the data collection, it looks at every element until it finds a match. After the target element is found the search for it comes to an end. The algorithm must stop running and produce a suitable result if it cannot locate a match. The linear search algorithm is easy to implement and efficient in two scenarios: When the list contains lesser elements When searching for a single element in an unordered array
• Procedure

1. Start from the very first element of the array or list.
2. Compare each element in the list with the target value you're searching for.
3. Return the element's index or location if a match is found.
4. Return a message stating that the element was not discovered if the last item in the list is reached without a match.

• Output Index of the target element if found; otherwise, indicate that the element is not present.

Activity 3 : Page Replacement Algorithm

• Requirements of Page Replacement Algorithm Page replacement algorithms are used in operating systems to manage memory and determine which pages should be swapped out to disk and which can remain in physical memory (RAM). Performance trade-offs and features vary amongst page replacement algorithms. Among the most widely used page replacement algorithms are Optimal, LRU (Least Recently Used), and FIFO (First-In-First-Out). The memory capacity of the system, the workload, and the required performance have an effect on the choice of algorithm to be implemented. - (^) Efficient memory utilisation: Make maximal use of the RAM that is available by loading the pages that are absolutely necessary and properly removing the ones that are not. - (^) Fairness: To avoid excessive swapping, treat all processes equally when it comes to page allocation and replacement. - (^) Low overhead : To prevent affecting system performance as a whole, the method itself should have a small processing overhead and memory footprint. - (^) Adaptability : Be able to modify workload parameters and program behaviours in order to preserve peak performance.
• Procedure - (^) Monitoring Page References: Monitor the order in which a process makes page references. - (^) Page Replacement Trigger: Start the page replacement procedure when a page reference is made and the page is not in the current memory. - (^) Page Replacement algorithms: Apply methods like First-In-First-Out (FIFO), Least Recently Used (LRU) etc. Choose the page to be replaced by applying the chosen algorithm. - (^) Update Memory: Choose a new page from the reference sequence and replace the current page. Update any data structures to the page replacement if needed.

• Output Updated memory with the latest pages.