Internet
Network
Moden Roufer swifch APs computers
LA
computer
I
Domain hame
loroin
http 1/
: www
,
. c
.
nabe Co ☆
-
.
o, leral
domain
… 1
sub domain
!“
domain
n
( ohot
o Dohcin o can
regiter )
More AP
larger area , cohhetion scanlesly( 無逢地 )
Rons
⼀
Columns ⼀
⼀
Need Thenmleondprintdpappn Inkjet
ink
printer Laser
Toner
printer
Price Low
High Low
speed Fast Slow Fast
high
Bot
density
Low
Very hgh
other
povercohsrption Inkjet
Quiet ,
igh
Size small ,
than
lightneightfine
fade orer
,
Bupotabostransterdata or instructiong
Address bos transter memory addresses
Control bos transfer whtrol
sighals
Stroag e
" >
Inputloutput
derice
<
< sProcessorss }
s devices
Machine
tetdl
⼀
-
-
C
k
≤
execute
-
AM ALU
Data access rate
c
Harddisk 7
* Register 3 Cace 7 RAM 7 SSD )
Magnctic tap
Process
Input s >
Output
尐
Main storage
公
Secondary Stovage
MAR & MDR
CPU address
registers stores
memory
H2 K M G
1013 0. (
s m ｡
⼼台
-
10. -
3 101 -
6 101
.
9
F4 Excel (Spreadsheet)
(IF)
($)
=average, =max, =min
COUNTIF, SUMIF
XLOOKUP
↑
- take Art
T
-
TEXT STRING RELATED:
Negative Number:
Two’s complement Representation
4-bit number:
1001 -8 (1) + 4(0) + 2(0) + 1(1) -710
0011 -8(0) + 4(0) + 2(1) + 1(1) +310
5-bit number:
10001 -16(1) + 1(1) -1510
Overflow Error (two’s complement representation)
1111 + 0011 (-) + (+) No overflow error
-
0011 + 1000 (+) + (-) No overflow error
-
0111 + 0011 (+) + (+) = (-) YES , OVERFLOW ERROR
0111
0011
111
1010
0001 + 0001 (+) + (+) (+) 0010 NO OVERFLOW ERROR
Data Control
Data Validation
EVEN Parity Check :
Every 7 bit patter, we add 1 parity bit
1010101 ( 0 ) (EVEN Parity)
1010101 ( 1 ) (ODD Parity)
1111111(0) (EVEN Parity Pass or Not pass) NO
Length Check (must have at least 8 characters) , Range Check (must be 1 to 100)
Format Check (must with @???.com)
Fixed Value Check (must be “M” or “F”)
Type Check (must be integer) (e.g. Input 1.23 Invalid Data)
Data Verification
Double input and then double check
Elective A (Paper 2 Database)
Elective C
Sorting Algorithm (should have one every year in DSE)
Search Algorithm (Linear Search , Binary Search)
Linear Search:
Key = 79
Found = False
i 0
While(i <= 9 and Found == False):
If(A[i] == Key):
Found = True
i i+1
if(Found == True):
output (“Found position is :” , i-1)
Data base
SCT- IF two table
NOT1
-
SELECT s .
name ,
r .
name
FROM STUDENTS ,
RESULT r
DESC/ASC
=
F)/INIIS/LIKE 1 . . .
%
- FROM table 1 th LEFT JOIN table 2 t &
&
,
WHERE to data = t datenot N
ME NAME
-
>
By FYMOUNT Integr
the table
STINTOSAAESENT ,MON
In
>
-
,
-
- UPDATE
TABLE
AE COLUMN =
New VALUE
WHERE PRIMARY KEY I
USUALLY
. Cr
1
21 BXA
A
2 . A XB
BX 24 .
D-
5 .
A- 25 .
A XC
6. ~ 26 B .
7 D
. Bx
~
.
8. Du
9 AXD .
29
.
10 . 13 XC · Cr
11 .
B 31 C XB .
12 .
D 32 .
Dm
B, C 35 A -
.
14 B- . 34 D- .
15 B .
~
35 D .
16 A~ .
36 .
Bu
17 C XD .
37 .
18 B XC .
38. ~
19 B
co D XA
.
.
:
