Question

In: Computer Science

In pseudo-code, design an algorithm for finding baking a cake.

In pseudo-code, design an algorithm for finding baking a cake.

Solutions

Expert Solution

Solution:

Algorithm for finding baking a cake:

Step 1: Start

First, set out ingredients

3/4 cups butter or margarine, softened

3 eggs

2 cups sugar

2 cups flour

3/4 cup unsweetened cocoa powder

1 teaspoon baking soda

3/4 teaspoon baking powder

2 teaspoon vanilla

1 1/2 cup milk

Step 2: Pre-heat oven to 350 degrees.

Step 3: Grease and flour three 6" * 1 1/2" round cake pans.

Step 4: Mix together flour, cocoa powder, baking powder and baking soda. Set aside.

Step 5: In a large bowl, beat butter, eggs and vanilla.

Step 6: Gradually add sugar.

Step 7: Beat on medium to high speed for about 3-4 minutes until well mixed.

Step 8: Alternately combine in flour mixture and milk to batter while beating.

Step 9: Continue to beat until batter is smooth.

Step 10: Pour equal amount of batter into greased and floured round cake pans.

Step 11: Bake 30 to 35 minutes.

Step 12: Check with the toothpick to see if it is done. Bake a few minutes more, if needed.

Step 13: Remove from oven and allow cakes to cool in pans for a few minutes.

Step 14: Done.  

Please give thumbsup, if you like it. Thanks.


Related Solutions

*Please give the answers in pseudo code 1) Design an algorithm that will receive two integer...
*Please give the answers in pseudo code 1) Design an algorithm that will receive two integer items from a terminal operator, and display to the screen their sum, difference, product and quotient. Note that the quotient calculation (first integer divided by second integer) is only to be performed if the second integer does not equal zero. 2) Design an algorithm that will read two numbers and an integer code from the screen. The value of the integer code should be...
Develop an algorithm for INSERTION SORT. Give the pseudo-code version. Convert your pseudo-code into a Java...
Develop an algorithm for INSERTION SORT. Give the pseudo-code version. Convert your pseudo-code into a Java program.
Write a pseudo code for an O (n7log3n) algorithm. Please write in C++.
Write a pseudo code for an O (n7log3n) algorithm. Please write in C++.
Write a recursive algorithm in pseudo-code to compute the “power list” of a given list of...
Write a recursive algorithm in pseudo-code to compute the “power list” of a given list of integers. Assume that the List type has members: int List.length returns the length of the list. void List.push(T n) pushes an element n to the front of the list T List.pop() pops an element from the front of the list. List$$ List$$.concat(List$$ other) returns the concatenation of this list with other. Explain in plain English the reasoning behind your algorithm. Power Lists should be...
Describe in pseudo-code, a linear-time algorithm for reversing a queue Q. To access the queue, you...
Describe in pseudo-code, a linear-time algorithm for reversing a queue Q. To access the queue, you are only allowed to use the basic functions of the queue ADT defined as follows (Hint: Using a stack, the basic stack functions defined in the textbook and in the class). class Queue { public: int size(); bool isEmpty(); Object front(); void enqueue(Object o); Object dequeue(); };
Design in pseudo code a multiple recursive version of Tetranacci calculators. Tetranacci numbers are a more...
Design in pseudo code a multiple recursive version of Tetranacci calculators. Tetranacci numbers are a more general version of Fibonacci numbers and start with four predetermined terms, each term afterwards being the sum of the preceding four terms. The first few Tetranacci numbers are: 0, 0, 0, 1, 1, 2, 4, 8, 15, 29, 56, 108, 208, 401, 773, 1490, …
Design in pseudo code a linear recursive version of Tetranacci calculators. Tetranacci numbers are a more...
Design in pseudo code a linear recursive version of Tetranacci calculators. Tetranacci numbers are a more general version of Fibonacci numbers and start with four predetermined terms, each term afterwards being the sum of the preceding four terms. The first few Tetranacci numbers are: 0, 0, 0, 1, 1, 2, 4, 8, 15, 29, 56, 108, 208, 401, 773, 1490, …
1.1 Describe the Marching Cubes algorithm using pseudo-code. What are potential issues of Marching Cubes. (I...
1.1 Describe the Marching Cubes algorithm using pseudo-code. What are potential issues of Marching Cubes. (I need pseudo code explaination)
Design and analyze a divide-and-conquer algorithm for finding the maximum element in a list: L[0: n – 1].
The following submission rules apply:·    For those questions requiring programs, the solutions must be implemented using JavaScript or Java.o Appropriate self-documenting comments in the source code are mandatory, consistent with good programming practices.o Solutions must be provided in plain text so that formatting is not lost.·    All answers must be provided in this document.·    Sources must be given accurate and complete citations sufficient for the instructor to find and confirm them.Design and analyze a divide-and-conquer algorithm for finding the maximum...
Design and write an efficient Python function (with tester code) for finding the 10 largest elements...
Design and write an efficient Python function (with tester code) for finding the 10 largest elements in a sequence of size n, where n >= 50. In your tester function, write code that generates at least 50 random numbers and stores them in an array, then calls your function on that array (and prints the resulting 10 largest elements). This function must be as efficient as possible. Marks will be deducted for a slow function, even if it actually answers...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT