Reference no: EM132640899

Unit 19 Data Structures and Algorithms - Higher National Diploma in Computing

Assignment Title - Data Structure and Algorithm

Learning Outcome 1: Examine abstract data types, concrete data structures and algorithms
Learning Outcome 2: Specify abstract data types and algorithms in a formal notation
Learning Outcome 3: Implement complex data structures and algorithms
Learning Outcome 4: Assess the effectiveness of data structures and algorithms

Assignment Brief:
You are working in Elexa as a software developer. Elexa is a solution development company involved in providing IT solutions to corporate sector. It has just got the contract to design and develop a middleware solution that will interface at the front-end to multiple computer provisioning interfaces including SOAP, HTTP, JML and CLI, and the back-end telecom provisioning network via CLI.

Being confident in your proven technical skills and knowledge-base, you Project Manager has made you Team Lead and made you responsible to inform them about designing and implementation of abstract data types.

In this regard, you are required to create a presentation for all collaborating Sectionners on how ADTs can be utilised to improve software design, development and testing.

Furthermore, you have to document an introductory report for distribution to all Sectionners on how to specify abstract data types and algorithms in a formal notation.

Section 1
You will need to prepare a presentation on how to create a design specification for data structures, explaining the valid operations that can be carried out on the structures using the example of:
1. A stack ADT, a concrete data structure for a First In First out (FIFO) queue.
2. Two sorting algorithms.
3. Two network shortest path algorithms
4. You will include formal notations and details in your presentation so that the audience get a clear idea as to what they are and how they function
5. Further include the role of memory stack in this process, its operations and how it implements function calls
6. For FIFO queue, support your evidence with an example and a diagrammatic representation
7. Include the comparison of performance of two sorting algorithms
8. Include the operational analysis of two network shortest path algorithms and support your evidence with example and/or diagrammatic representation

Section 2
You will need to provide a formal written report that includes the following:
1. Explanation on how to specify an abstract data type using the example of software stack. You should include the elements like ADT specification using formal notation e.g. ASN.1, use of non-executable program specification language e.g. SDL and VDM, Issues e.g. complexity in software development, design patterns, parallelism, interfaces, encapsulation, information hiding, efficiency etc. and creational conditions like pre- conditions, post-conditions and error conditions
2. Explanation of the advantages of encapsulation and information hiding when using an ADT
3. Discussion of imperative ADTs with regards to object orientation. Support your viewpoint with formal justification whether you agree or disagree

Section 3
You will need to demonstrate the implementation of atleast one complex data structure and one algorithm in an executable programming language. You need to develop a report that would include:
1. Information about the complex data structure used and algorithms using handle, pointer, class, methods etc. in an executable programming language
2. Intended and desired outcome of the implementation. Further include what type of problem this implementation of data structure and algorithm would address.
3. Programme code written in the executable programming language
4. Screenshots of the code execution
5. Any error handling and debugging performed during the process.
6. Test results at execution time and analysing the actual outcomes against the desired and intended outcomes (P5)
7. Demonstrate how the implementation of selected data structure and algorithm solves the defined problem (M4)
8. Critically evaluate the complexity level of the implemented data structure and algorithm in terms of its implementation and operations

Section 4
You will need to provide a formal written report that includes the following:
1. Evaluating the effectiveness of an algorithm (i.e. run time benchmark, compiler/interpreter dependencies, resource usage, degree of parallelism, time, space, power performance etc.) using asymptotic analysis approach
2. Determine two ways, using which, the efficiency of an algorithm can be measured. Support your evidence with examples and/or diagrammatic representation
3. With the help of an example, explain what trade-off may occur when specifying an ADT
4. Evaluate three benefits (i.e. Representation Independence, Modularity, Interchangeability of Sections) of using implementation independent data structures