Give Ceclor 45 mg/kg/day p.o. in 3 divided doses for a patient who weighs 66 pounds. A 75 mL stock medication is labeled Ceclor 125mg/mL. How many mL would the nurse administer per dose?

A nurse is calculating the fluid intake for an infant at the end of an 8-hr shift. For oral intake, the infant had 10 mL of medication, 3 oz of formula, and 2 oz of juice. In addition, the infant had IV fluid infusing at 20 mL/hr via an IV pump. The nurse should record how many mL of intake on the client’s record?  Type numeric answer only in box.

A nurse is reinforcing teaching with a client who has a new prescription for metformin.  According to the medication label below, which of the following instructions should the nurse include in teaching? Type numeric answer only in box.   

A nurse is preparing to administer enoxaparin 30 mg subcutaneous to a client.  Available is enoxaparin injection 60mg/0.6mL.  How many mL should the nurse administer?  Type numeric answer only in box.

A nurse is preparing to administer cefazolin 1 g in 100 mL 0.9% sodium chloride to infuse over 30 min.  The drop factor of the manual IV tubing is 15 gtt/mL.  The nurse should set the manual IV infusion to deliver how many gtt/min?  Type numeric answer only in box.

A nurse in a long-term care facility is preparing to administer rivastigmine 3 mg PO twice daily to a client who has Alzheimer’s disease. Available is rivastigmine 1.5mg/capsule.  How many capsules should the nurse administer per dose?  Type numeric answer only in box.

A stack is a “FIFO” data structure.

Write a recursive method to calculate factorials. Your method should have the following method header: public static int factorial(int n) Note: Do NOT write a main method or any code using the method you write – just write the method itself. Your method should not print anything. You may assume that input n > 0.

Add the following values (in the order provided) to a binary search tree and provide the values in the order you would get if you did an postorder traversal of your tree. Values: 6, 3, 7, 4, 9, 1, 0, 8, 5, 2

Add the following values (in the order provided) to a binary search tree and provide the values in the order you would get if you did an postorder traversal of your tree. Values: 2, 0, 7, 3, 5, 6, 9, 1, 4, 8