You are on page 1of 11

University of Bahrain

College of IT
Department of Computer Science
BSc. In COMPUTE SCIE!CE PO"#M CUICU$UM %&'() an* a+ove stu*ents,
%&'(' Mo*i-e* Program,
Semester I
Co*e Title $ec
$a
+ Cr Prere.uisites
ARAB 110 Arabic Language Skills I 3 0 3
ITCS 111 Computer Programming I 3 2 3
E!L 1"# Language $e%elopment I 3 0 3
&AT'S 101 Calculus I 3 0 3
P'(CS 101 !eneral P)*sics I 3 3 #
Total (/ /
(
0
Semester &
Co*e Title $ec
$a
+ Cr Prere.uisites
ITCS 112 Computer Programming II 3 2 3 ITCS 111
E!L 1"" Language $e%elopment II 3 0 3 E!L 1"#
P'(CS 102 !eneral P)*sics II 3 3 # P'(CS 101
ITCS 2"2 $iscrete Structures I 3 2 3 +ITCS 111 or ITCS103, -
&AT' 101
&AT'S 102 Calculus II 3 0 3 &AT'S 101
Total
(/ 1 (
0
Semester )
Co*e Title $ec
$a
+ Cr Prere.uisites
'IST 122 &o.ern Ba)rain 'istor* an. Citi/ens)ip 3 0 3
ISL& 101 Islamic Culture 3 0 3
ITCS 21" $ata Structures 3 2 3 ITCS 112 or ITCS 10#
E!L 210 Tec)nical Report 1riting 3 0 3 E!L 1""
ITCE 2"0 $igital Logic 3 2 3 ITCS111 or ITCS 103
ITCS 2"3 $iscrete Structures II ) 2 ) ITCS 2"2
Total (2 0
(
2
Semester 3
Co*e Title $ec
$a
+ Cr Prere.uisites
ITIS 102 2un.amentals o3 In3ormation S*stems 3 2 3
C'E&( 101 !eneral C)emistr* I 3 3 #
ITCS 2#2 Assembl* Language Programming 3 2 3
+ITCS112 or ITCS 10#, - ITCE
2"0
STAT 243 Probabilit* an. Statistics 3 0 3 &AT'S 101
ITCS 31" 'uman5Computer Interaction 3 2 3 ITCS 21"
Total (/ 4
(
0
Semester /
Co*e Title $ec
$a
+ Cr Prere.uisites
ITCS 31# 2ormal Language an. Automata 3 2 3 ITCS 21" - ITCS 2"3
ITCE 321 Computer Arc)itecture 3 2 3 ITCS 2#2
ITCS 3#6 Anal*sis an. $esign o3 Algorit)ms 3 2 3 ITCS 21" - ITCS 2"3
ITCS 37" $atabase &anagement S*stems 3 2 3 ITCS 21"
ITCS 300 Pro3essional Issues an. Et)ics 3 2 3 E!L 210
&AT'S 211 Linear Algebra 3 0 3 &AT'S 101
Total (2 ('
(
2
Semester 0
Co*e Title $ec
$a
+ Cr Prere.uisites
LA1 104 'uman Rig)ts Principles 2 0 2
ITCS 323 8perating S*stems 3 2 3 +ITCS 21" - ITCS 2#2, or +ITCS
216 - ITCE 3#1,
ITCS 332 8rgani/ation o3 Programming Languages 3 2 3 ITCS 31#
ITCE 31" Computer et9orks 3 2 3 ITCS 21"
ITCS 300 So3t9are Engineering I 3 2 3 ITCS 37"
ITCS 3#1 8b:ect 8riente. S*stems 3 2 3 ITCS 21"
Total (1 ('
(
1
Summer
Co*e Title $ec
$a
+ Cr Prere.uisites
ITCS #72 In.ustrial Training 0 3 1 Pass 7" cre.its
Semester 1&
Co*e Title $ec
$a
+ Cr Prere.uisites
ITCS #43 Internet So3t9are $e%elopment 3 2 3 ITCE 31" - ITCS 37"
ITCS #00 So3t9are Engineering II 3 2 3 ITCS 3#1 - ITCS 300
ITCS #;; ITCS Electi%e I 3 2 3
ITCS #;; ITCS Electi%e II 3 2 3
ITCS #00 Senior Pro:ect 0 6 3 E!L 210 - pass 7" cre.its
Total (& (3
(
/
Semester 2
Co*e Title $ec $a+ Cr Prere.uisites
ITCS #12 Cr*ptograp)* an. Computer Securit* 3 2 3 ITCS 3#6
ITCS #;; ITCS Electi%e III 3 2 3
ITCS #;; ITCS Electi%e I< 3 2 3
'=>SS ;;; 'umanities>Social Sciences 3 0 3
;; ;;; 2ree Electi%e 3 ; 3
Total (/ 0
(
/
Total Cre*it 5ours6 ()&
ELECTIVE COURSES
Code Title
$e
c $a+ Cr Prere.uisites
ITCS
#13 A.%ance. 8perating S*stems 3 2 3 ITCS 323
ITCS#23 S*stem So3t9are 3 2 3 ITCS 21" an. ITCS 2#2
ITCS
#2# !eograp)ical In3ormation S*stems 5 !IS 3 2 3 ITCS 21"
ITCS
#26 Practical Aspects o3 8perating S*stems 3 2 3 ITCS 323
ITCS
#24 Parallel Processing 3 2 3 ITCE 321 an. ITCS 323
ITCS
#27 Arti?cial Intelligence 3 2 3 ITCS3#6 an. ITCS 332
ITCS
#37 Computer !rap)ics 3 2 3 ITCS 21" an. &AT'S 211
ITCS
#30 8ptimi/ation Tec)ni@ues 3 2 3 ITCS 21" an. &AT'S 211
ITCS
##2 Compiler $esign 3 2 3 ITCS 332
ITCS
##4 Aa%a Concepts 3 2 3 ITCS 3#1
ITCS
#"0 !rap) T)eor* 9it) Applications to CS 3 2 3 ITCS 3#6
ITCS
#"2 &ultime.ia an. '*perme.ia S*stems 3 2 3 ITCS21"
ITCS
#"6 $istribute. S*stems 3 2 3 ITCS 323
ITCS
#60 'euristic &et)o.s 3or 8ptimi/ation 3 2 3 ITCS 3#6
ITCS
#62 A.%ance. $atabase &anagement S*stems 3 2 3 ITCS 37"
ITCS
#4# In3ormation Retrie%al 3 2 3 ITCS#43
ITCS &obile Computing 3 2 3 ITCS#43
#40
ITCS
#70 atural Language Processing 3 2 3 ITCS 332
ITCS
#01 umerical Computations 3 2 3 ITCS 2"3 an. &AT'S 211
ITCS
#03 Selecte. Topics in Computer Science 3 2 3 $epartment Appro%al
ITCS
#0" P)*sical Implementation o3 $B&S 3 2 3 ITCS 37"
7ree Elective Courses An* =8B course eBclu.ingC+1, courses oDere. 3or special stu.entsE +2, courses co%ere.
in t)e BFScF curriculumE+3, courses e@ui%alent or lo9er t)an t)ose alrea.* taken in t)e curriculumF oteC
Appro%al o3 .epartment is re@uire.F
5U8SS Courses 9 5umanities an* Social Science Component6 #ny course from the follo:ing6
5umanities6 2ine ArtsE 'istor*E American Stu.iesE ClassicsE CommunicationsE Englis)E +2oreign Language,
2renc)E &usicE P)ilosop)*E T)eatreE Literature +Arabic,E Religion +comparati%e,F
Social Science6 Ant)ropolog*E EconomicsE E.ucationE !eograp)*E 'istor*E Ps*c)olog*E Sociolog*E 1omenGs
Stu.iesE Political ScienceF
"ra*uation e.uirements
(. Passing t)e BFScF Program 9it) o%erall !PA at least 2F0F
&. T)e !PA o3 t)e ma:or courses IT;; s)oul. be at least 2F0 +onl* t)e best gra.e o3 t)e repeate. ma:or courses
9ill be counte.F,
B.Sc. in Computer Science
Course Descriptions
ITIS ('& 7un*amentals of Information Systems %)9&9),
Prere.uisite6 none
Course Description
Pro%i.ing t)e 3oun.ation 3or un.erstan.ing t)e business implications an. roles t)at
IS>IT pla* in pro%i.ing solutions to business problemsE an. in pro%i.ing opportunities
3or companiesF Topics co%ere.C In3ormation S*stems in global business to.a*C global
E5businessE )o9 business use in3ormation S*stemsE organi/ationsE an. strateg*H
et)ical an. social issues in In3ormation s*stemC ac)ie%ing operational eBcellence
an. customer intimac*H E5commerceF
ITCS ((( Computer Programming I %)9&9),
Prere.uisite6 none
Course Description
Intro.uction to computers an. numbering s*stemsH Algorit)mic problem sol%ing
principlesH Intro.uction to a mo.ern programming language +eFgF CII,H
Input>8utputE con.itional statementsE iterationE ?lesE stringsE 3unctions an. arra*sH
Lab assignments to practice programmingF
ITCS ((& Computer Programming II %)9&9),
Prere.uisite6 ITCS (((
Course Description
A.%ance. language elementsH .ata t*pes an. structuresH recursion an. recursi%e
algorit)msH Abstract .ata t*pesH Pointer manipulationE structuresE an. classesH
Recursion an. Recursi%e Algorit)msH Programming applications to business an.
scienti?c problemsF
ITCS &(/ Data Structures %)9&9),
Prere.uisite6 ITCS ((&
Course Description
Implementation an. manipulation o3 .ata structuresH Concept o3 abstract .ata
t*pesH Implementation an. use o3 .iDerent .ata structures suc) as listsE
stacksE @ueuesE arra*s an. t)eir linke. implementationsH =se o3 trees an.
grap)sH 'as) tablesH Intro.uction to algorit)msH Applications using CII or
anot)er current languageF
ITCS &3& #ssem+ly $anguage Programming %)9&9),
Prere.uisite6 ITCS ((& ; ITCE &/'
Course Description
$ata representationsE Computer Structure an. Processor 8rgani/ationE CP=
Registers an. Processor So3t9are mo.elE &emor* 8rgani/ation an. SegmentationE
P)*sical - Logical A..ressesE A..ress CalculationE Assembl* Language
2un.amentalsC Program StructureE $irecti%es an. &ac)ine Instructions 2ormatsE
$ata $e?nitionsE A..ressing &o.esE Instruction setE &acrosE Stack an. Proce.uresE
Input>8utput programming an. InterruptsF
ITCE &/' $ogic Design %)9&9),
Prere.uisite6 ITCS (((
Course Description
Intro.uction to .igital logic .esignF umber s*stemsF Combinational logic circuitsH
Boolean algebraH logic minimi/ationH combinational net9ork .esignF $eco.ersH
enco.ersH multipleBersH comparatorsH R8&sH PLAsF Se@uential circuits anal*sis an.
.esignH latc)esH Jip JopsH anal*sis an. .esign o3 s*nc)ronous se@uential net9orksH
countersH registersF
ITCS &/& Discrete Structures I %)9&9),
Prere.uisites6 ITCS (((; M#T5 ('(
Course Description
Intro.uction to .iscrete structures an. associate. mat)ematical toolsH Propositional
calculusH Pre.icate calculusH Se@uences an. SummationsH Ine@ualitiesH Proo3
tec)ni@uesH SetsH RelationsH 2unctionsH Partial an. Total 8r.eringsH !rap)sH
Applications to computer scienceF
ITCS &/) Discrete Structures II %)9&9),
Prere.uisites6 ITCS &/&
Course Description
!rap)s an. TreesH Recurrence relationsC )omogenous an. in)omogeneousH Sol%ing
recurrence relationsF CombinatoricsC countingE permutationsE combinationsE
binomial coeKcientsH Algebraic structuresC groupsE semi groupsE monoi.sH $iscrete
probabilit*F
ITCS )(3 7ormal $anguages an* #utomata %)9&9),
Prere.uisite6 ITCS &(/ ; ITCS &/)
Course Description
2ormal languages an. t)eir relation to automataH t)e C)omsk* )ierarc)* o3 classes
o3 grammarsH recognition o3 languagesH ?nite state automataH pus) .o9n
automataF ConteBt53ree grammars an. normal 3ormsF T)e stan.ar. Turing
mac)ineH Turing mac)ines as acceptors an. trans.ucersH TuringLs t)esis an.
incommutabilit*F
ITCS )(/ 5uman9Computer Interaction %)9&9),
Prere.uisite6 ITCS &(/
Course Description
'uman5Computer Interaction +'CI, an. =ser Inter3ace $esignH Alternati%e Inter3ace
$esign met)o.s +eFgFE user5centere. .esignE protot*pingE an. .esign principles an.
rules,H &et)o.s 3or inter3ace e%aluation +eFgFE so3t9are loggingE user obser%ationE
benc)marks an. eBperiments,H 'uman capabilities +eFgFE %isual an. au.itor*
perceptionE memor*E mental mo.elsE an. inter3ace metap)ors,H Inter3ace
tec)nolog* +eFgFE input an. output .e%icesE interaction st*lesE an. common
inter3ace para.igms,H Implementation o3 inter3acesF
ITCE )(/ Computer !et:or<s %)9&9),
Prere.uisites6 ITCS &(/
Course Description
Concepts o3 computer net9orksH t)e arc)itecture o3 .ata communication s*stemsF
T)e se%en la*er mo.el o3 a net9ork +applicationE presentationE sessionE transportE
net9orkE .ata linkE p)*sical,F Protocol algorit)msH resource5s)aringF et9ork
per3ormanceE using computer net9ork languages an. so3t9areF
ITCE )&( Computer #rchitecture %)9&9),
Prere.uisite6 ITCS &3&
Course Description
!eneral Purpose &ac)ineE &ac)ine language an. .igital logicE Real
mac)inesE RISC %ersus CISCE CISC Processor eBampleE RISC processor
eBampleE Processor $esignE T)e .esign processE 15bus micro5arc)itectureE
.ata pat) implementationE Control unitE 2 an. 3 bus arc)itecture .esignE
mac)ine eBception an. resetE pipe5lingE instruction le%el parallelismF
ITCS )&) Operating Systems %)9&9),
Prere.uisites6 %ITCS &(/ ; ITCS &3&, or %ITCS &(0 ; ITCE )3(,
Course Description
&ac)ine structure an. t)e 3unctions o3 an operating s*stemF 8perating s*stemLs
structureF Process managementE storage management an. %irtual memor*F 2ile
s*stem an. I>8 .e%ice )an.lingF Protection an. securit*F Case stu.ies using .iDerent
operating s*stemsF
ITCS ))& Concepts of Programming $anguages %)9&9),
Prere.uisite6 ITCS )(3
Course Description
'istorical Backgroun.F Programming para.igmsF $esirable 3eatures an.
speci?cations o3 programming languagesF <irtual mac)ines 3or programming
languagesF $ata T*pesE se@uence controlE .ata controlE s)aringE an. t*pe c)eckingF
run5time storage &anagementF Language translation s*stemsF Language
semanticsF $istribute. an. Parallel Programming constructsF
ITCS )3( O+=ect9Oriente* Systems %)9&9),
Prere.uisite6 ITCS &(/
Course Description
Intro.uction to t)e problems o3 .e%eloping large so3t9are applicationsF 8b:ect5
oriente. conceptsC classesE ob:ectsE relations)ips bet9een classes inclu.ing
associationE in)eritance an. aggregationF 8b:ect5oriente. anal*sis an. .esignF =&LF
Implementation o3 88 base. s*stem using an 88 programming languageF
Comparison bet9een .iDerent 88 programming languages an. 88 .esign
met)o.ologiesF
ITCS )30 #nalysis an* Design of #lgorithms %)9&9),
Prere.uisites6 ITCS &(/ ; ITCS &/)
Course Description
$e?nitionE criteriaE implementation an. empirical anal*sis o3 Algorit)msH As*mptotic
notationsE CompleBit*H BestE 1orstE an. A%erage case anal*sisH Anal*sis o3 on5
recursi%e an. Recursi%e algorit)msH Brute 2orceE !ree.*E $i%i.e an. con@uerE
Trans3orm an. con@uerE BacktrackingE Branc) an. Boun.E an. $*namic
programming Tec)ni@ues 3or .esigning eKcient algorit)msF Limitations o3
algorit)msH PE PE an. P5complete problemsF
ITCS )2/ Data+ase Management Systems %)9&9),
Prere.uisite6 ITCS &(/
Course Description
Intro.uction to .atabase management s*stemsF Logical an. p)*sical representation
mo.elsF Concepts o3 t)e relational .ata mo.elF ormali/ationF Muer* languagesF
$atabase reco%er*E securit* an. integrit*F Transaction processing an. concurrenc*
controlF An o%er%ie9 o3 ob:ect5oriente.E ob:ect5relationalE an. .istribute. .atabasesF
A case5stu.* pro:ect o3 t)e .esign an. .e%elopment o3 a .atabase s*stemF
ITCS )4' Soft:are Engineering I %)9&9),
Prere.uisite6 ITCS )2/
Course Description
Intro.uction to so3t9are engineeringF So3t9are engineering li3ec*clesF Agile process
mo.elsF So3t9are pro:ect managementF Risk managementF 2easibilit* stu.iesF S$LC
re@uirement anal*sis tools an. tec)ni@uesF Input>output .esign an. .ata .esignF
$ocumentation stan.ar.sF Case5stu.* on a real li3e s*stemF
ITCS )44 Professional Issues an* Ethics %)9&9),
Prere.uisite6 E!"$ &(4
Course Description6
Intro.uction to skills nee.e. b* IT pro3essional an. so3t9are .e%elopers inclu.ingC
researc) met)o.sE IT report 9riting skillsE presentation skillsE an. communications
skillsF Sur%e* o3 pro3essional certi?cation an. IT careersF Inter%ie9 an. C<
preparationF Pro3essional et)ics inclu.ing eBposure to co.es o3 con.uct in IT an.
so3t9are engineeringH legal IT issues an. IT regulationsF !lobal impact o3 IT an.
globali/ationF T)e course also inclu.es a 9eekl* seminar seriesF
ITCS 3(& Cryptography an* Data Security %)9&9),
Prere.uisites6 ITCS )30
Course Description
'istorical perspecti%e o3 cr*ptograp)* inclu.ing some classical encr*ption
tec)ni@uesE cr*ptanal*sisE an. steganograp)*F S*mmetric ke* encr*ption met)o.sF
Public5ke* encr*ption met)o.sF 'as) 3unctions an. aut)entication protocolsF Access
controlE ?re9allsE an. net9ork securit*F <iruses an. intru.ersF Pro3essional Et)ics in
ITF Legal issues an. social implications in .ata securit*F
ITCS 3() #*vance* Operating Systems %)9&9),
Prere.uisite6 ITCS )&)
Course Description
Algorit)ms 3or process an. t)rea. sc)e.ulingE memor* managementH ?le s*stemsE
resource allocationE process s*nc)roni/ation an. securit* in time5s)aringE
multiprogrammingE an. .istribute. operating s*stemsH implementation .etails an.
tra.e5oDs t)at )a%e been ma.e in contemporar* operating s*stems an.
.e%elopment o3 s*stem le%el utilities an. applicationsF
ITCS 3&) System Soft:are %)9&9),
Prere.uisite6 ITCS &(/ ; ITCS &3&
Course Description
Basic algorit)ms o3 operating s*stem so3t9areH linkage e.itorsE loa.ersE assemblersE
macrosE an. compilersH Practical s*stems programming pro:ects suc) as a simple
linkage e.itorE a stan.5alone eBecuti%eE a ?le s*stem etcF
ITCS 3&3 "eographical Information Systems %)9&9),
Prere.uisite6 ITCS &(/
Course Description
Intro.uction to !IS terminolog* an. .e?nitionsH application nee.sE tec)nical
re@uirements an. communication en%ironmentsH interpreting geop)*sicalE
geological an. relate. .ataH accessing .atabaseH .ata translatorsC eBtracting an.
con%erting .ata 3rom ot)er sources to !IS .ata mo.elsH spatial .ata )an.ling
concepts an. tec)ni@uesH storage capabilities o3 a !IS s*stemH ob:ect5oriente.
programming an. !ISC !IS macro languageH sur%e* o3 ma:or !IS s*stemH integrate.
!IS solutionsH 3uture !IS potentialH a pro:ect in !IS applicationsF
ITCS 3&0 Practical #spects of Operating Systems %)9&9),
Prere.uisite6 ITCS )&)
Course Description
Current operating s*stems in in.ustr*H Comparison o3 %arious operating s*stems
inclu.ing interoperabilit*E )ar.9are re@uirementsE ?le s*stemsE net9orking 3eaturesE
an. !=IsH S*stem a.ministrationE :ob controlE an. a%ailable utilitiesH EBperiment
9it) .iDerent t*pes o3 e.itorsE learning t)e use o3 t)e s)ellE an. create s)ell scriptsH
8S capabilities in t)e net9ork en%ironment an. on t)e InternetF
ITCS 3&1 Parallel Processing %)9&9),
Prere.uisites6 ITCE )&( ; ITCS )&)
Course Description
T)eor* o3 parallelismC parallel computer mo.els +SI&$H &I&$H $ata 2lo9H eural
et9orks,H Interconnection et9orks Parallel 'ar.9are Tec)nolog*C Super5Scalar
an. <ector ProcessorsH Pipeline. ProcessorsF Parallel an. Scalable Arc)itectureLsF
et9ork o3 9orkstationsF So3t9are 3or parallel programmingH operating s*stemsH
languagesH compilers an. algorit)msF Programming applicationsF
ITCS 3&2 #rti-cial Intelligence %)9&9),
Prere.uisites6 ITCS )30 ; ITCS ))&
Course Description
Topics inclu.e )euristic searc)H kno9le.ge representation an. eBpert s*stemsH
natural language processingH pattern recognitionH games an. roboticsF $esirable
3eatures o3 Arti?cial Intelligence languagesF Applications in .iDerent areas using
suitable language suc) as PR8L8! or LISPF
ITCS 3)2 Computer "raphics %)9&9),
Prere.uisites6 ITCS &(/ ; M#T5 &((
Course Description
T)eories an. applications o3 t)e computer grap)ics s*stemH Tec)nical an.
conceptual aspects o3 computer .ra9ing using stan.ar. computer grap)ics toolsH
Intro.uction to grap)ics )ar.9areE output primiti%esE clipping algorit)msE t9o5 an.
t)ree5.imensional geometric trans3ormationsE t)ree5.imensional ob:ect
representation an. %ie9ingE illumination mo.els an. sur3ace5ren.ering met)o.sH
!rap)ics so3t9are toolsF
ITCS 3)4 Optimi>ation Techni.ues %)9&9),
Prere.uisite6 ITCS &(/ ; M#T5 &((
Course Description6
8ptimi/ation &o.elingH Linear ProgrammingC &o.elsH EBamplesH 2ormulationH
!eometr* Linear programmingH SimpleB met)o. to sol%e Linear Programming
eBampleH $ualit* an. Sensiti%it* Anal*sisF Linear ProgrammingC Special casesC
transportation an. Assignment problemsF et9ork Jo9 optimi/ation C s)ortest pat)E
&inimum spanning treeE maBimum Jo9 an. minimum cost Jo9H Tec)ni@ues 3or
sol%ing Integer Linear programmingF
ITCS 33& Compiler Design +)925),
Prere.uisite6 ITCS ))&
Course Description
Compiler tec)ni@ues met)o.olog*H 8rgani/ation o3 compilersE leBical an. s*ntaB
anal*sisH semanticsH ob:ect co.e generation an. optimi/ationH $etection an.
reco%er* 3rom errorsH Contrast bet9een compilers an. interpretersH Tools 3or
generating compilersF
ITCS 331 ?ava Programming +)9&9),
Prere.uisite6 ITCS )3(
Course Description
8%er%ie9 o3 Aa%a application an. Applets basicsH 8b:ect 8riente. programmingH
grap)ics an. AnimationH &anaging E%ents an. Interacti%it*H Abstract 1in.o9s ToolsH
T)rea.sE EBceptionE et9orkingH Programming Pro:ectsF
ITCS 3/' "raph Theory :ith #pplication to CS +)9&9),
Prere.uisite6 ITCS )30
Course Description
$irecte. an. un.irecte. grap)sH pat)sE treesE coloring planar grap)sE partitioningH
Computer representation o3 grap)s an. grap) algorit)msH Applications in so3t9are
compleBit* metricsC program testing an. compilingH Applications in interconnection
net9orks 3or parallel an. .istribute. s*stemsH Ran.om grap)s an. compleB
net9orksF
ITCS 3/& Multime*ia an* 5yperme*ia Systems %)9&9),
Prere.uisite6 ITCS &(/
Course Description
Sur%e* o3 recent a.%ances in multime.ia s*stemsC applicationsE aut)oring toolsE
in3ormation retrie%alE net9ork an. operating s*stem supportE an. managementF Its
impact on societ*F &ultime.ia )ar.9are an. stan.ar.sF Tec)ni@ues 3or aut)oring
multime.ia pro:ects using a %ariet* o3 .igital me.ia toolsF
ITCS 3/) @isual Programming %)9&9),
Prere.uisites6 ITCS )(/
Course Description
Concepts an. tec)ni@ues in .esigning an. 9riting programs using a grap)ical user
inter3ace to implement sop)isticate. applicationsF Creating 8b:ect58riente.
ProgramsE buil.ing multi5tier programsE multiple .ocument inter3ace +&$I,E
!rap)icsE AnimationE Soun.E $rag an. $ropE .atabase access met)o.s
inclu.ing client>ser%er s*stemsE an. <isual 1eb .e%elopmentF
ITCS 3/0 Distri+ute* Systems %)9&9),
Prere.uisite6 ITCS )&)
Course Description
Intro.uction to .istribute. s*stemsH .istribute. computingH Inter5process
communication an. remote in%ocationH .istribute. namingH .istribute. ?le s*stemsH
.ata replicationH .istribute. transaction mec)anismsE an. .istribute. s)are.
ob:ectsE secure communicationE aut)entication an. access controlE mobile co.eE
transactions an. persistent storage mec)anismsH Pro:ect to construct 9orking
.istribute. applications using contemporar* languagesE toolsE an. en%ironmentsF
ITCS 30' 5euristic Metho*s for Optimi>ation %)9&9),
Prere.uisite6 ITCS)30
Course Description
P an. P problemsH 'euristic searc) met)o.s inclu.ing gree.* searc)E simulate.
annealingE tabu searc)E genetic algorit)msE .eran.omi/e. e%olution strateg*E an.
ran.om 9alk .e%elope. 3or optimi/ation o3 combinatorial5 an. continuous5%ariable
problemsH ApproBimation algorit)msH A.%antages an. .isa.%antages o3 )euristic
searc) met)o.s 3or bot) serial an. parallel computation are .iscusse. in
comparison 9it) ot)er optimi/ation algorit)msE Application pro:ectF
ITCS 30& #*vance* Data+ase Management Systems %)9&9),
Prere.uisite6 ITCS)2/
Course Description
Muer* processing an. Muer* optimi/ationE Concurrenc* controlE Acti%eE temporalE
an. multime.ia .atabasesE .istribute. .atabases an. client5ser%er arc)itectureE
$ata 9are)ouseE .ata miningE emerging .atabase tec)nologiesF
ITCS 31) Internet Soft:are Development %)9&9),
Prere.uisite6 ITCE )(/ ; ITCS )2/
Course Description
Ne* tec)nolog* un.erl*ing t)e 1orl.51i.e 1ebF 1eb arc)itectureE inclu.ing ser%er
.esignE Internet protocols stan.ar.s +eFgF 'TTPE TCP>IPE S&TPE P8P3E &I&EE 2TP,E
Client5Ser%er .ata processingH 1eb .esign using 'T&L>;'T&L>CSS t)at inclu.e
tec)ni@ues 3or teBtE imagesE links an. 3ormsH ;&L base. ApplicationsE $T$E
;SL>;SLTE an. RSSH Client an. Ser%er5si.e programming languagesE Aa%aScript an.
P'PH 1eb5base. Programming Pro:ectF
ITCS 313 Information etrieval %)9&9),
Prere.uisite6 ITCS 31)
Course Description
In%erte. in.ices an. Boolean searc)F TeBt enco.ing an. tokeni/ationF Tolerant
retrie%al met)o.sF In.eB construction an. compression tec)ni@uesF Parametric
searc) tec)ni@uesF <ector space scoringE an. rele%ance 3ee.backF Clustering an.
classi?cation o3 searc) resultsF 1eb searc) an. in.eBing tec)ni@ues inclu.ing link
anal*sis an. 9eb cra9lingF
ITCS 314 Mo+ile Computing %)9&9),
Prere.uisite6 ITCS31)
Course Description
Intro.uction to mobile computingH mobile computing plat3ormsH 9ireless net9orksH
arc)itecturesH securit* an. managementH mobile computing applications suc) as
mobile messagingE mobile agentsE an. sensor applicationsF
ITCS 32' !atural $anguage Processing %)9&9),
Prere.uisite6 ITCS ))&
Course Description
T)e state o3 t)e art an. current topics in atural5LanguageH Implementation IssuesH
atural communication bet9een person an. computerE ParsingH Nno9le.ge
representationH In3erence an. Learning in a computer mo.elH ConteBt Recognition
in Language Compre)ension Remin.ing an. &emor* 8rgani/ationH Proce.ural
SemanticsF
ITCS 32& In*ustrial Training %'9)9(,
Prere.uisite6 Pass 2/ cre*its
Course Description
Eac) stu.ent is re@uire. to spen. a minimum o3 eig)t 9eeks in some relate.
computer trainingF A report 3ollo9e. b* .iscussion is submitte. to a .epartmental
committee 3or e%aluationF T)e stu.ent is eBpecte. to .o a )ea%* practice in
programmingE using an. mo.i3*ing packagesF
ITCS 34' Soft:are Engineering II %)9&9),
Prere.uisites6 ITCS)3(; ITCS )4'
Course Description
Re%ie9 o3 so3t9are li3ec*clesF So3t9are @ualit* assuranceF Re@uirements
engineeringF So3t9are arc)itecture .esign an. .e%elopmentF So3t9are testingE
%eri?cation an. %ali.ationF 1eb5base. engineeringF So3t9are con?guration
managementF CASE toolsF &a:or case stu.* an. implementation pro:ectF
ITCS 34( !umerical Computations %)9&9),
Prere.uisite6 ITCS &/) ; M#T5 &((
Course Description6
Errors in ComputationF umerical algorit)ms an. t)eir programming an.
applications in engineering an. scienti?c problemsF 2in.ing Roots o3 E@uations b*
ApproBimationF Solution o3 linear e@uations an. matriB in%ersionH Least s@uares
cur%e ?ttingF Solution o3 nonlinear e@uationsH interpolation an. eBtrapolationF
2inite $iDerences an. Pol*nomial ApproBimations an. 2inite IntegrationF
ITCS 34) Selecte* Topics in Computer Science %)9&9),
Prere.uisite6 Department #pproval
Course Description
A course in a.%ance. topics 3rom %arious areas o3 computer scienceF T)e aim o3 t)is
course is to make stu.ents 3amiliar about an a.%ance. topic in computer science
9)ic) is not co%ere. in t)eir s*llabusF
ITCS 34/ Physical Implementation of DBMS %)9&9),
Prere.uisite6 ITCS )2/
Course *escription
Practical aspects o3 .atabase programming on ma:or $B&S packages suc) as
8RACLEF T)e course co%ers SML programmingE programming 28R&S an. REP8RTS
on t)e selecte. packageF Creating .atabase tablesF Creating an. interrogating
.atabasesF SelectingE up.ating an. @uer*ing .atabasesF 1riting programs to
interrogate t)e .atabaseF $esigning an. programming !=I 2ormsF =sing TriggersF
$esigning an. programming reportsF
ITCS 344 Senior Pro=ect %'909),
Prere.uisite6 English &(4 ; Pass 2/ cre*its
Course Description
T)e stu.ent 9ill 9ork un.er t)e super%ision o3 a 3acult* member on a ?el. pro:ect
in%ol%ing a.%ance. concepts not co%ere. in t)e curriculumF T)e stu.ent is eBpecte.
to make a ?nal pro:ect presentation be3ore a committee ma.e up o3 eBternal as 9ell
as internal membersF As muc) as possible t)e pro:ect entails t)e .e%elopment o3 an
actual in3ormation s*stem an. t)e submission o3 a pro:ect reportF

You might also like