Banana Nut Cheesecake

 


 

-----------------------------------------------------------------------------

------------- Recipe Extracted from Meal-Master (tm) v6.14 ------------------

 

     Title: Banana Nut Cheesecake

Categories: Cakes Desserts    

  Servings: 10


      1 c  Chocolate Wafer Crumbs            1/4 c  Margarine, Melted 

     16 oz Cream Cheese Softened             1/2 c  Sugar 

    1/2 c  Mashed Ripe Bananas                 2 ea Large Eggs 

    1/4 c  Chopped Walnuts                   1/3 c  Milk Chocolate Chips 

      1 T  Margarine                           2 T  Water 


  Combine crumbs and margarine; press onto the bottom of a 9-inch springform

  pan.  Bake at 350 degrees F., 10 minutes.

  

  

  Combine cream cheese, sugar and banana, mixing at medium speed on electric

  mixer until well blended.  Add eggs, one at a time, mixing well after each

  addition.  Stir in walnuts, pour over crust.  Bake at 350 degrees F., 40

  minutes.  Loosen cake from rim;cool before removing rim pf pan.

  

  

  Melt chocolate pieces and margarine with water over low heat, stirring

  until smooth.  Drizzle over cheesecake.  Chill.

 

Comments

Post a Comment

Popular posts from this blog

BOTTOM LIVE script

                                  BOTTOM                                   ======                     by Adrian Edmondson and Rik Mayall                                 Bottom Live                                 ===========                               Richie  Rik Mayall                                Eddie  Adrian Edmondson Introduction ------------ [Opening shot of theatre, with huge pictures of Richie and Eddie. Caption: "Live fro...
Read more

Evidence supporting quantum information processing in animals

              Evidence supporting quantum            information processing in animals                    James A. Donald                    1068 Fulton Av                    Sunnyvale, CA 94089-1505                    USA I show that quantum systems can rapidly solve some problems for which finite state machines require a non- polynomially large time. This class of problems is closely related to the class of problems that animals can solve rapidly and effortlessly, but are intractable for computers by all known algorithms. 1. Introduction      Animals, including very simple animals, can rapidly and effortlessly perceive objects, whereas computers take nonpolynomial time to do this by all...
Read more

ARMIES OF CHAOS

                          ARMIES OF CHAOS -      Before anyone proposes more gun control, he or she should know  about a simple, deadly weapon 4 times as powerful as Dirty Harry's  legendary .44 Magnum -- and at least twice as concealable -- that  _can't_ controlled.        This simple, deadly weapon can be made by anyone -- even a  child -- with unpowered hand tools in an hour's time using $5 worth  of materials, most of which are available around the house anyway.   In traditional form it's reusable an unlimited number of times, and  modern plastics have rendered its disposable version electronically  undetectable.  You can clear a room with such a weapon (more of a  hand-held directional grenade than a gun -- sort of a recycleable  Claymore mine) and it's just one of hundreds of similar time-proven  designs. ...
Read more