Download Data Structure And Algorithm and more Assignments Programming Methodologies in PDF only on Docsity!
Higher Nationals
Internal verification of assessment decisions – BTEC (RQF)
INTERNAL VERIFICATION – ASSESSMENT DECISIONS Programme title Assessor Internal Verifier Unit(s) Unit^ 19:^ Data Structures and^ Algorithms Assignment title Specification, Implemenation, and Assessment of Data Strctures for a sample scenario. Student’s name List which assessment criteria the Assessor has awarded. Pass Merit Distinction INTERNAL VERIFIER CHECKLIST Do the assessment criteria awarded match those shown in the assignment brief? Y/N Is the Pass/Merit/Distinction grade awarded justified by the assessor’s comments on the student work? Y/N Has the work been assessed accurately? Y/N Is the feedback to the student: Give details:
- Constructive?
- Linked to relevant assessment criteria?
- Identifying opportunities for improved performance?
- Agreeing actions? Y/N Y/N Y/N Y/N Does the assessment decision need amending? Y/N Assessor signature Date Internal Verifier signature Date Programme Leader signature (if required) Date Confirm action completed Remedial action taken Give details:
Assessor signature Date Internal Verifier signature Date Programme Leader signature (if required) Date
Formative Feedback: Assessor to Student Action Plan Summative feedback Feedback: Student to Assessor Assessor signature Date Student signature Date
Pearson Higher Nationals in Computing Unit 19: Data Strctures & Algorithms Assignment 01
Important Points:
1. Carefully check carefully the hand in date and the instructions given with the assignment. Late submissions will not be accepted.
- Ensure that sufficient time is spent to complete the assignment by the due date.
- Do not wait till the last minute to get feedback on the assignment. Such excuses will not be accepted for late submissions.
- You must be responsible for efficient management of your time.
- If you are unable to hand in your assignment on time and have valid reasons such as illness, you may apply (in writing) for an extension.
- Failure to achieve at least a PASS grade will result in a REFERRAL grade.
- Non-submission of work without valid reasons will lead to an automatic REFERRAL. You will then be asked to complete an alternative assignment.
- If you use other people’s work or ideas in your assignment, it must be properly referenced, using the HARVARD referencing system, in your text or any bibliography. Otherwise, you’ll be found guilty of committing plagiarism.
- If you are caught plagiarising, your grade will be reduced to a REFERRAL or at worst, you could be excluded from the course.
Student Declaration I hereby, declare that I know what plagiarism entails, namely to use another’s work and to present it as my own without attributing the sources in the correct form. I further understand what it means to copy another’s work.
- I know that plagiarism is a punishable offence because it constitutes theft.
- I understand the plagiarism and copying policy of Edexcel UK.
- I know what the consequences will be if I plagiarise or copy another’s work in any of the assignments for this program.
- I declare therefore that all work presented by me for every aspect of my program, will be my own, and where I have made use of another’s work, I will attribute the source in the correct way.
- I acknowledge that the attachment of this document signed or not, constitutes a binding agreement between myself and Edexcel UK.
- I understand that my assignment will not be considered as submitted if this document is not attached to the assignment. ( Provide E-mail ID ) ( Provide Submission Date )
Scenario ‘XYZ’ hotel chain has 100 banquet halls island wide. Any hotel has minimum one banquet hall to maximum 5 halls. It provides online hotel banquet hall reservation facilities to their customers. The reservation system uses a waiting list of the selected banquet halls. Each banquet hall has unique id, name, location, maximum number guests, reservation date and the three menu prices. Customer can search a banquet hall with the location, reservation date and the number of guests. According to the hotel chain rules and regulations, when a possible match between reservation and the banquet hall is found the customer is contacted via email or SMS and informed. If customer is not responding within a day, he or she is placed back in the waiting list and must wait again for another hall. If customer requested a date change or a location change or a change in number of guests, he or she is placed back in the waiting list and must wait again for another reservation. We will assume that each banquet hall, once accepted, will be occupied by a reservation ID. Insert banquet hall details, reservation details and customer details through the keyboard. The reservation process should remove a banquet hall on a given date from the queue if the customer “accepts” the reservation. If the customer rejects or changes the reservation delete the customer reservation, insert it to the back of the queue and compare next customer reservation and repeat. This process repeats until all customers complete their reservations.
Task 1 : Which data structure can be used, when simulating the above scenario. What are the valid operations that ca n be carried out on this data structure? Task 2: Implement the above scenario using the selected data structure and its valid operations for the design specification given in task 1. Use suitable error handling where appropriate. Test the application using suitable test cases and illustrate the system. Provide evidence of the test cases and the test results. Task 3: Determine the operations of a memory stack and how it is used to implement function calls related to the above scenario. Task 4: Sort the banquet hall list and display from the smallest to largest based on the maximum number of seating arrangements that can be done. Sort the banquets halls with two different sorting algorithms and compare the performances of those two algorithms. Task 5: There are 8 hotels available in the Southern district in Sri Lanka. A customer plans to visit all of these eight hotels through the shortest path within a day. Analyse the operation, using illustrations, of two shortest path algorithms, showing how it operates using a sample graph. Task 6: Banquet hall details are stored from oldest to newest hall. The customer should be able to find from the newest to the oldest banquet hall added to the hotel chain. Using an imperative definition, specify the abstract data type for the above scenario. Examine the advantages of encapsulation and information hiding when using an ADT selected for the above scenario. Object orientation is a paradigm where a computer program functions by objects calling the methods of other objects, which ultimately produces program behaviour. It makes programming simple, readable, and makes programs maintainable. Imperative ADTs are basis for object orientation. Do you agree? Justify your answer. Task 7: Implement the above scenario using the selected complex ADT. Demonstrate how the implementation of an ADT/algorithm solves the above problem.Critically evaluate the complexity
Table of Contents
1.2.2. Provided system implementation code of above (task 1) selected data structure
Table List
- Acknowledgement
- Table List
- Figures list
- Activity
- LO1. Examine abstract data types, concrete data structures and algorithms.
- 1.1. Data structure
- 1.1.1. Characteristics of data structures
- 1.1.2. Types of data structures
- 1.1.3. Introduction of the Data Structures from chart
- 1.1.4. Uses of data structures
- 1.2. A linked list can use when the above scenario
- 1.2.1. Types of Linked Lists
- 1.2.3. Error handling techniques
- 1.3. The Queues data structure operations of a memory stack
- related to the above scenario (task 3) 1.3.1. The operations of a memory stack and how it is used to implement function calls
- 1.4. An Algorithm
- 1.4.1. Sorting Techniques
- 1.4.2. Bubble Sort Algorithm
- 1.4.3. Quick Sort
- 1.4.4. Comparing the performance of Bubble sort and Quick sort
- 1.5. The definition for Dijkstra Algorithm and Floyd Warshall sort path algorithms
- 1.5.1. Dijkstra Algorithm short path
- 1.5.2. Floyd Warshall algorithm
- Activity
- LO2. Specify abstract data types and algorithms in a formal notation.
- 2.1. Abstract Data Types
- 2.1.1. Stack abstract data type (ADT)
- 2.1.2. Queue abstract data type (ADT)
- 2.1.3. List abstract data type (ADT)
- 2.2. Encapsulation
- 2.2.1. Advantages of Encapsulation:............................................................................
- 2.3. Information hiding.....................................................................................................
- Activity
- LO3. Implement complex data structures and algorithms.
- 3.1. The system implemented scenario
- 3.1.1. Reservation List
- 3.1.2. Reservation
- 3.1.3. Main Queue
- 3.1.4. Customer
- 3.1.5. Customer Queue.................................................................................................
- 3.1.6. Hotel
- 3.1.7. Hotel Queue
- 3.2. Implement of using the selected complex ADT
- 3.2.1. These ideas connect to our three key properties of good software as follows:
- 3.2.2. Advantages of Abstract Data Types
- Activity
- LO4. Assess the effectiveness of data structures and algorithms.
- 4.1. Algorithm Efficiency.................................................................................................
- 4.1.1. Time efficiency
- 4.1.2. Space Efficiency
- 4.1.3. Big-O Notation...................................................................................................
- 4.1.4. Big-O Arithmetic
- 4.1.5. Common examples of domination
- 4.1.6. Other Categories
- 4.1.7. Log scale graph of big-O complexities
- 4.1.8. Table of growth rates
- 4.1.9. Effect of Increased Computer Speed
- References
- Figure 1 Arrays data structure example (Author developed)
- Figure 2 Stacks data structure example (Author developed)
- Figure 3 Queues data structure example (Author developed)
- Figure 4 Links list data structure example (Author developed)
- Figure 5 Trees data structure example (Author developed)
- Figure 6 Graphs data structure example (Author developed)
- Figure 7 Trie data structure example (Author developed)
- Figure 8 Hash table example (Bland, 2019).............................................................................
- Figure 9 Introduction to Data Structure (Author developed)
- Figure 10 singly link list node (Author developed)
- Figure 11 A singly linked list populated with integers (Author developed)
- Figure 12 Doubly link list node (Author developed)
- Figure 13 Doubly link list populated with integers (Author developed)
- Figure 14 Reservation (Author developed)
- Figure 15 Reservation List (Author developed)
- Figure 16 Running the program (Author developed)
- Figure 17 Example of queue data stack (Author developed)
- Figure 18 Customer (Author developed)
- Figure 19 Customer Queue (Author developed)
- Figure 20 Hotel (Author developed)
- Figure 21 Hotel Queue (Author developed).............................................................................
- Figure 22 Hotel Queue (Author developed).............................................................................
- Figure 23 Main Queue (Author developed)
- Figure 24 Analysing Bubble Sort 01 (Author developed)
- Figure 25 Analyzing Bubble Sort 02 (Author developed)
- Figure 26 Analyzing Bubble Sort 03 (Author developed)
- Figure 27 Analyzing Bubble Sort 04 (Author developed)
- Figure 28 Analyzing Bubble Sort 05 (Author developed)
- Figure 29 Analyzing Bubble Sort 06 (Author developed)
- Figure 30 Analyzing Bubble Sort 07 (Author developed)
- Figure 31 Analyzing Bubble Sort 08 (Author developed)
- Figure 32 Analyzing Bubble Sort 09 (Author developed)
- Figure 33 Analyzing Bubble Sort 10 (Author developed)
- Figure 34 Analyzing Bubble Sort 11 (Author developed)
- Figure 35 Analyzing Bubble Sort 12 (Author developed)
- Figure 36 Bubble Sort Example (Author developed)
- Figure 37 Analysing Quick Sort 01 (Author developed)
- Figure 38 Analysing Quick Sort 02 (Author developed)
- Figure 39 Analysing Quick Sort 03 (Author developed)
- Figure 40 Analysing Quick Sort 04 (Author developed)
- Figure 41 Analysing Quick Sort 05 (Author developed)
- Figure 42 Analysing Quick Sort 06 (Author developed)
- Figure 43 Analysing Quick Sort 07 (Author developed)
- Figure 44 Analysing Quick Sort 08 (Author developed)
- Figure 45 Analysing Quick Sort 09 (Author developed)
- Figure 46 Analysing Quick Sort 10 (Author developed)
- Figure 47 Analysing Quick Sort 11 (Author developed)
- Figure 48 Analysing Quick Sort 12 (Author developed)
- Figure 49 Analysing Quick Sort 13 (Author developed)
- Figure 50 Analysing Quick Sort 14 (Author developed)
- Figure 51 Analysing Quick Sort 15 (Author developed)
- Figure 52 Analysing Quick Sort 16 (Author developed)
- Figure 53 Analysing Quick Sort 17 (Author developed)
- Figure 54 Analysing Quick Sort 18 (Author developed)
- Figure 55 Analysing Quick Sort 19 (Author developed)
- Figure 56 Analysing Quick Sort 20 (Author developed)
- Figure 57 Analysing Quick Sort 21 (Author developed)
- Figure 58 Analysing Quick Sort 22 (Author developed)
- Figure 59 Dijkstra Algorithm Example (Author developed)
- Figure 60 Dijkstra algorithm coding(Author Developed)
- Figure 61 Floyd Warshall Example (Author developed)
- Figure 62 Floyd Warshall coding (Author Developed)
- Figure 63 Abstract datatype (Author Developed)
- Figure 64 Stack abstract data type (Chauhan, 2019)
- Figure 65 Queue abstract data type (Chauhan, 2019)
- Figure 66 List abstract data type (Chauhan, 2019)
- Figure 67 Encapsulation Example 01 (Author Developed)
- Figure 68 Encapsulation Example 02 (Author Developed)
- Figure 69 Information hiding (Author Developed)..................................................................
- Figure 70 Reservation List (Author developed)
- Figure 71 Running the program (Author developed)
- Figure 72 Reservation (Author developed)
- Figure 73 Main Queue (Author developed)
- Figure 74 Running queue (Author developed).........................................................................
- Figure 75 Customer (Author developed)
- Figure 76 Customer Queue (Author developed)
- Figure 77 Hotel (Author developed)
- Figure 78 Hotel Queue (Author developed).............................................................................
- Figure 79 Hotel Queue (Author developed).............................................................................
- Figure 80 Big-O Notation formula (Author developed)
- Figure 81 Other Categories (Author developed)
- Figure 82 Log scale graph of big-O complexities (Juniata, 2019)..........................................
