We wonder if caffeine facilitates the learning of nonsense syllables. We randomly assign participants to one of two groups. People in the experimental group drink 2 cups of coffee and then learn a list of nonsense syllables. People in the control group drink 2 cups of plain water and then learn the same list. We record the number of trials required to perfectly learn the list for each participant. Did participants who drank the coffee learn the list faster than participants who drank the water? Be sure to interpret your answer completely, including a graph if appropriate. t-test for Independent Samples df = N1 + N2 – 2

Exercise 1 (1 point) For this step, you will load the training and test sentiment datasets "twitdata_TEST.tsv" and "allTrainingData.tsv". The data should be loaded into 4 lists of strings: X_txt_train, X_txt_test, y_test, y_train. Note, when using csvreader, you need to pass the "quoting" the value csv.QUOTE_NONE.

import csv X_txt_train = ... y_train = ... X_txt_test = ... y_test = ...

assert(type(X_txt_train) == type(list())) assert(type(X_txt_train[0]) == type(str())) assert(type(X_txt_test) == type(list())) assert(type(X_txt_test[0]) == type(str())) assert(type(y_test) == type(list())) assert(type(y_train) == type(list())) assert(len(X_txt_test) == 3199) assert(len(y_test) == 3199) assert(len(X_txt_train) == 8018) assert(len(y_train) == 8018) print("Asserts Completed Successfully!")

Sales for Outback Steakhouse has significantly decreased due to fierce competition and new healthy well-being lifestyle trends. As the marketing director, you were asked to re-position the brand. How can Outback Steakhouse differentiate itself within the emerging health trends?

1) List your ideas in the following attributes: a) physical attributes, b) service, c) personnel, d) location, e) image (list at least 1 example for each component). (10 points)

2) Indicate what type of new promotion-mix strategies you would implement (list at least 1 example for each promotion tool). (10 points)

3) Finally, re-design the pricing strategy for Outback Steakhouse (list at least 1 example). (5 points)

Write a subroutine named swap in C thatswaps two nodes in a linked list. The first node should not be able to change places. The nodes are given by:

Struct nodeEl {

int el;

struct nodeEl * next;

};

typdef struct nodeEl node;

The list header (of type node *) is the first parameter of the subroutine. The second and third parameters consist of integers and are the places in the list where the nodes are to change places. The subroutine should be written in such a way that the nodes change places (and not the elements in the nodes). A suitable precondition for calling the subroutine is that the two places must be greater than 1 and less than or equal to the number of list elements. The subroutine must be written without using library functions (the exceptions are malloc and free). It is allowed to define help functions. Also write an explanation of how the subroutine works

Hello. Please answer the following question in Scheme. Not Python, not any form of C, but in the language Scheme. If you do not know Scheme, please do not answer the question. I've had to upload it multiple times now. Thank you.

4 Write a recursive function called mergesort that sorts a list by doing the following:
(a) Use split to split the list into two roughly equal-sized partitions.
(b) Recursively sort both partitions.
(c) Use merge to merge the sorted partitions together.
Once again you will need two base cases, one for the empty list and the other for a single-element list.
> (mergesort '())

()

> (mergesort '(9))

(9)

> (mergesort '(8 6 7 5 3 0 9))

(0 3 5 6 7 8 9)

Write a MIPS program using the Bubble Sort algorithm, that sorts an input list of integers by repeatedly calling a “swap” subroutine.

The original unsorted list of integers should be received from the keyboard input. Your program should first prompt the user “Please input an integer for the number of elements:”. After the user enters a number and return, your program outputs message “Now input each element and then a return:”. For example, if the user enters 5 as the number of integers, and then the sequence of integers one by one: 1,-2, 3, 3, -4, it should display “The elements are sorted as: -4, -2, 1, 3, 3” (the output sequence of integers should be either space-separated or comma-separated).

The final sorted list (increasing order) should be stored in the data area, that starts with the label "list:".

1. Programming Exercise 1

Write a function that will have a list as an input, the task of the function is to check if all the elements in the list are unique,( i.e. no repetition of any value has occurred in the list), then the function returns true otherwise it returns false. Your program should include a main method that call the method to test it.

2. Algorithm Analysis

For the function you implemented in part 1, please calculate T(n), which represents the running time of your algorithm in terms of n. Where n is the length of the list. Then find the order of magnitude of your algorithm (Big O).

3. Algorithms Comparison

Please find another algorithm that solves part 1, write the code, calculate T(n) and find Big O. Then compare the efficiency with the algorithm from part1 to determine the more efficient one.

Consider the following relational schema:

Salerep(sales_rep_ID, name, address, commission, rate)

Customer(customer_number, name, address, balance, credit_limit, sales_rep_ID)

Part(part_number, part_description, on_hand, class, warehouse, price)

Orders(order_number, order_date, customer_number)

Orderlilne(order_number, part_number, number_order)

Write SQL statements for the following queries:

a) Produce a list showing part_number, part_description, on_hand, and price sorted by part_description.

b) List customer’s name followed by order_number, part_description, and number_order.

c) List names of customers who have ordered the most expensive item(Hint: Use a nested SQL query to determine thehighest price.)

d) List the names of the sale_reps who have sold the most number of part “123”.(Hint: Use a nested SQL query for the FROM clause)

Could I please get explainations and working out as to how to get to the answers.

Note that  is where part of the answer goes.

1.

Write a statement that removes the first occurrence of item 10 (if any) from an ArrayList of Integer objects, data.

data.remove(  );

2.

Complete the following function that returns true if ArrayList list contains any positive (more than 0) item, false otherwise.

public static  containsPositive(ArrayList list) {

for(int i=0; i < list.size(); i++) {

if(    ) {

 ; }

}  ; }

3.

Consider the following list:

ArrayList list = new ArrayList(Arrays.asList(10, 70, 20, 90, 30, 80, 50, 40, 60));

Complete the following code that gives the following output:

20 90 30 80 50 40 60

 <interger> iter = list.listIterator(  );

while(iter.  ) {

System.out.println(  +" ");

}

Write a class IgnoreCaseComparator that implements Comparator<Character>. If it were used as the argument to List.sort(), it would sort the list ignoring case. This behavior is different from using the natural ordering of characters, where uppercase characters come before lowercase characters.

Note that this question is not asking you to sort a list -- just to write the comparator!

For example, if the unsorted list were [b, C, A, d], then the list would be [A, b, C, d] after sorting using this comparator. (If you had sorted using the natural ordering of characters, the result would instead have been[A, C, b, d].)

You may find a utility method of Character, such as Character.toLowerCase(), helpful.

You may assume that Comparator and Character are imported. You may not import other classes.