¶¡ÏãÔ°AV

This course aims to give the student an understanding of what a modern operating system is, and the services it provides. It also discusses some basic issues in operating systems and provides solutions. Topics include multiprogramming, process management, memory management, and file systems. Prerequisite: CMPT 225 and MACM 101.

Analysis and design of data structures for lists, sets, trees, dictionaries, and priority queues. A selection of topics chosen from sorting, memory management, graphs and graph algorithms. Prerequisite: CMPT 225, MACM 201, MATH 151 (or MATH 150), and MATH 232 or 240.

A presentation of the problems commonly arising in numerical analysis and scientific computing and the basic methods for their solutions. Prerequisite: MATH 152 or 155 or 158, and MATH 232 or 240, and computing experience. Quantitative.

An examination of social processes that are being automated and implications for good and evil, that may be entailed in the automation of procedures by which goods and services are allocated. Examination of what are dehumanizing and humanizing parts of systems and how systems can be designed to have a humanizing effect. Prerequisite: A CMPT course and 45 units. Breadth-Science.

Examination of the emergence and shaping of information and communication technologies in the digital age. Explores new media and social change between everyday life, social institutions, and various enterprises. Emphasis is placed on social context and relations of power. May repeat for credit if topic studied is different. Prerequisite: CMNS 253 (or 253W), and CMNS 261 or 362.

Provides a unified discussion of the fundamental approaches to the problems in artificial intelligence. The topics considered are: representational typology and search methods; game playing, heuristic programming; pattern recognition and classification; theorem-proving; question-answering systems; natural language understanding; computer vision. Prerequisite: CMPT 225 and MACM 101. Students with credit for CMPT 410 may not take this course for further credit.

The principles involved in using computers for data acquisition, real-time processing, pattern recognition and experimental control in biology and medicine will be developed. The use of large data bases and simulation will be explored. Prerequisite: Completion of 60 units including CMPT 125, 126 or 128 (or 102 with a grade of B or higher).

Formal and foundational issues dealing with the representation of knowledge in artificial intelligence systems are covered. Questions of semantics, incompleteness, non-monotonicity and others will be examined. As well, particular approaches, such as procedural or semantic network, may be discussed. Prerequisite: Completion of nine units in Computing Science upper division courses or, in exceptional cases, permission of the instructor.

Computational approaches to image understanding will be discussed in relation to theories about the operation of the human visual system and with respect to practical applications in robotics. Topics will include edge detection, shape from shading, stereopsis, optical flow, Fourier methods, gradient space, three-dimensional object representation and constraint satisfaction. Prerequisite: MATH 152, and nine units in Computing upper division courses or permission of the instructor.

This course examines the theoretical and applied problems of constructing and modelling systems, which aim to extract and represent the meaning of natural language sentences or of whole discourses, but drawing on contributions from the fields of linguistics, cognitive psychology, artificial intelligence and computing science. Prerequisite: Completion of nine units in Computing Science upper division courses or, in exceptional cases, permission of the instructor.

This course covers various topics in computer vision with the emphasis on the model-based approach. Main subjects include 2-D and 3-D representations, matching, constraint relaxation, model-based vision systems. State-of-the-art robot vision systems will be used extensively as study cases. The solid modelling and CAD aspects of this course should also interest students of computer graphics. Prerequisite: MATH 152 and nine units in CMPT upper division courses, or permission of the instructor.

Intelligent Systems using modern constraint programming and heuristic search methods. A survey of this rapidly advancing technology as applied to scheduling, planning, design and configuration. An introduction to constraint programming, heuristic search, constructive (backtrack) search, iterative improvement (local) search, mixed-initiative systems and combinatorial optimization. Prerequisite: CMPT 225.

Computationally-oriented theories of human cognitive architecture are explored, beginning with neurologically inspired (neural network) models of "low-level" brain processes, and progressing upwards to higher-level symbolic processing, of the kind that occurs in rule-following and problem solving. Arguments concerning the need for modular processing and combinatorially adequate forms of mental representation are examined at length. Prerequisite: CMPT 225. Recommended: CMPT 310.

Current topics in artificial intelligence depending on faculty and student interest.

This course provides an introduction to the fundamentals of computer graphics. Topics include graphics display and interaction hardware, basic algorithms for 2D primitives, anti-aliasing, 2D and 3D geometrical transformations, 3D projections/viewing, Polygonal and hierarchical models, hidden-surface removal, basic rendering techniques (color, shading, raytracing, radiosity), and interaction techniques. Prerequisite: CMPT 225 and MATH 232 or 240.

This course provides a comprehensive study of user interface design. Topics include: goals and principles of UI design (systems engineering and human factors), historical perspective, current paradigms (widget-based, mental model, graphic design, ergonomics, metaphor, constructivist/iterative approach, and visual languages) and their evaluation, existing tools and packages (dialogue models, event-based systems, prototyping), future paradigms, and the social impact of UI. Prerequisite: CMPT 225.

Multimedia systems design, multimedia hardware and software, issues in effectively representing, processing, and retrieving multimedia data such as text, graphics, sound and music, image and video. Prerequisite: CMPT 225.

Covers advanced topics and techniques in computer graphics with a focus on image synthesis. Topics include photorealistic rendering, advanced ray tracing, Monte Carlo methods, photon maps, radiosity, light fields, participating media, as well as tone reproduction. Prerequisite: CMPT 361, MACM 201 and 316. Students with credit for CMPT 451 may not take this course for further credit.

Covers advanced topics in geometric modelling and processing for computer graphics, such as Bezier and B-spline techniques, subdivision curves and surfaces, solid modelling, implicit representation, surface reconstruction, multi-resolution modelling, digital geometry processing (e.g. mesh smoothing, compression, and parameterization), point-based representation, and procedural modelling. Prerequisite: CMPT 361, MACM 316. Students with credit for CMPT 469 between 2003 and 2007 or equivalent may not take this course for further credit.

Topics and techniques in animation, including: The history of animation, computers in animation, traditional animation approaches, and computer animation techniques such as geometric modelling, interpolation, camera controls, kinematics, dynamics, constraint-based animation, realistic motion, temporal aliasing, digital effects and post production. Prerequisite: CMPT 361 and MACM 316 or permission of the instructor.

Presents advanced topics in the field of scientific and information visualization. Topics include an introduction to visualization (importance, basic approaches, and existing tools), abstract visualization concepts, human perception, visualization methodology, data representation, 2D and 3D display, interactive visualization, and their use in medical, scientific, and business applications. Prerequisite: CMPT 361, MACM 316.

An introduction to the fundamentals of digital audio, computer music, basic sound synthesis algorithms, and digital audio effects and processing. Topics include concepts of sound and digital audio representation, basic concepts of digital filtering, fundamentals of spectrum analysis, and sound synthesis techniques. Understanding of theoretical concepts will be consolidated through practical programming assignments in Matlab, however there will also be exposure to various freeware real-time audio programming and sound editing environments. Prerequisite: MATH 152 and one of CMPT 125, 126 or 128 (or permission of instructor).

Current topics in computer graphics depending on faculty and student interest. Prerequisite: CMPT 361.

This course aims to give the student an understanding of what a modern operating system is, and the services it provides. It also discusses some basic issues in operating systems and provides solutions. Topics include multiprogramming, process management, memory management, and file systems. Prerequisite: CMPT 225 and MACM 101.

This course is an introduction to the modelling, analysis, and computer simulation of complex systems. Topics include analytic modelling, discrete event simulation, experimental design, random number generation, and statistical analysis. Prerequisite: CMPT 225, MACM 101, STAT 270.

Data communication fundamentals (data types, rates, and transmission media). Network architectures for local and wide areas. Communications protocols suitable for various architectures. ISO protocols and internetworking. Performance analysis under various loadings and channel error rates. Prerequisite: CMPT 225, CMPT/ENSC 150 and MATH 151 (MATH 150). MATH 154 or 157 with a grade of at least B+ may be substituted for MATH 151 (MATH 150).

This course covers the key components of a compiler for a high level programming language. Topics include lexical analysis, parsing, type checking, code generation and optimization. Students will work in teams to design and implement an actual compiler making use of tools such as lex and yacc. Prerequisite: MACM 201, (CMPT 150 or ENSC 215) and CMPT 225.

An introduction to distributed systems: systems consisting of multiple physical components connected over a network. Architectures of such systems, ranging from client-server to peer-to-peer. Distributed systems are analyzed via case studies of real network file systems, replicated systems, sensor networks and peer-to-peer systems. Hands-on experience designing and implementing a complex distributed system. Prerequisite: CMPT 300, 371. Students with credit for CMPT 401 before September 2008 may not take this course for further credit.

The basics of embedded system organization, hardware-software co-design, and programmable chip technologies are studied. Formal models and specification languages for capturing and analyzing the behavior of embedded systems. The design and use of tools for system partitioning and hardware/software co-design implementation, validation, and verification are also studied. Prerequisite: CMPT 250, 300.

This course covers the fundamentals of higher level network functionality such as remote procedure/object calls, name/address resolution, network file systems, network security and high speed connectivity/bridging/switching. Prerequisite: CMPT 300 and 371.

Current topics in computing systems depending on faculty and student interest. Prerequisite: CMPT 401 or 431.

Current topics in computer hardware depending on faculty and student interest. Prerequisite: CMPT/ENSC 250.

Topics include strategic planning and use of information systems, current and future technologies, technology assimilation, organizational learning, end-user computing, managing projects and people, managing production operations and networks, evaluating performance and benefits, crisis management and disaster recovery, security and control, financial accountability, and proactive management techniques for a changing environment. Prerequisite: CMPT 225.

Logical representations of data records. Data models. Studies of some popular file and database systems. Document retrieval. Other related issues such as database administration, data dictionary and security. Prerequisite: CMPT 225, MACM 101.

This course focuses on the computer-related problems of information system design and procedures of design implementation. Well-established design methodologies will be discussed, and case studies will be used to illustrate various techniques of system design. Prerequisite: CMPT 275 or 276; CMPT 354.

This course introduces students to the computing science principles underlying computational biology. The emphasis is on the design, analysis and implementation of computational techniques. Possible topics include algorithms for sequence alignment, database searching, gene finding, phylogeny and structure analysis. Prerequisite: CMPT 307. Students with credit for CMPT 341 may not take this course for further credit.

An advanced course on database systems which covers crash recovery, concurrency control, transaction processing, distributed database systems as the core material and a set of selected topics based on the new developments and research interests, such as object-oriented data models and systems, extended relational systems, deductive database systems, and security and integrity. Prerequisite: CMPT 300 and 354.

Introduction to the essentials of information retrieval and the applications of information retrieval in web search and web information systems. Topics include the major models of information retrieval, similarity search, text content search, link structures and web graphics, web mining and applications, crawling, search engines, and some advanced topics such as spam detection, online advertisement, and fraud detection in online auctions. Prerequisite: CMPT 354.

Current topics in database and information systems depending on faculty and student interest. Prerequisite: CMPT 354.

This course examines: two-tier/multi-tier client/server architectures; the architecture of a Web-based information system; web servers/browser; programming/scripting tools for clients and servers; database access; transport of programming objects; messaging systems; security; and applications (such as e-commerce and on-line learning). Prerequisite: CMPT 354.

Web service based systems are fundamentally different from traditional software systems. The conceptual and methodological differences between a standard software development process and the development of a web service based information system. The technology involved during the construction of their own web service based application in an extensive project. Prerequisite: CMPT 371.

Survey of modern software development methodology. Several software development process models will be examined, as will the general principles behind such models. Provides experience with different programming paradigms and their advantages and disadvantages during software development. Prerequisite: CMPT 276 or 275. Students with credit for CMPT 475 may not complete this course for further credit.

Abstraction principles and formalization techniques for modelling software systems in early design phases. Design is a creative activity calling for abstract models that facilitate reasoning about the key system attributes to ensure that these attributes are properly established prior to actually building a system. The focus is on specification and validation techniques rather than on formal verification. Prerequisite: MACM 101, 201. Recommended: CMPT 275.

Various concepts and principles underlying the design and use of modern programming languages are considered in the context of procedural, object-oriented, functional and logic programming languages. Topics include data and control structuring constructs, facilities for modularity and data abstraction, polymorphism, syntax, and formal semantics. Prerequisite: CMPT 225, MACM 101.

This course considers modelling and programming techniques appropriate for symbolic data domains such as mathematical expressions, logical formulas, grammars and programming languages. Topics include recursive and functional programming style, grammar-based data abstraction, simplification and reduction transformations, conversions to canonical form, environment data structures and interpreters, metaprogramming, pattern matching and theorem proving. Prerequisite: CMPT 225; MACM 101.

Factors in software quality include functionality, reliability, usability, efficiency, maintainability, and portability. Techniques for assessing the quality of software with respect to such factors, and methods for improving the quality of both software products and software development processes. Prerequisite: CMPT 373.

Students will study in-depth the techniques, tools and standards needed in the management of software development. Topics will include software process and quality standards, life cycle models, requirements specification issues, project estimation, planning and tracking, project management tools, team dynamics and management, configuration and change management techniques and tools, metrics, quality assurance and test techniques, professional and legal issues. Prerequisite: CMPT 275 or 276 and 15 units of upper division courses. Recommended: co-op experience. Students with credit for CMPT 373 may not take this course for further credit.

Introduces, at an accessible level, a formal framework for symbolic model checking, one of the most important verification methods. The techniques are illustrated with examples of verification of reactive systems and communication protocols. Students learn to work with a model checking tool. Prerequisite: CMPT 275 or 276.

Current topics in programming languages depending on faculty and student interest. Prerequisite: CMPT 383.

Analysis and design of data structures for lists, sets, trees, dictionaries, and priority queues. A selection of topics chosen from sorting, memory management, graphs and graph algorithms. Prerequisite: CMPT 225, MACM 201, MATH 151 (or MATH 150), and MATH 232 or 240.

This course introduces students to formal models of computations such as Turing machines and RAMs. Notions of tractability and intractability are discusses both with respect to computability and resource requirements. The relationship of these concepts to logic is also covered. Prerequisite: MACM 201.

The main cryptographic tools and primitives, their use in cryptographic applications; security and weaknesses of the current protocols. The notion of security, standard encryption schemes, digital signatures, zero-knowledge, selected other topics. Prerequisite: MACM 201. CMPT 307 and 308 are recommended.

Models of computation, methods of algorithm design; complexity of algorithms; algorithms on graphs, NP-completeness, approximation algorithms, selected topics. Prerequisite: CMPT 307.

Machine models and their equivalences, complexity classes, separation theorems, reductions, Cook's theorem, NP-completeness, the polynomial time hierarchy, boolean circuit models and parallel complexity theory, other topics of interest to the students and instructor. Prerequisite: CMPT 307.

Network design parameters and goals, dynamic networks and permutations, routing in direct networks, structured communication in direct networks, other topics of interest to the students and instructor. Prerequisite: CMPT 307 and 371.

Current topics in theoretical computing science depending on faculty and student interest. Prerequisite: CMPT 307.

Languages, grammars, automata and their applications to natural and formal language processing. Prerequisite: MACM 201. Quantitative.

A presentation of the problems commonly arising in numerical analysis and scientific computing and the basic methods for their solutions. Prerequisite: MATH 152 or 155 or 158, and MATH 232 or 240, and computing experience. Quantitative.

A first course in computer algebra also called symbolic computation. It covers data-structures and algorithms for mathematical objects, including polynomials, general mathematical formulae, long integer arithmetic, polynomial greatest common divisors, the Risch integration algorithm. Other topics include symbolic differentiation, simplification of formulae, and polynomial factorization. Students will learn Maple for use on assignments. Prerequisite: CMPT 307 or MATH 332 or MATH 340. Quantitative.

An introduction to the subject of modern cryptography. Classical methods for cryptography and how to break them, the data encryption standard (DES), the advanced encryption standard (AES), the RSA and ElGammal public key cryptosystems, digital signatures, secure hash functions and pseudo-random number generation. Algorithms for computing with long integers including the use of probabilistic algorithms. Prerequisite: (CMPT 201 or 225) and one of (MATH 340 or 332 or 342); or CMPT 405. Students with credit for MACM 498 between Fall 2003 and Spring 2006 may not take this course for further credit. Quantitative.

Linear programming modelling. The simplex method and its variants. Duality theory. Post-optimality analysis. Applications and software. Additional topics may include: game theory, network simplex algorithm, and convex sets. Prerequisite: MATH 150, 151, 154, or 157 and MATH 240 or 232. Quantitative.

The integers and mathematical proof. Relations and modular arithmetic. Rings and fields, polynomial rings, the Euclidean algorithm. The complex numbers and the fundamental theorem of algebra. Construction of finite fields, primitive elements in finite fields, and their application. Prerequisite: MATH 240 (or MATH 232 with a grade of at least B). Students with credit for MATH 332 may not take this course for further credit. Quantitative.

Structures and algorithms, generating elementary combinatorial objects, counting (integer partitions, set partitions, Catalan families), backtracking algorithms, branch and bound, heuristic search algorithms. Prerequisite: MACM 201 (with a grade of at least B-). Recommended: knowledge of a programming language. Quantitative.

Special topics in computing science at the 300 level. Topics that are of current interest or are not covered in regular curriculum will be offered from time to time depending on availability of faculty and student interest. Prerequisite: CMPT 225.

To be individually arranged. Prerequisite: Permission of Instructor and School.

To be individually arranged. Prerequisite: Permission of the department.

Independent study in topics selected in consultation with the supervising instructor(s) that are not covered by existing course offerings. Students must submit a proposal to the undergraduate chair, including the name and signature of the supervising faculty member(s). The proposal must include details of the material to be covered and the work to be submitted. Prerequisite: Students must have completed 90 units, including 15 units of upper division CMPT courses, and have a GPA of at least 3.00. The proposal must be submitted to the undergraduate chair at least 15 days in advance of the term. The proposal must be signed by the supervisor(s) and the undergraduate chair.

Students will select one project to be completed in their final year of study. Each student must complete a project report and make a project presentation. The project may include: a research survey, a project implementation, a research paper/report. Prerequisite: Submission of a satisfactory capstone project proposal.

Students must submit a proposal to the Undergraduate Chair, including the name and signature of the supervising faculty member(s). Students must complete a project report and make a project presentation. This course can satisfy the research project requirements for Computing Science honours students. Prerequisite: Students must have completed 90 units, including 15 units of upper division CMPT courses, and have a GPA of at least 3.00. The proposal must be submitted to the Undergraduate Chair at least 15 days in advance of the term. The proposal must be signed by the supervisor(s) and the undergraduate chair.