Consider the following normalized relations for a database in a large retail store chain:
STORE (StoreID, Region, ManagerID, SquareFeet) EMPLOYEE (EmployeeID, WhereWork,
EmployeeName, EmployeeAddress) DEPARTMENT (DepartmentID, ManagerID, SalesGoal)
SCHEDULE (DepartmentID, EmployeeID, Date)
Assume that a data communications network links a computer at corporate headquarters with a computer
in each retail outlet. The chain includes 50 stores with an average of 250 employees per store. There are
15 departments in each store. A daily schedule is maintained for five months (the previous two months,
the current month, and next two months). Further assume that the following:• Each store manager updates the employee work schedule for her or his store roughly 10 times per
hour.• An external payroll provider generates all payroll checks, employee notices, and other mailings for all
employees for all stores.• The corporation establishes a new sales goal each month for each department, in collaboration with
the respective store managers.• The corporation hires and fires store managers and controls all information about store managers;
store managers hire and fire all store employees and control all information about employees in that store.
a. Would you recommend a distributed database, a centralized database, or a set of decentralized databases for this retail store chain?

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?

Continue performing the steps in this appendix, starting withthe section called Developing theSchedule. Print out the following screens or send them to yourinstructor, as directed:a. Figure A-32. All task durations and recurring task enteredb. Figure A-39. Network diagram viewc. Figure A-46. Changing Work hours for tasksd. Figure A-56. Earned value

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

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.

Refer to the case “Blue Ocean Leadership: How to Achieve High Impact at Low Cost”, and answer the following questions: 1. Revise your time/effort ratings and the order of the acts and activities according to the results of the Leadership Grid and transfer the data to the To-Be Leadership Canvas.

Not less than 250 words 1.A company has a choice of four different modes of foreign market entry. Briefly describe each of these modes, and explain when each would be the best option. 2.Define the term global brand. How are global brands important?