A metal bar is in the xy-plane with one end of the bar at the origin. A force F⃗ =( 7.11 N )i^+( -2.57 N )j^ is applied to the bar at the point x = 3.33 m, y = 3.14 m

Part A What is the position vector r⃗ for the point where the force is applied? Enter the x and y components of the radius vector separated by a comma.

Part B What is the magnitude of the torque with respect to the origin produced by F⃗ ? Express your answer with the appropriate units.

7. The number of surface flaws in plastic panels used in the interior of automobiles has a Poisson distribution with mean of 0.04 flaws per square foot of plastic panel. Assume automobile interior contains 10 square feet of plastic panel.(a) What is the probability that there are no surface flaws in an auto's interior?(b) If 10 cars are sold to a rental company, what is the probability that none of the 10 cars has any surface flaws?(c) If 10 cars are sold to a rental company, what is the probability that at most two cars have any surface flaws?

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?

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.