Suppose you want to know if different dosages of caffeine affect students’ performance on a test. We randomly sampled 15 college students and randomly assigned them to three conditions.
The table below displays these 15 students’ scores.
|
Group1 |
Group 2 |
Group 3 |
|
15 |
26 |
10 |
|
16 |
25 |
9 |
|
14 |
23 |
9 |
|
13 |
20 |
6 |
|
12 |
21 |
6 |
|
X |
Y |
Suppose you want to know if different dosages of caffeine affect students’ performance on a test. We randomly sampled 15 college students and randomly assigned them to three conditions.
The table below displays these 15 students’ scores.
2. Fill out the blanks of the following ANOVA table.
3. Perform the hypothesis testing to see if there are differences in test scores among the three groups. 4. Perform post-hoc comparisons. Find which groups are significantly different in test scores. 5. Enter the data in EXCEL. Analyze the data and attach the output. Confirm your results with the EXCEL output. Submit the output. |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
In: Statistics and Probability
Consider the University Database with the following relations:
Professors (pid, pname, dept, ext)
Students (sid, sname, major-dept, year)
Courses (cid, cname, dept, credithours)
Enrollment (sem-year, sid, cid, grade)
Teaches (pid, cid, sem-year, class-size)
where,
Professors: All professors have professor id (pid), name (pname), department that they work (dept), and a phone number extension for their office (ext).
Students: All students have id (sid), name (sname), department for their major (major-dept), and a year (year i.e, freshman, sophomore, junior, etc). Courses: All courses have a course id (cid), course name (cname), department (dept), and total credit hours (credithours).
Enrollment: has a semester year (sem-year), enrolled student id (sid), course id (cid), and grade that student earns (grade).
Teaches: has a professor id (pid), course id (cid), semester year (sem-year), and class size (class-size).
Attributes “dept” in relations Professors and Courses, and attribute “major-dept” in relation Students have the same domain, and have values like “CDS”, “EE”, “CE”, etc. Attribute “sem-year” has values like “Spring2016”, “Fall2015”, etc. Assume that cids are unique, i.e. if there are multiple sections of a course, each section has a unique cid.
Express the queries below using Relational Algebra.
1. Find sids, names and major-dept of students who enrolled in a course that is taught by professor James.
2. Find pid and names of professors who teach no courses in “Fall2015”.
3. Find cid and cname of courses that are offered by “CDS” department that are taught by professors who are from another department in “Fall2015".
4. Find pid and names of professors who teach only courses offered by “CDS” department.
5. Find pnames and pids of professors who teach every course offered by “CDS” dept.
6. Find sids of students who enroll in “Fall2015” every 3 credit hour course offered by “CDS” department.
7. Find cids and names of courses in which every student majoring in “CDS” enrolled in “Fall2015”.
In: Computer Science
| Shoe Size |
| 12 |
| 6 |
| 11 |
| 13 |
| 8 |
| 9 |
| 8 |
| 8 |
| 9 |
| 9 |
| 11 |
| 5 |
| 10 |
| 8 |
| 7 |
| 7 |
| 11 |
| 9 |
| 9 |
| 9 |
| 12 |
| 8 |
| 8 |
| 8 |
| 12 |
| 9 |
| 11 |
| 8 |
| 11 |
| 8 |
| 13 |
| 5 |
| 9 |
| 8 |
| 11 |
We need to find the confidence interval for the SHOE SIZE variable. To do this, we need to find the mean and standard deviation with the Week 1 spreadsheet. Then we can the Week 5 spreadsheet to find the confidence interval. This does not need to be separated by males and females, rather one interval for the entire data set.
First, find the mean and standard deviation by copying the SHOE SIZE variable and pasting it into the Week 1 spreadsheet. Write down the mean and the sample standard deviation as well as the count. Open the Week 5 spreadsheet and type in the values needed in the green cells at the top to find the confidence interval.
Change the confidence level to 99% to find the 99% confidence interval for the SHOE SIZE variable.
|
We need to find the confidence interval for the SHOE SIZE variable. To do this, we need to find the mean and standard deviation with the Week 1 spreadsheet. Then we can the Week 5 spreadsheet to find the confidence interval. This does not need to be separated by males and females, rather one interval for the entire data set. First, find the mean and standard deviation by copying the SHOE SIZE variable and pasting it into the Week 1 spreadsheet. Write down the mean and the sample standard deviation as well as the count. Open the Week 5 spreadsheet and type in the values needed in the green cells at the top to find the confidence interval.
Change the confidence level to 99% to find the 99% confidence interval for the SHOE SIZE variable.
|
In: Math
Please correct chosen answers if incorrect.
22) d
23) c
24) c
22) Which of the following is not true regarding event rates:
a. an event can be anything such as Chicago Cubs winning the World Series
b. event rates are seldom used as they only provide data of nominal significance
c. event rate is statistical term that describes how often an event occurs
d. the formula for event rate is the number of times the event occurs, divided by the number of possible times the event could occur
23) Which of the following statements is not true regarding data collection:
a. often times, in our field, we collect data to help us infer or hypothesize about any number of things including treatments, prevention, occurrences, etc
b. collecting count data may be on one single sample or cohort, due to any number of reasons
c. when data is collected on count data, e call the outcome of that collection, results
. in single group studies, control groups are the standard
24) Which of the following statements is true:
a. comparisons between age-adjusted rates can only be useful if the same standard population is used in the creation of the age-adjusted rates
b. event rates are never seen as something which is important in public health except in epidemiological concerns
c. count data is something that is important when considering data gathered on vampires
d. person-time is often used in epidemiological studies in the veterinary sciences
In: Math
Show your numerical answer(s) and the Excel function(s) and inputs you used to get the answer. You may use up to 25 words (50 for #4) to supplement your numbers, tables and Excel functions.
1. State Retirement Funding (5 points – 1 page with table, functions and 25 words)
A state retirement plan has been frozen. It is considered fully-funded, with $635,244,352.26 of assets on hand and makes payouts to 1,000 recipients. It assumes it will earn 7.5% per year on these assets. The most recent total payout was $50,000,000. Next year it will be $51,000,000, which includes a 2% COLA increase in benefits. This payout amount is scheduled to increase by 2% per year for inflation. All interest earned and payments occur at the end of the year. For this cohort of retirees the final payment will be made in exactly22 years from today. The fund balance at that time will be zero.
The effective rate for annuities like this is RATE = .
The PV was calculated as =PV(RATE,22,-50000000,0,0)
In: Finance
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
This question is designed to test on the understanding of students in the recording of the business transactions using the double entry system under the book of prime entry format.
INSTRUCTIONS:
1. Assuming you are planning to set up a sole trading business selling finished goods (name your product) to customers in your area (any area choose by the student is acceptable).
2. Create possible business transactions between your business and supplier and also between your business and customers.
3. The business transactions should include at least:
a. 4 credit transactions
b. 2 returns transactions
c. 4 cash transactions
d. 2 drawing transactions
e. 2 operating expenses transactions
f. 2 other revenues transactions
g. Other transactions
4. Your report should include the following informations:
a. Introduce the business background (including capital contributed, name of the business, address, type of goods sold,etc)
b. Accounting transactions
c. Specialised journals
d. Subsidiary ledgers account
e. Trial Balance as at that date.
5. Report format
b Table of content
c. Introduction
d. Content
e Conclusion
f Bibliography or references
g Appendix
In: Accounting
Suppose that bicycles in the drawing are not identical: One bike is plated in gold and valued significantly higher than the other two, the silver and bronze bikes, with the bronze being the cheapest.
In: Math
A random small sample of 15 novels making a national best seller
list was selected. The average length of time these novels stayed
on the best seller list was 5.2 weeks with standard deviation 2.3
weeks. Find the 99% confidence interval for the average number of
weeks a book is on the best seller list
In: Statistics and Probability
LIST the habits that hinder critical thinking (you may simply list them). IDENTIFY the six important distinctions in critical thinking (you may simply list them). COMPOSE a brief strategy for critical reading. SUMMARIZE a brief strategy for critical listening. CREATE a brief strategy for critical viewing.
In: Computer Science