Problem: Implement a part of functionality for the Netflix DVD queue. It's a service that allows a user to create a list of desired movies and then sends DVDs with movies on top (what we called head in our lectures) of this list to the subscriber one at a time. A subscriber should be able to create a list of desired movies and manipulate the order in a movie queue in their account. Your program will implement some of the desired functionality by storing the list of movie titles in a linked list. You are provided with the following files available in the "Downloadable files" section:

• MovieList.h contains a class declaration for the class that represents a list of movies. top refers to the head position of a list and bottom refers to the tail or end position of a list.
• Driver.cpp contains the main function you can use to test your implementation.

*** NOTE: Please do not change any of the function names since our automated test script calls those functions. Changing function names or parameters will break the automated test script.

You will be responsible for providing the MovieList.cpp file, including the implementation of the MovieList member functions (described below). The class is defined in the MovieList.h file.:

• MovieList and ~MovieList: create an empty list and deallocates all the nodes in the list, respectively.
• display(ostream& out) Print movie titles from top to bottom, with positions numbered (put a colon and space between the number and the movie title) one movie per line. Use out << instead of cout <<.
• addToTop(string title) Add a movie to the top (head) of the list
• addToBottom(string title) Add a movie to the bottom (end) of the list
• moveToTop(string title) Move a movie with given title to position 0 (top or head)
• moveToPosition(string title, int position) Move movie with given title to position n (0 is top or head)
• remove(int n) Remove a movie at the given position. Return true if successful, false if there is no movie at position n.

Input/Output:

Use the provided Driver.cpp file to test your code. I recommend trying to implement one or two functions at a time, and testing them, rather than implementing all the functions and then trying to debug them all at once.

Describe the Main Points about the given following: a.) Program Optimization Techniques b.) Disk Characteristics c.) Cache Memory Stack d.) Static and Dynamic Linking

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

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.

7-Eleven Malaysia Holding Berhad's annual report for the fiscal year ending 2021 is available at https://www.7eleven.com.my/financial-reports. (At least two years of comparable financial statements are required.) a) Assess 7-Eleven’s financial position for year 2020 and 2021 according to i) liquidity position, and how the liquidity position has changed over time from 2020 to 2021. (6 marks) ii) asset management position, and how its asset management efficiency has changed over time. (6 marks) iii) debt management position, and how its debt management has changed over time. (6 marks) iv) profitability ratios, and how its profitability position has changed over time. (6 marks) v) market value ratios, and how its valuation has changed over time. (6 marks) b) Calculate 7-Eleven’s ROE as well as the industry average ROE, using the DuPont equation. From this analysis, how does 7-Eleven’s financial position. (10 marks) c) Write your opinion on what you think would happen to its ratios if the company initiated cost-cutting measures that allowed it to hold lower levels of inventory and substantially decreased the cost of goods sold. No calculations are necessary. Think about which ratios would be affected by changes in these two accounts. (10 marks)

What are the determinants of price elasticity of demand? Identify at least three examples. explain how price elasticity can impact pricing decisions and total revenue of the firm, can policy market interventions cause consumer or producer surplus