Sheniblog Plus Two Kaithang Comp Science
Sheniblog Plus Two Kaithang Comp Science
Structure :- hnhn[ datatype ¬ D≈ variable Isf Hcp unit B°n am‰p-hm≥ D]-tbm-Kn-°p∂p.
Dot (.) operator D]tbmKn®v Hcp structure ¬ D≈ hnhn[ variables access sNømw.
Difference between Array and Structure (Array bpw structure Dw XΩn-ep≈ hyXymkw)
Array - Htc datatype ¬ D≈ thcn-b-_nfpIfpsS Iq´w
structures - hnhn[ datatype ¬ D≈ thcn-b-_nfpIfpsS Iq´w
Pointers as‰mcp thcn-b-_n-fns‚ A{Ukv kq£n-°p∂ Hcp variable BWv pointer
DZm. int *ptr;
ChnsS ptr F∂-Xv- Hcp integer variable s‚ A{Ukv kq£n-°m≥ ]‰p∂ Hcp pointer BWv
Memory allocation methods
Hcp t{]m{Km-an\v Bh-iyamb memory c≠v coXn-bn¬ allocate sNømw.
1. Static Memory Allocation t{]m{Kmw XpS-ßp-∂-Xn\v apºv saΩdn \¬Ip-∂p.
2. Dynamic memory Allocation t{]m{Kmw XpS-ßnb-Xn\v tijw saΩdn \¬Ip-∂p
new F∂ keyword dynamic memory allocate sNøm≥ D]-tbm-Kn-°p-∂p.
delete F∂ keyword dynamic memory Xncn®v FSp-°p-hm≥ D]-tbm-Kn-°p-∂p.
Memory Leak
Hcn°¬ allocate sNbvX saΩdn Xncn-s®-Sp-°m-Xn-cn-°p-∂Xv saΩ-dn-bpsS e`yX Ipd-°p∂p.
CXn-\mWv memory leak F∂p ]d-bp∂Xv.
Pointer Arithmetic
Pointer thcn-b-_nfns‚ IqsS integer numberIƒ am{Xw Iq´p-hm\pw Ipd-°p-hm\pw km[n°pw
Relational operators
==(equal to), !=(not equal to) F∂o c≠v operators am{Xta pointer thcn-b_
- n-fns‚ IqsS D]-tbm-Kn°m≥
km[n-°q.
Ponters and Arrays
bpsS t]cv Hcp Pointer Xs∂-bmWv. Array bpsS t]cn¬ BZysØ element s‚ A{Ukv
Array
kq£n-°p-∂p.
Pointer to a structure
Hcp structure variable s‚ A{Ukv kq£n-°p-hm≥ Hcp structure pointer D]tbmKn°mw Btcm (—>)
operator D]-tbm-Kn®v structure pointer \v hnhn[ structure members s\ access sNømw.
Self Referencial Structures
Hcp structure variable se Hcp AwKw as‰mcp structure variable s‚ address kq£n-°p-∂p-sh-¶n¬
AXn-s\-bmWv Self Referencial Structures F∂p- ]-d-bp-∂X.v
CHAPTER 2
Concepts of Object Oriented Programming
tkm^vSvshbdpI-fpsS hen∏w IqSp-∂-X-\p-k-cn®v AXns‚ k¶o¿Æ-Xbpw (Complxity) IqSpw. BZy
Ime-Øp≠m-bn-cp∂ t{]m{Kmanßv coXn-Iƒ henb tkm^vSvshbdp-Iƒ ssIImcyw sNøm≥ ]‰m-
Xm-b-t∏mƒ BWv OOP coXn Ah-ew-_n-°-s∏-´Xv.
OOP, Xmsg-∏-d-bp∂ Nne concept Ifn¬ A[n-jvTn-X-am-Wv. Objects, Classes, Data Abstraction,
Encapsulation, Modularity, Inheritance, Polymorphism.
Objects - GsX--¶nepw Hcp hkvXp-hns\ {]Xn-\n-[m\w (kqNn-∏n-°p∂) sNøp∂ Hcp LSIw (entity)
BWv Object.
Class:- Hcp Object s‚ amXr-I-bmWv Class. Class s‚ Hcp Variable BWv Object.
F∂p ]d-bp-∂-Xv.
visit www.shenischool.in
Iºyq-´¿ kb≥kv
CHAPTER 3
DATA STRUCTURES AND OPERATIONS
Data Structures
~ Hcp-an®v Process sNtø≠
tU‰m-Isf Hcp {Kq∏m°n am‰p-∂-Xn-\mWv Data Structures D]-tbm-
Kn-°p-∂-Xv. data Structure s\ c≠mbn Xcw Xncn-°mw.
1. Static Data Structures
t{]m{Kmw compile sNøp-tºmƒ Xs∂ memory allocate sNøp∂p DZm. Queue, Stack
2. Dynamic data Structure
t{]m{Kmw run sNøp-tºmƒ am{Xw memory allocate sNøp∂p DZm : linked list.
Operations on Data Structures
LIFO A\p-k-cn®v {]h¿-Øn-°p∂ Data structure BWv Stack. insertion, deletion F∂nh TOP F∂ `mKØv
\S-°p∂p Ah-km\w add sNbvX AwKw BZyw delete sNø-s∏Spw.
Operations on stack
FIFO A\p-k-cn®v {]h¿-Øn-°p∂ Data structure BWv Queue. Queue\v c≠v ends D≠.v Front end ¬
deletion \S-°p∂p. Rear End ¬ insertion \S-°p∂p. BZyw insert sNbvX AwKw BZyw delete sNø-s∏Spw.
Circular Queue
Front end Dw Rear End Dw XΩn¬ Iq´n-ap-´p∂ Queue BWv Circular Queue
Linked List
]c-kv]cw _‘-s∏´ AwK-ß-fpsS Hcp Iq´-amWv Linked List. Hmtcm AwKhpw ASp-Ø -Aw-K-Øns‚
A{Ukv kq£n-°p-∂p. Ah-km\ AwKw NULL A{Ukv kq£n-°p∂p. Self Referencial Structure
D]-tbm-Kn-®mWv \n¿Ωn-°p-∂Xv.
visit www.shenischool.in
Iºyq-´¿ kb≥kv
CHAPTER 4
WEB TECHNOLOGY
Web Server
sh_v s sk‰p- I ƒ kq£n- ° p∂ i‡n- t b- d nb Iw]yq- ´ - d p- I ƒ BWv sh_v s k¿hdpIƒ.
sh_vssk‰v:-˛ ]c-kv]-c -_-‘n-X-amb sh_v t]-Pp-I-fpsS Iq´w.
Software ports
sk¿h-dn¬ \n∂pw hnhn[ tkh-\-߃ e`y-am-°p-hm≥ Software Ports D]-tbm-Kn-°p-∂p.
DNS Servers
Hcp URL ¬ \n∂pw IP A{U v I≠p-]n-Sn®v Xcp∂ {]tXyI tkm^vSvshb¿ D]-tbm-Kn-°p∂
Iw]yq-´-dp-Iƒ.
Static and Dynamic Web Pages
Ãm‰nIv t]Pp-Iƒ Ft∏mgpw Hcp-t]mse Xs∂ ImW-s∏-Sp-∂p. ssU\m-anIv t]Pp-Iƒ hyXy-kvX-
ß-fmbn ImWs∏Sp∂p.
Scripts
kv{In]v‰nwKv emwtKz-Pp-Iƒ D]-tbm-Kn®v \n¿Ωn-°p∂ t{]m{Km-ap-Iƒ BWv Scripts.
Client side Script
sh_v _uk-dn¬ d¨ BIp∂ t{]m{Km-ap-Iƒ BWn-Xv.
Server side Script
sk¿h¿ Iw]yq-´¿ d¨ sNøp∂ t{]m{Km-ap-Iƒ BWn-Xv.
Scripting Languages
{][m-\-s∏´ kv{In]v‰nwKv emwtKz-Pp-Iƒ Xmsg-∏-d-bp-∂p.
1. Java Script
Brendan Eich 1995 ¬
hnI-kn∏n®v FSpØ `
ë mj-bm-Wn-Xv. ss¢b‚ v sskUv kv{In]v‰p-Iƒ \n¿Ωn-
°p-hm≥ D]-tbm-Kn-°p-∂p.
2. Vb Script
ssat{Im-tkm^vSv hnI-kn∏n® ss¢b‚ v sskUv t{]m{Km-anwKv `mj.
3. PHP
dmkvakv se¿tUm¿^v 1995 ¬ hnI-kn-∏n® sk¿h¿ sskUv t{]m{Km-anwKv `mj
4. ASP
ssat{Im-tkm^vSv hnI-kn-∏n® sk¿h¿sskUv t{]m{Km-anwKv `mj
5. Java Server Pages
k¨ssa-t{Im-knÃw hnI-kn-∏n-s®-SpØ sk¿h¿sskUv t{]m{Km-anwKv `mj
Cascading Style Sheets (CSS)
CXv sh_v t]Pns‚ \ndw, sSIvÃ,v t^m≠v F∂o t^m¿am-‰p-Iƒ Nn´-s∏-Sp-Øp-hm≥ D]-tbm-Kn-°p-∂p.
Tags
sh_v t]Pp-Iƒ \n¿Ωn-°p-hm≥ D]-tbm-Kn-°p∂ Iam≥Up-Iƒ BWv Tags. SmKp-Isf c≠mbn Xncn-
®n-cn-°p-∂p.
Hcp tPmUn Bbn D]-tbm-Kn-°p∂ SmKp-Iƒ DZm : < head>< /head>, <html></html>
2. Empty Tag
Attributes
<B> :- t_mƒUv
<i> :- C‰m-enIvkv
visit www.shenischool.in
Iºyq-´¿ kb≥kv
CHAPTER 5
WEB DESIGNING USING HTML
Lists in HTML
c≠v sh∫v t]Pp-Iƒ XΩn¬ ]c-kv]cw _‘n-∏n-°p-hm≥ klm-bn-°p∂ SmKv BWv anchor tag <a>.
Cu SmKns‚ ‘href’F∂ attribute GXv t]Pn-te-°mWv en¶v sNtø-≠Xv F∂v kqNn-∏n-°p-∂p.
en¶pIƒ c≠p Xc-Øn-ep≠v
a) Internal Link
<Frameset>
visit www.shenischool.in
Iºyq-´¿ kb≥kv
{][m\ attibutes
<FRAME> ]e-Xmbn hn`Pn® Hcp hn≥tUm-bn¬ Bh-iy-ap≈ t]Pv temUv sNøp-hm≥ klm-bn-
°p∂ SmKv.
<Form>
<Input>
7. button
<Textarea>
visit www.shenischool.in
Iºyq-´¿ kb≥kv
CHAPTER 6
CLIENT SIDE SCRIPTING USING JAVA SCRIPT
Java script 1995 ¬ Brendan Eich hnI-kn-∏n-s®-SpØ kv{In]v‰nwKv emwtKzPv BWv CX.v client
side kv{In]v‰pIƒ (t{]m-{Km-ap-Iƒ) \n¿Ωn-°p-hm≥ D]-tbm-Kn-°p-∂p. km[m-c-W-bmbn data validation
(tU‰ icn-bmtWm F∂v ]cn-tim-[n-°p-∂-Xn-\v) BWv java script D]tbm-Kn-°p∂Xv. {_uk¿ interpret
sNbvXmWv javascript {]h¿Øn-∏n-°p-∂Xv. Javascript case sensitive BWv. javascript t{]m{Km-ap-Iƒ html
t]Pp-I-fp-ambn _‘-s∏-´mWv {]h¿Øn-°p-∂Xv. Html t]Pp-Iƒ°p≈n¬ <script> tag D]-tbmKn®v
javascript t{]m{Km-ap-Iƒ Dƒs∏-Sp-Ømw. as‰mcp am¿Kw. ''.js'' F∂ extension \¬In javascript t{]m{Kmw
save sNøp-Ibpw. <script> tag D]-tbm-Kn®v html file tebv°v link sNøp-Ibpw sNømw. java script ¬
decision making ,looping statement Iƒ c++ emwtKz-Pn-te-Xp-t]m-se -X-s∂-bm-Wv.
Decision making statement
for, while
javascript ¬ functions html file se head section ¬ \¬I-Ww- F√m ^Mvj\pw ''function” F∂
keyword D]-tbm-Kn®v thWw XpS-ßp-hm≥.
DZm: <html>
<head><title>function <title>
document.write (“Hello”);
}
</script>
</head>
<body>
print();
</script>
</head>
</html>
Output :- Helo
visit www.shenischool.in
Iºyq-´¿ kb≥kv
CHAPTER 7
WEB HOSTING
Web Hosting
Cs‚¿s\- ‰ n¬ sh_v s sk‰v e`y- a m- ° p- ∂ - X n- \ m- b n, - s h- _ v sk¿h- d n¬ kw`cW ÿew
(storage space ) k÷o-I-cn®p sImSp-°p∂ tkh-\-amWv sh_v tlmÃnw-Kv. sh_vtlm-ÃnwKv sNøp∂
Iº-\n-Isf sh_v tlm-Ãp-Iƒ (web hosts) F∂v hnfn-°p-∂p.
1.1 Types of Web Hosting
]e-Xcw web hosting package Iƒ \ne-hn¬ e`y-am-Wv. GXp Xcw sh_v tlmÃnwKv sXc-s™-Sp-
°Wsa∂Xv Xmsg ]d-bp∂ Bh-iy-X-Iƒ IsW-°n-se-SpØmIWw.
· sh_v tlmÃnw-Kn\v Bh-iy-amb kw`cW ÿew (storage space)
· sh_vssk‰v kµ¿i-I-cpsS {]Xo-£n-°p∂ FÆw. (Expected number of visitors)
· Database, programing klmbw
\ne-hn¬ e`y-amb Web hosting package Iƒ Shared Hosting, Virtual Hosting, Dedicated Hosting F∂n-hb
- m-Wv.
A. Shared Hosting - Hcp sk¿h-dn¬ H∂n¬ IqSp-X¬ sh_vssk-‰p-Iƒ kw`-cn-°p-Ib
- pw, Cu sh_vssk-
‰p-Iƒ sk¿h-dns‚ RAM, CPU apX-emb hn`h-߃ (resources) ]¶p-sh-°p-Ibpw sNbp-∂p.
ta·-IÄ (Advantages)
· Xnc°v (traffic ) Ipd-hmb sNdnb sh_vssk-‰p-Iƒ°v A\p-tbm-Pyw.
· sNehv Ipd-hm-Wv.
· D]-tbm-Kn-°m≥ Ffp∏w.
Ipd-hp-Iƒ. (Disadvantages)
· sk¿h-dns‚ _m≥Uv hnUvXv (band width) F√m sh_vssk-‰p-Ifpw ]¶p-sh-°p-∂-Xn\m¬
GsX-¶nepw Hcp sh_vssk-‰n-te°v Xnc°v IqSp-tºmƒ a‰v sh_vssk‰p-If
- psS thKX Ipd-bp-∂p.
B. Dedicated Hosting - Hcp sk¿∆-dn-t\bpw, AXns‚ hn`h-ß-tfbpw (resources) Hcp sh_vssk-‰n\v
am{X-ambn hmS-Ibv°v D]-tbm-Kn-°p∂ coXn-bm-Wn-Xv.
ta∑-Iƒ (Advantages)
· kµ¿i-I¿ IqSp-X-emb Kh¨sa‚ v Un∏m¿´vsa‚p-Iƒ, henb ÿm]-\߃ F∂n-hbv°v
A\p-tbm-Pyw.
· sk¿∆-dn-t∑¬ ]q¿Æ kzmX-¥yw.
· Dd-∏mb {]h¿Ø\ anI-hv.
· _m≥Uv hnUvXv (bandwidth) ]¶p-sh-°m-Ø-Xn-\m¬ ssk‰ns‚ thKX -Ip-d-bp-∂n-√.
Ipd-hp-Iƒ (Disadvantages)
· sNehv IqSp-X-em-Wv.
¢b‚ v kz¥w sh_vsk¿h¿, Um‰m sk‚-dn¬ (data center) ÿm]n-°p-I-bm-sW-¶n¬ AXns\
ta∑-Iƒ (Advantages)
· Shared Hosting t\°mƒ IqSp-Xepw, Dedicated Hosting t\°mƒ Ipdhpw Bb kuI-cy-߃
Bh-iy-amb ssk‰p-Iƒ°v A\p-tbm-Pyw.
· sk¿h-dnse Hmtcm ssk‰p-Iƒ°pw \n›nX Afhn¬ band width Dd-∏m-°p-∂p.
· Dedicated Hosting t\mfw kuI-cy-߃, Ipd™ Nne-hn¬ e`y-am-°p-∂p.
visit www.shenischool.in
Iºyq-´¿ kb≥kv
°p-∂-Xv. Cu t{]mt´m-t°mƒ A\p-k-cn®v Um‰-Isf encrypt sNbvX-Xn\p tij-amWv sh_vsk¿h-
dn-te°v Ab-°p-∂-Xv. Eg: FileZilla,Cute FTP, Smart FTP
1.2 Free Hosting
sh_vtlm-ÃnwKv tkh-\-߃ kuP-\y-ambn sNøp-∂-Xns\ Free Hosting F∂p ]d-bp-∂p.
ta∑-Iƒ (Advantages)
· tlmÃnwKv XnI®pw kuP-\yw.
· sh_vtlm-Ãnw-Kn-\p≈ Nnehv Xmßm-\mh-mØ hy‡n-Iƒ°pw, {Kq-∏p-Iƒ°pw A\p-tbm-Pyw.
· Nne Free Hosting ÿm]-\-߃ Domain Name registration tkh-\hpw H∏w \¬Ip-∂p.
Ipd-hp-Iƒ (Disadvantages)
· Free Hosting sNbp∂ ÿm]-\ß
- ƒ sh_vssk-‰n-s\m∏w ]c-ky-߃IqSn {]Z¿in-∏n-°p-∂p.
· ^b-ens‚ hep∏w Ipd-hm-bn-cn-°-Ww,- Hm-Untbm/hoUntbm ^b-ep-Iƒ ]mSn-√ XpSßn Nne
\nb-{¥-W-߃ Free Hosting ÿm]-\-߃ sh_vssk-‰n-t∑¬ G¿s∏-Sp-Øm-dp-≠v.
Eg: Sytes.google.com,yola.com
visit www.shenischool.in
Iºyq-´¿ kb≥kv
CHAPTER 8
DATABASE MANAGEMENT SYSTEM
1. DBMS
visit www.shenischool.in
Iºyq-´¿ kb≥kv
1.3 Data abstraction and data independence
visit www.shenischool.in
Iºyq-´¿ kb≥kv
1.5 Relational Data Model
Hcp Relation se Hcp tuple s\ as‰mcp tuple  \n¶pw thÀXn-cn-¨-dn-bm³ klm-bn-¡p¶ Hcp attribute
s\ AÃ-¦n attribute IfpsS Iq«s¯ keys F¶p ]d-bp-¶p. Key H¶n-e-[nIw attribute Ifm \nÀ½n-
X-am-sW-¦n A¯cw Key sb composite key F¶p ]d-bp-¶p.
Candidate key : Hcp relation se Hcp tuple s\ as‰mcp tuple ¬ \n∂pw th¿Xn-cn-®-dn-bm≥ klm-bn-
°p∂ Hcp attribute s\ As√-¶n¬ attribute IfpsS Iq´sØ Keys F∂p ]d-bp-∂p. Hcp relation ¬
H∂n-e-[nIw Candidate key D≠m-Imw. DZm: STUDENT relation se AdmNo, Roll + Batch+Year
Primary Key : Hcp tuple s\ asämcp tuple  \n¶pw thÀXn-cn-¨-dn-bm-\mbn Candidate key Ifn \n¶pw
Xnc-sª-Sp-¡p¶ Hcp attribute s\ AÃ-¦n attribute IfpsS Iq«s¯ Primary Key F¶p ]d-bp-¶p.
Hcp relation  Hcp Primary Key am{Xta D- m - I p- I - b p- Šp.
DZm: STUDENT relation se AdmNo
Alternate Key : Primary Key AÃm¯ Candidate key sb Alternate Key F¶p ]d-bp-¶p.
DZm: STUDENT relation  AdmNo s\ Primary Key Bbn Xnc-sª-Sp-¯m Roll + Batch+Year Alternate Key
BIpw.
Hcp relation  \S-¯m-hp¶ hnhn[ operation Isf Relational Algebra F¶p ]d-bp-¶p. Relational
Algebra bnse ASn-Øm\ operation IÄ SELECT, PROJECT, UNION, INTERSECTION, SET DIFERENCE, CARTESIAN
PRODUCT F¶n-h-bm-Wv.
Hcp relation  \n¶pw X¶n-cn-¡p¶ \n_-Ô\ (condition) A\p-k-cn-¨pÅ hcn-Isf (rows) e`y-am-
¡m³ Select Operation D]-tbm-K-n-¡p-¶p. Cu operation s\ knÜ (ó) F¶ A£cw sIm≠v kqNn-¸n-
¡p-¶p. ó condition (Relation)
Hcp relation  \n¶pw Xnc-sª-Sp¯ attribute Isf ey-am-¡m³ Project Operation D]-tbm-Kn-°p-∂p.
Cu operation s\ ss] (ð) F∂ A£cw sIm≠v kqNn-∏n-°p-∂p.
ð A1,A2,…… An (Relation)
CsXmcp ss_\dn Hm∏-td-j-\m-Wv. c≠v relation Ifn-tebpw tuples tN¿Øv H‰ relation Bbn ImWn-
°p-∂p. Cu operation s\ U F∂- A-£cw sIm≠v kqNn-∏n-°p-∂p.
c≠v relation Ifn-tebpw s]mXphmb tuples tN¿Øv H‰ relation Bbn ImWn-°p-∂p. Cu relation s\
c≠v relation tebpw F√m tuples Itfbpw tN¿Øv sIm≠v H‰ relation Bbn ImWn-°p-∂p.
Cu operation s\ X F∂ A£cw sIm≠v kqNn-∏n-°p-∂p.
CXv Hcp Free RDBMS BWv. Database, Table (Relation) F∂nh \n¿Ωn-°p-hm\pw Data Process sNøp-
hm\pw klm-bn-°p-∂p.
SQL DATA TYPES
DataType Hcp thcn-b-_nƒ GXp Xc-Øn-ep-≈- tU-‰-bmWv kq£n-°-p∂Xv F∂v kqNn-∏n-°p-∂p. SQL
data types aq∂p Xc-Øn-ep-≠-v.
1. Numeric : A°-߃ ssIImcyw sNøp-∂p.
DZm : INT, DEC
2. String : A£-c-ßfpw knw_-ep-Ifpw ssIImcyw sNøp-∂p.
DZm : CHAR, VARCHAR
3. Date & Time : My SQL ¬ Date Dw Time Dw tÃm¿ sNøp-∂-Xn\v D]-tbm-Kn-°p-∂p.
SQL COMMANDS
Database ssIImcyw sNøp-hm-\p≈ {][m-\-s∏´ Commands Xmsg-sIm-Sp-°p-∂p.
(1) Create Database <database name> : ]pXnb Um‰m-t_kv \n¿Ωn-°p-∂p.
(2) USE <database name> : \ne-hn-ep≈ Um‰m-t_kv Open sNøp-∂p.
(3) Show databases: \ne-hn-ep≈ F√m Um‰m-t_kpIfpw display sNøp-∂p.
(4) Create Table : ]pXnb Hcp tS_nƒ \n¿Ωn-°p-∂p.
(5) Describe : Hcp Table s‚ Structure ImWn-°p-∂p.
(6) Insert Into : Hcp Table ¬ ]pXnb Hcp Tuple Iq´n-t®¿°p-∂p.
(7) Select : Hcp Table ¬ \n∂pw Bh-iym-\p-k-cWw Tuple ImWn-®p-X-cp∂p.
(8) Update : Hcp Table ¬ am‰-߃ hcp-Øp-∂p.
(9) Alter Table : ]pXnb Attribute Iq´n-t®¿°m-\pw, t]cv am‰m\pw, \ne-hn-ep≈ Attribute \v hyXymkw
hcp-Øp-hm\pw.
16 ssIØmßv ]Ø-\w-Xn´ Pn√m-]-©m-bØv 2019˛2020
Iºyq-´¿ kb≥kv
(10) Delete From : Table \n∂pw Tuples \o°w sNøm≥
(11) Drop Table : Hcp Table \o°w sNøm≥.
(12) Create View : Hcp ]pXnb hyq \n¿Ωn-°p-hm≥
(13) Drop View : Hcp hyq \o°w sNøp-∂p.
View : CXv \ne-hn-ep≈ tS_n-fn¬ \n∂pw \n¿Ωn-°p∂ Hcp Virtual Table BWv.
Hcp tS_nƒ t]mse Xs∂ CXv D]-tbm-Kn-°mw.
AGGREGATE FUNCTIONS
PHP - “Hypertext Preprocessor” Hcp sever side kv{In]v‰nwKv emwtKzPv BWv. 1995 ¬ Rasmus Lerdorf
BWv CXv hnI-kn-∏n-®Xv. PHP bpsS syntax c++ \v Xpey-amWv. PHP file Iƒ “.php”F∂ extension
\¬In Hcp web server s‚ root directory bn¬ save sNø-Ww. php t{]m{Km-ap-Iƒ interpret sNø-s∏-
Sp∂p, php t{]m{Km-ap-I-fpsS output HTML file BWv.
PHP kv{In]v‰v XpS-ßp-∂Xv <? php F∂ Tag epw Ah-km-\n-°p-∂Xv ?> Tag ep-am-Wv.
echo(), print () F∂nh php bn¬ D]-tbm-Kn-°p∂ output commands BWv
PHP ¬ thcn-b-_n-fp-Iƒ XpS-ßp-∂Xv $ Nn”-tØm-sS-bmWv
PHP bn¬ c++ ¬ D≈ integer, float, double data type Iƒ IqSmsX string, boolean, null, array, object,
resources F∂o datatype Iƒ IqSn-bp≠v
Operators
c++ ¬ D≈ F√m operators Dw PHP ¬ D]-tbm-Kn°mw AXp IqSmsX dot Operator (‘.’) Hm∏td‰¿
concatenating
For , while, do......while F∂nh IqSmsX foreach F∂ Hcp loop IqSn PHP ¬ D]-tbmKn°p∂p,
Functions
java script teXp-t]mse ^Mvj-\p-Iƒ “function” F∂ keyword D]-tbm-Kn®v XpS-ßp∂p
DZm. function print()
{
body of function;
var_dump ($a);
output :- int (678)
ARRAYS IN PHP
PHP t{]m{Km-ap-Iƒ 3 Three tire architecture (aq∂v Xeß-fn¬) D]-tbm-Kn-°p∂p. user interface, application
programs , datastore F∂n-h-bmWv 3 Xe߃.
Global variables
POST- D]-tbm-Kn-°p-tºm-ƒ tU‰mbv°v limit C√ Ab-bv°p∂ tU‰ visible A√. Bookmark sNøp-hm≥
km[n-°n√ . {][m-\-s∏´ hnh-c-߃ ssIam-dp-∂p.
Database t{]m{Km-ap-Iƒ
PHP D]tbm-Kn®v tU‰m-t_kv connect sNbvXv data kzoI-cn-°p-Itbm \¬Ip-Itbm sNømw.
PHP {][m-\-s∏´ F√m database Ifp-ambn {]h¿Øn°pw
2. Serial Computing :