Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

C-Programming_Handwriting Notes, Study notes of Computer Engineering and Programming

C-Programming_Handwriting Notes" is a topic that pertains to the process of manually documenting handwritten notes related to the C programming language. It involves the act of writing down key concepts, code snippets, algorithms, and explanations using pen and paper. These handwritten notes serve as a tangible and personal resource for individuals learning or working with C programming, providing a means of retention, reference, and study outside of digital environments. #computer #computer_engineering #cse #c #cnotes #c_programming

Typology: Study notes

2022/2023

Available from 07/04/2023

mritunjay-thakur
mritunjay-thakur 🇮🇳

3 documents

1 / 152

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Date
Page
HagHammiog
languagea
Puagiamming Lang
uages-
He
Antiicat
Language
pHDeslg.ned to
communicate
unstuuctiang to a machine
3sed
to
CHate
HagHOm9
tAat
contual
JAe
behavioH
ahmachine
2
bes
Paag1ammïng_languageg
Piagmamming
language'aal
High
Level
Lanoiaee
Law
leuel
language S
Mac
abjecton
iented
Quage
language
PHocedu Assemb|
-hine
Lulan=
quage
Haf ian
langliaqs
Machfne
language
1
DiHeaBly
MUn
on
CPU
iiSenies
6itiko,
O and 1
iTediau19
and
eHHOH_
þHOne
to
wnite
Cadle
monuia
la,loll
O1Locol
Ivnotbayiablo Mot
human
unclenstadable,-
HAseemblu
langugge
1Hlese
ewiabOne
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f
pf20
pf21
pf22
pf23
pf24
pf25
pf26
pf27
pf28
pf29
pf2a
pf2b
pf2c
pf2d
pf2e
pf2f
pf30
pf31
pf32
pf33
pf34
pf35
pf36
pf37
pf38
pf39
pf3a
pf3b
pf3c
pf3d
pf3e
pf3f
pf40
pf41
pf42
pf43
pf44
pf45
pf46
pf47
pf48
pf49
pf4a
pf4b
pf4c
pf4d
pf4e
pf4f
pf50
pf51
pf52
pf53
pf54
pf55
pf56
pf57
pf58
pf59
pf5a
pf5b
pf5c
pf5d
pf5e
pf5f
pf60
pf61
pf62
pf63
pf64

Partial preview of the text

Download C-Programming_Handwriting Notes and more Study notes Computer Engineering and Programming in PDF only on Docsity!

Date Page

HagHammiog languagea Puagiamming Lang uages- He

Antiicat Language

pHDeslg.ned to communicate unstuuctiang to a machine 3sed to CHate HagHOm9 tAat contual JAe behavioH ahmachine

2 bes Paag1ammïng_languageg

Piagmamming language'aal

High Level Lanoiaee

Law leuel language S

abjecton Mac iented

Quage language

PHocedu (^) Assemb| Lulan= -hine quage

Haf ian

langliaqs

Machfne language (^1) DiHeaBly (^) MUn (^) onCPU iiSenies (^) 6itiko, (^) O and (^1) iTediau19 (^) and (^) eHHOH_ (^) þHOne to (^) wnite Cadle monuia

la,loll O1Locol

Ivnotbayiablo (^) Mot (^) human (^) unclenstadable,-

HAseemblu langugge 1Hlese ewiabOne

Page.Date.

2 Coding eaaien dñan machine language 3 Reblace and os wilA Engligh ineiHuction LMnemanic Cades ou COMHOSbonding mochpe language (^) IMav94n

S (^) Dienence (^) betucen (^) pHaceduiaP_and (^) objeatoi

-ented language

PHaceduiaP Languuage-

HPHaqnam iG uHtten ng

sequence o9ngtnuctiong lo unc iang betueen ekiece

absect OHiented langulage PHagham ie an *oBetachan

25 PHaeduyat bHogHanming abject aHe nted Languageg

allaws (^) tep (^) dounabpiaach (^) olloug (^) boitam (^) uh_abhHoach G

9t (^) docg (^) nat (^) haue (^) huaheH (^) t (^) belps in (^) LuHapping (^) daa uayda hiding data (^) and unctians n a clagg

499n (^) pHocedunaf (^) fanguage9t (^) helps în (^) buitding gecL- data (^) iS not (^) gecHe (^) He pHOgHamG

S9nbHOcedunot (^) Panguagen object (^) otiented (^) language Cade (^) S (^) Snteudebendent (^) |code (^3) maduPan

9n (^) pnoced (^) UHaE (^) Panguage | (^) 9E Can (^) 6e (^) extended

Reuse i dileuft

Nmeman+cs meang 9n9tnu etion'eaiven and Canueted unnbinaHuaAm cailed mnemanag_

Dafe Page

Lau leuel language Hloh level language gE i9^ pHagammey^ iie-^

9t i9^ amachin@iendlu -hdly language Lanqulage

2High leuel^ _language^ is^ |lau^ leueP^ fonquage^ fo legg memaHs_ejicient^ high^ memanu1cient

319 is CoSy ta undeugtand 9ti9 taugh to undeistam

isis eimble to debug i9 camplex ta debug Co

hauatiu@ly

59ie simble h maîntain t ig Camplex ta maha in CambaHatively-

91 is þontable Nan^ poHtable

3t Con unon any

plotom

9tTs machthe deben -dent

a Hah Level language'g| law level Languageg aie aHe ea9y to Leain and challengihg fo leana and lIndengtand LIndets^ tand

q hey aHe execllked.olo-hey exectte witfi high

-LueN tHan low^ level 9heed languagee kcmue they

Meminea tuan9lato1 bo

9 19 wHItHen^

n (^) englrehat 1S witlenn (^) Re Jan

Re hene aHe^ Callec

d generaion ano

Aabeza uige

Date Page

lohey allaw much maie hey allaw Littlo on nao abgtiackion abgBuoctian

I|hey do nat buovide ma Jhey ae ueHY Close to

ny acifrties at tie ha-|haduaie and helb to duaHe Level. (^) Lusilke aþHoguam at Re handuuaHe level

(^19) 9n (^) HLL Jan (^) uMTthg (^) bOgn l (^) jon (^) mlHhg (^) bHagHame Hamg, handwaMe Knauiled handuwane knoLuledge ge 3not Hequiued mugt

19Hhe bHOgamg are eagyModiumg bagHame to mody (^) dijiaukt

141A (^) Single (^) Statement (^) mayhe (^) Stalemenks can (^) be dited- excoLHe (^) Seuenaf (^) 9nsBhuc-ls (^) mapbed to (^) brncesso Hiong- (^) Qngtuuctiens-.

L5Examble'e: Penl, PagcafCxamble'a: machîne langua-

Cogol Ruby ele

E (^) is le (^) the (^) am9umibq t (^) g (^) tme CcomgLumig-

ge (^) and (^) Hggembly (^) languagE

8CambtReH 9t 9 a^ buanglaton (^) ufich (^) takea (^) 9nbut ie (^) htgb (^) leuel (^) language_and (^) pHoduces.an autput (^) olou (^) level (^) language (^) ie (^) machine aHa9semb -Ly Langu.age cOTmileH dg moHe 9nkelligent tRan an aggemble

t checkS all kînde o Lînitg,Hange s,eMOHe.ek-

But Stg DHOgHam HuUn time is moHe and occlupiee q LaHgeH DaH o memoH- 9 hag 9low Gpeedbea-

Date Page 9Ecanuexle dhe 90LIe91 Hequieo) doeg not Code inta objeat Code_ canuert g0ICeCode na

object code Inglead 91

9cang ut Lihe by Linee

5-9_doeg mot^ Heguiue gou t JHequiHeS

HCe Cadeo Latey SOIC Exe@utin 0ode (^) on (^) laBey (^) executian kg Ctt, c#etc dava Eg PtRan, Ruby Pel SNoBaLMatlab efe lo (^) oxping g (^) Cambilen (^) and gnto1hs1e (^) ten iCOmbiPen SoucePehuaceabject |Puacegsiny Cade geing LCade

Machtnel

19nteabaelen Sonce [EcpuncacainntenmedialeBiacegsng9nhezpxeke Cade (^) 9nheabneked.

Code

Assemble- (^9) uged (^) to tnanslate umitten dfiebHogHam Code (^) he nsgembly^ language (^) inlo machine 9auico (^) po emble gHamife^ an^ uhput^ oan (^) as9- diat (^) Contafhe he a9sembly an (^) uhbut o (^) anass- She (^) outut Lang^ uage^ Insfouctio geneHaBed (^) bu (^) tfe Object (^) ode a assemblenue^ thehe machns Codaunde1gtandabto (^) by

Gnteace ufat^ fs^ abl^ uto^ Cmmunake^ nLmang lin uAe^ maehine^ ig^ need^ anasschioley^

a

Pe he^ aap^ hcHusen^ human^ ahd^ machihe utRat feu ca Code usiiien^ in^ assPmblu^ aruae^ uS_SmE

Camminicate uER^ Aab^ atey

SaHt_ a nenmanicsinsuchcns^ ke^ ADP^ DUL Mux GuB,^ DIV^ May^ a^ So^ cn^ and^ aesemble-a basicall ahle fo Cm.et trase mnenanic S uN Bnaucoce. Heie ifeae mnemanias ao depbend uban Re achitecte o he machn-

9 Lanquage^ puOceasom'9^ Campite-a^ 9nhe-bmeieis,faan| Slaie pHcgHan9 tuilten fo high leLel^ languages^ une^ machie^ cade^ that^ q Compuie undeStan da and asSemtleve tianslab pHagHame wHILken ih lou levelen a£sSmbly_ Longuage dnta Gac)machin e eedeIn cmbi- fatmbHocCSStReye aHe sevea gtages - e beip pMOgnamme19 LwHiBe eeo ee Code,tacls_ae OvaiPable

8uRu do lue need pHegmammYng cAng Pdanammfng e meeded t cueais Vauia

hheg cabbl+catan andYsiem Sqltiuaie-Suete SaltuaHO aMe geneialy Ceak@ bs Syshem p aammeHS2pblcari Sauae de (^) Ceed

Date Page.

QnbHaooduua^

hHagiammiho_Clue th^ HOCealuo

uh matune^9 becameg^

vey cliicuet^ h^ ha

tfhat uhat^ data^ ate^ used^

bu Bi h^ unchn_a

mament oime-^ the^ data^

ojHaediuIral baagan

handled uTtR^ IRe^ helb^ o^ lacal^

and glaba^ vai

-ahles

9dvantage 'a oltocedtuaal^ bàagaamming

4 PHagHomming^ feam^ gtaus^

ocuSed am^ the^ goqE ueuane knaug^ his^ be1Hob 33 B^ fRe^ ime^ Re^ þàagaammniho^ tarka^ ineio^ Ae^ ma stiong 4Cado S^ Casio^ utaallougimo^9 LuHilHon| me Radically and uilR þurbago

Disadva ntogés f- yPanallel oleuelopment lë mot paseible- he_Loling

a kelongentme

e op daum^ pHogHamming^ moy^ dammp^ ieae^ teghna- Smce mathing executable uiPeeven exist unt

nean the endaRe pHojec-

3ALLdecsionsdeend on 3lan fino gaal a he pMojecand gome deciaCnS Cannat_be macle cle

-þemlipg m^ hO^ 9heeiie^ Raldescafhitm

1bied Onented^ paoGAamming^ g-object^ ouenied pAOgHOammino u@ desioncd o^ Henmavenelaue^0 aocèdund

Date Page

DHagaammhg-abiec on+enhed_bMOgAammng mada bHeaks dato as a cuitical elemen' h buagaam and does mot allmu ut h moie queolu around Lie (^) Suaiem:daka e tied (^) moke alngel+-

-Chong daa ia bHaiecled uamm accidental modli

icaimt atAerdunchiny 0lettomep te o baaghaMming Cohihes dalo and Junchonsactno n (^) tRa (^) daka (^) dnto (^) gmgle (^) nhy (^) Colled (^) aajee 9t (^) allows (^) acceung (^) qdata_cmly (^) thuOLLgh a Set (^) cHunchang (^) 9n (^) abectamepied the (^) Cmphaso ug gren (^) lo (^) alata (^) taRen (^) UAan (^) ach_a (^) tunC Hms (^) Hero (^) tRL (^) þanqdamg One (^) dol (^) ed (^) iht

Oleck and daa StHucare ArO Caeaiad n_ manhe

un

Rat (^) ey (^) ahak (^) aclenze oGjeck-

Lpata (^) Daia

Euncha (^) tunctiioms|

Data

Funchias

OMganizaion_ (^) unchiom (^) and (^) daa (^) h coP

SheneaHO (^) many (^) 9tebe Gnncdhduat. un_deuelasmeni pHOgKam. (^) Fatlcrurihg ane_ Lised (^) gtebs (^) ufite many tcakho a^ ag&CUn-

Date Page.

uhplieel usTtA^ 9npui^ o^ See^ Lhethen^ the^

paogacua

Me uanS^ tAe^ acclLaa^ Oulpui^ Qlen^ laRTn^

accuA

e mbub

5MaibtengaceB 9n^ dRi3^ phage^ paogaam^ developm-

-ent bMagtam uRich 3 allogefRen nea- -du nstaled at tRe gite o the u.g

195HLgoHIMm AlgoniAm^ sa^ 9eguece^ q^ Yngt-

uchions, wHHen unSimple enolèh Language o Sotue ahartouta baolblem hee can b maMe tHon.anealgonilras o Sotve a peat ulas ptngaonmin he 9nstHuctions wHftkenó an atgoiT HAn mush have atloutng chaiacienLeice

YEach 9ngtHucton 9houPd be ÞHeaise ad umabiguau

Cach 9nsaucliim should be titten un Such mannen hat_9F Can beberanmcd mhe linei 39me on Mor@ 9nslyuchöm Shalld al: be_Hebeat Cd 9nniiely dñat meang on mugt enguMe tha Re bMogam Stopa ajeA a given mumbO

o ealiong

49le erecuhno he 9lebg of algaritRmn, olesied

paoe

He9uli_ (^) mugt (^) be obtaîned 5Cachþaocedue ghould shecidu JRe 9npuls.and 0utbus available G (^) vanables 9houl (^) d be (^) bHa]ely (^) defhed se 9ubb1Ogdamg On Subuouhn ea Jheh@Mes

8DoCumenialn Shguld be ReCbut 9hon/

Ond meanigu

DatePag

21xamble'e Algoritfns Exa Schutfn

and

EXampleAlUHike an^ afgoitim^ tn^ 9nhit^ manksSudenl^ in.3.9ub^ paîn

Steb 18 9nltiatige^ Mi^ Me,^ Ma^ and^ Sum^ a^ lexo

Steb29nbut tRe^ matRg^ o^ R^ Hee_gubieats^ inh MMe,and M9 Hegbechiely^ - Skeb.3Add MLMA and Ma and goHe he Heg. -uPtuPt unta Suml9UM= M +Me+^ Ma Gep 4 PRINI SUM Sie 5 Stab^ _

xamble WHie artgaim ta e0unt numbers males

Sadutan Sleh 9nihafiee GENDER CauNTMALP TA ZEHa Sheb 9nbut dhRe gende o HGt bexaan te. checR_Caunt to gee it ie less JRan

teb chedk (^) tfie (^) genden fo (^) gee (^) ,9 9t e (^) eo uoP o Mafe, 9 mof go to gBeb 6 Steb 5_Add L to Maole Add to Counf Steb (^) Repeat (^) CounE= (^) 1po Sheb 8 PH*nt maPe Stob

Steb

Steb

ee Flowchat Floocha (^) ustAe (^) þïctomiaP_ (^) OM aHabhicaP (^) HebH£genta (^) n o (^) Re (^) gleb ht e (^) Moce (^) due_dapHoblem (^) o e gofe /HepHenenhnthe loqiedlau o ae bsog&am

CO P-

FEFR

Pae

onnec la Qumbaf ie uged to exlend a ves Longlau chat an Ymext bage wñen a lou Chai &@cames ve4 lang low mo9 9fatf CHOgein9 each aIhen_Qnd undorgland ab itity alou Chatt Ieduce la exBend dRe Lo Chartfo (^) he (^) mext bage we use com neclon^ ym- balg Mebuese nfed 6y a cihicle wilR an adtous

24CHeate a Jlou_chant to 9nbut maiks o stud-

nt an thnCe Subjecis and buht fie totat manR

Stait

Ma M=0 Padallelogàam AM-o Sum:al

Gnbul manka

LRee.qubjecisl

Calculgke gum ISUM M+MatMa

Stab

251aeaBe (^) La chasd

ua mumbeg Cnlen by Re taeMS

hd Re langegt 0mamg

Date Paga

LuMting Cambuten nagacm al any levd o complexit

Sequence logicLPgeudaccde use» all logic olucture iesequee gelection and Jtetatioy 3N9Henatiom lagic ts expveM JRe sequerre ol execu tiam a fRebtiogtam Sequen ceSeQuence lagic 9 uged on Exptea9ing ctieSequeme a exeeulian o Inghructians

2Selectian lagic

21Seletian t- Selection logic ig used do maRE decisians (^) n dhe^ pHagàam

3teatfm is used to Hepeat the execution et gnstuchioms again 9t q pontfe (^) uPan (^) Comditian (^) likd

Ex:2 (^) unile (^) peudo (^) Cade o (^) caunt (^) mad (^) numbe a adulis and (^) chidnen (^) out o (^) vo (^) beapleaa fouwn Salution- Pgeudocode SetCount AbUu CHILD Ta Zeto ba (^) uwHUE (^) CoUN 9 mot (^) euo to 1,aoo Read te age ot er9 on 9 GE 2 =18 JLEAJ Add to Adutt EL9E Add lo chitd

CNOIF

Add taCounT END DO RITEADULT CH1tp SIOP

Date Page

8Aduantageg a Paeudocode

nto pogham.o^ actuak^

Camputey_languag@.

Pgeudocodeg ane^ Helatively^ eagyto^ madtu n Cage^ qchanae^ h^ logic^ qptogHam 31Paeuda.codes are^ Helativelyles9^ diYe^ ComSumna Ran a louchatt_

2aDisadvanlages a Peeudocode

4No Quabh>cal HehHeentatiom is avaeable NUIA Pseudacades Peeuda.cmde is dilieult to undeneiand gan a begihne 3hene aHe no sfandand Hules uto lenu n ugng pgoudocodea- It leads to communicahim oblem ffen Gama_Codes shareduamq 9eudacodes -

Sa (^) Dedigion able - (^) DecSian (^) tableg (^) cleauly (^) and cancigely (^) deme (^) Jhe (^) gtaiement abuablem (^) and (^) steps (^) o be (^) taken 9 me oxmoHeCandifomS_ie uieled Fallaumng (^) aHe (^) iie (^) ghebsto (^) 6e (^) all oued (^) 2on tRe Camsiuc han o deci9ian table. he þHablenm (^) Rat hog (^) to (^) be (^) gof (^) ved by- JRe (^) mbulen, (^) must (^) e (^) brigpely cletfned tau mugt explah^ U_Com.dttoma (^) iat (^) ane (^) to. de dested aAiable ghoutd beoHmed by-uaihg ua lisks AILRe CaHeQbOndma aticns b cmditiane