1. Take a tour of the Soap Factory and describe the process used? (word count maximum: 100)

Please complete a 250-word write-up describing the 8 steps of the billing process

C question

Using a for-loop: (a) calculate the length of a string, (b) find a word in a string

Plot a graph and briefly describe the monthly fixed deposits rate (12 months), savings deposits rates and lending rates of commercial banks for the period between Jan 2018-July 2020. You may plot the graph in excel, copy and paste in the word document for your submission.

Based on the information in (a), write an essay, approximately 500 word, to suggest three ways of financing the purchase of a house in Malaysia. In suggestion, compute and compare the cost of each method of financing.

Write a java program to reverse element of a stack. For any given word (from input), insert every character (from the word) into a stack. The output from the stack should be the same as the input. Your program should be using a stack and a queue to complete this process. 1. Push into stack 2. Pop from stack 3. Enqueue into queue 4. Dequeue from queue 5. Push into stack 6. Pop from stack and display java

1. Write a program that analyzes savings and expenses (variables of type double). Prompt the user for and retrieve these two values that have been given values. The program outputs the word Solvent, decreases the value of savings by the value of expenses, and sets the value of expenses to zero if the savings is at least as large as expenses. If, however, savings is less than expenses, the program simply outputs the word Bankrupt and does not change the value of any variables. pls write code in c++

Individuals experience various mood states or emotions at varying times every day, both subtle changes and obvious changes, that can result in attitude alternations with both negative and positive effects and impair or facilitate performance. The connections in the brain between emotion and memory have been particularly interesting to researchers given that neural networks that are activated by mood states are linked with neural networks that process basic perceptual functions such as word processing. Dr. Siebert has conducted a number of research experiments inducing various mood states through the use of music and then studying the effects of mood on lexical processing. (Dr. Pennie S. Siebert)

Previous research has shown that mood effects can be found in brain function at the level of lexical access. According to the associative network model of memory and emotion, emotions are represented in networks of nodes, as are words. Stimulation of emotion nodes activates networks that prime the retrieval of word nodes, creating mood-related effects on word retrieval such that positive emotions are associated with faster retrieval of positive words and negative moods are associated with faster retrieval of negative words. However, the speed of word retrieval may vary by type of mood, indicating stronger mood-related effects for some emotions compared to others. To assess differences in the speed of word retrieval under the influence of various mood states, researchers randomly assigned participants to happy, sad or neutral mood conditions and then tested their lexical retrieval of emotion-laden words.Participants were randomly assigned to listen to 30 minutes of happy, sad, or neutral music. They were then given a Reicher test which briefly presents a short string of letters that may or may not form a word. Participants were tasked with deciding whether or not the letters represented a word. Reaction time on the Reicher test was recorded for the three groups. Lower reaction time scores indicate greater mood effects on memory.

Research Question: Is there a difference in word recall among individuals who listen to happy, sad and neutral music?

Sad: 384.82, 380.26, 324.24, 314.68, 336.74, 380.26, 404.62, 331.46, 338.04, 418.28 [T=3613.98; M=361.40]

Neutral: 466.32, 430.94, 332.28, 338.04, 418.28, 597.08, 482.74, 436.74, 442.28, 580.34 [T=4525.04; M=452.50]   

Happy: 397.08, 482.74, 332.60, 397.92, 418.94, 519.54, 387.74, 442.62, 376.50, 360.34 [T=4116.08; M=411.61]

1. Write null and alternative hypotheses (in words and notation) appropriate for this research scenario.

2. Explain the concepts of SS_between, SS_within, SS_total, MS_between, and MS_within. With respect to this specific dataset, interpret what are those numbers are telling you?

3. Using the ANOVA Formula Worksheet, compute an ANOVA to test the hypotheses at an α = .05.

4. Compute the η² and interpret it. What might be variables that would influence mood other than listening to certain types of music?

word level palindrome program with stacks and queues

I have a good portion of my program finished, I am just trying to figure out how to do some final things to it. I want the program to only check for letters a through z and A = Z, treating uppercase and lower case as the same thing. I want it to ignore any other characters and to just realize word level palindromes, not sentence level, so for example a%345b@a c24&c8d)9cc would be a word level palindrome since the program would ignore the numbers and special characters and only look at each word or set of letters as a candidate. Since uppercase and lowercase will be treated the same, something like AbBa baB should also come back as a word level palindrome. Here is the code I have so far. Thanks for any help.

include <cassert> // Provides assert

include <cctype> // Provides isalpha, toupper

include <iostream> // Provides cout, cin, peek

include <queue> // Provides the queue template class

include <stack> // Provides the stack template class

using namespace std;

int main() {

queue<char> q;
stack<char> s;
char letter;
queue<char>::size_type mismatches = 0;  // Mismatches between queue and stack
cout << "Enter a line and I will see if it's a palindrome:" << endl;

while (cin.peek() != '\n')
{
    cin >> letter;

    if (isalpha(letter))
    {
        q.push(toupper(letter));
        s.push(toupper(letter));
    }
}

while ((!q.empty()) && (!s.empty()))
{
    if (q.front() != s.top())
        ++mismatches;
    q.pop();
    s.pop();
}

if (mismatches == 0)
    cout << "That is a palindrome." << endl;
else
    cout << "That is not a palindrome." << endl;


cin.ignore(2);


return 0;

}

PYTHON PROGRAM

Requirements:

1. Create an empty directory a variable named song_search

2. Repeatedly prompt the user to enter either the title of a song or enter nothing if they have no more songs to enter

3. For each song title entered by the user, split the song title into words by using the split function and splitting on a space. For each word from each song title, ensure the song_search dictionary has a entry with that word as the key and a list (initially empty) as the value

4. Also for each song title entered by the user and each word from each song title, insert the full song title into the list inside the song_search dictionary associated with each of the words from the song. For example, the contents of the song_search dictionary after the user would have entered the song titles Crazy in Love and What is Love:

song_search = {’Crazy’ : [ ’Crazy in Love’ ],’in’ : [ ’Crazy in Love’ ],’Love’ : [ ’Crazy in Love’, ’What is Love’ ],’What’ : [ ’What is Love’ ],’is’ : [ ’What is Love’ ]}

Once the user has finished entering song titles, repeatedly ask the user if they want to look up a song by keyword until they say no. If they respond yes prompt them for a keyword and print all the song titles containing that word by looking up the value in the song_search dictionary using the key word as the key

5. If the keyword the user entered is in more than one song title, print each song title on a separate line preceeded by a number beginning with one and increasing by one for each song

6. If the keyword the user entered is in none of the song titles print the message Keyword not found in any song titles