Data Structure and Algorithm

Data Structure and Algorithm Individual Assignment
Data Structure &
Algorithm
PREPARED BY –
Umar Mahmood
KD/HNDCSE/48/07

Data Structure and Algorithm Individual Assignment
INTERNATIONAL COLLEGE OF BUSINESS & TECHNOLOGY LTD
ASSIGNMENT BRIEF
Assignment Cover Sheet
Qualification Module Number and Title
HD in Computing and Software Engineering Data Structures and Algorithms
SED52013
Student Name & No. Assessor
M.H Umar Mahmood (KD/HNDCSE/48/07)
Hand out date Submission Date
24.11.2020
Assessment type
Coursework
Duration/Length of
Assessment Type
Weighting of Assessment
100%
Learner declaration
I, .................................................<name of the student and registration
number>, certify that the work submitted for this assignment is my own and
research sources are fully acknowledged.
Marks Awarded
First assessor
IV marks
Agreed grade
Signature of the assessor Date
FEEDBACK FORM
INTERNATIONAL COLLEGE OF BUSINESS & TECHNOLOGY
Module:Data Structures and Algorithms - SED52013
Student:M. H Umar Mahmood (KD/HNDCSE/48/07)

Data Structure and Algorithm Individual Assignment
Assessor:
Assignment:
Strong features of your work:
Areas for improvement:
Marks Awarded:

I
Data Structure and Algorithm Individual Assignment
Executive Summary
This report discusses about the basic data structures suitable for the given scenario;
Stack and Queue, and provides a comparison among the 2. Of the 2, the most suitable
data structure was chosen after proper discussion and analysis; Stack. Relevant source
codes are attached as screenshot and in the sub-folder attached with this report.
On the second part of the report is a discussion about the Sorting Algorithms and
analysis to implement for the given scenario. Upon proper analysis Insertion Sort was
chosen. Relevant source codes are attached as screenshot and in the sub-folder
attached with this report.
The third part of the report provides a brief information about the Recursive algorithm
and its advantages and disadvantages with its source code, and factorial numbers as its
example.

II
Data Structure and Algorithm Individual Assignment
Acknowledgement
This module; Data structures and Algorithm is a golden opportunity for learning about
Data structure and Sorting Algorithms and how they contribute towards the
programming environment. It is indeed a matter of great pleasure and proud privilege
to present this project report. I own great thanks to many people who helped and
supported me in completing this project. I would like to express my deepest
appreciation to my family members and my friends especially who provided the
possibility to complete this report.
I would like to express a deep sense of gratitude to our Lecturer Mr. Prabu
Premakumar who was kind enough and always available to help and guided me and
my batch mates to do such a complex yet wonderful and interesting project and made
sure that we understood what we were taught, and a special gratitude to my course
coordinator Mrs. Shyamila Karunarathna for this module.

III
Data Structure and Algorithm Individual Assignment
Table of Contents
Executive Summary........................................................................................................I
Acknowledgement..........................................................................................................II
Table of Contents..........................................................................................................III
Table of Figures.............................................................................................................V
Table of Tables...............................................................................................................V
Task 1. A).......................................................................................................................1
Identification of suitable Data Structures...............................................................1
Identification of Data Structure for given Scenario................................................6
Task 1. B).......................................................................................................................7
Task 2. A).......................................................................................................................9
Sorting Algorithms..................................................................................................9
Identification of Pros and Cons among Sorting Algorithms.................................11
Justification...........................................................................................................13
Task 2. B).....................................................................................................................13
Task 3. A).....................................................................................................................15
Recursion..............................................................................................................15
Identification of Advantages and Disadvantages of Recursion Algorithms.........15
Task 3. B).....................................................................................................................16
References....................................................................................................................17
Appendix A..................................................................................................................18
Gantt Chart............................................................................................................18