ajo6vul4 的部落格

課程參予-筆記03

[XHTML]

1.Many start tags have attributes that provide
additional information about an element

2.Each attribute has a name and a value separated by an
equals sign (=)  變數名稱=變數的質

3.element or attribute name is a syntax error (但原則上還是有分)

4.XHTML provides six headings (h1 through h6)
for specifying the relative importance of
information
– Heading element h1 is considered the most significant
heading and is rendered in the largest font
– Each successive heading element (i.e., h2, h3, etc.) is
rendered in a progressively smaller font

課程參予-筆記02

[XHTML]

1.The title element:
– Names a web page(名稱)
– Usually appears in the colored bar (called the title bar) at
the top of the browser window
– Is the text identifying a page when users add your page to
their list of Favorites or Bookmarks (取名稱很重要)

2.The body element:
– Contains the document’s content, which may include text
and tags (body是核心的部份)

3.All text placed between the <p> and </p> tags
forms one paragraph (表示一個段落)

4.‧ XHTML documents delimit an element with start
and end tags (e.g. <html>  </html>)<<注意結尾斜線

課程參予-筆記01

[XHTML](Extensible HyperText Markup Language)

1.markup language for creating web pages

2.text is marked up with elements
delimited by tags that are names contained in
pairs of angle brackets(表示為一個網頁)
-Every XHTML document contains a start <html> tag
and an end </html> tag (對稱的格式,但有例外)
-tag=element (文件裡的標籤)

3.標籤elements裡含有"屬性attributes"

4.註解Comments in XHTML always begin with <!--
and end with -->

5. Every XHTML document contains a head
element which generally contains a title,a body element

計概筆記15


<計概筆記8-2>

˙storing binary trees:
  1.每個節點包含:
    (1)the data
    (2)a pointer to the node's first child(left child pointer左子指標)
    (3)a pointer to the node's second child(right child pointer右子指標)
  2.root pointer 根指標 : store the address of the root node
  3.在記憶體n的節點,其左`右子節點儲存在記憶單元的位置分別為2n與2n+1
  4.某節點的位置除以2(餘數去除),可找出其父節點的位置

˙binary search algorithm 二分搜尋法
  1.把名單的中間項目當作根節點
  2.前半部的中間項當作根的左子節點
  3.後半部的中間項當作根的右子節點
  4.遇到偶數項時,取較大的為中間項

                F
             /     \
           D        H
         /   \       /   \
       B     E   G     J
      / \                 /
    A   C            I

計概筆記14

<計概筆記8-2>

˙traveraing a list : going through the list, node by node, and processing each node
  1.counting the number of nodes
  2.printing the contents of nodes
  3.summing the values of one or more fields

˙storing stacks : similar to a contiguous list (要先保留一塊足夠應付堆疊成長及縮小作業所需的連續記憶體區塊)

˙stack pointer 堆疊指標 : pointer to the top of the stack

˙storing queues : as Circular Queues 環狀佇列
  - stored in a contiguous block in which the first entry is considered to follow the last entry
  - prevents a queue from crawling out of its allotted storage space
  - head pointer 頭指標 : keeps track of the head of the queue
  - tail pointer 尾指標 : keeps track of the tail

計概筆記13

<計概筆記8-2>


˙general list : 1.data can be inserted and deleted anywhere
                      2.no restrictions on the operations

˙restricted list : 1.data can be added or deleted at the ends of the structure
                        2.processing is restricted to the operations on the data at the ends of the list EX. stacks,queues

˙Four common operations are associated with liner lists : insertion, deletion, retrieval, and traversal

˙storing list :
  -contiguous list 連續串列 : list stored in a homogeneous array
  -linked list 指標串列 : list in which each entries are linked together by pointers
    -head pointer 頭指標 : pointer points to the beginning,or head,of the list
    -NIL pointer : to mark the end of a linked list

˙nodes : 1.the elements in a linked list
               2.each element contains two parts - data and link
               3.each node contains only one link to a sigle successor unless it is the last

˙inser into a linked list :
    1.adding to the empty list
    2.adding at the beginning
    3.adding to the middle
    4.adding at the end

計概筆記12

<計概筆記8-2>

˙Abstraction抽象化:
  -the concept of abstraction means:
   1. You know what a data type can do.
   2. How it is done is hidden.
  -user : in this context does not necessarily refer to a human
 
˙ADT(Abstraction Data Type)
  1.Declaration宣告 of data
  2.Declaration of operations
  3.Encapsulation封裝 of data and operations

˙static v.s dynamic structures
  -構成資料的抽象型態時的一個重要差異點是 : 結構的形狀及大小是否隨時間而改變(靜態 or 動態)

˙Pointer : is a storage area that contains such an encoded address.
                is used to record the location where data items are stored.
  - another name for a program counter程式計數器 is instruction pointer指令指標.

˙儲存陣列
  1.同質陣列 :
    - 分為 : 1.row major order以列為主次序
               2.column major order以行為主次序
    - 必須先在記憶體中保留和陣列相當大小的連續區塊
  2.異質陣列 :
    - store each component in a separate location and then link them together by means of pointers.
    - is especially useful in those cases in which the size of the array's components is dynamic變動的.

計概筆記11


7-8 Software Ownership所有權

˙Copyright
    -The "substantial similarity"test
    -Filtration criteria: what is not copyrightable
      ˙Features covered by standards
      ˙Characteristics dictated by software purpose
      ˙Components in the public domain
    -The "look and feel"argument

˙Patents專利權
    -"Natural laws" are traditionally not patentable

˙Trade secrets
   -Non-disclosure洩漏 agreements are legally enforceable強制的

計概筆記10

7-6 Software Testing Strategies
˙Glass-box testing(white-box testing)
   -Pareto principle巴累圖原理
   -Basis path testing基本路徑測試法

˙Black-box testing
   -Boundary value analysis邊界值分析法
   -Redundancy testing多重作業
   -Beta testing 


7-7  Documentation
˙User Documentation使用者文件
    -Printed book for all customers
    -On-line help modules

˙System Documentation系統文件
   -Source code
   -Design documents

˙Technical Documentation技術文件
   -For installing安裝, customizing訂做, updating, etc

頁面