Question

In: Computer Science

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

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.

venereology answered 9 months ago

*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 an algorithm in pseudo code to find one element and delete it in a doubly...

Write an algorithm in pseudo code to find one element and delete it in a doubly linked list. Your algorithm will print the original list, request the user to put in an element to be deleted, then print the final list after the deletion is done. If the element doesn’t exist in the list, print "XXX is not in the list" where "XXX" should be the one you received from the user. Use the following as your test cases to...

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...

1. Write an algorithm to calculate the Matrix multiplication (or write with pseudo code) 2. Write...

1. Write an algorithm to calculate the Matrix multiplication (or write with pseudo code) 2. Write an algorithm to calculate the recursive Matrix multiplication (or write with pseudo code) 3. Find the time complexity of your pseudo code and analyze the differences

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(); };

Write the pseudo code for longest common subsequence algorithm in Java. Alg lCS( X , n,...

Write the pseudo code for longest common subsequence algorithm in Java. Alg lCS( X , n, Y, m) Input: String X of length n, String Y of length m Output: return the length of the longest common subsequence between X and Y

Write down an algorithm in pseudo-code whose running time where input is an array whose length...

Write down an algorithm in pseudo-code whose running time where input is an array whose length defines the problem size. Take the cost of execution of each line of the algorithm as 1. Make comment about the following paragraph: “You are given two independent algorithms and whose running time complexities are and , respectively. If we add a new line to our algorithm in which it calls the algorithm then the running time complexity of the modified algorithm becomes ”.

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, …