Unit Learning Outcomes LO1 Examine abstract data types, concrete data structures and algorithms. LO2 Specify abstract data types and algorithms in a formal notation. LO3 Implement complex data structures and algorithms. LO4 Assess the effectiveness of data structures and algorithms. Transferable skills and competencies developed

This assignment provides practice on designing and building data structures and utilizing them for building systems according to certain requirements. Also, it teaches students to compare different algorithms and assess their effectiveness. Along with the following: - identify program data requirements. - Specify abstract data types using formal notation. - translate into concrete data structures and be able to develop, using a programming paradigm, different sorting, searching and navigational algorithms that implement complex data structures and evaluate their effectiveness.

Vocational scenario: You are working for a Tech Solutions company that designs and builds software solutions for several clients. Your company has won the bid to create an application that handles many required services for MacDonalds. An application for handling different features for MacDonald's services. Consider the tasks below to implement the system. Assignment activity and guidance

The questions are: The application has many features as listed and explained in the following tasks: Task 1: Handling Orders Description: cars in drive thru line place their order once it is their turn. The orders are delivered in a first-come-first-serve order. 1.1:Draw a class diagram that includes the following classes and show the relationship between them, information hiding, and ADT specifications: Order:Each order placed from drive thru service contains: order ID,list of items, total price. This class have an operation to calculate the total price based on items (not user input), and a print operation. Item:Each item has a description and a price. For example, (Big Mac, 5.00) Queue:implement over a DLL to handle orders. With main add and remove operations of a queue.

DLL:customize the DLL class to store orders, and another one to store items. The DLLOrder class has two operations, AddOrder that add an order to the end of the list, and a RemoveOrder that return the removed order from the head/front. The DLLItems has only one operation (AddItem) that add an Item to the end of the list. 1.2:Implement the solution according to the given classes and specifications, and prevent handling orders when there are no orders in queue and prevent creating invoice/total price for empty list of items. 1.3:Test your implementation using a Demo class , Figure 1 shows a sample testing.Presenthow the specified ADT solves the given problem.

Transcribed Image Text:

***** order id 1 order Items : Big Mac 5.0 $ Hot Chocolate 3.0 $ Total price :8.0 order id 2 order Items : Apple pie 5.0 $ Sprite 1.5 $ Fires 3.0 $ Total price :9.5 queue is empty Figure 1: sample testing ***** order id 1 order Items : Big Mac 5.0 $ Hot Chocolate 3.0 $ Total price :8.0 order id 2 order Items : Apple pie 5.0 $ Sprite 1.5 $ Fires 3.0 $ Total price :9.5 queue is empty Figure 1: sample testing

Answer rating: 100% (QA)

Heres an analysis of the prompt and some suggestions on how to proceed Prompt Analysis The prompt describes a scenario where youre tasked with designing and implementing a system for handling orders a... View the full answer