Use only Java, or C++ for implementation.

The A* search can be used to solve the 8-puzzle problem. There are two candidate heuristic functions:

h1 = the number of misplaced tiles

h2 = the sum of the distances of the tiles from their goal positions

You are to implement the A* using both heuristics and compare their efficiency in terms of depth of the solution and search costs. To test your program and analyze the efficiency, you should generate random​ problems (>1000 cases) with a variety of solution depths. Collect the data on the different solution depths that you have tested, with their corresponding search cost (# of nodes generated); and average the search costs by depth. A good testing program should test a range of possible cases (2 <= d <= 24).

Note that the average solution depth for a randomly generated 8-puzzle instance is approximately 22. A* Search Costs (nodes generated) d h1 h2 2 6 6 4 13 12 6 20 18 8 39 25 10 93 39 12 227 73 14 539 113 16 1301 211 18 3056 363 20 7276 676 22 18094 1219 24 39135 1641 Comparison of the average search costs for the A* algorithm using heuristics h1 and h2 . This data was averaged over 100 instances of the 8-puzzle for each depth.

User Interface: Provide at least two menu options for your program:

1) An option to generate a solvable random 8-puzzle problem (generated by your program) then solve it using both heuristics. It should output the optimal sequence of states that result from the search, the solution depth and the search cost for each heuristic.

2) An option to input a specific 8-puzzle configuration. The input will contain the configuration for only one puzzle, in the following format (where 0 represents the empty tile and the digits are separated by a space): 1 2 4 0 5 6 8 3 7 This option should solve the entered puzzle and output the optimal sequence of states that result from the search, the solution depth and the search cost for each heuristic. Your program must test the puzzle to be sure that it is solvable. You must handle the input/output gracefully―handle exceptions.

QN ; Compare [ a construction company ] against TEN of the requirements of the audit standard given in supporting document below. [ 30 marks ] 1.0 PlanningRequirements:1.1Establish audit programme.1.2Selection of and checks on competence of audit lead.1.3Establish the scope of the audit.1.4Set procedures for the

Design a 4-bit UP-DOWN counter. It counts 1 to 7 only. The middle output is 1111. Include truth table, K-map with equation, and decoder implementation. Please answer fast 20 mins left

Complete MS Project Exercise 2 on Appendix A: Brief Guide to Microsoft Project Professional 2016 2. Continue performing the steps in this appendix, starting with the section called Developing the Schedule. Print out the following screens or send them to your instructor, as directed: a. Figure A-32. All task durations and recurring task entered b. Figure A-39. Network diagram view c. Figure A-46. Changing Work hours for tasks d. Figure A-56. Earned value report e. Continue performing the steps, or at least read them. Write a one-to-two page paper describing the capabilities of Project Professional 2016 and your opinion of this software. What do you like and dislike about it?

I need answer in C++. Thank You!!! Project on pharmacy management system in c++ with oop concepts classes (medicine type, administration, cashier, manager, customer, owner) for software engineering mapping abstract class encapsulation inheritance friend function polymorphism association

FINAL SEMESTER PROJECT in C++ Create a bank management system using the concepts of oop in c++ having the following features Creating new account Withdrawing money Depositing money Money transfer Credit card and Debit card payments Modifying account Deleting account View your account details View all account details Use the concepts of encapsulation, abstraction, polymorphism, Inheritance, Abstract-Concrete class, filing, Generic programming, Exception handling, vectors-sets-lists. The project should be of atleast 900-1000 lines.

Please DO NOT respond to this question by copy/pasting the code provided elsewhere on the site, none of those work. Thanks. Virtual Memory Lab This lab project addresses the implementation of page-replacement algorithms in a demand-paging system. Each process in a demand-paging system has a page table that contains a list of entries. For each logical page of the process, there is an entry in the table that indicates if the page is in memory. If the page is in memory, the memory frame number that page is resident in is indicated. Also, for each page, the time at which the page has arrived in memory, the time at which it has been last referenced, and the number of times the page has been referenced since the page arrived in memory are maintained. The page table data structure is a simple array of page-table entries (PTEs). Each PTE contains five fields as defined below: struct PTE { int is_valid; int frame_number; int arrival_timestamp; int last_access_timestamp; int reference_count; } Each process in the system has a page table that is simply an array of PTEs. Each process also has a pool of frames that is allocated. The frame pool for a process is represented as an array of integers, where each Integer represents the frame number of a frame that is free and is available for use by the process. Note that in order to get the frame number in the pool, you first need to access the integer in the array. This lab project aims to exercise the various policies for page replacement. In particular, we study the following three page-replacement policies: First-In-First-Out (FIFO) Least-Recently-Used (LRU) Least-Frequently-Used (LFU) In order to implement the above policies, we need to develop corresponding functions that process page accesses for a process. That is, for each process, given its page table, a logical page number being referenced and the free frame pool of the process, the functions should determine the memory frame number for the logical page. Also, the functions should modify the page table and the free frame pool appropriately. The details of the functions with respect to the different policies are described below. You need to develop code for these functions that implement the specifications. Place the code in a file called virtual.c. You should include the oslabs.h file.