In: Psychology
Consider the five
survey questions below from a job satisfaction survey, and indicate
the levels of measurement used for each question (nominal, ordinal,
interval, or ratio). Briefly explain your rationale for each
decision.
A. I feel I am being paid a fair amount for the work I do (Fields,
2002).
B. My primary role within the company is:
C. A reasonable amount I should be expected to contribute annually
to the company's health plan is:
D. Indicate the highest amount you were able to contribute to your
401k in 2017.
Reference
Fields, D. L. (2002). Taking the measure of work: A guide to validated scales for organizational research and diagnosis. Thousand Oaks, CA: Sage.
Please include the name of the person or question to which you are replying in the subject line. For example, "Tom's response to Susan's comment."
In: Operations Management
Examples, please
Paired design with repeated measures
Paired design with matched pairs
In: Math
Rodriguez Company pays $320,000 for real estate plus $16,960 in
closing costs. The real estate consists of land appraised at
$207,000; land improvements appraised at $69,000; and a building
appraised at $184,000.
Required:
1. Allocate the total cost among the three
purchased assets.
2. Prepare the journal entry to record the
purchase.
Allocate the total cost among the three purchased assets. (Round your "Apportioned Cost" answers to 2 decimal places.)
|
Note: Enter debits before credits.
|
In: Accounting
Compare and contrast the four responses to interpersonal conflict other than
collaborating. Also, briefly identify the situation where each response would be most
appropriate.
In: Operations Management
Hard networking major
Design a network for a private school that serves the learning side and allows for easier communication between teachers and students and saves time.
In: Computer Science
1. what control best prevents the receipt of items in the warehouse that are not ordered?
a. reconciliation of PO's to Receiving report
b. Bar-code scanners
c. receiving should have approved purchase order before receiving inventory\
2. what control prevents paying the same invoice twice?
a. only treasury should do cash disbursements
b. only pay original invoices
c. reconcile vender invoices to vendor payments
3. what control best prevents paying for items ordered, but yet received?
a. all receiving reports should be prenumbered
b. reconcile PO to Receiving report before making payment
c. all PO's should be prenumbered
In: Accounting
Can someone explain to me whats happening for every method in this code and the breakdown of everything. I added the p2.h file for any reference needed and i need the Implementation of the tree ADT in the p2.h file explained and why it was implemented in that file and not p2.cpp.
p2.cpp
#include
#include "p2.h"
#include "recursive.h"
using namespace std;
static int sum_helper(list_t list, int total) {
if(list_isEmpty(list))
{
return total;
}
else
return sum_helper(list_rest(list), total + list_first(list));
}
int sum(list_t list) {
return sum_helper(list, 0);
}
static int product_helper(list_t list, int total) {
if(list_isEmpty(list))
{
return total;
}
else
return (product_helper(list_rest(list), total * list_first(list)));
}
int product(list_t list) {
return product_helper(list, 1);
}
static int accumulate_helper(list_t list, list_t otherList, int result, int (*fn)(int, int), int identity) {
if(list_isEmpty(list)) return identity;
else if(list_isEmpty(otherList))return result;
else
{
result = fn(list_first(otherList), result);
return accumulate_helper(list, list_rest(otherList), result, fn, identity);
}
}
int accumulate(list_t list, int (*fn)(int, int), int identity) {
return accumulate_helper(list, list, identity, fn, identity);
}
static list_t reverse_helper(list_t list, list_t reverse) {
if(list_isEmpty(list)) return reverse;
else return reverse_helper(list_rest(list), list_make(list_first(list), reverse));
}
list_t reverse(list_t list)
{
return reverse_helper(list, list_make());
}
static list_t append_helper(list_t first, list_t second, list_t reverse_first, list_t result) {
if(list_isEmpty(first) && list_isEmpty(second)) return list_make();
else if(list_isEmpty(first))return second;
else if(list_isEmpty(second))return first;
else
{
if(list_isEmpty(reverse_first))return result;
else
{
return append_helper(first, second, list_rest(reverse_first), list_make(list_first(reverse_first), result));
}
}
}
list_t append(list_t first, list_t second) {
return append_helper(first, second, reverse(first), second);
}
static list_t filter_odd_helper(list_t list, list_t result) {
if(list_isEmpty(list))return result;
else
{
if (!(list_first(list)%2))
return filter_odd_helper(list_rest(list), result);
else return filter_odd_helper(list_rest(list), list_make(list_first(list), result));
}
}
list_t filter_odd(list_t list) {
return filter_odd_helper(list, list_make());
}
static list_t filter_even_helper(list_t list, list_t result) {
if(list_isEmpty(list))return result;
else
{
if (list_first(list)%2)
{return filter_even_helper(list_rest(list), result);}
else
{return filter_even_helper(list_rest(list), list_make(list_first(list), result));}
}
}
list_t filter_even(list_t list) {
return filter_even_helper(list, list_make());
}
static list_t filter_helper(list_t list1, list_t otherList, bool (*fn)(int), list_t result) {
if(list_isEmpty(list1)) return result;
else if(list_isEmpty(otherList)) return result;
else if(fn(list_first(otherList)))
{
result = list_make(list_first(otherList), result);
return filter_helper(list1, list_rest(otherList), fn, result);
}
else return filter_helper(list1, list_rest(otherList), fn, result);
}
list_t filter(list_t list, bool (*fn)(int)) {
return reverse(filter_helper(list, list, fn, list_make()));
}
static list_t rotate_helper(list_t result, unsigned int n){
if(n == 0 || list_isEmpty(result))return result;
else return rotate_helper(reverse(list_make(list_first(result), reverse(list_rest(result)))), n-1);
}
list_t rotate(list_t list, unsigned int n)
{
return rotate_helper(list, n);
}
static list_t insert_list_helper(list_t inFirst, list_t first, list_t fir1, list_t fir2, list_t second, unsigned int n2, unsigned int n1) {
if (list_isEmpty(inFirst) || list_isEmpty(second) || n2==0)
{
if(n2==0)return append(second, inFirst);
else return append(inFirst, second);
} else {
if (n1>0)
{return insert_list_helper(inFirst, list_rest(first), list_make(list_first(first),fir1),list_rest(first),second,n2,n1-1);}
else
return append(reverse(fir1), append(second, fir2));
}
}
list_t insert_list(list_t first, list_t second, unsigned int n) {
return insert_list_helper(first, first, list_make(), list_make(), second, n, n);
}
static list_t chop_helper(list_t numl, unsigned int n) {
if(list_isEmpty(numl) || n==0) return numl;
else return chop_helper(list_rest(numl), n-1);
}
list_t chop(list_t l, unsigned int n) {
return reverse(chop_helper(reverse(l), n));
}
int fib(int n) {
if(n==0) return 0;
else if (n==1) return 1;
else return (fib(n-1) + fib(n-2));
}
static int fib_tail_helper(int a, int counter, int b, int c) {
if(a==0)return 0;
else if(a==1)return 1;
else
{
if(counter
else if(a%2) return c;
else return b;
}
}
int fib_tail(int n) {
if (!(n%2)) return fib_tail_helper(n, 0, 0, 1);
else return fib_tail_helper(n, 1, 0, 1);
}
int tree_sum(tree_t tree)
{
if(tree_isEmpty(tree)) return 0;
else if(tree_isEmpty(tree_left(tree))&& tree_isEmpty(tree_right(tree)))return tree_elt(tree);
else if(tree_isEmpty(tree_left(tree)))return (tree_elt(tree) + tree_sum(tree_right(tree)));
else if(tree_isEmpty(tree_right(tree)))return (tree_elt(tree) + tree_sum(tree_left(tree)));
else return(tree_elt(tree) + tree_sum(tree_left(tree)) + tree_sum(tree_right(tree)));
}
list_t traversal(tree_t tree)
{
list_t ord_list = list_make();
if(tree_isEmpty(tree))return ord_list;
else
{
list_t elt = list_make(tree_elt(tree),list_make());
if(!(tree_isEmpty(tree_right(tree))))
ord_list = append(traversal(tree_right(tree)), elt);
if(!(tree_isEmpty(tree_left(tree))))
ord_list = append(traversal(tree_left(tree)), elt);
return ord_list;
}
} bool contained_by(tree_t A, tree_t B)
{
if(tree_isEmpty(A)) return true;
else if(!(tree_isEmpty(A) && tree_isEmpty(B))) return false;
else
{
if(list_first(traversal(A)) == list_first(traversal(B)))
return contained_by(traversal(A), traversal(B));
else
return(contained_by(tree_right(A), tree_right(B)) && contained_by(tree_left(A), tree_left(B)));
}
}
tree_t insert_tree(int elt, tree_t tree)
{
if(tree_isEmpty(tree))return tree_make(elt, tree_make(),tree_make());
else
{
if(elt
return tree_make(tree_elt(tree), insert_tree(elt, tree_left(tree)), tree_right(tree));
else
return tree_make(tree_elt(tree), tree_left(tree), insert_tree(elt, tree_right(tree)));
}
}
the implementation in the p2.h file is below.
const unsigned int tree_node_id = 0x45ee45ee; const unsigned int tree_empty_id = 0x56ff56ff;
struct tree_node
{
unsigned int tn_id; // Are we really a tree_node?
int tn_elt; // This element
struct tree_node *tn_left; // left subtree
struct tree_node *tn_right; // right subtree
}; static struct tree_node * tree_checkValid(tree_t tree)
// MODIFIES: cerr
// EFFECTS: assert if tnp does not appear to be a valid tree,
// writing an appropriate error message to cerr.
{
struct tree_node *tnp = (struct tree_node *)tree;
if ((tnp->tn_id != tree_node_id) && (tnp->tn_id != tree_empty_id)) {
std::cerr << "Error: user pass invalid tree\n";
//assert(0);
}
return tnp;
}
static void tree_checkNonEmpty(tree_t tree)
{
if (tree_isEmpty(tree)) {
std::cerr << "Error: user pass empty tree\n";
// assert(0);
}
}
bool tree_isEmpty(tree_t tree)
{
struct tree_node *tnp = tree_checkValid(tree);
return (tnp->tn_id == tree_empty_id);
}
tree_t
tree_make()
{
struct tree_node *tnp = 0;
try
{
tnp = new struct tree_node;
}
catch (std::bad_alloc a)
{
//not_allocated();
}
tnp->tn_id = tree_empty_id;
tnp->tn_left = NULL;
tnp->tn_right = NULL;
return tnp;
} tree_t tree_make(int elt, tree_t left, tree_t right)
{
struct tree_node *tnp = 0;
try
{
tnp = new struct tree_node;
}
catch (std::bad_alloc a)
{
//not_allocated();
}
if (!tree_isEmpty(left))
{
tree_checkValid(left);
}
if (!tree_isEmpty(right))
{
tree_checkValid(right);
}
tnp->tn_id = tree_node_id;
tnp->tn_elt = elt;
tnp->tn_left = (struct tree_node *)left;
tnp->tn_right = (struct tree_node *)right;
return tnp;
}
int tree_elt(tree_t tree)
{
tree_checkNonEmpty(tree);
struct tree_node *tnp = tree_checkValid(tree);
return tnp->tn_elt;
}
tree_t tree_left(tree_t tree)
{
tree_checkNonEmpty(tree);
struct tree_node *tnp = tree_checkValid(tree);
return tnp->tn_left;
} tree_t tree_right(tree_t tree)
{
tree_checkNonEmpty(tree);
struct tree_node *tnp = tree_checkValid(tree);
return tnp->tn_right;
}
static void print_spaces(int spaces)
// MODIFIES: cout
// EFFECTS: prints n spaces
{
while (spaces--)
{
std::cout << " ";
}
}
static void tree_print_internal(tree_t tree, int spaces)
// MODIFIES: cout
// EFFECTS: prints tree contents recursively, with newlines
// for each node, with each level indented
{
print_spaces(spaces);
if (tree_isEmpty(tree))
{
std::cout << "( )\n";
} else {
std::cout << "(" << tree_elt(tree) << "\n";
tree_print_internal(tree_left(tree), spaces+1);
tree_print_internal(tree_right(tree), spaces+1);
print_spaces(spaces);
std::cout << " )\n";
}
} void tree_print(tree_t tree)
{
tree_print_internal(tree, 0);
}
In: Computer Science
In: Computer Science
What is Tiffany & Co.'s product assortment? In terms of breadth, length, depth for stock.
In: Operations Management
In Acid - Base equilibria problems, how do you know what are the major species. I mean what do " major species " mean exactly?
In: Chemistry
What is the current state of the US Economy in the last 20 years?” Your report should include the following: GPD, unemployment, inflation and Labor Force Participation Rate. Include a general statement about the state of the economy and then brief commentaries on each of the measures. You can use FRED graph for your comparison
In: Economics
1. How do “buy one, get one free” deals sometimes deceive customers?
2. Why do retailers like Amazon show customers a product’s original list price along with the discounted price?
3. Discuss sales promotions in general. Compare/contrast this type of sales promotions to other promotional tools (e.g. commercials). Consider objectives, costs, and how it can be integrated into a comprehensive, unified promotion message. Use examples from businesses you've seen using this strategy. Think about how it fits into their overall marketing campaign.
In: Operations Management
CAN SOMEONE REVISE THIS AND MAKE IT BETTER?
Therefore, it is important for the law enforcement agencies of the nation to reflect the diversity in the community which it serves. With the Task Force being recognized, increasing diversity in the law enforcement agencies is an important tool in building trust with the societies. Diversity needs to be defined not only in line with gender, race, sexual orientation, religion, language, gender identity, experience and background. This is a finding which is strengthened by many years of research confirming that if members of the community believe law enforcement represent them, and they foster their trust in law enforcement. When the public views that law enforcement organization understands and responds to them, it instills confidence in the government and provides support to the integrity in democracy. This trust is very important in reducing tension, finding solutions to crimes and establishing a system where residents view law enforcement as just and fair. Witnesses and victims of crime many not engage or approach with the law enforcement when they consider them to be accountable for their concerns or experiences. The trust and the cooperation which they bring about assists officers in becoming more effective in their jobs.
In: Psychology
What does Maslow’s Hierarchy of Needs describe? what are Herzberg’s Two Factor Theory.
Motivation is of how many types? what are each one of them. What is the examples of motivation.
In: Operations Management