51

1

2 3 4

2 5 6 7 8

1

1

1.

2.

3. -

4.

DATA UNITS)

1. bit)2 0 1

2. charecter)ASCII 1 8

1 01000001 A 16 Unicode 0000 0000 1110 0110 ?

3. Field)

4. Record)

431999999

5. file)

6. Database)

Key field)

2

3.1 formatted data)

3.2 text)

3.3 images)

3.4 audio)

3.5 video)

6.1 master file)

6.2 transaction file)

6.3 table file)

51 4,50052 1,20053 4 M 4,50054 8 M 7,00055 50056 200

inventory master file) customer order master file) production master file)

3 product code)

product description) product price)

2

6.4 sort file)

report file)

3

4

word processor) compression utility)

file extension) Microsoft Word doc Winzip

zip Microsoft Word2000

doc .htm .html .rtf .txt .mcw wpsdoc

Adobe Photoshop psd

Bitmap ( BMP) Graphics Interchange Format (GIF) Joint Photographic Experts Group (JPEG) Windows PaintBrush , Adobe Photoshop Microsoft Photo Editor

exe , .com , .bat , .dll

2

5

2

Physical Data Structure)

2 1. Primitive Data Types)

- Integer)- Floating point)- Boolean)- Real)- Character)

2. Structure Data Types)- Array)- Record)- File)

- Logical Data Structure)

2 1. Linear Data Structure)

- List)- Stack)- Queue)- String)

2. Non-Linear Data Structure)

- Tree) - Graph)3. Data Structure Operation)

4 1. Traversing)2. Searching)3. Inserting)4. Deleting)

2 1. Sorting)2. Merging)4.

2 Static Memory Representation)

Array)Dynamic Memory

Representation)

Pointer)5.5.1

5.2 Decision)

2 5.3 Loop)

6. Algorithm)

1. Divide and conquer)2. Dynamic Programming)3. Greedy Algorithm)

Flowchart)Flow Chart

Pseudo Code)Pseudo Code

- Machine Language)- Assembly Language)- High Level Language)- 4 (Fourth Generation Language 4GL)

Program Maintenance)

6

• accuracy)

• (relevancy)

• (timeliness)

7

,

2

1. Internal Sorting

2. External Sorting

1. SELECTION SORT2. INSERTION SORT / LINEAR INSERTION SORT3. BUBBLE SORT4. SHELL SORT

5. BUCKET SORT /RADIX SORT6. QUICK SORT7. HEAP SORT / TREE SORT1. Selection Sort)

-A(1) A(1)

- A(2), A(3),....,A(n) A(2) N-1

2. Insertion Sort)

1.

2. 3. Insert 3. Bubble Sort)

1 2 2 3

Bubble Sort

4. shell sort)sort

11959 D.L.SHELL) shell

sort)

5. radix sort)

6. quick sort)C.A.R HOARE)

pivot)

7. heapsort)2

1. 2.

8 (searching)

(Sequencial Search)

2 (Blind Search) (Heuristic Search)

(Blind Search)

(Blind search)

- (exhaustive search)- (partial search)

(Depth first search)(Breadth first search)

(Depth first search)

(Root node)(Terminal node)

1

()

(pop)

2

A B C AC C C

D F(Push) B D F C F

G B D G(A C F G H E D B) 1

1

1

(Breadth first search)

( 0) 1 1 23

3

(Breadth first search)( 0)

3

(Queue)

4

A B CA B

D E B D E B(A B C D E F G H)

2

2

n+1 n

n+1 n

(Heuristic Search)

(heuristic search)

(heuristic function)

(aspects)

Weak Methods Weak Methods (general-purpose control stategies)

(Hill climbing)

Hill climbing algorithm

(Hill climbing)

6Hill climbing

h(i) i h-

-

-

(Steepest ascent hill climbing)

(Best-first search)

(Depth firstsearch) (Breadth first search)

(most promising)

2.71 (root node) 2

B C B C3 1 C

()

C 3 D E4 6

(terminal node)B 3 ( )

4 F G6 5

:1. OPEN2.

OPENOPEN

i)

OPENii)

Greedy (Greedy Algorithm)(Best first

search)

1.2.3.

3.1

3.2

4. 2

A B C D 3

9

9 AB C D A 20

30 50 BB C D 15 20

C C D10 D A20 + 15 + 10 + 50 = 95

A*A*

A*

A*2

f gcost h'

cost

f = g + h’

A* (A* Search)

A* f' sf'(s)=g(s)+h'(s)

g h'f'

h'

'h'

g'

f'h' g

A*f' h'

f' A*h'

g A*f'

11 A* 8

g A B,C D

CA* f' E

h' E