Investors issue buy and sell orders for a certain stock on an electronic exchange, stating a maximum purchase or minimum sell price and the number of shares they desire to trade at that price. Create and simulate a programme that matches customers and vendors by using priority queues. Maintain two priority queues, one for buyers and one for sellers, and execute transactions whenever a fresh order can be matched with a previously placed order or orders.

Investors issue buy and sell orders for a certain stock on an electronic exchange, stating a maximum purchase or minimum sell price and the number of shares they desire to trade at that price. Create and simulate a programme that matches customers and vendors by using priority queues. Maintain two priority queues, one for buyers and one for sellers, and execute transactions whenever a fresh order can be matched with a previously placed order or orders.

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter7: File Handling And Applications

Section: Chapter Questions

Problem 6PE

See similar textbooks

Similar questions

Quiz 2/III Draw the use case model and write main scenario and extensions for the following: student online registration in a computer college : a student enters his information in the college website and receives a registration code to his email . then login the email to complete the process and get a message that he is being added to the student database if his degrees are under the average the system will redirect the record to another college.
Description: There are 5 philosophers sitting around a table and try to eat from the center of the table. 5 chopsticks also lay on the table. Let us call the 5 philosophers in clockwise P1, P2, ...P5. There also 5 chopsticks clockwise S1, S2, ..., S5 on the table. There are only one chopstick between every two philosophers. Every right hand chopstick will have the same index as the philosopher. For example, on the right hand side of P1, the chopstick is called S1. And every left hand side chopstick number is 1+number of the philosopher. A philosopher spend random time to think, then he feel hungry and try to eat. The middle dish can provide enough food for everyone at the same time. But a philosopher only can start to eat when he picked up two chopsticks from left hand side and right hand side to form a pair of chopsticks. If a philosopher take one chopsticks, he will try to fight with neighbours to get another one, and never back off to put down the one in his hand. Once the…
A restaurant chain has several locations in a city (with a name and zip code stored for each), and each is managed by one manager. Each manager manages multiple restaurants. Each restaurant location has its own unique set of menus. Most have more than one menu (e.g., lunch and dinner menus). Each menu has many menu items, items can appear on multiple menus, and each menu has a price on it. A customer can visit multiple restaurants and a restaurant can have multiple customers. Represent this situation of restaurants with an E-R diagram
Simulation parameters: • Define a step size h. Try something small like 0.001 seconds. • Define a length for the simulation-perhaps 10 seconds for now, but feel free to adjust it as you see fit. • Create a list of times that begins at 0 and goes up to the simulation length in steps of h. The actual simulation only cares about the step size, so we won't use this in the simulation but we'll use it for plotting at the end. • Calculate the length of the list created in the previous step and assign it to a variable n. Data arrays: • Create a list r of length n that is all zeros (np.zeros could come in handy here). • Create a list s of length n that is all zeros. Initial conditions: • Set the first entry of r to be some initial height of your choosing. • Set the first entry of s to be some initial velocity of your choosing. First-order equations: • We need to define a function that calculates the derivative of r. Since Eq. 2.14 says that r' s, this is fairlv simply. We iust have to return c…
Define setup time.
In Assignment 5, our focus was on the Data & Processes that act on it. This week’s assignment is focusing on Actions & Events. In a typical mobile banking application, users will login into the app, the log in may be successful or unsuccessful. For unsuccessful logins, the users can either request login or reset their password and attempt logging back in again. If the login is successful, the users can then perform various transactions (read actions). For example, The users can transfer money internally to another customer or transfer money to another account they own. They may also transfer money to an external bank. The users can also view their current account balance – they may have more than one account They can also deposit their check using Mobile Check deposit feature on the app They can contact customer service using either chat feature, request a callback, or email Some of the shapes and symbols you will need for this assignment are as follows: Start Point/Initial…
Create a process model for the following simple scenario using BPMN. In an online shopping application, the following steps will be followed whenever a customer places a new order. The shop receives an order from a customer to buy a product. The availability of the product will be checked. If the product is available, the order will be shipped to the customer. If the product is not available, a request for the order will be sent to the supplier, then it will be shipped to the customer.
Please implement the following design using Java, C#, or C++. observers Subject subscribe (Subscriber) unsubscribe (Subscriber) notify() GameBoard state getState() playMove ( * Observer update() MatchView gameBoard update()
Design a GUI for Tasks Management. The Task data is: id, title, status, added by, creation date. Do the following: Add Task manually and from a file. View Tasks. Find All Tasks titles that added by “Ali" sorted by id. Find the top four tasks sorted by creation date. Find all tasks that start with the letter 'a' and have exactly seven letters (ignore letter 'a' case). Find who added the largest number of tasks. Find the number of tasks that are closed and open. Count the tasks that added by "Sami". Notes: Id is an integer value. Status can be (open or closed) only. Validate the add form fields and display error messages. Use the appropriate collections and functional programming to find results.
For the following scenario for a point of sale system, draw the following: • A mail order company that distributes CDs and tapes at discount prices to record club members (tells the purpose of the system). • When an order processing clerk receives an order form, she verifies that the sender is a club member by checking the MEMBER FILE. If the sender is not a member, the clerk returns the order along with a membership application form. • If the customer is a member, the clerk verifies the order item data by checking the ITEM FILE. Then the clerk enters the order data and saves it to the DAILY ORDERS FILE. • At the same time, the clerk also prints an invoice and shipping list for each order, which are forwarded to the ORDER FULFILLMENT DEPARTMENT for processing there. Answer:
Q2- Once you are doing a financial transaction through an ATM machine, there is an authentication process that takes place to grant you the access to your bank account, which has been demonstrated generally in this module. Using your own words, describe the most common scenario involved in the authentication process that takes place once you enter your payment card into ATM machine. Provide your explanation with a suitable diagram that illustrates the basic steps involved.
Design a javafx GUI for Tasks Management. The Task data is: id, title, status, added by, creation date. Do the following: Add Task manually and from a file. View Tasks. Find All Tasks titles that added by “Ali" sorted by id. Find the top four tasks sorted by creation date. Find all tasks that start with the letter 'a' and have exactly seven letters (ignore letter 'a' case). Find who added the largest number of tasks. Find the number of tasks that are closed and open. Count the tasks that added by "Sami".