O Dewowry « hase - lo numbering system woes (NARs
O Binary. a base-v numbering system thart uses (lb andl (Op
% aie 1
© texadecinnal a vase-Ib numbering syvtem usec OR) ol CP
woth] yoe| ib | |
O Binary w De nary
1 bY Br Ib & zl
ud a => lat rai tet 92> 4d
0 0 | ol ord
O Herndecimal vo Binary
N72 bb 3 Ib & Yr | 0 jlo ho > bE
Yeo ow vy. Bar =>
@ 1 ' 0 11 ro
Up ob yxy ers WDE
O Henadecrmad to Denavy
IK
tury Url > De bu WD b BU!
oii Yoru D | iol pouet
v
TF = bY +B2+1b+ 44 +241 Heradecimal
Benefits of heradecimol
Jouer digits casey to check errors
cotrer $0 read, take less place
Voage af Heradecimal
memories adlolrens ASCII | Unicode
colour values Assembly language
errar messages
LY addlress
Binary
Adlon
overflows result of binary addrwen exceeds the maximum value
Shiftte=
used for mud-tiplying or dividing
bits ohif-tel w the enol owe losted =? looe the Integrity
a Ghift to left = xr
a Ghift wo right- +v
Two's complemend | negative binary
Gign= C the leftmay bit 02 positive )
\7 negastive
O invert all 1s to Os , 0 to Is
O add 1 10 te reult To cuncte 8 eg
collecuon of Characters und corresponding binury codes thot
veprese/ them
WSOMP Lamericon Stondarcl Code for [Link] inter charge
— signs 0 unique Ttbit bbrnanyscode +410 etch character
~ only present a dimit number of charaoter
character of English
Unicode 7 different language ond emgyi
~ greote ronge of chayootes ono symbols
— ses a vewiable — length encoding Scheme
— requires more bit» per character —> lager file are
Goud: aneloyue signal need yo converted +0 digital vo
processed ly Computer nid
Gimplings toting measurements Of Sounc wt regular imtervale
) Somplemoie the number of barmple taken per selond
7 ty Higher oomple vate, mul wocurote —7 higher quolig
Sumplemreqolution. number vf bit per sample
Caumple of sound file
MIPL: © stoves w set of msowuetins
O doesn stare me worualisounds
MP% : © formar for digital wauolro
Comyscompremimy © acwal recording of Gouna
piMeb: small dots of Colour
Wem numbers of pixels n the image
higher resolution, moe pixels. higher quality
coloypmdepus number of bits per pixel
Pile + colour depth resohutron kiB = 2° bytes
Dato. storage MiB = 2 byes
Dato. storage GuB = v* bytes
— smallest unit. —> bite Tre = 2 we
nibble = u& bits, byte = & bits Pe = 3 byies
Compression - uses algoritin reduce sre Erb = 2” byres
© \osclesemcompressron : 0 compression algorithm used to
veduce the sme of the file wrwoxempermandy remue
O repeated patterns in file iy identify and mdex
JO data ie replace by des anol position Cmumber oppear stor
Gx. RLE Lun length encoding) Yes Huff mon ence ding
replace sequences of repeated witn a 8
aw code —?
© dossymcomprermion : re move some data permaniely from file
O often weed for image once audro
O ea. down Sampling, reducing reGolutton/ colaw depth
percep tical music chops remove sounde that wre not
normally heanl by human cor
@ Benefits
O less Storage needed. 0 gutcker to dawnlup hook
O take lee time to wansfer © leas bendwitch necol Data VakeD: 0 small unit of dara
— informarnon online broke down into packet anol created ng TCP
TCP: Trangommisson Conte Protacod > orgpnising distd tandumis
~ packet Contains = 8
mendes Contains Onyinal aa about data tnd eqtinienr
ancl packet number
Pay loool» Ce actual data °
tadlers marker smokeite the end. of information, CCMPOPTORCOET
me thool
Packer Sunt ching - & methool of olata tranemisaion ACrOSS a Network
— dota (brokedeWin Into packet,
— pocket iy send snaividicellp acros the internet
— packet can be very though Giffereni pathway
_ — conte) whieh pathway the packet go
7 gomponenty that @utuwines the destinacion addvess of pasick and tronsme
packet to r
ie packet» may nol arnve in order, the paskery will WeaRraye accord,
‘yo the ypadker number. —7 recreate the dotalfile
Advortago of Pocket, Suictohng
O anipoenitle for CORAAPHIGN ond Interference, Yo happen
D individual, dato will GOTRRHEEL Yo snl when conuption
DO packer owitehiny ie
© universal stondlarc
© cutomatedly connected
can power devices
O fast trong mission
® simple imteface, only fit into re tn one way
Tie aduowtagos =O length ty Kimiteal
© speed. not high endugh
© some ypc visi cont vied
‘very O interference
@ problems durny padet suitening
9 skewing Cae
Error choding. me tod,
parity check
Check Gum:
Coho checking:
ks chek
— on a
error detection method Crror detection methool
weer on olata transmission usec on aacanmentny Encryption
plomn rn cipher ee plam text
an encApHOANAlyOr tA 1s wreol Cenoryptionivey) make the data back +o mani il
we moke +he tert meaningless data scramble) by sing the vey
Symmetric + Same key Neymme trie different, key
to en ond. dece bhe key ener date, but
ogre wre pabhe Beye Craype data Set
lese secure , requires Safe methool private key: decrypt data
+0 twonsfer beys
It only requires a single key for both It requires two key one to encrypt and the
encryption and decryption. other one to decrypt
The size of cipher text is same or smaller
| than the original plain text.
The size of cipher text is same or larger
than the original plain text.
The encryption process is very fast. The encryption process is stow.
It is used when a large amount of data is It is used to transfer small amount of data.
| required to transfer.
It only provides confidentiality. It provides confidentiality, authenticity and
validation,
Examples: 3DES, AES, DES and RC4 Examples: Diffie-Hellman, ECC, El Gamal,
DSA and RSA
In symmetric key encryption, resource In asymmetric key encryption, resource
utilization is low as compared to utilization is high.
asymmetric key encryption, CRU Central procecting Wnre)) tne micramrocesser
micreprocessor= a limi Sb of Metrmotiong
The Component of CPU
— CU= component controle ol the operating m CPI
— RLU> performs alt mathe mestical colcwlation
~ Register: waco by processor to ste datathat cently wed
Memory: maiet by
Address ond Content _.
TEER autres
Harel drive —> Raw —> [PC] —"#—> MAR “ns”, Ram
Ns CLR Sa MPR performs Mathematical caleutactious
ACC imeidle ~ Yecovol the result vf codculoctrw
the number of instructions CFDE cycle) con be done per second
Core
the yoru of OPu that perform the fetch - decode execure
ude
es. one cove —? w fetch decode cyde ot a time
Cache
Storage that store mob frequently used data and mopuction
improve performonce of CPV —>? no need ty fetch instructions from
Rai —> layger sive 2 larger perfor mance Features of Embedded Systems
Hordwore + Software
7 Componente to run the system
Microcontroller. GPU + RAMIROM in a angle chip
Microprocessor: Only CPU on a Gingle chip
System on Chip» Microcontroller + othe on a chip Data Hovge pregramme/ metrusitons that, run the, computer
Other applications of RAM & ROM xom Question)
Other applications of RAM & ROM Gam Question)
fete word file —> store m RAM
the Indwuctions rm fie —7 Store m ROM
Fler editing, file save > stove m secondary storage
Virtilal Memory - 0 ype of memory con be wstal as extension
of RAM J part of ne hard drive.
when RAM full the nob immectiartery data is wansfereol
Yo virtual memory \-? exteecl datr transfered to virtual in stugtwe
of pa Cloud Storage > dota storage oumeol ing thirel party and
ber access whiry Intemet,
— dota can be acceied anytime unc anywhere
Benefits and drawbacks of cloud storage
— potenrtiad limitless storage
— datx is aceesseble wring tenes, pry fancton- send/ recieve pockets
— NLC CNetwore mterface » enalles devices conhech network
— vouter
— trongmigion meolia
(MAC Address ee
— MAC address used, to tWentify devices Ye: EAB) 15 =h2
— given by manufacture m NIC monwtiactue nibs
— 2 darts, —> heradecimal
UP addzers Cintornet protaco)
Pv: LP vie MAG odlvers:
NB bes bY bits US baes
Hesedectmad- Binay Hexadecimad
static) dynamic static) dynomic Storie
Asaighed by AP asigned by AGP Oe gped Ry (manufecine
Gumic seh up hy 19P5 © mmaarually
Dywane sev up by 19?> L ductomatedly)
pre cand Cong
Poxsaser Dynan, [moore
= Atel eee, | Mole oar ipower
recuiesnocteonclaetp | access
1 Sopot mate sentap ens
+ Less pron tomacing + Can coun dovetine shan score
Describe the role of router ina network
OG
router sends date too specifi destination
‘Sno network
1+ Can asignse lacalP ederess to each device
nthe network
+ creates feewal to prevent sunt breaches
4+ Monoges the trate on your netwere
+ Handles ony Porentol [Link] a Home LAN netrk Software
ji manages the Yanning of hardware ancl softunl
Opevationsystem: manages the computer, allow wcer/softwore Yan
ceuiintgmprOgraNNS: perfums hase keeping sotlity
aoftuare that allow wer +o parfovm function
word, procevver:
opreadcheet=
[Link] =
web browser:
invevnapyMThanler. tu progyom that, Orginise
Intenupt ware pon Priovitie,
low level —> non— portable
0 assembly longuage> code wrivten in mnemonics that allows
direct manipulation of harcware
High-level language —? Assembly language > Binary code
Omophnemeodle> 0s unk Is
High- bevel longuage» progromme language uses Englioh Dee commano
portable TPARBIOTOP = type of Goptuare convert one code into onother Programming
language
O Asembler= convert assembly language into machine code
@ dysterpietore convert, high-level to low-level, when coding
@ compilers convert, high-level to Inw-level, before running the program
Franviate the code | transite lbiins of
zane ance aw une | code into machine cree
a
useful when Useful when datelnaal
worneiing progeome — | and. ready 4» t06b
code wee Wewrance | code dane need to
euch vine, revranslaze
Gource code wequarace | Waimnead Yor searce
when programme ran code
hen nase mane
@
File
ve Se
wrthoue complet
Integrated Development Enviroment [ LvE)
> a piece of Software that allows user to edrt . run he Programe code
fearturee de hugging feartwes
~ Awto completion — break pormt > “pm ie i
Rute correction = variable wath window vito enn
— Prettyprint Re pig > rane pron ie ye
— block minimizing <— Gnitemed- « large global network that allow users +o worl
wide web the internet % w huge network all the computers and
devices jeinec together
a type of (aide area network
TS wn TRPUSYAIZAULONL physical stmcture)
(CGH: collecthe term for alk the websites ond.
web pages —> accessed whiny internet
OREDTOIRE software that allow usere 40 alters +0
acce® and display web pages en devie
© home page D history © abilivy allow wher navigote website
O stores waers' favorve O jpoges open sometime © wies of cookies
@ data store os cache § hyperlinks allo navigation between website ond pages
URLS Lumiferm resowee locator)
ieeys,- HY wow am bridge. Org | eoucoaition
protocel domain name webpage name | file nome
‘Protocols
HITES Hypervext Transfer Protocol
refines how communication -voke place between braucer
anc wer seyver
HITPS® HTTP with encryption
wits 1L9 LGbL)> tv cnoypt
TWA Transport Layer Seuurity L euctersar of SoU)
TU Geawe Yorker layers
Provide Seowe communication protocol
wse combinection of syme-tric | amy mmetie enciyrtion GOD - sperote ut trampwt layer of OF model, ensue dova iy
encrypt befme 6° wor the net work
THE made of 2 layer
(HaRLGnAREMMaYe® = establish secure connection
ReceveNAye § trunsmmioring dora seomrely betwen
@O browser vequest Gecuve coynectim +40 Gener
O brome requery server identify V5 ef
@ sever provide digrtal cartificatin
@ browser validity
@ browser Senet aignol +0 start dota -tyarsimmission
0 encryption yme-thool te agreed
and location of web pages
sonco™
—
st
peauest 30,
es
2s
DNS Server
Domain nome Server ib
& gystem for finding LP eee DNS Server
according 40 URL ZO tenets
tee + EG)
User with Web
Coes ‘Server (t 1215.90)
Protocol - ott of vues for wansmivtiny lata
FATIAD > Hyper ved Morkup language
a scripriny longuoge that wel to Create web pages
WEBESEVE = netwok component where webpage of wobnite ove
Grored
Digitol Currency
type ef Currency that edists only in elec tyrone form anc not backed
by any physical commodity or government acy a mag ean
Sensor
WMicyoprocessar
Actuators
Featuwe: Robot
a mechanical structwe
Electrical components
Programmadle
Range area of AL
Imoge Yecognition
speech recognition
natural language recognition
gome
Ding novis systems
Components of Bl
Colleetim of data
a seb of programm rules
dpi ley +o Yeaom
ability 40 feam and oldape,
Expert System
a rule base
& knowledge base
a inference engine
a User inter Fouce nadysis + Study | tdentifying problems
Investigate quertion sing:
abstraction =
vemoviny wnimportont details of the problems
RLOMPOSTHIGA) = tabing system and GPlEIND into omaller qysten
Design: created algorithms and ready for cooiny
decomposition:
Sbrucwe_ diagram: flowchart pseudocode
Desision
Steet! step
2 Process
D Input) Outpt
Coding = writing program wang program longuage
Py thon) CHD -.
Testing. Yepeated use ayston to ry pwsibiliues te owe work
make swe program. Fully works don't crach. meet vegwirment,
Wormal- data program accert
Abnormal? data. progrom vejeow
BxweMe? on edge of data cdlow
Bubble con undnnes decta. on edge of IRjeob unl uceert jee Geach
PSEUDOCODE ALGORITHM — ID ARRAY?
DECTARE Initial: ARRAY(1:4] OF CHAR
or Fon oucer € 1 70 uEMmH(Zeore) = 2 ee
FOR Inner € 1 70 LENGTH (Score) ~ 1 SearchValue € A
TF Score (Ianer] > Seore(Inner + 1) sen || Found € False
temp € Score [Inner] FOR X € 1 TO LENGTH(rnitial)
Score{Inner] € Score[Inner + 1)
4F nitial[x} = Searchvalue
=)elel=]= Seore(Inner +1] © temp vrae
ENOIE
NEXT Inner Bound € True
[w]e [wef] [et outer ENDIF
NEXT X
IF Found = True
THEN
OUTPUT “Value is found”
ELSE
‘OUTPUT “Value not found”
ENDIF
to AL aaa
Three different way of design
Y) Ted aL
v Gog
a ree
TAD
UM egal Ce) o Boundary Cary
Oe oe a <7 Sc CoO La)
Validation in od
D Range check make swe date between mar anc min
an Vola Pe cn a aa
OT oe RR Ro
Dr na a
Ce eee eee ee ea Me a aR
a SR 2
a Ot ae a
UT Ly ed
Se Se
el ea oa Yee ree re by > charmete
Taye mPey aT ren
Ce ead Cee
a ae Ln
Iecling UT 2
Oo a ee. 7a
Lease FOR Index <— 1 To ¥0
eee ed S tudentnumbo [ Index} <—"
PRO att ey
BY WHILE) Pre -concii tien
Ua SS or
ead
[Saas
py erro
O FOR Indes <— 1 To ¥0
Cee et oe Whos el
NEXT Index
OF ad
NS Oa
TF < condrsion> RY ee
3g THEN
Sea Sota d ade ed
10g ELSE
ead
ays rele
CASE OF =
=
SO Ge ated
OS at eee et
ata rZv) etter : Gs ne
ees
Da ae Cer eee 0d eS ee ree
ae
Lo
See nate
variable Tdentiprer <—— READ Lfilengmed
CLOSE filename
Ye LT
Seer
WRITE dota
Noa a
Le ee cae ea
Meaningful ident frers~
RM ea
Oey ad
BS LY La
aa
GL, ec aoa ea
