http://dspace.mist.ac.bd:8080/xmlui/handle/123456789/63 Tue, 12 May 2026 10:07:00 GMT 2026-05-12T10:07:00Z http://dspace.mist.ac.bd:8080/xmlui/handle/123456789/185 Optimizing Divide and Conquer Based Algorithms: the Case of Heapsort Lutfor, Abu Sa-Adat Mohammed Moinul Hasan; Islam, Md. Shahidul; Dey, Arup Kanti The divide and conquer approach is very useful in computer science applications. With this approach a large problem is broken down into small and manageable subproblems and each is solved separately. Then these solutions are combined to give the final solution to the problem. This paper presents a discussion on the divide and conquer based techniques for various sorting algorithm with special emphasis on heap sort. Most divide and conquer approach divides a problem into two subproblems recursively. The thesis shows that ternary systems are more promising than the more traditional binary systems used in the divide and conquer approach. In particular, heap on ternary tree does indicate some theoretical advantages over the more established binary systems. The paper also makes an endeavour to present a set of simulations with random numbers for both integers and floating point numbers to support our theoretically proven claim. For doing so, at first algorithm for conventional binary heapsort has been modified for three and four child heapsort. Thereafter, the paper finds out number of comparisons required, number of movements required and time taken for all the three systems. Experimental results clearly state that in most cases three child heasort demonstrates better performance than both binary and four child version of heapsort. The experimental data with graphical representation have also been presented to support the analysis. This experiment can surely be a guide to establish more promising ternary system in applications related to divide and conquer technique with the motivation- ‘A little advantage in optimization can be proven very useful in implementation of large systems’. Sun, 01 Dec 2013 00:00:00 GMT http://dspace.mist.ac.bd:8080/xmlui/handle/123456789/185 2013-12-01T00:00:00Z http://dspace.mist.ac.bd:8080/xmlui/handle/123456789/184 A New Algorithm for Solution of System of Linear Equations Maowa, Jannatul; Kabir, Sraboni; Khosru, Ibn Md. Abu Saleh Systems of linear equations are used in a variety of fields. The canonical problem of solving a system of linear equations arises in numerous contexts in information theory, communication theory, and related fields. This thesis is aimed at analyzing the available methods for solving a system of linear equations of the form n x n. Using a couple of iterative and/or direct methods, implement a program for these methods that could be run for different dimension size n of system of linear equation . At the end, a graph can be plotted with time taken for execution of a method considered V/s dimension size n. In this contribution, we develop a solution that does not involve direct matrix inversion. The iterative nature of our approach allows for a distributed message-passing implementation of the solution algorithm. We present test results which show that our solver achieves good results, both in terms of numerical accuracy as well as computing time. Furthermore, even very large systems (n 1000) can be solved given a cluster with sufficient resources. We also address some properties of the algorithm, including convergence, exactness, its complexity order and relation to classical solution methods. Sat, 01 Dec 2012 00:00:00 GMT http://dspace.mist.ac.bd:8080/xmlui/handle/123456789/184 2012-12-01T00:00:00Z http://dspace.mist.ac.bd:8080/xmlui/handle/123456789/171 A New Algorithm for Solution of System of Linear Equations Iftekharul Hoque, Md.; Nur-E-Arefin, Md.; Saiful Ahmad, Md Systemsoflinearequationsareusedinavarietyoffields. Thecanonicalproblemofsolving a system of linear equations arises in numerous contexts in information theory, communication theory, and related fields. This thesis is aimed at analyzing the available methods for solving a system of linear equations of the form n x n. Using a couple of iterative and/or direct methods, implement a program for these methods that could be run for different dimension size n of system of linear equation . At the end, a graph can be plotted with time taken for execution of a method considered V/s dimension size n. In this contribution, we develop a solution that does not involve direct matrix inversion. The iterative nature of our approachallowsforadistributedmessage-passingimplementationofthesolutionalgorithm. We present test results which show that our solver achieves good results, both in terms of numerical accuracy as well as computing time. Furthermore, even very large systems (n≤ 1000) can be solved given a cluster with sufficient resources. We also address some properties of the algorithm, including convergence, exactness, its complexity order and relation to classical solution methods. Sat, 01 Dec 2012 00:00:00 GMT http://dspace.mist.ac.bd:8080/xmlui/handle/123456789/171 2012-12-01T00:00:00Z http://dspace.mist.ac.bd:8080/xmlui/handle/123456789/170 A Cost Effective Regression Testing Approach for Web Application Nahar Jesy, Sumsun; Raihan Majumder, Md.; Arifur Rahman, Md. Regression testing is an expensive testing procedure utilized to validate modified software. Duringregressiontesting,amodifiedsystemisretestedusingtheexistingtestsuite. Because the size of the test suite may be very large, testers are interested in detecting faults in the systemasearlyaspossibleduringtheretestingprocess. Regressiontestselectiontechniques attempt to reduce the cost of regression testing by selecting a subset of a program’s existing testsuite. Inthispaperwehavebrieflydiscussedtwooftheselectiontechniquesandchoose the safe algorithm technique. The previous researches indicate that safe regression test selectioncanbecost-effective,butthatitscostsandbenefitsvarywidelybasedonanumberof factors. Inordertocarrythroughtheregressiontestingquicklyandeffectively,wehaveproposed a regression testing approach from a large test suite using hybrid technique based on safeselectionalgorithmandprioritizationbasedoncostcriterion. Weexaminedsomeprioritizationstrategiesanddevelopourproposedalgorithmtoimprovetherateoffaultdetection for web applications. We propose a new hybrid regression testing approach that select less test cases and then prioritize them according to their cost, so that the regression testing for web application become more time effective and less expensive. Sat, 01 Dec 2012 00:00:00 GMT http://dspace.mist.ac.bd:8080/xmlui/handle/123456789/170 2012-12-01T00:00:00Z