CH0MO0053s2006

C HED MEMOR MORANDUM OR ORDER (CMO (C MO)) NO. 53; Series of of 2006 2006

SUBJ UBJ ECT EC T

:

POLICIES IC IES AND STANDAR NDARDS FOR INFOR INFORMAT MATION ION TECHNOLOG ECHNOLOGY Y EDU EDUC ATIO ATION N (ITE) PROGRAMS

x- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -x In accordance with pertinent provisions of Republic Act (RA) No. 7722, otherwise known a s the “Highe “Higherr Ed uca uc a tion tion Ac A c t of 1994 1994,” ,” and p urs ursuant ua nt to to C ommiss ommission En En Ba Ba nc (C EB) EB) Re Re so lutio lutio n No. 798 - 2006 to rationalize Information Technology Education (ITE) in the country and keep pace with the demands of global competitiveness, the follow followin ing g Polic Polic ies a nd Stand Standa a rds (PS) (PS) for ITE a re hereby ad opted op ted a nd promulga promulga ted b y the C o mmiss mmission, thus: thus: ARTICL IC LE I INTRODUC DUC TION ION Sect ec tion I. Rationale Rationale and Backgr ac kground ound

The The field field of Informati nformation on Tec hnolog hnology y (IT (IT) is ever dynamic; its a dvanc dva ncement ement a nd develop de velopment ment had ha d bee b een n ra pid and a nd its its evolv evo lveme ement nt is a c ontinuous ontinuous proc ess ess. To fac e the challenges of advancement, the Commission recognizes the need to be responsive according to the current needs of the country. Hence, it is essential and important that the country’s IT capability should be continually developed and strengthened to be at par globally. It is the objective of the Commission to develop and promote the Policies and Standards (PS) for Information Technology Education to provide a minimum stand a rd for Highe Higherr Ed Ed uca uc a tion tion Insti Institut tutions ions (HE (HEIs) Is) offeri o ffering ng o r intend intending ing to offer offe r quali qua lity ty ITE p ro g ra ms. ms. The PS P S is d e velop ve lope e d with w ith co c o nsultatio nsultations ns fro fro m all a ll stakeho ta keholde lderrs, fro fro m the academe to industry. The The PS c ontains provis provisions that that c ulti ultivate vate the c ultu ulturre of exc exc ellenc ellenc e in offeri offering the ITE ITE p ro g ra ms. ms. This is in line line with w ith the vision vision of o f the C o mmiss mmission to have ha ve HEIs HEIs p ro d uc e c o mpetent mpe tent grad uates ua tes that sha shall ll c a ter to to the ne ed s o f the IT IT industr industry. y. The PS is a lso lso d esigne esigned d for all a ll HEIs HEIs to ex e xe rc ise ise their innovati innova tivene venes ss a nd c rea tivit tivity y in the the d evelop eve lopment ment of o f its its c urr urriculum ic ulum for the the offer offe ring of o f ITE p ro grams gra ms..

Page 1

ARTICL IC LE II AUTHORIT HORITY TO OPERATE Sect ec tion 2. Authorit Authority to Oper perate. All Private Higher Education Institutions (PHEIs) intending to offer degree programs in Computer Science, Information Technology a nd Information Informa tion Sys Systems tems must must firs first se se c ure pr p ro p e r a uthor utho rity fro fro m the C o mmiss mmission in a c c o rd a nce nc e with with exis existing ting rules rules a nd reg regulations ulations.. State unive unive rsities ities a nd colleg c olleges es (SUC (SUCs s), and a nd loc a l co c o lleg llege e s a nd univers universities ities should ho uld likewis likewise e strictly trictly ad here to the provisions in this policies and standards. ARTICL IC LE III PROGRAM SPECIF ECIFIC ICA ATIONS IONS

Sect ec tion 3. Degree Progr ograms. ms. - The degree programs corresponding respectively to these these spec ific ific a rea s a re the foll fo llow owin ing: g: 3.1

the stu study dy of c onc epts ep ts a nd Bac helor of Sc ience ience in C omputer Sc ience ience (BS (BSC S) - the theories, algorithmic foundations, implementation and application of information and computing solutions.

3.2

Bac helor of Sc ience ienc e in Informat Information ion Technology ec hnology (BS (BSIT) - the study of utilization of computers and computer software to plan, install, customize, operate, mana ge, ge , a dminis dminister and maintain inform informa a tion tion technolog tec hnology y infr infra struc tructur ture. e.

3.3

Bac helor helor of Sc ienc ience e in Informa Information Systems (BSIS) IS) – the study of design and implementation of solutions that integrate information technology with b usines usiness s p roc esses. esses. The BSIS shall ha ll rep lac e the Bac helor helo r of Sc Sc ienc e in Inform Informa a tion tion Ma nage na gement ment (BS (BSIM) pr p rogr og ra m.

Sect ec tion 4.

Progr ogram des desc ription iption. The The obj ob jec tives tives of the the thr three ee (3) (3) prog progrra ms in IT ITE a re as a s follows: follows:

4.1.1 .1.1 The Bac helor of Sc Sc ienc e in C omputer omp uter Sc ience ienc e (BSC S) program prepares students to be IT professionals and researchers, and to be proficient in in des d esigni igning ng a nd develop de velopin ing g c omputi omp uting ng soluti solutions ons.. 4.1. 4.1.2 2 The Bac helor helo r o f Sc Sc ience ienc e in Information Information Tec Tec hnology hnolo gy (BS (BSIT) progr prog ra m prepares students to be IT professionals, be well versed on application ins installa talla tion, tion, ope o perra tion, tion, deve d evelopme lopment, nt, ma ma intena intenanc nce e a nd a dminis dministra tra tion, tion, a nd fa mili milia a r with with hardwa re install installa a tion, tion, op eration, and maintenanc e. 4.1.3 4.1.3 The Bac Ba c helor he lor of Sc Sc ienc e in Information Informa tion Sys Systems tems (BS (BSIS) IS) pr p ro g ra m prepares students to be IT professionals and be expert on design and impleme imple menta ntation tion of o f IS IS for fo r b usiness usiness p ro c e sse s. 4.2

Spec pe c ific ific profess professions/ ions/ c a ree eerrs/ oc c upa tions tions or tra tra des de s that the gradua grad uates tes of these programs may pursue. – After satisfactorily completing all the re q uire uire ments me nts lead lea d ing to a BSC S, BS BSIT, or o r BSIS d e g re e , stud stude e nts may ma y qua qu a lify lify for b ut not limit limited ed to the following entry level posi p ositi tions: ons:

Page 2

4.2.1 4.2.1 Bachelor ac helor of Sc ience ience in C omputer omputer Sc ience ience (BSC S) • • • • • • • •

Ap plic plic a tions tions Developer C omputer omp uter Sc Sc ience ienc e Ins Instruc tructor tor Database Programmer / Designer Informa Informati tio o n Sec urit urity y Engineer Enginee r Quality Assurance Engineer Researcher Systems Developer Syste ystems ms Ana Analys lystt

4.2.2 4.2.2 Bac helor of Sc ience ienc e in Informat Information ion Technology ec hnology (BSIT) • • • • • • • • • • • •

Ap plic plic a tions tions developer de veloper Datab Da taba a se Ad mini minis stra tra tor Entrepreneur in IT Industry Information Informa tion Se Se c urity urity A d ministr ministra a tor Informa Informati tio o n Te Te c hnology hnolo gy Instr Instruc uctor tor Netwo Ne tworrk A d minis ministra tra tor Network Engineer Syste ystems ms Ana Analys lystt Tec Tec hnic hnic al Suppo Suppo rt Spec pe c ia list ist Tes Testt Enginee ngineerr Web Ad mini minis stra tra tor / Web We b Ma ster Web Developer

4.2.3 Bac helor helor of Sc ienc ience e in Informa Information Systems (BSIS) IS) • • • • • • • •

Busine Busines ss Proc Proc e ss A nalys na lystt Data Da ta Q ual ua lity ity Spe Spec c ialis ialist Entrepreneur in IT industry IS Instr Instruc uc tor to r Systems Auditor Quality Assurance Analyst Systems ystems Impleme Impleme ntation O fficer ffice r Tec Tec hnic hnic al Suppo Suppo rt Spec pe c ia list ist

These e a re progra progra ms tha tha t may b e c onsider onsidered ed a s Sect ec tion 5. Allied Allied Progr ograms. ms. – Thes equivalent to ITE programs for the purpose of determining qualifications of faculty members and for students cross enrolling to other department. For the BSC S Program: rogram: • • • •

BS Mathematics BS C omputer omp uter Engine Engineeri ering ng BS in Elec Electr tronic onic s a nd C ommunica ommunic a tions tions Enginee Enginee ring BS Applied Mathematics

Page 3

For the BSIT Program rogram:: • • • •

BS C omputer omp uter Engine Engineeri ering ng BS Electr lec tronic onic s a nd C o mmunic mmunic a tio tio ns Engineeri ngine ering ng BS Statis ta tistic tics s BS in Information Management

For the BSIS Progra rogram: m: • • •

BS Inform Informa a tion tion M a nage na gement ment BS Statis ta tistic tics s BS Industrial Engineering

ARTICL IC LE IV C OMPETENCY ENCY STANDAR NDARDS

omp e tenc y refe referrs to sp sp ec ific ific skill kills s, Sect ec tion 6. C ompetency ompetency Standar andards – C ompe knowledge and attitude that may be demonstrated through performance, while stand a rd s a re c o mmon set set of o f expec expe c tati ta tio o ns. ns. G ra d uates ua tes of eit e ither her BS BSC S, BS BSIT, or BS BSIS programs, are expected to have acquired but not limited to the following competencies: 6.1

Pers Pe rso o nal na l Skills • • • • • • • • •

6.2

Interpe Interpers rso o nal na l Skills kills • • •

6.3 6.3

Per Pe rso nal-dis na l-disc c ipline skill kills s C ritic ritica a l-thinking skil skills ls Inter and intra person motivation skills Problem solving skills Planning and organizing skills Ethica thic a l thinking thinking Entrepreneurial thinking Innovative Perseve Perseverra nce nc e in purs pursuing uing goa go a ls a nd c ontinuous ontinuous improvement improvement

Tea Tea m work a nd coll c olla a bor bo ra tive tive sk skills Oral and written communication skills C o nflict nflic t reso reso lutio lutio n skil skills ls

Tec hnica hnic a l Under Unde rstand ing 6.3.1 .3.1 Ba c helor of Sc Sc ienc e in in C omputer omp uter Sc ience ienc e (BS (BSC S) •

• •

Ap plic plic a tion tion of o f funda funda menta menta l co mputer mputer co ncep nc epts ts a s problem solv solvin ing g skills Design Design and a nd impleme implementati ntation on o f comp c omputer uter-ba -ba sed solutions olutions Rec ogni og niti tion on and a nd a ppl pp licati ica tion on of tec hnic hnic a l standa rds a nd interoperability

Page 4

• •

Research in Computer Science related areas Integration Integration of know knowledg ledge e lear lea rned in different different ar a rea s of C omputer omp uter Science

6.3. 6.3.2 2 Ba c helor helo r o f Sc ience ienc e in Informa Informati tio o n Te c hnology hnolo gy (B (BSIT) • • • • •

Systems analysis and design O per pe ra tion tion of da taba tab a se, network ne tworks s a nd multi multimed media ia systems ystems Softwar oftwa re integration, integration, testi testing ng a nd d oc umentation Systems management and administration Principles of accounting

6.3.3 6.3.3 Ba c helor he lor o f Sc ienc e in in Information Informa tion Systems ystems (BS (BSIS) IS) • • • • •

Inform Informa a tion tion a bstr bstra c tion, tion, repr ep resenta esentati tion on a nd organi orga niz za tion tion C o mputing ar a rc hitec hitec tures tures a nd delivery d elivery systems ystems C o ncep nc ep ts o f information information and a nd sys system dis d istr tribution ibution Information management and system development C omputing omputing tool too ls in knowled knowledge ge a ppl pp lic ation ation ARTICL IC LE V C URRICUL IC ULUM

Sect ec tion 7. C urr urriculum ic ulum Descr Description. iption. - ITE shall be built upon a core of courses and a series series o f professiona professionall c ourses ourses lead lea d ing to one o r more of o f the the thre thre e pr p rogr og ra ms. ms. The New G ener ene ra l Educ Educ a tion tion C urr urriculum as manda mand a ted b y the the C ommiss ommission sha shall ll form pa rt o f the req uireme uirements nts for ITE. The The req uire uire d natur na tura a l sc sc ienc e c ourse ourse s in the G E curric curriculum ulum should hould inc inc lude a la bor bo ra tory tory compo c ompo nent. nent.

The c urr urriculum ic ulum outline outline is d ivid ivid e d into five (5) Sect ec tion 8. C urr urriculum iculum Outline. – The c o mponents mpo nents namely: na mely: G ener ene ra l Ed uca uc a tio tio n, Ba Ba sic ITE ITE C ore C o urs urses, ITE Pro Pro fessiona fessionall C o urse urse s, IT ITE e lec tives a nd fre fre e elec e lec tives with a minimum re re q uire uire ment me nt of 140 140 units. units. The The outli outline is is as foll follows: ows: a)

GENER ENERAL EDUC ATION ION Languages nguages and Humanit Humanities ies English Filipino Humaniti Huma nitie e s (Litera (Literatur ture e , A rts, ts, Philosophy, Philosop hy, e tc.) tc .) Mathema Mathemattics ics, Natur Natural Sc iences ienc es and Techn ec hnology ology Mathematics Natur Na tura a l Sc ienc e s Electi lec tives ves ( Ma th, Natur Na tura a l Sc ience, ienc e, Tec hnology hnolog y etc.) etc .) Social oc ial Sc iences iences & C ommunica ommunicattions Soc ial Sc iences ienc es & C ommunic ommunic a tions tions Psychology, Sociology, Anthropology, Ec onomi ono mic c s (w/ Ta xa tion tion & Agr Ag ra rian Reform Integ Integ ra ted), ted ), Philip Philip pine His History & C ultur ulture e, Life Life & Wo rks o f Riz Riza a l, Asia Asian/ n/ We Wes stern C ivili ivilization zation,, M a ss C o mm., Soc iety a nd Cult C ultur ure e (with (with Fa mily mily

Units

Total Units 24

9 6 9 15

6 6 3 15

15

Page 5

Planning), Planning), Politics Politics & G over ove rnanc na nce e (with (with Phil Philippine C o nsti nstitut tution) ion) b) BASIC ITE C ORE C OURSES c ) ITE PROFESSIONA IONAL L C OURSES d) ITE ELECT ECTIVES IVES e) FREE ELECT ELECTIVES PE NSTP TOTAL UNIT UNITS

18 33 12 9 8 6 140

Be low a re sa mple c urr urricula ic ula for fo r the BSC BSC S, Sect ec tion 9. Sample program of study. - Be BSIT BSIT a nd BSIS BSIS.. Sample ample Cur C urr riculum iculum for the Ba Bac helor of Sc ience ienc e in Computer C omputer Sc ience ienc e (BSC S) Pr Progr ogram FIRSTYEAR YEAR First Semester mester DESCRIPT DESCRIPTIVE IVE TITLE

C S Fundamenta Funda mentals ls C omp uter Prog Prog ra mming 1 A lgeb lge b ra English English 1 Soc ial Sc ience ienc e 1 Natur Na tura a l Sc ienc e 1 PE 1 NSTP 1

C OURSE CODE

TOTAL UNITS

LEC UNITS

LAB UNITS

C S101 C S102 102 G E101 101 G E201 E201 G E301 301 G E111 111

3 3 3 3 3 3 2 3

2 2 3 3 3 3 2 3

1 1 0 0 0 0

23

21

2

C OURSE CODE

TOTAL UNITS

LEC UNITS

LAB UNITS

C S103 103 C S201 201 G E102 G E202 E202 G E206 E206 G E112 112

3 3 3 3 3 3 2 3

2 3 3 3 3 3 2 3

1 0 0 0 0 0

23

22

1

TOTAL

C o-R o-REQ Pre-R e- REQ.

None No ne None No ne None No ne None No ne None No ne None No ne


TOTAL HRS/ WK

5 5 3 3 3 3 2 3 27

Second ec ond Semester Semester DESCRIPT DESCRIPTIVE IVE TITLE

C omp uter Prog Prog ra mming 2 Data Da ta Struc truc tures Tr Trigonometr go nometry y English English 2 (C o mmunica mmunic a tions for IT) Filipin Filipino o1 Natur Na tura a l Sc ienc e 2 PE 2 NSTP 2 TOTAL


None No ne None No ne None None No ne None No ne None No ne

C S102 102 C S102 102 G E101 G E201 E201 G E201 E201 G E111 E111

TOTAL HRS/ WK

5 3 3 3 3 3 2 3 25

Page 6

SECO ECOND YEAR First Semester mester DESCRIPT DESCRIPTIVE IVE TITLE

O b jec t O riented Prog Prog ra mming mming Des De sign a nd A nalys na lysis is o f A lgori lgo rithm thm Disc Disc rete Structures truc tures C a lculus lc ulus Englis English h3 Filipin Filipino o2 PE 3

C OURSE CODE

TOTAL UNITS

LEC UNITS

LAB UNITS

C S211 211 C S202 202 C S104 104 C S210 210 G E203 E203 G E207 E207

3 3 3 3 3 3 2

2 3 3 3 3 3 2

1 0 0 0 0 0

20

19

1

C OURSE CODE

TOTAL UNITS

LEC UNITS

LAB UNITS

C S212 212 C S203 203 C S204 204 C S206 206 G E103 E103 G E401 E401

3 3 3 3 3 3 2

2 2 3 3 3 3 2

1 1 0 0 0 0

20

18

2

C OURSE CODE

TOTAL UNITS

LEC UNITS

LAB UNITS

C S213 213 C S205 205

3 3

2 3

1 0

None No ne None No ne

C S212 212 G E101 101

5 3

C S105 105 C S301 301 G E302 302 G E402 E402

3 3 3 3

2 2 3 3

1 1 0 0

None No ne None No ne None No ne None No ne

C S206 206 3rd 3rd Yr None No ne None No ne

5 5 3 3

18

15

3

TOTAL



C S103 103 C S201 201 G E101 E101 G E102 E102 G E202 E202 G E206 E206

TOTAL HRS/ WK

5 3 3 3 3 3 2

22


Data Da tab b a se Systems ystems Programmi Progra mming ng La ngua ges ge s A utomata utoma ta a nd La ngua ng uage ge Theo ry Digital Digita l Design Proba Prob a b ility ility a nd Statis ta tistic tics s Humaniti Huma nitie es 1 PE 4

TOTAL


None No ne None No ne None No ne None No ne No N o ne None No ne

C S103 103 C S103 103 C S103 103 G E102 E102 G E102 E102 None No ne

TOTAL HRS/ WK

5 5 3 3 3 3 2

24

THIRD YEAR YEAR First Semester mester DESCRIPT DESCRIPTIVE IVE TITLE

We b Programming Web Prog ramming M od elling elling a nd Simula imula tion tion C omputer Orga Orga niz nization and A sse mbly mb ly Lang uag ua g e C S Elec Elec tive 1 Soc ial Sc ience ienc e 2 Humaniti Huma nitie es 2 TOTAL


TOTAL HRS/ WK

24

Page 7


So ftwa re Enginee Engine e ring ring O p e rating Systems ystems C S Elec Elec tive 2 Free Free Elec tive tive 1 Soc ial Sc ience ienc e 3 Humaniti Huma nitie es 3

C OURSE CODE

TOTAL UNITS

LEC UNITS

LAB UNITS

C S214 214 C S207 207 C S302 302 C S401 401 G E303 303 G E403 E403

3 3 3 3 3 3

2 2 2 2 3 3

1 1 1 1 0 0

18

14

4

C OURSE CODE

TOTAL UNITS

LEC UNITS

LAB UNITS

C S500

3

0

3

3

0

3

C OURSE CODE

TOTAL UNITS

LEC UNITS

LAB UNITS

C S501

3

3

0

None

C S214

3

C S208 208 C S106 106 C S302 302 G E304 304 G E405 405

3 3 3 3 3

2 3 2 3 3

1 0 1 0 0

None No ne None No ne None No ne None No ne None No ne

C S207 207 C S101 101 None No ne None No ne None No ne

5 3 5 3 3

18

16

2

TOTAL



C S211 211 C S105 105 3rd 3rd Yr None No ne None No ne None No ne

TOTAL HRS/ WK

5 5 5 5 3 3

26

Summer DESCRIPT DESCRIPTIVE IVE TITLE

Interns Internship/ hip/O O J T/ Pra Pra c tic tic um TOTAL


None

TOTAL HRS/ WK

None 162

FOURT FO URTH YEAR YEAR First Semester mester DESCRIPT DESCRIPTIVE IVE TITLE

Thes Thesiis 1 Network Ne twork Princ Principles iples a nd Programming Prog ramming Profes Profe ssiona l Ethic Ethics s C S Elec tive tive 3 Soc ial Sc ience ienc e 4 Soc ial Sc ience ienc e 5

TOTAL


TOTAL HRS/ WK

22

Page 8

Second ec ond Semester Semester C OURSE CODE

TOTAL UNITS

LEC UNITS

LAB UNITS

C S502 C S304 304 C S402 402 C S403 403

3 3 3 3

3 2 3 3

0 1 0 0

TOTAL

12

11

1

BSC S TOTALS

152/155 152/ 155

136

19

DESCRIPT DESCRIPTIVE IVE TITLE

Thes Thesiis 2 C S Elec tive tive 4 Free Free Elec tive tive 2 Free Free Elec tive tive 3


None None No ne None No ne None No ne

TOTAL HRS/ WK

C S501 None No ne None No ne None No ne

3 5 3 3 14

Sample C urr urriculum iculum for the the Bachelor Bac helor of Sc Sc ience ienc e in Informat Information ion Technology ec hnology (BS (BSIT) Program FIRSTYEAR YEAR First Semester mester DESCRIPT DESCRIPTIVE IVE TITLE

IT Funda menta men tals ls Programming Prog ramming 1 A lgeb lge b ra English English 1 Soc ial Sc ience ienc e 1 Natur Na tura a l Sc ienc e 1

C OURSE CODE

TOTAL UNITS

LEC UNITS

LAB UNITS

IT101 101 IT102 102 G E101 101 G E201 E201 G E301 301 G E111 111

3 3 3 3 3 3

2 2 3 3 3 3

1 1 0 0 0 0

18

16

2

C OURSE CODE

TOTAL UNITS

LEC UNITS

LAB UNITS

IT103 103 G E102 G E202 E202 G E206 E206 G E112 112 G E401 E401

3 3 3 3 3 3 2 3

2 3 3 3 3 3 2 3

1 0 0 0 0 0 0 0

23

22

1

TOTAL




TOTAL HRS/ WK

5 5 3 3 3 3 22


Prog Prog ramming ramming 2 Tr Trigonometr go nometry y English English 2 (C o mmunica mmunic a tions for IT) Filipin Filipino o1 Natur Na tura a l Sc ienc e 2 Humaniti Huma nitie es 1 PE 1 NSTP 1 TOTAL


None No ne None None No ne None No ne None No ne None No ne

IT102 102 G E101 G E201 E201 G E201 E201 G E111 E111 None No ne

TOTAL HRS/ WK

5 3 3 3 3 3 2 3 25

Page 9

SECO ECOND YEAR First Semester mester DESCRIPT DESCRIPTIVE IVE TITLE

C o mputer mp uter O rg a niza niza tion O b jec t O rien riented ted Programming Prog ramming Disc Disc rete Structures truc tures A c c o unting Princ Princ iples iple s Englis English h3 Filipin Filipino o2 PE 2 NSTP 2

C OURSE CODE

TOTAL UNITS

LEC UNITS

LAB UNITS

IT105 105 IT211 211 IT104 104 IT201 201 G E203 E203 G E207 E207

3 3 3 3 3 3 2 3

2 2 3 3 3 3 2 3

1 1 0 0 0 0

23

21

2

C OURSE CODE

TOTAL UNITS

LEC UNITS

LAB UNITS

IT212 212 IT202 202 IT203 203 G E103 E103 G E302 302 G E402 E402

3 3 3 3 3 3 2

2 3 2 3 3 3 2

1 0 1 0 0 0

20

18

2

C OURSE CODE

TOTAL UNITS

LEC UNITS

LAB UNITS

IT214 214 IT20 IT204 4 IT21 IT213 3 IT30 IT301 1 G E303 303 G E403 E403

3 3 3 3 3 3 2

2 2 2 2 3 3 2

1 1 1 1 0 0

20

16

4

TOTAL



IT103 103 IT103 103 G E101 E101 G E102 E102 G E202 E202 G E206 E206

TOTAL HRS/ WK

5 5 3 3 3 3 2 3 27

Second Semester DESCRIPT DESCRIPTIVE IVE TITLE

Data Da tab b a se M a nag na g ement eme nt System ystem 1 O p e rating System ystem A p p lica tions Netwo Ne tworrk M a nag na g ement eme nt Proba Prob a b ility ility a nd Statis ta tistic tics s Soc ial Sc ience ienc e 2 Humaniti Huma nitie es 2 PE 3 TOTAL


None No ne None No ne None No ne No N o ne None No ne None No ne

IT211 211 IT105 105 IT105 105 G E101 E101 None No ne None No ne

TOTAL HRS/ WK

5 3 5 3 3 3 2 24


We b Develo Web De velop p ment men t Syste ystems ms A nalys na lysis is a nd Des De sign Data Da tab b a se M a nag na g ement eme nt Systems ystems 2 IT Elec tive 1 Soc ial Sc ience ienc e 3 Humaniti Huma nitie es 3 PE 4 TOTAL



IT212 212 G E102 E102 IT IT212 212 3rd 3rd Yr None No ne None No ne

TOTAL HRS/ WK

5 5 5 5 3 3 2 28

Page 10


So ftwa ftwa re Engine Enginee ering ring M ultimed ultimed ia Syste ystems ms Profe Profes ssiona ion a l Ethics Ethic s IT Elec tive 2 Fre Fre e Elec Elec tive 1 Soc ial Sc ience ienc e 4

C OURSE CODE

TOTAL UNITS

LEC UNITS

LAB UNITS

IT205 205 IT215 215 IT106 106 IT302 IT401 401 G E304 304

3 3 3 3 3 3

2 2 3 2 3 3

1 1 0 1 0 0

18

15

3

TOTAL UNITS

LEC UNITS

LAB UNITS

TOTAL



IT204 204 IT214 214 IT101 101 None No ne None No ne None No ne

TOTAL HRS/ WK

5 5 3 5 3 3 24


Interns Internship/ hip/ O J T/ Prac ticum

C OURSE CODE

IT500 500

9

0

9

9

0

9

C OURSE CODE

TOTAL UNITS

LEC UNITS

LAB UNITS

IT206 206 IT303 IT304 IT402 402 IT403 403 G E305 305

3 3 3 3 3 3

3 2 2 3 3 3

0 1 1 0 0 0

TOTAL

18

16

2

BSIT TOTALS

149

124

25

TOTAL


Senior Stand ta nding ing

IT 11

TOTAL HRS/ WK

27 27

Second Semester DESCRIPT DESCRIPTIVE IVE TITLE

C ap stone Projec Projectt (Te (Tec hno p reneurs rene urship hip)) IT Elec tive 3 IT Elec tive 4 Fre Fre e Elec Elec tive 2 Fre Fre e Elec Elec tive 3 Soc ial Sc ience ienc e 5


4th yr None No ne None No ne None No ne None No ne None No ne

IT 13 None No ne None No ne None No ne None No ne None No ne

TOTAL HRS/ WK

3 5 5 3 3 3 22

Page 11

Sample C urric urriculum ulum for the Bachelo Bac helor r of Sc ienc ience e in Information Systems (BS (BSIS) IS) Program Program

FIRSTYEAR YEAR First Semester mester DESCRIPT DESCRIPTIVE IVE TITLE

Fundamentals of Information Systems / Information Management Pers Pe rso nal na l Produc Prod uc tivity tivity using using IS A lgeb lge b ra English English 1 Natur Na tura a l Sc ienc e 1 Humaniti Huma nitie es 1 PE 1 NSTP 1

C OURSE CODE

TOTAL UNITS

LEC UNITS

LAB UNITS

IS10 IS101 1 IS10 IS102 2 G E101 101 G E201 E201 G E211 211 G E401 E401

3 3 3 3 3 3 2 3

3 2 3 3 3 3 2 3

0 1 0 0 0 0 0 0

23

22

1

TOTAL UNITS

LEC UNITS

LAB UNITS

3

3

0

None No ne

None No ne

3

3

2

1

None No ne

None No ne

5

3

3

0

None No ne

None No ne

3

3 3 3 3 2 3

3 3 3 3 2 3

0 0 0 0 0 0

None No ne None None No ne None No ne

None No ne G E101 G E201 E201 G E211 211

3 3 3 3 2 3

26

25

1

TOTAL




TOTAL HRS/ WK

3 5 3 3 3 3 2 3 25


C OURSE CODE

Human C omputer omp uter Intera Intera c tion IS21 IS211 1 Fundamentals of Programming, Data Da ta,, File File a nd O b jec t Struc tructur tures es IS1 IS103 Introduction to the IM Profession and Ethics Ethic s IS10 IS106 6 Fundamenta Funda mentals ls of Busines usiness s and M a nage na gement ment IS20 IS201 1 Tr Trigonometr go nometry y G E102 Englis English h2 G E202 E202 Natur Na tura a l Sc ienc e 2 G E212 212 PE 2 NSTP 2 TOTAL


TOTAL HRS/ WK

28

Page 12

SECO ECOND YEAR First Semester mester TOTAL UNITS

LEC UNITS

LAB UNITS

Syste ystems ms A nalys na lysis is a nd Des De sign IS21 IS213 3 Data Da tab b a ses IS21 IS212 2 System ystem Infra Infra struc truc ture a nd Integration Integ ration IS21 IS214 4 Busine Busines ss Proc Pro c esses IS202 IS202 Disc Disc rete Structure truc ture IS10 IS104 4 Filipin Filipino o1 G E206 E206 Englis English h3 G E203 E203 PE 3

3 3 3 3 3 3 3 2

3 2 3 3 3 3 3 2

0 1 0 0 0 0 0 0

TOTAL

23

22

1

C OURSE CODE

TOTAL UNITS

LEC UNITS

LAB UNITS

IS21 IS215 5 IS10 IS105 5 IS20 IS203 3 G E103 E103 G E207 E207 G E301 301 G E302 302

3 3 3 3 3 3 3 2

2 2 3 3 3 3 3 2

1 1 0 0 0 0 0 0

23

21

2


C OURSE CODE


None No ne None No ne None No ne No ne None No ne None No ne None No ne

IS21 IS211 1 IS10 IS103 3 IS10 IS103 3 IS201 IS201 G E101 E101 G E201 E201 G E202 E202

TOTAL HRS/ WK

3 5 3 3 3 3 3 2 25


A p p lica tions Deve De velop lopmen mentt Netwo Ne tworrks a nd Internet Tec hnolog hno logy y A c c ounting a nd Fina Financ nc ials Proba Prob a b ility ility a nd Statis ta tistic tics s Filipin Filipino o2 Soc ial Sc ience ienc e 1 Soc ial Sc ience ienc e 2 PE 4 TOTAL


None No ne None No ne None No ne None No ne None No ne None No ne None No ne

IS21 IS212-2 2-213 13 IS21 IS214 4 IS2 IS202 G E101 E101 G E206 E206 None No ne None No ne

TOTAL HRS/ WK

5 5 3 3 3 3 3 2 27

Page 13


Projec Projectt Mana gement ge ment and Qua lity lity Syste Systems ms Deployment, Deployment, Ma intena ntenance nce and Servic es Evaluation Evalua tion of Business Business Performanc Pe rformanc e IS Elec tive 1 Fre Fre e Elec Elec tive 1 Soc ial Sc ience ienc e 3 Humaniti Huma nitie es 2

C OURSE CODE

TOTAL UNITS

LEC UNITS

LAB UNITS

IS217 IS217

3

3

0

No ne

IS215 IS215

3

IS216 IS216 IS20 IS204 4 IS30 IS301 1 IS40 IS401 1 IS30 IS303 3 IS40 IS402 2

3 3 3 3 3 3

3 3 3 3 3 3

0 0 0 0 0 0

No ne None No ne None No ne None No ne None No ne None No ne

IS215 IS215 IS20 IS203 3 3rd 3rd Yr None No ne None No ne None No ne

3 3 3 3 3 3

21

21

0

C OURSE CODE

TOTAL UNITS

LEC UNITS

LAB UNITS

IS21 IS218 8 IS20 IS205 5 IS30 IS302 2 IS30 IS303 3 IS40 IS402 2 G E304 304

3 3 3 3 3 3

3 3 3 3 3 3

0 0 0 0 0 0

18

18

0

C OURSE CODE

TOTAL UNITS

LEC UNITS

LAB UNITS

IS50 IS500 0

9

0

9

9

0

0

TOTAL


TOTAL HRS/ WK

21


Informa Info rmation tion Syste ystems ms Planning Pla nning M a nage na gement ment of Tec hnology hnolo gy IS Ele Ele c tive 2 IS Ele Ele c tive 3 Fre Fre e Elec Elec tive 2 Soc ial Sc ience ienc e 4 TOTAL


None No ne IS21 IS218 8 None No ne None No ne None No ne None No ne

IS21 IS216 6 None No ne None No ne None No ne None No ne None No ne

TOTAL HRS/ WK

3 3 3 3 3 3 18


Internship/ Internship/ O J T/ Prac ticum tic um TOTAL


None No ne

IS21 IS218 8

TOTAL HRS/ WK

27 27

Page 14

Second ec ond Semester Semester C OURSE CODE

TOTAL UNITS

LEC UNITS

LAB UNITS

IS50 IS501 1 IS30 IS304 4 IS40 IS402 2 IS40 IS403 3 G E305 305 G E403 E403

3 3 3 3 3 3

3 3 3 3 3 3

0 0 0 0 0 0

TOTAL

18

18

0

BSIS TOTALS

161

147

14


C a p stone ton e Projec t IS Ele Ele c tive 4 Fre Fre e Elec Elec tive 2 Fre Fre e Elec Elec tive 3 Soc ial Sc ience ienc e 5 Humaniti Huma nitie es 3

Sect ec tion 10. 10.



TOTAL HRS/ WK

IS50 IS500 0 None No ne None No ne None No ne None No ne None No ne

18

Thesis/ c apstone projec t

Thes Thesiis is a requi eq uirrement for the BSC S pr p rogr og ram. C ontents ontents must must be focus foc uss sed on the the theories and concepts of computing and it should be in the form of scientific work that may be presented in a public forum. C a p stone p rojec oje c t is req uired uired for the BSIT BSIT a nd BSIS p ro grams gra ms.. It should should b e in the for fo rm of a systems ystems a ppli pp lic c a tion tion or an a n enter e nterpri pris se resource esource plan. pla n. Interns nshi hip/ p/ O J T/ Pra Pra c tic tic um is Sect ec tion 11. 11. Interns ernship/O hip/ On-then-the-jobjob-ttraining/P aining/ Pract ac ticum icum.. Inter an immersion program wherein the students will have the chance and opportunity to be b e with the IT indus indu stry. try. This p ro g ra m is is impor impo rtant ta nt bec be c a use use the stud stude e nts will have ha ve the chance to apply the skills, knowledge and attitude learned in the school and at the sa sa me time time the op por po rtunit tunity y to to ex e xper pe rience ienc e the c orpor orpo ra te environment. environment. Lea rning ning expectations in the IT related field should be established between the HEI and the industry in the form of a Memorandum of Agreement (MOA) or Memorandum of Unde Unde rstandin tand ing g (MO U). Internship Internship is a re q uire uire ment me nt for fo r the BSIT BSIT a nd BSIS p ro g ra m but b ut op o p tiona l for the BSC BSC S program. Students are eligible to enrol the internship program after completing the 80% 80% o f the tota to tall number numbe r o f units in the the c urri urric c ulum. T ulum. The he mini minimum mum numbe numberr of inter interns nshi hip p hour ho urs s for fo r the the BSIT a nd BSIS p ro g ra ms a re 486 486 and a nd 162 162 for the BSC S p ro g ra m.

ARTICL IC LE VI C OURSE SPECIF ECIFIC ICA ATIONS IONS

Sec tion 12.

• • •

3 3 3 3 3 3

All courses for the three (3) programs should have the following components:

C ours ourse na me Course Description Course objectives

Page 15

• • • • • • •

Number Numbe r of units units for lec lec ture ture a nd la bor bo ra tory tory Number of contact hours per week Prerequisites Course outline Laboratory Equipment Tex Texts ts a nd Refer Referenc enc es

A nnex nne x A contains the course specification for the three (3) ITE programs (core and p ro fessiona fessionall c o urs urses).

ARTICL IC LE VII OTHER REQ REQUIREMEN UIREMENT TS Sec tion 13.

Administration

13.1 13.1

Co C o mpos mpo sition ition A we well ll-orga -organi niz zed and c ompetent omp etent staff a nd fac ulty ulty shall ha ll administer the implementation of an ITE program and should meet the req uireme uirements nts set by the C ommiss ommission.

13.2 13.2

A Hig Hig her he r Ed uc a tion Ins Instit titution ution (HE (HEI) o ffer ffe ring an a n ITE p rogr rog ra m shall ha ll have ha ve a fulltime time a d minis ministr tra a tor that wil w illl ad a d minis minister the pr p ro gram. gra m. This This a d minis ministra tra tor ca c a n be be a Dean, Department Head, Director, Coordinator or equivalent depending o n the or o rg a niza niza tio tio nal na l str struc uctur ture e o f the HEI. HEI. 13.2 13.2.1 .1 For one (1) (1) progr prog ra m offer offe ring, the pr p ro gram gra m ad a d minis ministra tra tor may als a lso o serve as the program head for the specific program being offered. For two (2) or more program offerings, there should be one program head for ea c h prog progrra m offered offered . If the prog progrra ms offered a re under unde r a lar la rger ge r unit unit like a college, an administrator, who maybe one of the program heads, is still required. 13.2.2 There should be three (3) full-time ITE faculty members per program offered offered,, one of o f whom whom ca c a n be the the progra progra m hea hea d. A full full-ti -time fac ulty ulty should render at least twenty-four (24) hours in residence per week and have a mini minimum mum cont co ntrrac t of one o ne (1) yea yea r in the the c olleg ollege/ e/ depa de pa rtment. tment. 13.2.3 13.2.3 The d e p a rtment tmen t must also also e nsure nsure tha t six sixty ty pe p e rce rc e nt 60% 60% o f a ll IT ITE c ourses ourses in ea c h program a re ha ndled by a fullfull-ti time me fac fa c ulty ulty membe rs. 13.2.4 13.2.4 At A t lea st twenty twe nty pe p e rc e nt (20% (20%) of o f the ITE fac ulty must must have ha ve IT industry industry exper expe rienc e wit w ithin hin the last 5 year yea rs. Industr Industry y exp exp erience erienc e ma y be full-time full-time work or part-time consultancies in an IT Industry as evidenced by a contract, certification or MOA/MOU. The involvements are in the form of technical administration, systems design, applications programming, research, project management or equivalent. 13.2.5 13.2.5 A t leas lea st six sixty ty perc pe rce e nt (60% (60%) of o f the ITE fac ulty membe memb e rs must must have ha ve c ompleted omp leted a minimum minimum of eightee e ighteen n (18) (18) units o f mas ma ster’s study study in ITE or

Page 16

thre thre e (3) yea rs o f IT-related -rela ted industry industry exper expe rienc e withi w ithin n the las la st five five (5) years. 13.2.6 At least 30% of the faculty members handling ITE courses must have master’s degrees in each program offered by the department. 13.3

G ener ene ra l Q uali ua lifi fic c a tions tions of the Dea n possess any one of the following:

The The Dean Dea n of a n ITE progra progra m must must

13.3.1 13.3.1 M a ster’s d e g re e in an a n ITE p ro g ra m, at a t le le a st three three (3) yea rs o f IT IT work/consultancy experience, and at least three (3) years of ITE teac hing hing ex e xper pe rienc e beyond be yond c omputer litera tera c y both of which must must be within the last five (5) years. 13.3 13.3.2 .2 A ma ster’s d eg ree in a n IT ITE a llied llied p ro gram gra m plus a t lea lea st one o f the following: 13.3. 13.3.2. 2.1 1

C ompleti omp letio o n o f c ourse ourse wor wo rk req uireme uirements nts for a mas ma ster's ter's d egr eg ree in any ITE ITE pro pro grams gra ms;;

13.3.2 13.3.2.2 .2

Five Five (5) yea rs expe exp e rienc e in systems ystems d e sign, a p p lic lic a tions programming, IT project management, or information technology research within the last eight (8)years;

13.3 13.3.3 .3 Do c torate in an a n ITE prog progrra m and a nd a t leas lea st three three (3) yea yea rs o f IT work/consultancy experience within the least five (5) years. 13.3.4 Doctorate in an ITE allied program, at least three (3) years of wor wo rk/c k/ c onsultanc onsultanc y exper expe rienc e, at a t leas lea st five five (5) yea rs of ITE teac tea c hing experience beyond computer literacy both of which must be within the last five (5) years. 13.4

Gener eneral Qualif Qualific ica ations of the Pr Progr ogram Head ead

13.4. 13.4.1 1 Ba Ba c helor helo r o f Sc Sc ienc e in Comp C omputer uter Sc ienc e (BSC (BSC S) - The hea he a d of o f BS BSC S program should posses any of the following qualifications: 13.4.1 13.4.1.1 .1

A mas ma ster’s d e gree gre e in C S;

13.4. 13.4.1.2 1.2

A mas ma ster’s d egr eg ree in IT or IS IS p rovide ovid e d that tha t his b a c helor helo r’ s degree de gree is in C S;

13.4 13.4.1. .1.3 3

A mas ma ster’s d e gree in a n ITE a llied llied pr p ro gram gra m p lus a t leas lea st one of the fol fo llowing: 13.4 13.4.1. .1.3. 3.1 1

C o mpleti mple tion on of co urs ursew ewo o rk req uireme uirements nts for a master' master's s degree de gree in Comp C omputer uter Sc ience; ienc e;

Page 17

13.4.1 13.4.1.3.2 .3.2

13.4. 13.4.1. 1.4 4

Five Five (5) year yea rs e xp e rie rie nc e in sys systems tems d e sign, applications programming, IT project management, or computer science research within the last eight (8) years.

A do d o c torate in an ITE a llied llied p rogr og ra m plus five (5) (5) yea yea rs experience teaching ITE (beyond computer literacy courses) within the last eight (8) years.

13.4 13.4.2 .2 Ba c helor helo r of Sc Sc ienc e in Information Information Te Te c hnology hnolo gy (BS (BSIT) Ba c helor he lor o f Sc ienc e in Information Informa tion Sys System tem (BS (BSIS) IS) the hea d should p osses osses any of the follow followin ing g qua lifi lific c a tions tions:: 13.4.2 13.4.2.1 .1

A mas ma ster’s d e gree gre e in a ny ITE p ro g ra m;

13.4 13.4.2. .2.2 2

A mas ma ster’s d e gree in a n ITE a llied llied pr p ro gram gra m p lus a t leas lea st one of the fol fo llowing:

13.4. 13.4.2. 2.3 3

13.5 13.5

13.4 13.4.2. .2.2. 2.1 1

C o mpleti mple tion on of co urs ursew ewo o rk req uireme uirements nts for a mas ma ster's ter's d egr eg re e in any a ny of the ITE ITE progr prog ra ms; ms;

13.4.2 13.4.2.2.2 .2.2

Five Five (5) year yea rs e xp e rie rie nc e in sys systems tems d e sign, applications programming, IT project management, or information technology resear esea rc h wit w ithin hin the las la st eight e ight (8) year yea rs;

A do d o c torate in an ITE a llied llied p rogr og ra m plus five (5) (5) yea yea rs experience teaching ITE courses (beyond computer literacy c o urs urse s) within the the las la st eight eig ht (8) ye ye a rs.

G ener ene ra l Func Functi tio o ns a nd Respo Respons nsibil ibilit ities ies of the Dea n - The general functions and/or responsibilities of the Dean should b e a s fo fo llo llo ws, thus thus:: 13.5.1 13.5.1 To a ssist ist in the the for fo rmulation mula tion of o f instit institutiona utiona l poli po lic c ies; 13.5.2 .5.2 To ex e xercise ercise overall o verall super upe rvis vision of all a c a demi de mic c a nd non-a c a demi de mic c per pe rsonnel onne l of the IT c ollege or depa de pa rtment; tment; 13.5 13.5.3 .3 To co c o ordinate ordina te with with the o ffic ffic e co c o ncerned nc erned with student tude nt servic ervic es; 13.5.4 .5.4 To enc e ncourag ourage e resea resea rc h and extens extension ion ac tivi tiviti ties es a mong fa c ulty ulty a nd students; 13.5.5 .5.5 To overs o versee ee the formation, formation, implementa implementati tion on and a nd eva e valu lua a tion tion of o f plans a nd programs for development and the supervision/coordination of activities and services for the advancement of goals and objectives of the ITE program;

Page 18

13.5.6 .5.6 To help he lp enfor enfo rc e the c onc erned HEI HEI’s rul rules es and the laws affec ting ting education, and the procedures, policies, rules and regulations promulga promulga ted under unde r a uthori uthority ty of or o r a s a do pted by the C ommiss ommission a nd/ or the HEI; HEI; 13.6 13.6

G ener ene ra l Functi unc tions ons a nd Respo Respons nsibil ibilit ities ies o f the Pro Pro gram gra m Head Hea d - The general functions and/or responsibilities of the Program Head should be as follows: 13.6.1 To exercise educational leadership among the concerned faculty members memb ers b y: 13.6.1 .6.1.1 .1

rec ommend ing ing fac ulty ulty a nd staff develop de velopment ment programs; programs;

13.6.1 .6.1.2 .2

prepa ring ing and a nd assigni assigning ng the the tea tea c hing hing loa loa d of the the fac ulty ulty members and directing them to advise students in their progr prog ra m of o f studies studies;; and

13.6.1 .6.1.3 .3

eva lua lua ting ting a nd rec ommend ing ing the a ppointm pp ointment, ent, promotion, retirement, termination of and disciplinary actions against faculty members and non-teaching personnel, subject to the HEI’s policies and procedures;

13.6 13.6.2 .2 To undertake und ertake pe riodic iod ic cur c urrriculum ic ulum review, eview , revision, evision, and d evelop eve lopment ment with the assistance of the faculty members in the degree program concerned; and 13.6 13.6.3 .3 To p rep a re c o urs urse offer offe rings, ings, insti institut tute e method metho d o logies log ies o f instr instruc ucti tion, on, adopt proper textbooks and recommend books to add to the c ollec ollec tion tion of the library library.. Sec tion 14.

14.1

ITE fac fa c ulty ulty should ho uld pos po sses the following qua q uali lifica fica tions: tions: ITE Fac ulty. ulty. - A n IT

Qualifica ualifications.

14.1. 14.1.1 1 A ba b a c c a laurea te de gree in any IT ITE o r its its a llied llied pr p ro grams gra ms.. 14.1.2 .1.2 A b a c c a laurea laurea te deg d egrree in a field other o ther than ITE or its its a llied lied programs plus a ny of the follow followin ing: g: 14.1. 14.1.2. 2.1 1 c o mpleti mple tio o n of c o urs urse wor wo rk rre e quireme quirements nts for a ma ster's ter's d egr eg re e in any of the ITE programs; 14.1.2 14.1.2.2 .2 a t le le a st thre thre e (3) yea rs e xp e rienc e in the IT p ro fes fe ssion suc suc h as as technical administration, systems design, applications p ro gramming gra mming or o r eq uivalent within within the las la st 5 ye ye a rs. 14.1 14.1.2. .2.3 3 p ro ficienc ficie ncy y in in teac tea c hing IT ITE c o urs urse s a s p ro ven by b y a c ertifica ertifica tion tion issued by a certifying body such as the Philippine National IT Standards (PhilNITS), Brainbench, Oracle or Microsoft etc., provided that the teaching load assigned to him/her is aligned with the area of the certification.

Page 19

14.1. 14.1.3 3 A mas ma ster’s d egr eg ree in an ITE ITE p rogr og ra m. 14.1.4 A master’s degree in an ITE allied program plus at least one of the following: 14.1. 14.1.4.1 4.1 O ne (1) (1) IT related ela ted resear esea rc h pub p ubli lis shed a nd presented in national or international conference. The IT related research should c ontribute ontribute to the field o f IT a nd not in soc soc ial sc sc ience. ienc e. 14.1.4 14.1.4.2 .2 Three (3) yea ye a rs exper expe rienc e in the IT p ro fes fe ssion such uc h a s technical administration, systems design, applications p ro gramming gra mming or o r eq uivalent within within the las la st 5 ye ye a rs. 14.1. 14.1.4.3 4.3 Proficienc Profic ienc y in in teac tea c hing IT ITE c o urs urse s a s p roven ove n by a c ertifica ertifica tion tion iss issued b y a c ertifyi ertifying ng bo b o d y suc such h as a s J ITSE or Mic rosoft etc ., provided that the teaching load assigned is aligned with the area of the certification. 14.1. 14.1.5 5 A do d o c torate in an ITE progr prog ra m. 14.1.6 A doctorate in an ITE allied program plus five (5) years experience teaching ITE courses beyond computer literacy courses within the last eight (8) years.

14.2

Load.

14.2.1 Assignment. - The regular regula r load loa d of o f an ITE fac fa c ulty ulty member memb er is is twenty twe nty-four -four (24) contact hours per week inclusive of lecture and laboratory. Overload should not exceed six (6) hours. There should not be more than four (4) preparations per term. 14.2.2 Teac g enerra l rule, ule, in in c a se the the Dea n has ha s to tea tea c h, his his eac hing hing Load. - As a gene or her teaching load should not exceed nine (9) contact hours per week. we ek. This load loa d takes ta kes into into c onsid onsid erati era tion on the functi func tions ons o f the the Dea De a n. Fo Fo r the the depa de pa rtment tment c hair, hair, his his/ her tea tea c hing hing loa d should hould not exc exc ee eed d twelve twelve (12) contact hours. 14.3

Employment Status. - Full-time regular faculty is defined as a faculty member receiving monthly compensation throughout the year inclusive of all other employment incentives and benefits as mandated by the Labor Code. They should render at least twenty-four (24) hours in residence per week in the college/department.

14.4

Fac ulty ulty Support upport

Page 20

14.4.1 Fac ulty Develop ollege/ e/ depa de pa rtment should Development ment Progr ogram. - The c olleg have ha ve a writ written ten c ompr omp rehens ehe nsiv ive e fac ulty ulty develop de velopment ment program. There shall be a specific budget allocation to implement such program. HEIs are enjoined to send full-time ITE faculty members to participate in various activities of professional organizations like Philippine Society of I.T. Educ a tors (PSIT (PSITE), C o mputing Soc iety of the Phil P hilipp ippines ines (CS (C SP), Phili Philipp ppin ine e C omputer omp uter Soc iety (PCS (PC S), etc. etc . and a nd to a ttend ttend in va va rious profess professional iona l develop de velopment ment progr prog ra ms in his/ his/ her field field a s we welll as gradua grad uate te studies in ITE. 14.4.2 Fac ilities. The HE HEI should ho uld p ro vide office offic e sp sp a c e , c o mputer mpute rs with Internet Internet c onnec onne c tions tions a nd pr p rinters inters for fa fa c ulty ulty and a d minis ministra tra tors. tors. Consul C onsultation tation areas for students are also required.

ulty members memb ers handli ha ndling ng general ge neral Sect ec tion 15. 15. Gener eneral Educa duc ation Fac ulty. - A ll fac ulty education subjects must have appropriate master’s degree or higher degrees in their respective teaching assignments.

Sec tion 16.

16.1

Library

HEIs o ffer ffe ring ITE should ho uld have ha ve at a t lea st o ne (1) full-ti full-time me lice lic e nse nse d Librarian(s). - HEIs lib lib ra rian. The The lib lib ra rian(s) ian(s) sha shall ll p a rtic tic ipate ipa te in fac fa c ulty ulty meeti mee tings ngs and a c tivit tivities ies and serve as (a) member(s) of the educational program planning committee. The The librari ibrarian(s an(s)) should hould work c losely osely with with the the Dean Dea n or Depa rtment tment C hair in c ollec ollec tion tion d evel eve lop ment for the the ITE ITE prog progrra m. The The librari brarian(s) an(s) should hould be enc oura oura ged ge d to join rec ogni og niz zed libra ibra ria n soc ieties ieties a nd a ssoc iations iations for profe profes ssional deve d evellop ment.

16.2

library c ollec tio tio n of the the HEI HEI should mee t the fo fo llo llo wing Book Collect ollection. ion. - The library re quire quire ments, ments, namely: na mely: 16.2 16.2.1 .1 To supp supp o rt HEI’s HEI’s c urr urricular ic ular need nee d s a nd to pr p ro vide enoug e noug h boo bo o ks for students, its library should have at least five (5) titles per professional c ourse ourse and one (1) (1) volume per pe r c ourse ourse of a pa rtic tic ula ula r year yea r of the the c urr urriculum ic ulum for ever eve ry ten (10) (10) stude students nts enrolled in tha thatt yea r. At A t leas lea st twenty percent (20%) of the books should have been published within the last four (4) years. Book holdings should preferably include more reference books and textbooks rather than vendor specific technology books. 16.2.2 16.2.2 Fo Fo r initia initiall offer offe ring, the minimum volumes volume s o f IT b o o ks c o ver ve ring first first to third year courses are required to be found in the Library. For program recognition, an HEI should have the required number of books in all four-year four-yea r levels. levels. 16.2.3 The library should include significant holdings of up-to-date computer magazines, journals and periodicals that are published locally and inte inte rnati na tio o nall na lly. y. This include includ e s a t lea lea st two two (2) (2) publi pub lic c a tio tio ns p er progr prog ra m.

Page 21

The The HE HEI should hould have c urr urrent subsc ubsc ription ption to to the the journals journals a nd maga mag a zines. nes. Paid Pa id onli o nline ne / digit dig ita a l subsc subscrriptions to a t leas lea st twenty (20) (20) journal titl titles es are allowed as substitute for journals and magazines provided that they can be readily accessed and printed by faculty, students and staff. 16.2.4 16.2.4 The lib lib ra ry must must pr p ro vide stude tud e nts with a c c e ss to to manua ma nuals ls for fo r programming languages and computer systems, as well as documentation materials related to the development and use of systems that were purchased by the HEIs. 16.2.5 16.2.5 The lib lib rary must must provide provid e Inter Inte rnet ne t te te rminals mina ls to all a llo o w fa c ulty memb me mbe e rs and students to undertake research and other academic activities. 16.2.6 The library must provide access (with capability to read or print) to elec tronic tronic library library mater mate rials such uc h as a s C D-RO D-RO M s a nd elec tronic tronic subscriptions. These are considered as additional library holdings beyond the minimum requirements. 16.3

The library brary should hould have a sea ting ting c ap a c ity of a t Spac pac e Requir equirement ements. - The least five percent (5%) of the total students enrolled.

Sect ec tion 17. 17.

Fac ilities and Equipment. Equipment.

17.1

should a t leas lea st be 1.2 1.2 squa re C lassroo oom m Requir equirement ements. C la ssroo m spa c e should meter mete rs p er stude student. nt. Fo Fo r a c lass lass size ize o f 40 stude students nts,, the ro om should ho uld b e a t leas lea st 48 sq uare ua re meter mete rs; for 50 stude tud e nts, nts, 60 60 sq uar ua re meters me ters.. It should ho uld be b e we w e ll lig lig hted and well ventilated and/or air-conditioned. The classroom should preferably have ha ve two exi exit doors do ors op ening outwards. outwards. There should should be a t leas lea st one c lassr lassroo m pe p e r one hundred thir thirty-five ty-five (135) (135) stude students nts e nrolled nrolled.. The The max ma ximum imum c las la ss size ize should ho uld b e fifty (50) (50) stud stude e nts o nly.

17.2

The HEI HEI must must p ro vide for network netw orke e d c o mputer mpute r Laboratory Requirements. laboratories required for hands on training of the students. T students. The he la la bor bo ra tory tory floo floorr space should be at least 2.0 square meters per student. For the computer laboratory, there should be a ratio of one (1) student per terminal or wor wo rkstation. kstation. The number numb er of termina terminals ls o r wor wo rksta kstati tio o ns should ho uld be b e such that tha t a student is provided at least nine (9) hours of individual hands-on computer time time per p er week. O n the the ba b a sis that eac ea c h comp c omputer uter termi termina nall or work work station tation operates effectively at least ten (10) hours a day and five (5) days a week, the c omputer omp uter time time requireme requirement nt should should tra tra nslate nslate to a t lea lea st one c omputer omp uter per pe r ten (10) (10) stude students nts enrolled in the ITE ITE progr prog ra m, the c omputers omp uters be ing ex e xc lusively lusively for the their ir use use . A lab la b oratory ora tory a ssistant, istant, whom who m at a t lea lea st a junior junior IT IT student tude nt and not a ssisti isting ng a c lass o f the same o r higher highe r yea yea r leve levell is is req uire uire d for lab oratory ora tory class c lass with mor mo re than tha n thirty thirty (30) (30) stud stude e nts. nts. Networked laboratory must have one printer for every 15 computer units or be connected to at least one (1) high speed printer (at least 30 pages per minute) for students’ access.

Page 22

For initial offerings, the HEI should have at least two laboratories with 15 workstations each. One of the laboratories should be dedicated for the use of the IT department. 17.3

The The requi eq uirred c omputer hardwar hardwa re a nd software Laboratory Equipment. should be able to respond to the objectives of the courses in the curriculum. They They should hould c onform onform to gener ge nera a lly a c c epted ep ted industr ndustry y standa rds a nd be capable of providing training in multiple platforms. At least thirty percent (30%) of the equipment should have been manufactured within the last three (3) years.

17.4

- As a gene ra l rule, the HEI HEI should p ro vide the Audio Audio Visua Visual Fac ilities. nec ess essa ry audio-vis a udio-visual ual equipme e quipment nt in in supp support ort of the tea c hing-lea hing-learrning ning proc ess ess, such uc h as a s over ove rhea d p rojec tors tors, LC LC D projec tors tors, etc. etc .

ARTICL IC LE VIII VIII TRANSITORY, REPEAL EALING ING AND EFFEC TIVIT IVITY CLAUS C LAUSE Sec tion 18. Transitory C lause. lause. HEIs that have been granted permit or recognition are hereby given three (3) years from the date of effectivity hereof to fully comply with with all the req requi uirrements eme nts a s stipula tipulated ted in this this C M O . C ompl omp lianc e to thes these e re quireme quirements nts shall ha ll a lso lso b e req uired uired to State State Univers Universit ities ies a nd C olleges olleg es (SUC (SUCs s) and a nd Loca Loc a l Co C o lleg lleges es and Univers Universit ities ies (LC (LC Us). Us). In the the event e vent that tha t the the HEI HEI fails to c o mply, it it is is given a non-extendable period of two (2) years to comply.

C urr urrently ently enroll enrolled ed students in the the pr p rogr og ra m shall shall be a llow llowed ed to gr g ra dua te under und er the the o ld c urr urriculum. ic ulum. Howe ver, stude students nts enrolling enrolling for the the ITE ITE p rogr og ra ms b eginni eg inning ng scho o l yea r 2007 2007-20 -2008 08 shall ha ll b e c over ove re d b y this this C M O . ling C lause lause . All p ertine ertinent nt rules a nd regulations reg ulations o r p a rts thereof thereo f Sec tion 19. Repe a ling that are inconsistent with the provisions of theses policies and standards are hereby repea ep ea led or mod modiified fied a c c ordingl ordingly. y. tively C lause. This This C M O shall ha ll b e effec effe c tive tive b eginni eg inning ng SY 2007 2007-20 -2008 08 Sec tion 20. Effec tively after publication in the Official Gazette or in a newspaper of general circulation.

Pas Pa sig C ity, ity, Phili Philipp pp ines, ines, ____________________ ____________ ________

FOR THE C O M M ISS ISSION: IO N:

C ARLITO S. PUNO Chairman

Page 23

A nnex nne x A course specification for the three (3) ITE programs (core and professional c o urs urse s). Ba c helor of Sc Sc ience ienc e in Comp C omputer uter Sc ience ienc e (BSC S) Prog Progrra m

C O URSE NUMBER: C S101 TITLE: C S Fundame Fundame nt ntals als •

C O URSE RSE DESC RIPTIO RIPTIO N

Thi This s c ours ourse pr p rovides a n overvi overview ew o f co mputers mputers,, number number sys systems tems,, data da ta type types s a nd representations, digital logic systems, assembly and machine language, c o mpilers a nd tra tra nslato nslatorrs, op erati era ting ng systems ystems,, and a nd internetwo internetwo rking. king. •

C O URSE RSE OBJ EC TIV ES (DESIRA (DESIRA BLE BLE OBJ EC TIV ES) ES)

At the end e nd o f this this c ourse, ourse, the stude student nt should should be b e a ble to: to : 1. identify identify the bas ba sic c ompone omp onents nts of a c omputer omp uter system ystem 2. know the arithmeti arithmetic c o pe ra tio tio ns o n numbe numberr systems ystems 3. under unde rstand how ho w different different da ta type types s a re rep reprresented esented 4. unde rstand the ba b a sics ic s of digit dig ita a l logic log ic sys systems tems 5. identi ide ntify fy the different levels o f p rogr og ra mming mming 6. know the functi func tio o ns of an op erati era ting ng sys system tem 7. know conc c onc epts ep ts of data c ommuni ommunic a tion, tion, network network c omponents ompo nents and p ro toc o ls, ls, the Internet iss issues ue s •

C O URSE O UTLIN E A ND TIM EFRA EFRA ME TOPICS PICS AND READINGS EADING S 1. Histo Historry o f Co C o mputers mp uters 2. C omputer omp uter Hardw Hardwa a re 3. C omput omp uter er Softwar oftwa re 4. Introduction to Number Systems Numbe Numb e r Sys System tem C o nversion nversion Numbe Numb e r System ystem O p erati era tio o ns Fixed-Point Number Representation Floating-Point Number Representation 5. Digital Dig ital Logic Log ic Systems ystems Logi og ic O per pe rations a nd G a tes Boolean Functions C a nonic nonic a l and Standa rd Forms orms Boolea oo lean n Algeb A lgebrra Theor heo rems and Prop Propert erties ies Simplification of Boolean Functions Flip-flo Flip-flop p s, C o unter unte rs, Regis Reg isters ters,, PLAs PLA s 6. C ontroll ontrollin ing g the C omput omp uter er Assembly and Machine Language C o mpil mp ile e rs a nd Tr Tra nsla nslators tors Programming Languages Operating Systems 7. Overview of Internetworking

DATE

• • • •

• • • • • •

• • • •

Page 24

• • •

Networ Netwo rking: king: Co mputer C onnec onne c tions tions Internet: Internet: A Resource for All A ll of Us Sec urit urity y and a nd Priv Priva a c y: Comp C omputer uters s a nd the Internet Internet

Page 25

COURSE NUMBER: CS102

TITLE: C omput omputer er Prog Prog ramm ramming ing 1 C O URSE RSE DESC RIPTIO RIPTIO N

•

Thi This s c ours ourse intr introd oduce uce s the the stu stude dent nts s to the the funda fundament mentals als of log logiic for fo rmula mula tion tion toge tog e ther with their implementation impleme ntation in in the C p rogr og ra mming la la ngua ge . This c o urs urse should serve serve as a s a founda found a tion tion for fo r students in the the C omputer omp uter Sc ience ienc e progr prog ra m.


•

A t the end en d of this this c ourse ours e , the the stude s tudent nt should sho uld be a ble to: 1 2 3 4 5 6 7

Lear Lea rn the c o mponents mpo nents in p ro b lem solving Exp lore lore the str stra a tegies teg ies in p rob lem solving in relati ela tion on to proc ed ura ura l programming Ana An a lyz lyze p ro b lems Design Design algor algo rithms ithms to so lve problems prob lems Implement a lgorithm lgorithms s in a programming programming langua ge Te st p ro g ra mming so lutio lutio ns to p ro b lems A p p ly rec urs ursion a s a programming progra mming so lution lution

C O URSE O UTLIN E A ND TIM EFRA EFRA ME

•

1. 2. 3. 4.

TOPICS PICS AND READINGS EADING S Steps tep s in Prog Progrra m Planning Planning and a nd Developme Deve lopment nt His History/ tory/ Princ Principles iples of the the (Pro (Pro grammi gra mming ng La La ngua ge used used ) Expressions Ba sic Progr Prog ra m Struc truc ture ture Var Va ria ble Dec De c la ra tion tion A ssignment ignme nt Sta Sta tement teme nt Input/Output Statements Using Using C ond itiona itionall C o nstr nstruc ucts ts Single Se Se lecti lec tio o n C onstr onstruct uc t Multiple Selection Construct Using Using Loop Loo p ing C onstr onstructs uc ts Event-Contr vent-C ontroll olled ed Loop oo p C onstr onstruc uctt C ount-C ount-Contr ontroll olled ed Loop oo p C onstr onstruct uct Using Using Function Func tions s C onc epts ep ts a nd Rules Rules Functions and Parameter Passing Re Re c ursion ursion

DATE

• • •

5.

• •

6.

• •

7.

• •

8.

Page 26

C O URSE NUMBER: C S103 TITLE: C omput omputer er Prog Prog ramm ramming ing 2 •


Thi This s is a n adva nced nc ed c ours ourse for c omputer progra progra mmi mming in in C. It c overs the the da ta struc truc ture ture s like like ar a rra y, lis list, t, and a nd file file . This This c o urse urse a lso lso should ho uld serve a s a found fo unda a tion for fo r stud tud ents in the the C omputer omp uter Sc ience ienc e program.

•


A t the end en d of this this c ourse ours e , the the stude s tudent nt should sho uld be a ble to: omp onents nts in prob prob lem solving olving 1. Lea rn the c ompone 2. Explore the strategies in problem solving in relation to procedural programming Ana lyz lyze probl prob lems Design Design a lgor lgo rithms ithms to so lve pr p ro blems ble ms Implement a lgorithm lgorithms s in a p rogr og ra mming mming langua la nguage ge Tes Testt progra progra mmi mming solut solutiions to prob probllems Understand various concepts of data structures

3. 4. 5. 6. 7.

•

C O URSE O UTLIN E A ND TIM EFRA EFRA ME TOPICS PICS AND READINGS EADING S

DATE

1. Arrays One-Dimensional Array Sorting and Searching in an Array Two-Dim Two-Dimens ensiional ona l Arra Arra y 2. Strings 3. Struc Struc tures Struc tructur ture e Within Within a Struc tructur ture e A rra y Within Within a Struc tructur ture e 4. Pointers C oncept onc ept of Heap , Stac Stack ks, and Memory Ma nage ment Pointers Po inters Within Within a Struc truc ture ture 5. File File Struc truc tures Tex Textt File Non-Text File • • •

• •

• •

• •

Page 27

C O URSE NUMBER: C S104 TI TLE : Disc rete Struc Structtures 1 C O URSE RSE DESC RIPTIO RIPTIO N

•

Thi This s c ours ourse int intrroduce od uces s the the foundati founda tions ons of disc disc rete mathematic mathematic s a s they they app ly to c omputer omp uter sc ience. ienc e. Top ics inc inc lude functions, functions, rela relati tions ons a nd sets sets,, ba sic logic, log ic, proof proo f techniques, basics of counting and introduction to digital logic and digital systems.


•

A t the end en d of the the c ourse ours e , the student stude nt must be able a ble to: 1. 2. 3. 4.

•

Perform ope op e rations rations assoc assoc iated w ith ith ssets, ets, func tions tions and re lations A pp ly forma l me thod s of symb olic p rep ositiona l a nd p red re d ic a te log log ic D iscuss isc uss w hic h kind of o f proo f is b e st for a g ive n prob pro b le m C ompute permutations permutations and c ombinations ombinations of sets sets

C O URSE O UTLIN E A ND TIM EFRA EFRA ME TOPICS PICS AND READING EADINGS 1. Functions, Func tions, Relations Rela tions a nd Se Se ts 2. Ba sic Logic Log ic Prop Proposi ositi tiona ona l Logic Logi og ic a l C onnec tives tives Tr Truth uth Tab les Nor No rmal ma l Fo Fo rms Validity Predicate Logic Univers Universa a l and a nd Existential istential Q uanti ua ntifica fica tio tio n Mo dus Ponens and M od us Tolens Limit imita a tions tions of Predica Pred ica te Logic Log ic

DATE

• • • • • • • • •

3. Pro Pro of Te c hniques hnique s 4. Ba sics ic s o f C ounting 5. Intr Intro d ucti uc tio o n to digital logic log ic and a nd digital digita l systems ystems

Page 28

C O URSE NUMBER: C S105 TITLE: C omput omputer er Org aniz anizat ation ion and A ssembl ssemblyy Lang Lang uag e •


Thi This s c ours ourse provide provides s an overview overview of the the ar a rc hitec hitectu turre and a nd orga orga niz niza tion tion of a c o mputer mpute r, how it is b uilt uilt.. It include inc ludes s a d isc isc uss ussion of the C PU, memor memo ry, I/O I/ O organi orga niz za tion tion a nd per pe ripherals. ipherals.

•


A t the end en d of this this c ourse ours e , the the stude s tudent nt should sho uld be a ble to: 1. Ide ntify ntify the the d ifferent ifferent hierarchic hierarchica a l view views s of a c omputer omp uter (gates (ga tes,, mic mic ropr op rogr og ra m, mac hine hine languag lang uage, e, a ssembly la la nguag e) Writ ite e c ode od e in as a ssembly emb ly langua ge 2. Wr 3. Know the different devices and components of a computer system and how these these c ompo nents nents work together

•

C O URSE O UTLIN E A ND TIM EFRA EFRA ME TOPICS PICS AND READINGS EADING S 1. Review: Review : Bina Binarry Numb e r Sys Systems tems 2. Review: Fixed and Floating Point Representation 3. Review: Logic Gates and Boolean Algebra (Simplification) omp uter System ystem (Von (Vo n Neumann Ne umann A rc hitec hitectur ture) e) 4. C omputer 5. CPU Single Bus A rc hitec ture ture i. O verview verview of A ssembly emb ly Pro Pro grammi gra mming ng ii. Microprogramming iii. iii. G a ting ting a nd C ontrol ontrol Sequenc eq uenc ing ing C o ntro ntro l Unit Unit Arithm Arithmetic etic a nd Logic og ic Unit i. A d d ition ition (Half, Full Full,, Fa st A d d er, C LA ) ii. ii. Subtra Subtra c tion tion iii. iii. M ultipli ultiplic c a tio tio n (Algo (Alg o rithmic ithmic)) iv. Division Division (Algo (A lgorrithmic ithmic ) 6. I/O Organization and Peripherals a . M a gneti gne tic c Disk Disk (Ha (Ha rd Dis Disk) b. Keyboard c . M o nito nito r (C RT) 7. Memory a . C a c he Memor Me mory y (L1 (L1, L2, c a c hing hing tec tec hniques hniques)) b . Virtual Virtual M emor emo ry c . M emor emo ry Interlea nterleavi ving ng La b: Assemb Assembly ly La ngua ge Prog Progrra mming mming

DATE

•

• •

Page 29

C O URSE NUMBER: C S106 TI TLE : PR PRO O FE FESSION SSION A L ET ETHIC HIC S C O URSE RSE DESC RIPTIO RIPTIO N

•

The The cour c ours se intr introd oduc uces es ethic ethic s a nd ethic ethic a l theo theorries; es; provide provides s disc disc uss ussions on the the ethica l dilemma dilemmas s a nd iss issues fa fa c ing ing IT prac titi titione onerrs. An a pp rec iation iation a nd d isc isc uss ussion of o f the C od e of Ethic Ethic s of I. T. T. Profe Profes ssionals iona ls;; cybe c yberrc rimes a nd a pp ropr op riate Philippine Philippine Laws are are a lso inclu inc lude de d.


•

At the end e nd o f the the ter te rm, the the stude students nts should be b e a ble to: to : Understand and appreciate the meaning of ethics, values and attitudes. Be guided in their ethical thinking and considerations as they relate in the cyberworld. Be a war wa re o f the different different ethica l dilemma dilemma// iss issues in the the c ybeworl ybew orld. d. Appreciate and internalize the code of conduct of an I. T. Professional. Be famil fa miliar iar with the var va rious Phili Philip p pine La ws tha thatt pena pe nali liz zes cybe c yberrc rimes. imes. • •

• • •

•

C O URSE O UTLIN E A ND TIM EFRA EFRA ME 1. Ethic thic s, values va lues a nd atti a ttitude tudes s. 2. The most most c o mmon ethic ethic a l theor theo ries. ies. 2.1 Anc ient G ree eek k – Pla Pla to 2.2 2.2 M ed ieval ieva l – Thoma s A q uinas 2.3 Immanue Imman uell Ka Kant nt 2.4 2.4 Ra Ra wl Theo Theo ry J usti ustic ce 2.5 Eg Eg o ism ism 2.6 Utilitari Utilitaria a nism 3. Ethic thic a l Dilemma Dilemma / iss issues in the cybe c yberrwor wo rld 3.1 Privacy Invasion 3.2 3.2 Ha Ha c king king 3.3 Se c urity 3.4 Theft 3.5 3.5 Co C o p yright yright Infringe Infringement ment 3.6 3.6 Unfair C o mpeti mpe titi tio on 3.7 Virus Virus 3.8 Tele/videoconferencing 3.9 O nli nline d efamation efa mation 3.10 3.10 Pira Pira c y 3.11 Fraud 4. Ethic thic s a nd Law 5. Ap plica ble Phil Philippine La La ws that pena pe nallize ize cybercri cyb ercrime me 1.1. 1.1. Intell Intelle e c tual Pro Pro p erty Right Right 1.2. .2. E-C E-Commerc ommerce e La w 1.3. .3. Op tic tic a l La La w 1.4. .4. Civ C ivil il C od e 1.5. .5. Revis Revised ed Pena l C ode od e 1.6. 1.6. Sp e c ial C rimina iminall La La w 1.7. .7. Unfair Unfair Comp C ompetit etition ion A c t

Page 30

1.8. 1.8. Internet Internet Por Po rnog ra phy ph y 2. G over ove rnment Agenc Ag enc ies Respo espo nsible nsible in in the the Implementa Implementati tion on of the Philippine I. T. Programs 2.1. .1. C ommiss ommission on o n Informati Information on a nd C ommunic ommunic a tion tion Tec Tec hnolog hnology y 2.2. 2.2. Nati Na tiona ona l Bur Burea ea u of o f Investi Investiga ga tion tion 2.3. .3. Depa Dep a rtment of J usti ustic ce

C O URSE NUMBER: C S201 TITLE: Data Structures C O URSE RSE DESC RIPTIO RIPTIO N

•

Thi This s c ours ourse intr introd oduc uces es the the stu stude dent nts s to the the design design and implement implementati ation on of bas ba sic a nd a dva nced nc ed da ta str structur uc tures. es. Topics op ics inc inclu lude de ba sic d a ta str structur uc tures, es, tree trees s, graphs grap hs a nd hashing. hashing.


•

A t the end en d of this this c ourse ours e , the the stude s tudent nt should sho uld be a ble to: 1. Choose, implement and evaluate the appropriate data structures for specific programming problems and

2. Use and manage memory effectively in data presentation.


•

1.

TOPICS PICS AND READINGS EADING S Ba sic Data Da ta Struc tructur ture es A rra rra ys Linked Lists Stac ta c ks Queues Trees Binary Bina ry Tree rees s Bina Binary ry Se a rch rc h Tree rees s AVL RB Trees Graphs Representations Se a rch rc h Algo A lgo rithms rithms (BFS (BFS, DFS) DFS) Shortest Path Problems Spanning Trees Sets Hashing

DATE

• • • •

2.

• • • •

3.

• • • •

4. 5.

Page 31

C O URSE NUMBER: C S202 TITLE: Desig n and Analysis of A lg orit orithms hms C O URSE RSE DESC RIPTIO RIPTIO N

•

A study on the design and analysis of algorithms, which introduces students to the techniques in basic algorithmic analysis, algorithmic strategies, sorting and sea rc hing, hing, gr g ra ph a lgorithm lgorithms s, and a nd geome ge ometr tric ic a lgor go rithms ithms..


•

A t the end en d of this this c ourse ours e , the the stude s tudent nt should sho uld be a ble to: 1. Design Design effec tive, tive, effic effic ient, elega eleg a nt, a nd rea rea da ble algori a lgorithm thms s for various various c lass lasses of c omputi omp uting ng p rob lems 2. Determin Determine e spa spa c e a nd time time c ompl omp lexity exity of a lgorithm lgorithms s Use var va rious a lgorithm lgorithm design design techni tec hnique ques s (divi (divide de a nd c onquer, onq uer, 3. Use ba c ktra tra c king, ing, gree greedy, dy, etc)


•

1.

TOPICS PICS AND READINGS EADING S M a thema tic tic a l Too ls in A naly na lys sis Proof Techniques Rec urr urrenc e Relation G ener ene ra ting ting Functi unc tions ons Ba sic A lgor lgo rithmic ithmic Ana lysis lysis a . Best, est, a verage, verag e, worst worst c a se beha be havi viors ors b. Time ime and Memo M emorry C omplex omp lexit ity y A lgor lgo rithmic ithmic Stra tra tegies teg ies Brute Force Forc e a lgor lgo rithms G ree eedy dy a lgorithm lgorithms s Divi Divide de-a -and-C nd-C onquer onq uer str stra a tegies Backtracking Branch-and-bound Heuri Heuris stics tic s Sorting and Searching Graph Algorithms G eo eometr metric ic Algor Algo rithms ithms NP-Completeness

DATE

• • •

2.

3.

• • • • • •

4. 5. 6. 7.

C O URSE NUMBER: C S203 TITLE: Pro rogg ram rammin mingg Lang uag es •


Page 32

Thi This s c ours ourse provide provides s stude tudent nts s the the funda fundament menta a l featu fea turres a nd conc c onc epts ep ts to diff differ erent ent programming languages. Topics include overview of programming languages, Intr Introd od ucti uc tion on to langua ge tra tra nslati nslation, on, type systems ystems,, da ta a nd executi exec ution on c ontrol, ontrol, dec de c lara lara tion tion a nd modula mo dularrity, ty, and synta ynta x a nd sema semanti ntic c s.


•

A t the end en d of this this c ourse ours e , the the stude s tudent nt should sho uld be a ble to: 1. Identify Identify featur fea tures es of imperative imperative languag lang uages, es, a nd their impleme implementati ntation on (inc (inclluding the use use of sta sta tic tic memory, memory, stac stac k and hea p for implementi implementing ng variables) Identify var va rious programming programming pa ra digms (func (functi tiona ona l, dec lara lara tive, tive, 2. Identify impe imperra tive, tive, objec o bjec t orient oriented ed), ), and their their impleme implementati ntations ons Desc ribe the d ifferent ifferent phas pha ses in in the la nguage ngua ge tra tra nslati nslation on proc ess. ess. 3. Desc


•

1.

TOPICS PICS AND READINGS EADING S O verview verview of Prog Progrra mming mming La nguage ngua ges s History of programming languages Overview of Programming paradigms (procedural, object-oriented, functional, declarative, scripting languages) Intr Introd od ucti uc tion on to to la la ngua ge tra tra nsl nsla tion tion C o mpa riso iso n of interpr interprete eterrs a nd c ompil omp ile e rs La nguage ngua ge tra tra nslati nslation on pha ses Type yp e Systems ystems Data Da ta a nd Exec ution ution C ontrol ontrol Dec lara lara tion tion a nd Mo dularity dularity Synta ynta x a nd Sema ntic ntic s O bjec t-Oriented t-Oriented Prog Progrra mming mming C onc urr urrent Prog Progrra mming mming La nguage ngua ges s Dec lara lara tive tive La nguage ngua ges s

DATE

• •

2.

• •

3. 4. 5. 6. 7. 8. 9.

C O URSE NUMBER: C S204 TITLE: A utoma utomata ta and Lang ua uagg e The Theory ory •


Thi This s c ours ourse int intrroduce od uce s the the formal formal model mode ls of computi c omputing ng and their their relation elation to to formal languages.

•


Page 33

A t the end en d of this this c ourse ours e , the the stude s tudent nt should sho uld be a ble to: Unde rstand the pr p rinc inc ipal ipa l mod mod els of c omputati omp utation on suc suc h as a s fini finite te automata a utomata,, 1. Unde pushdown automata and Turing machines. 2. Rec ogni og niz ze the the corr c orres espo ponde ndenc nce e of the the different different langua ge c lass lasses to the the model mode ls of c omputation. omputation.

•


DATE

1. Strings trings a nd Langua Lang uage ge s Se ts, ts, relations, rela tions, str strings ings and a nd string tring o p e ra tions O per pe ra tions tions on language langua ges s  

2. Finit Finite e State M a c hines   

Deter Dete rminis ministi tic c Finit Finite e A utoma ta Non-deterministic Finite Automata Regular Expressions

3. C ontext-fr ontext-free ee G ra mmar 4. Pushdo Pushdown wn Automa ta 5. Turing uring M a c hines

C O URSE NUMBER: C S205 TITL ITLE: M ode od e lling and Simulation Simulation •


Thi This s c ours ourse intr ntroduce od uce s the stude tudent nts s to model mode lling a nd simulation mulation c onc epts ep ts.. Topi op ic s discussed in the course includes, system analysis and classification., abstract and simulation models, continuous, discrete, and combined models, heterogeneous models. It also covers pseudorandom number generation and testing, queuing systems ystems,, Mo nte C a rlo method me thod,, and a nd c ontinuous simula imula tion. tion. Simul Simula a tion tion e xper pe riment control. •


A t the end en d of this this c ourse ours e , the the stude s tudent nt should sho uld be a ble to: Atta Atta in gener ge neriic lea rning ning out o utc c omes and c ompetence ompe tence s: 1. Under Unde rstand ta nd the p rinciples inc iples of simu simulation lation 2. Create simulation model of various types 3. 4. Verify, and validate simulation models.

•


Page 34

TOPICS PICS AND READINGS EADING S 1. Intr Intro d ucti uc tio o n to mode mo de lling lling a nd simul simula a tio tio n. 2. System ystem ana a nalys lysis is,, cla c las sific ific a tion of o f sys systems. tems. System ystem theo the o ry b a sics ic s, its its re lation la tion to simulation. imulatio n. 3. M odel od el c lass lassifica ifica tion: tion: c onc eptual, ep tual, a bstr bstra c t, a nd sim simul ula a tion tion models. Heterogeneous models. Methodology of model building. 4. Simula imula tio tio n systems ystems a nd langua lang uage ges s, mea ns for mod el a nd e xp e riment de d e sc ription. iptio n. Princ Principle iples s o f simulation simulation sys system tem design. 5. Par Pa ra llel llel proc ess mod elling. elling. Using Using Petri Petri nets a nd finite finite automata in simulation. 6. M od els o queuing q ueuing sys systems tems.. Dis Disc rete simulation simulation models mod els.. Model time, simulation experiment control. 7. C o ntinuous ntinuous systems ystems mod elling. elling. Ove rvie vie w of numeric numeric a l method metho d s used used for co c o ntinuous ntinuous simul simula a tio tio n. 8. C ombined omb ined simulation. simulation. The role of simul simula a tio tio n in in digital systems design. 9. Sp ec ial model mod el c lasses, lasses, models mod els of heterogene heterog eneo o us systems ystems.. 10. 10. Chec C hec king king mod mo d el vali va lidity, dity, verifica verifica tio tio n of mod els. els. Ana lys lysis o f simulation imula tion re sults. ults. 11. 11. Simulation Simulation re sults visua visuali lization zation.. Inter Inte ra c tive simula simulation, tion, virtua virtuall reality. 12. Design and control of simulation experiments. Model optimization. 13. Gene G enerra ting, ting, tra tra nsform nsforma a tion, tion, a nd testi testing ng of pseudor pseudo ra ndom ndo m numbers. numbers. Stoc Stoc has ha stic tic models mod els,, Monte Mo nte C a rlo method. method . 14. 14. Overvi O vervie e w o f c o mmonly used used simula imula tio tio n sys systems. tems.

DATE

C O URSE NUMBER: C S206 TITLE: Dig it ital al Desig n •


Thi This s c ours ourse provide provides s an overvi overview of the the pri principles underl underlying ying number number systems ystems,, logic ga tes, tes, Fix Fixed ed-Point -Point Rep Reprresenta esenta tion, tion, Boo Boo lea n Func Functi tion, on, Boolea n al a lgebra, ge bra, combinational and sequential logic circuits, flip-flops, registers, and PLAs.

•


A t the end en d of this this c ourse ours e , the the stude s tudent nt should sho uld be a ble to: 1. Identify building blocks of Von Neumann machine. Design sim simple ple c ombin omb ina a tiona tiona l and sequenti eq uentia a l cir c irc c uits uits.. 2. Design minimi miz za tion tion techni tec hnique ques s (Ka (Ka rnaugh na ugh ma ps) to to Boo lea n 3. Ap ply mini expressions.

Page 35


•

TOPICS PICS AND READINGS EADING S

1. 2. 3. 4.

DATE

Numb Numbe e r Syste ystems ms (Bina (Binary ry)) Fix Fixed -Point -Po int Repr Rep resentati esenta tion on (1’s (1’s a nd 2’s 2’s c o mplement) mple ment) Logi og ic G a tes Boolea oo lean n Functi unc tion on C a nonic nonic a l a nd Standa Standa rd Format Format Tr Truth uth Ta ble Bool oo lea n Algebr Algeb ra Simplifica implific a tio tio n using using Prope Prop e rties Simplification using K-Map C ombinati omb inationa ona l Logic og ic C irc irc uits uits Seq uential uentia l Logic Cir C irc c uits uits Flip Flip-flo -flop p s, regis reg iste ters rs,, PLAs PLA s • •

5.

• •

6. 7. 8.

C O URSE NUMBER: C S205 TITL ITLE: M ode od e lling and Simulation Simulation •


Thi This s cour c ours ses intr introd oduce uces s the the stude tudent nts s to to model mode lling a nd simul imulati ation on c onc epts ep ts.. Topi op ic s discussed in the course includes, system analysis and classification., abstract and simulation models, continuous, discrete, and combined models, heterogeneous models. It also covers pseudorandom number generation and testing, queuing systems ystems,, Mo nte C a rlo method me thod,, and a nd c ontinuous simula imula tion. tion. Simul Simula a tion tion e xper pe riment control. •


A t the end en d of this this c ourse ours e , the the stude s tudent nt should sho uld be a ble to: Atta Atta in gener ge neriic lea rning ning out o utc c omes and c ompetence ompe tence s: 1. Under Unde rstand ta nd the p rinciples inc iples of simu simulation lation 2. 3. Create simulation model of various types Verify, and validate simulation models. 4.

•

C O URSE O UTLIN E A ND TIM EFRA EFRA ME TOPICS PICS AND READINGS EADING S 1. Intr Intro d ucti uc tio o n to mode mo de lling lling a nd simul simula a tio tio n. 2. System ystem ana a nalys lysis is,, cla c las sific ific a tion of o f sys systems. tems. System ystem theo the o ry b a sics ic s, its its re lation la tion to simulation. imulatio n. 3. M odel od el c lass lassifica ifica tion: tion: c onc eptual, ep tual, a bstr bstra c t, a nd sim simul ula a tion tion models. Heterogeneous models. Methodology of model building.

DATE

Page 36

4. Simula imula tio tio n systems ystems a nd langua lang uage ges s, mea ns for mode mod e l a nd e xp e riment de d e sc ription. iptio n. Princ Principle iples s o f simulation simulation sys system tem design. 5. Par Pa ra llel llel proc ess mod elling. elling. Using Using Petri Petri nets a nd finite finite automata in simulation. 6. M od els o queuing q ueuing sys systems tems.. Dis Disc rete simulation simulation models mod els.. Model time, simulation experiment control. 7. C o ntinuous ntinuous systems ystems mod elling. elling. Ove rvie vie w of numeric numeric a l method metho d s used used for co c o ntinuous ntinuous simul simula a tio tio n. 8. C ombined omb ined simulation. simulation. The role of simul simula a tio tio n in in digital systems design. 9. Sp ec ial model mod el c lasses, lasses, models mod els of heterogene heterog eneo o us systems ystems.. 10. 10. Chec C hec king king mod mo d el vali va lidity, dity, verifica verifica tio tio n of mod els. els. Ana lys lysis o f simulation imula tion re sults. ults. 11. 11. Simulation Simulation re sults visua visuali lization zation.. Inter Inte ra c tive simula simulation, tion, virtua virtuall reality. 12. Design and control of simulation experiments. Model optimization. 13. Gene G enerra ting, ting, tra tra nsform nsforma a tion, tion, a nd testi testing ng of pseudor pseudo ra ndom ndo m numbers. numbers. Stoc Stoc has ha stic tic models mod els,, Monte Mo nte C a rlo method. method . 14. 14. Overvi O vervie e w o f c o mmonly used used simula imula tio tio n sys systems. tems.

C O URSE NUMBER: C S206 TITLE: Dig it ital al Desig n •


Thi This s c ours ourse provide provides s an overvi overview of the the pri principles underl underlying ying number number systems ystems,, logic ga tes, tes, Fix Fixed ed-Point -Point Rep Reprresenta esenta tion, tion, Boo Boo lea n Func Functi tion, on, Boolea n al a lgebra, ge bra, combinational and sequential logic circuits, flip-flops, registers, and PLAs.

•


A t the end en d of this this c ourse ours e , the the stude s tudent nt should sho uld be a ble to: 1. Identify building blocks of Von Neumann machine. 2. Design Design sim simple ple c ombin omb ina a tiona tiona l and sequenti eq uentia a l cir c irc c uits uits.. 3. Ap ply mini minimi miz za tion tion techni tec hnique ques s (Ka (Ka rnaugh na ugh ma ps) to to Boo lea n expressions.

•


DATE

1. Numb Numbe e r Syste ystems ms (Bina (Binary ry)) 2. Fixed-Point Representation (1’s and 2’s complement)

Page 37

3. Logic Gates 4. Boolean Function C a nonic nonic a l a nd Standa Standa rd Format Format Tr Truth uth Ta ble Boolean Algebra Simplifica implific a tio tio n using using Prope Prop e rties Simplification using K-Map C ombinati omb inationa ona l Logic og ic C irc irc uits uits Se q uential uentia l Logic C irc irc uits uits Flip-flops, registers, PLAs • •

5.

• •

6. 7. 8.

C O URSE NUMBER: C S207 TITLE: O peratin peratingg Syst Systems ems IN STRU STRUC C TO R: C O URSE RSE DESC RIPTIO RIPTIO N

•

Thi This s c ours ourse provide provides s an int intrroducti od uction on to to the the conc c onc epts ep ts,, theo theorries a nd compo c omponent nents s that serve as the bases for the design of classical and modern operating systems. Top Topiic s inc inc lude pr p roc ess ess a nd memory memory manage mana gement ment,, proces proc ess s sync ync hroniz hroniza a tion tion and deadlocks.


•

A t the end en d of this this c ourse ours e , the the stude s tudent nt should sho uld be a ble to: 1. Describe relationships between system services and application software 2. C ompa omp a re and a nd c ontra ontra st different different des de sign cons co nsiderations iderations for major O S components


•

1.

TOPICS PICS AND READINGS EADING S O verview verview of O pe ra ting ting Systems ystems History Functi unc tiona ona lity lity of a typic typica a l OS O S struc truc tures Proc Proc ess M a nage na gement ment Process concept Process scheduling Memor Me mory y Ma nagement nag ement MVT MV T, Paging, Pa ging, Seg Segmentation mentation Virtual Virtual M emor emo ry Demand Pagin Pa ging g File File Ma nage na gement ment

DATE

  

2.

 

3.



4.



5.

Page 38

6.

Deadlocks Prevention Avoidance Detecti Detec tion on and a nd Rec Rec overy 7. C onc urr urrent Proc Proc esse esse s Synchr ync hroniz oniza a tio tio n C la ssica l Prob Prob lems (Prod (Prod ucer-C uc er-Cons onsumer umer,, Rea der de rsWriters Wr iters,, Dining D ining Philosophe Philosop herrs)   

• •

C O URSE NUMBER: C S208 TI TLE : NET NETWO WORKS RKS and INTERNET INTERNET TEC HNO LO G Y •


Thi This s c ours ourse provide provides s an in-dep in-depth th disc disc uss ussion of computer co mputer network networks. It It includes a detailed discussion of the different Network Models. Concepts that have a direct effec t on the eff e ffiic ienc y of a network network (e.g. (e.g. c olli ollision a nd b roa dc a st domains do mains,, topolog top ology) y) are are a lso lso d isc isc uss ussed . Conc C onc epts ep ts on dif d ifferent ferent networ netwo rk tec tec hnologies hnolog ies,, distr distributed ibuted c omputati omp utation, on, netwo rking, king, a nd c ommunic ommunic a tion tion software, and a nd sec urit urity y iss issues ue s a re a lso lso d isc isc uss usse d . •


Towa Towa rds the the end of o f the the c ours ourse, stu stude dent nts s are expe expec c ted to / a ble to: to: Be familiar with the different Network Models. Under nde rstand different different network ne twork tec tec hnologies Understand the effects of using different networking topologies Be upda ted wit w ith h differ different ent ad vanc ed network network tec tec hnolog hnologiies tha tha t can c an be used used to c onnec onne c t different different networ netwo rks Be familiar familiar with with various various har ha rdwa dw a re a nd softwa softwarre that tha t ca c a n help pr p rotec t the network Know the advantage of using a network management system • • • •

•

•

•

C O URSE O UTLIN E A ND TIM EFRA EFRA ME 1. Intr Intro d ucti uc tion on to C o mputer mpute r Netwo Ne tworrks 2. O verview verview of Networ Netwo rking king Mo dels de ls 1. OS O SI 2. TC P/ IP 3. Physic Physica a l Layer Laye r 4. Data Da ta Link Link Layer Laye r 5. Netwo Ne tworrk Layer 6. Trans ran sp o rt Laye La yerr 7. Ap plic plic a tion tion La yer 8. Netwo Ne tworrk To p o logies log ies 9. Netwo Ne tworrk Se c urity urity

•

REQUIR REQUIRED ED READIN G S

Page 39

C omput omputer er Netw Networks, 4th Edition And rew S. Ta nenba nenb a um C omputer C ommunica ommunications and Networ Networking king Technologie ec hnologies s Michae Mic haell A. G allo, allo, Wil Willia m M. Ha Ha ncoc nc oc k

•

SUG SUG G ESTED ESTED REA DI N G S

Business usiness Data Communic C ommunica ations and Netw Networking, 7th 7th Edition Edition J err erry y FitzG tzG erald, erald, Alan Denni Dennis

C O URSE NUMBER: C S210 TI TLE: C alc ulus •


A course covering the real number system as a complete, ordered field; topological p ro per pe rties ties of R a nd R2 , limi limits ts a nd c ontinuity. ontinuity.

•


A t the end en d of this this c ourse ours e , the the stude s tudent nt should sho uld be a ble to: 1. Under Unde rstand p ro p erties erties of o f the number numbe r sys systems tems 2. Per Pe rform d eriva erivati tives ves C ompute for area area s under the the c urve urve a nd oth o ther er appli ap plic c a tions tions 3. •

C O URSE O UTLIN E A ND TIM EFRA EFRA ME TOPICS PICS AND READINGS EADING S 1. Exp o nential nentia l a nd trigo trigono nometr metric ic Func Functi tions ons 2. The deter de termi mina nant nt a nd the cross cross produc prod uctt 3. Vec Ve c tors tors a nd geome ge ometr try. y. 4. Differentiation 5. Deriva Derivati tives ves in higher highe r dimensions, dimensions, d irec irec tiona tiona l d eriva erivati tive ve and a nd gradient. 6. C omputati omp utation on of der de riva iva tives tives.. 7. Differentia Differentiati tion on b y rule. 8. Vec Ve c tor der de rivati va tives ves a nd prop prop erties erties 9. Hig Hig her he r d e rivatives iva tives a nd taylor taylo r se ries. 10. Quadratic approximations in two dimensions. 11. App lic lic a tions tions of the linea linearr approx ap proxim ima a tion. tion. 12. 12. Ma xima ima a nd mini minima. ma. 13. 13. C urve urves s 14. Complex numbers and functions.

DATE

Page 40

15. The antiderivative. 16. 16. Area Area under unde r a c urve. urve.

C O URSE NUMBER: C S211 TITLE: Ob jec t-O ri rient ented ed Prog Prog ramm ramming ing Thi This s c ours ourse provide provides s the the stu stude dent nts s with with the the funda fundament menta a l unders understanding of obj ob jec toriented oriented progr prog ra mming mming usin using g J a va. It intr introd od uces uc es the different different c onc epts ep ts that are are commonly associated with object programming.


•

A t the end en d of this this c ourse ours e , the the stude s tudent nt should sho uld be a ble to: 1. des de sign the c lass lasses neede nee ded d given a pr p rob lem spe spec c ifica ifica tion; tion; 2. impleme implement nt the des de signed c lass lasses using using the the ob ject jec t oriented oriented progra progra mming mming language langua ge 3. lea rn how how to test, test, verify, verify, a nd deb d ebug ug objec ob ject-or t-orient iented ed programs; programs; a nd 4. c rea te progr prog ra m usin using g objec ob ject-or t-orient iented ed pr p rinc inc iples. iples.


•

1.

TOPICS PICS AND READINGS EADING S O bjectbjec t-O O riented C onc epts ep ts Procedural Programming vs. Object-Oriented Programming Ab stra tra c t Data Da ta Types ype s (ADTs (ADTs) O bjec t-O t-O riented Progra Progra mmi mming C onc epts ep ts J a va Fundamentals Fundamentals - Anatomy Ana tomy of a Ba Ba sic J a va Prog Progrra m C omments Primitive Data Types Expressions and Operators Reference Types Statements O bjec ts a nd Class Classes in J a va C lasse lasse s Ac c ess ess Mo difiers difiers Me thods and Attribut Attributes es C o nstr nstruc uctors tors C la ss Me thods a nd C lass lass Var Va riabl iab les O bjectbjec t-O O riented Pr Progr og ra mmi mming in J a va Inherit Inherita a nce nc e : Superc up erclass lass a nd Subc Subc lass Encapsulation Method Overriding Polymorphism O ther J a va C lass lasses Ab stra tra c t C la ss Interfaces

DATE

•

• •

2.

• • • • •

3.

• • • • •

4.

• • • •

5.

• •

Page 41

6. GUI Development AWT G ra phica l Compo C omponent nents s Event Handling A nonymous non ymous C lasse lasse s 7. Exc ep tio tio n Handli Hand ling ng Tr Try, C a tch, and Fi Finally nally C rea ting ting Exc epti ep tions ons Exception Hierarchy 8. Thread Thr Threa ea d Li Lifec ycle Thr Threa ea d Syn Sync c hroniz hronization ation C ritic itica a l Sec tio tio ns 9. C ollec tions tions Fra Fra mewo mew o rk Collection Set List Map 10. 10. Input and a nd O utput Str Strea ea ms InputStr InputStre e a m/O m/ O utputStr utputStrea ea m C lass lasses Read Rea d er/Wr er/ Writ iter er Class C lasses es File File Hand Han d ler C lasse lasse s • • •

• • •

• • •

• • • •

• • •

Page 42

CH0MO0053s2006

Recommend Documents