高纖營養三明治

時間: 2008/9/20 早上

今天起了個大早跟內人開心的將昨天事先買好的材料一一陳列在餐桌上，兩個人便開始七手八腳的參考網路上的食譜做高纖營養三明治。材料如下：

小黃瓜一條，剉成絲，以少許的白砂糖攪拌均勻，目的在增加口感
蕃茄二顆，切片
沙拉或美奶滋 (我們這次是準備低熱量的美奶滋)
蕃茄醬
胡椒粉
蛋 4 顆，煎成荷包蛋
火腿半條
全麥吐司半條

以上之材料約可做出四人份的三明治。製作步驟如下：

1. 煎荷包蛋
2. 將小黃瓜剉絲
3. 蕃茄切片
4. 火腿切片
5. 放上第一片吐司
6. 放蕃茄片，適量
7. 放火腿片，適量
8. 淋上適量的美奶滋
9. 蓋上第二片吐司
10. 舖上一層小黃瓜絲
11. 淋上適量的蕃茄醬
12. 放一份荷包蛋
13. 撒上適量的胡椒粉
14. 蓋上第三片吐司

如此即完成美味爽口的高纖營養三明治! 份量大但熱量低! 真的很讚!! 可惜的是忘了拍一下完成品的照片，就通通下肚了! =.="

Comments

Post a Comment

Popular posts from this blog

How to show only month and year fields in android Date-picker?

Image
Android default DatePicker show day/month/year fields but you have to customize this DatePicker as your requirements. Suppose that you want to show only month and year fields in android datepicker . To do this, you have to customize the Dialog DatePicker source code but it is not an easy task. In this tutorial I will show you a tricky way to solve this problem. Lets see how to show only month and year field in android DatePicker as a dialog.   Step to show only month and year fields in android date-picker: Some days ago I got this same problem and here I am trying to explain this in a sequential manner. I want to show a dialog datepicker when user click on an EditText. So if user click on EditText, A dialog datepicker will be invocked and it will show only month and year fields. To do this, at first we have to create a xml layout to hold the EditText fields. So create an android project and name it DatePickerExample. In the main.xml file just try to write this simple code....
Read more

How to construct a B+ tree with example

Image
A B+ tree contains n-1 search key values K1K2…….Kn-1 and have n pointers.   In a B+ tree the data are ordered  sequentially.  The leaf node may hold up to n pointers and must hold at least N/2 pointers. The root node must hold at least two pointers, unless the tree consists of only one node.  Now we construct a B+ tree. Construct a B+ tree for the following set of key values: (2,3,5,7,11,17,19,23,29,31) Assume that the tree is initially empty and values are added in ascending order. Construct a B+ tree where the pointer number is Four. Solution: When a node exceeds n-1 search key value then we split it into two nodes. First node contains (ceiling(n-1)/2) values.  2 nd node contains remaining node. Copy the smallest search key value of the second node to the parent node. Let's start, we know each node has N pointer and has N-1 search key values. In our example pointer number is 4, so the search key value is 4-1=3. So each node has 4 pointers and 3 search key val...
Read more

Conflict Serializability in database

Image
To maintains database state consistency we introduce serializability. Using serializability we can understand which schedule will ensure consistency, and which schedule will not. When we are capable of converting a concurrent schedule into a serial schedule then we cal it serializable schedule. A schedule is serializable if it is equivalent to a serial schedule. We divided this concepts into two parts 1. Conflict serializability  & 2. View serializability In this discussion I just clarify you the conflict serializability. Consider two instruction read, write and the data item A and B. When two instruction execute different data item such as read(A) and read(B), then we can swap the instruction without affecting the result of the schedule. But when the data item is equivalent to one another we need to consider following four condition.    a.   read (A ),    read ( A ).   they   don’t conflict.    b.   read ( Q),  ...
Read more