Functional Requirements Prioritization using Graph and Sorting Algorithm
Keywords:
Functional Requirements, Prioritization, Depth First Search, Directed Acyclic GraphAbstract
Requirements prioritization is an important activity conducted during requirement engineering phase. Prioritization of software requirements become more important and difficult when size of requirements is large. The existing techniques such as Analytic Hierarchical Process (AHP) which are although considered to be reliable techniques and yield more accurate results but doesn?t applicable for large size requirements due to too much pairwise comparisons. Using Directed Acyclic Graph (DAG) and Depth Frist Search (DFS) algorithm, FRs can be prioritized with minimum time complexity. Beside, existing prioritization techniques that are suitable to prioritize all types of requirements are not applied for functional requirements (FRs) from development perspective. Suggested prioritization approach using DAG and DFS is applied on FRs ODOO ERP as case study and results are compared with other techniques i.e. AHP, Binary Search Tree (BST) and Cumulative Voting (CV) for time complexity. The outcome of comparison shows that suggested technique produce more better results with less time complexity
References
A. U. Rahman, M. Yaseen, and Z. Ali, ?Identification of Practices for Proper Implementation of Requirements in Global Software Development : A Systematic Literature Review Protocol?, vol. 177, no. 13, pp. 53?58, 2019.
M. Yaseen, A. Mustapha, and N. Ibrahim, ?An Approach for Managing Large-Sized Software Requirements During Prioritization?, no. 1, pp. 98?103, 2019.
M. Yaseen, A. Mustapha, S. Qureshi, A. Khan, and A. U. Rahman, ?A Graph Based Approach to Prioritization of Software Functional Requirements?, vol. 9, no. 3, pp. 64?73, 2020.
M. Yaseen, N. Ibrahim, and A. Mustapha, ?Requirements Prioritization and using Iteration Model for Successful Implementation of Requirements?, Int. J. Adv. Comput. Sci. Appl., vol. 10, no. 1, pp. 121?127, 2019.
M. Yaseen, A. Mustapha, N. Ibrahim, and U. Farooq, ?International Journal of Advanced Trends in Computer Science and Engineering Effective Requirement Elicitation Process using Developed Open Source Software Systems?, vol. 9, no. 1, 2020.
M. Yaseen and Z. Ali, ?Success Factors during Requirements Implementation in Global Software Development : A Systematic Literature Review?, vol. 8, no. 3, pp. 56?68, 2019.
M. Yaseen, I. Journal, M. Yaseen, A. Mustapha, M. A. Salamat, and N. Ibrahim, ?International Journal of Advanced Trends in Computer Science and Engineering Available Online at http://www.warse.org/IJATCSE/static/pdf/file/ijatcse09912020.pdf Prioritization of Software Functional Requirements : A Novel Approach using AHP and Spanning Tree?, vol. 9, no. 1, 2020.
M. Yaseen, A. Mustapha, and N. Ibrahim, ?MINIMIZING INTER-DEPENDENCY ISSUES OF REQUIREMENTS IN PARALLEL DEVELOPING SOFTWARE PROJECTS WITH AHP?, vol. 8, no. Viii, 2019.
M. Yaseen, A. Mustapha, A. U. Rahman, S. Khan, and W. Kamal, ?Importance of Requirements Prioritization in Parallel Developing Software Projects?, vol. 9, no. 2, pp. 171?179, 2020.
R. Prioritization and U. Hierarchical, ?Requirements Prioritization Using Hierarchical Dependencies?, pp. 459?464, 2018.
M. A. Iqbal, A. M. Zaidi, and S. Murtaza, ?A new requirement prioritization model for market driven products using analytical hierarchical process?, DSDE 2010 - Int. Conf. Data Storage Data Eng., pp. 142?149, 2010.
P. Chatzipetrou, L. Angelis, P. Roveg??rd, and C. Wohlin, ?Prioritization of issues and requirements by cumulative voting: A compositional data analysis framework?, Proc. - 36th EUROMICRO Conf. Softw. Eng. Adv. Appl. SEAA 2010, pp. 361?370, 2010.
R. M. Liaqat, ?A Majority Voting Goal Based Technique for Requirement Prioritization?.
A. K. Massey, P. N. Otto, and A. I. Ant?n, ?Prioritizing Legal Requirements?, vol. 1936, no. 111, 2010.
R. Beg, Q. Abbas, and R. P. Verma, ?An Approach for Requirement Prioritization using B-Tree?, pp. 1216?1221, 2008.
L. Arge and N. Zeh, ?I / O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs?, 2003.
M. Rainey, ?A Work-Efficient Algorithm for Parallel Unordered Depth-First Search?, 2015.
M. Weigel, ?Connectivity algorithm with depth first search ( DFS ) on simple graphs Connectivity algorithm with depth first search ( DFS ) on simple graphs?, pp. 4?8, 2018.
M. M. Asadi, H. Mahboubi, J. Habibi, A. G. Aghdam, and S. Blouin, ?with Application to Underwater Sensor Networks?, pp. 1?8, 2017.
K. Jun, ?Depth-First-Search based Region Merging for the Waterfall?, pp. 540?545, 2015.
M. Yaseen, A. Mustapha, and N. Ibrahim, ?Prioritization of Software Functional Requirements : Spanning Tree based Approach?, vol. 10, no. 7, pp. 489?497, 2019.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
