Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Data Structures and Algorithms - 2 (Have a Project), Study Guides, Projects, Research of Data Structures and Algorithms

I work as an internal software developer for Softnet Development Ltd, a software shop that specializes in providing networking solutions. Your company was part of a service delivery co-development project, and your company won a contract to design and develop an intermediary software solution that will interface in the front-end with multiple interfaces. Computer provisioning interfaces include SOAP, HTTP, JML and CLI, and the backside - Networking the telecommunications provider through CLI.

Typology: Study Guides, Projects, Research

2020/2021

Available from 09/22/2021

Thanhduong1080
Thanhduong1080 🇻🇳

3.9

(14)

18 documents

1 / 39

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
BTEC LEVEL 5 HND DIPLOMA IN BUSINESS
UNIT 19
DATA STRUCTURES AND ALGORITHMS
ASSIGNMENT
No.2
Learner’s name: Huỳnh Thanh Dương
Assessor name: Ngọc Thành
Class: GCS0804_NX
Learner’s ID: GCS190756
Subject’s ID: 1649
Assignment due: January 2021
Assignment submitted: February 2021
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f
pf20
pf21
pf22
pf23
pf24
pf25
pf26
pf27

Partial preview of the text

Download Data Structures and Algorithms - 2 (Have a Project) and more Study Guides, Projects, Research Data Structures and Algorithms in PDF only on Docsity!

BTEC LEVEL 5 HND DIPLOMA IN BUSINESS

UNIT 19

DATA STRUCTURES AND ALGORITHMS

ASSIGNMENT

No. 2

Learner’s name: Huỳnh Thanh Dương Assessor name: Lê Ngọc Thành Class: GCS0804_NX Learner’s ID: GCS Subject’s ID: 1649 Assignment due: January 2021 Assignment submitted: February 2021

ASSESSMENT 2 BRIEF Qualification BTEC Level 5 HND Diploma in Computing Unit number Unit 19: Data Structures and Algorithms Assignment title Implement and assess specific DSA Academic Year 2021 – 2022 Unit Tutor Le Ngoc Thanh Issue date January 2021 Submission date February 2021 IV name and date Submission Format: Format: The submission is in the form of an individual written report and a presentation. This should be written in a concise, formal business style using single spacing and font size 12. You are required to make use of headings, paragraphs and subsections as appropriate, and all work must be supported with research and referenced using the Harvard referencing system. Please also provide a bibliography using the Harvard referencing system. Submission Students are compulsory to submit the assignment in due date and in a way requested by the Tutors. The form of submission will be a soft copy in PDF posted on corresponding course of http://cms.greenwich.edu.vn/ Note: The Assignment must be your own work, and not copied by or from another student or from books etc. If you use ideas, quotes or data (such as diagrams) from books, journals or other sources, you must reference your sources, using the Harvard style. Make sure that you know how to reference properly, and that understand the guidelines on plagiarism. If you do not, you definitely get fail Assignment Brief and Guidance: Scenario : Continued from Assignment 1. Tasks For the middleware that is currently developing, one part of the provision interface is how message can be transferred and processed through layers. For transport, normally a buffer of queue messages is implemented and for processing, the systems requires a stack of messages. The team now has to develop these kind of collections for the system. They should design ADT / algorithms for these 2 structures and implement a demo version with message is a string of maximum 250 characters. The demo should demonstrate some important operations of these structures. Even it’s a demo, errors should be handled carefully by exceptions and some tests should be executed to prove the correctness of algorithms / operations.

Learning Outcomes and Assessment Criteria Pass Merit Distinction LO1 Implement complex data structures and algorithms D3 Critically evaluate the complexity of an implemented ADT/algorithm P4 Implement a complex ADT and algorithm in an executable programming language to solve a well defined problem. P5 Implement error handling and report test results. M4 Demonstrate how the implementation of an ADT/algorithm solves a well- defined problem LO4 Assess the effectiveness of data structures and algorithms D4 Evaluate three benefits of using implementation independent data structures P6 Discuss how asymptotic analysis can be used to assess the effectiveness of an algorithm P7 Determine two ways in which the efficiency of an algorithm can be measured, illustrating your answer with an example. M5 Interpret what a trade-off is when specifying an ADT using an example to support your answer

ASSIGNMENT 2 FRONT SHEET Qualification BTEC Level 5 HND Diploma in Computing Unit number and title Unit 19 : Data Structures and Algorithms Submission date January 2021 Date Received 1st submission February 2021 Re-submission Date Student Name Huỳnh Thanh Dương Student ID GCS Class GCS0804_NX Assessor name Le Ngoc Thanh Student declaration I certify that the assignment submission is entirely my own work and I fully understand the consequences of plagiarism. I understand that making a false declaration is a form of malpractice. Student’s signature Duong Grading grid P4 P5 P6 P7 M4 M5 D3 D

Table of Contents BTEC LEVEL 5 HND DIPLOMA IN BUSINESS UNIT 19 ................................................................................. 1 ASSESSMENT 2 BRIEF ............................................................................................................................. 2 TABLE OF CONTENTS .............................................................................................................................. 2

  1. INTRODUCTION........................................................................................................................................... 5
  2. IMPLEMENT COMPLEX DATA STRUCTURES AND ALGORITHMS .............................................................................. 5 2.1. P4 Implement a complex ADT and algorithm in an executable programming language to solve a well-defined problem................................................................................................................................. 5 2.2. P5 Implement error handling and report test results. .................................................................. 14 2.3. M4 Demonstrate how the implementation of an ADT/algorithm solves a well-defined problem. 16 2.4. D3 Critically evaluate the complexity of an implemented ADT/algorithm ................................... 17
  3. ASSESS THE EFFECTIVENESS OF DATA STRUCTURES AND ALGORITHMS ................................................................. 18 3.1. P6 Discuss how asymptotic analysis can be used to assess the effectiveness of an algorithm ....... 18 2.1. P7 Determine two ways in which the efficiency of an algorithm can be measured, illustrating your answer with an example. ................................................................................................................ 26 2.2. M5 Interpret what a trade-off is when specifying an ADT using an example to support your answer. .................................................................................................................................................... 28 3.3. D4 Evaluate three benefits of using implementation independent data structures. ................... 29
  4. CRITICAL EVALUATION................................................................................................................................ 32
  5. REFERENCES............................................................................................................................................. 33

1. Introduction I work as an internal software developer for Softnet Development Ltd, a software shop that specializes in providing networking solutions. Your company was part of a service delivery co-development project, and your company won a contract to design and develop an intermediary software solution that will interface in the front-end with multiple interfaces. Computer provisioning interfaces include SOAP, HTTP, JML and CLI, and the backside - Networking the telecommunications provider through CLI. Your account manager has assigned you a special role that is to inform your team about the design and implementation of abstract data types. I have been asked to make a presentation to all collaborating partners on how to use ADT to improve software design, development, and testing. Furthermore, I will write an introductory report to distribute to all partners on how to specify abstract data types and algorithms in a formal notation. 2. Implement complex data structures and algorithms 2.1. P4 Implement a complex ADT and algorithm in an executable programming language to solve a well-defined problem. Descriptions: The framework comprises of sender and collector, irregular activity, if the sender works, they will cut the message string into 25 characters and send it into the line, until the message is out, they send a parcel to tell the beneficiary. Realizing that messages are out and recovering another message. The beneficiary will get 1 bundle from An each time and push it to Stack, in the wake of getting the message that the message is out of message will print on that message screen. Here I make 3 classes, the sender class, the beneficiary addresses the sender and recipient, the Main class is utilized to make demands. My project be showed on my channel in YouTube: https://youtu.be/BhSOxZ5NAZM Code: Include of 4 class and main class

✓ Main class ✓ Queue class ✓ Stack class ✓ Sender class ✓ Receiver class The first this is MyQueue class

 This is the side queue class consisting of variables front, rear, capacity, size, and string called array. Where front is the order in front of the string, rear is the tail of the string, capacity is the amount contained in the string, size is the length of the string. In MyQueue is the main action container with specified capacity. The isFull boolean function is used to check whether or not it is full. The isEmpty boolean function determines whether the function is empty or not. We have the function void enqueue which is to add an element, and dequeue is to get the element out. We have the splitMessage function used to split the message into 25 characters in the string including the space mark. Stack class

setMessage (). And here I have 2 messenger people. Message 1 is 200 characters, and message 2 is 450 characters, equivalent to message and message Receiver class  This is the function used to get the value from the receiver and declare it via getReceiveMessage () and setReceiveMessage (). Here we have 2 variables to receive from 2 senders. And use the super function to refer to the messeage received from the parent class

N=0 A sender => n=1 B receiver N=2 C sender => n=3 D receiver N=0 A sender => n=3 D receiver Operation: We will randomize variable n if n output 0 then A will start sending if n outputs 1 then B will be the receiver of A similar to C and D. Put 1 more variable r to randomize who will be the recipient of the message Person A's message, if r = 0, the message of person A will be sent to B, if r = 1, the message of person C will be sent to D. And if it is empty, the message of stack is empty will invite the enqueue and if it is already full will report stack overflow. 2.2. P5 Implement error handling and report test results. Test case and test logs Tes t What be tested How Expect result Date Catch errors in code Actu al result s Last Action

  1. Sender sent messag e Sender String with 400 characte rs Successfu ll sending! And out put on screen End conversati on

Pass No more action

  1. Receiv er receive messag e Sender sent string with 0 characte r Output on screen Stack is empty

Pass No more action

  1. Receiv er receive messag e Sender sent string with 3000 characte r while max String array be = 1 0 Output on screen Stack Overflow

Still sent to be succe ss full Need put in validati on for my String with max = 1000

  1. Sender sent messag e

A

sender and a messag e but sent for two receiver s Output on screen End conversati on

Pass No more action

  1. Sender sent messag e A no sent any characte r but still run Output on screen error

Pass Set up return null if Sender not sent