X hits on this document

PDF document

CHANCELLOR Sir George Alleyne OCC, MD, FRCP, FACP (Hon), Hon. DSC (UWI) - page 100 / 136

362 views

0 shares

0 downloads

0 comments

100 / 136

The

FA C U L T Y Faculty

BOOKLET 2004 – 2005 of Science & Agriculture

COMP 3500 (CS34M) INTERNET TECHNOLOGIES I (4 credits)

COMP 3600 (CS35E) THEORY OF COMPUTING II (4 credits)

Prerequisite: COMP 2500 (CS24E) Syllabus: Overview of networking. The TCP/IP stack. Domain name reso- lution. The Hypertext Transfer Protocol (HTTP): headers, re- quests, responses, content-negotiation, caching. The Exten- sible Hypertext Mark up Language (XHTML): XML syntax, XHTML DTDs, document structure, text formatting elements, images, tables, forms, links, image maps. Cascading Style Sheets (CSS): separation of content and presentation, selec- tors, declarations, conflict resolution. Client-side scripting: Control of document appearance and content, browser con- trol, user interaction, window manipulation, client-side object hierarchy, cookies, animation. Applets: Class hierarchy, graphi- cal user interface elements, event handling, component lay- outs, drawing graphics, applications. Extensible Mark up Lan- guage (XML): Advantages and applications, Document Type

Definitions (DTDs). Examination: One 2-hour written paper Coursework

75% 25%

COMP 3550 (CS34N) INTERNET TECHNOLOGIES II (4 credits)

Prerequisite: COMP 3500 (CS34M) Syllabus: Introduction to a server-side scripting language. Review of the Hypertext Transfer Protocol. The Common Gateway Interface (CGI): Environment variables, forms, templates, security, email, data persistence, maintaining state, searches, graphics. Servlets: Class hierarchy, CGI variables equivalent, cookies, session tracking, applet/servlet interaction. Java Servlet Pages (JSP): Scripting elements, expressions, scriptlets, declarations, directives, custom libraries. Server-side database connectiv-

Prerequisite: COMP 2600 (CS25E) Syllabus: Turing machines. Computing with Turing machines.

Exten-

sions

of

Turing

machines.

Nondeterministic

Turing

machines.

Grammars.

Undecidability.

The

Church-Turing

Thesis.

The

halting

problem.

Unsolvable

problems.

Recursively

enumer-

able

languages.

Chomsky

hierarchy.

Computational

complex-

ity:

Classes

P

and

NP.

NP–completeness.

Special

topics,

e.g.

Methods of tackling NP-hard problems. Examination: One 2-hour written paper Coursework

75% 25%

COMP 3650 (CS36E) PROGRAMMING LANGUAGE TRANSLATION (Not being taught in 2004/2005) (4 credits)

Prerequisite: COMP 2000 (CS20A) Syllabus: Language translation phases: lexical analysis, parsing, code generation, optimisation. Comparison of interpreters and com- pilers. Deterministic and non-deterministic finite state ma- chines. Regular expressions. Grammars and languages. Top- down and bottom-up methods of parsing. Recursive descent. SLR, LR and LL methods. Internal code – quadruples and Pol- ish notation. Code generation for common control structures (while, if, then, else, for). Optimal evaluation of Boolean ex-

pressions. Examination: One 2hour written paper Coursework

75% 25%

ity: Drivers, connections, SQL queries, result sets. Examination: One 2-hour written paper Coursework

75% 25%

100

Document info
Document views362
Page views362
Page last viewedSun Dec 04 16:18:55 UTC 2016
Pages136
Paragraphs4701
Words45742

Comments