takes a breadth-first overview approach to the discussion of important aspects of computer science including fundamentals in algorithms, binary data representation, Boolean logic, systems software, networking concepts, introductory programming, databases, and selected Computer Science subfields.

is an introduction to fundamental programming techniques, primitive data types, and to simple algorithms and their design concepts.

introduces methods of reasoning and logic tools that underlie computer science. In particular, this course covers propositional and predicate logic, sets and other discrete structures, as well as modular arithmetic and basic counting, with emphasis on their applications in computer science.

provides an in-depth introduction to foundational topics in computer science: algorithms and data structures, theory of computing, machine architecture and their historical context.

will give an overview of the development of computing technologies over the last 75 years as well as both the perception of these technologies by, and their impact on, society. The course will be organized chronologically by decade, and within each decade will examine the dominant computing developments, their image in various print and pictorial media, and their social impact. The aim is to give students of all disciplines an appreciation of the abilities and limitations of computer technology and how such technologies interact with society.

will both examine and counter common misconceptions about computing and the computing profession. This will be done by contrasting depictions of various aspects of computing in various movies and documentaries produced over the last 60 years with the reality of these aspects as given in selected readings and course lecture notes.

introduces students to basic programming in the context of numerical methods with the goal of providing the foundation necessary to handle larger scientific programming projects. Numerical methods to solve selected problems from Physics, Chemistry, and Mathematics will be covered.

offers an overview of information technology. It provides students with an understanding of basic concepts and necessary skills required to use spreadsheet, database and presentation software to manage, analyze, and present data.

is a survey of computation as a means of understanding, modelling, and describing artificial and natural systems. The emergence of complex behaviour from the interaction of simple rules governing individual components is illustrated and discussed, as well as the role of communication between system components. Selected systems to be studied will be drawn from different topic areas which may include the worldwide web, the mind (cognitive science), formal logic, autonomous robotics, chaos and fractals, and bioinformatics. Each topic will incorporate an associated laboratory experience.

advances from Introduction to Programming and studies object-oriented programming. Additional topics include event-driven programming, program correctness and simple refactoring, as well as interfaces and human-computer interaction. A brief overview of programming languages is also provided.

covers fundamental data structures, algorithms and algorithm design techniques. A problem-driven course, it focuses on computational problem solving from designing an efficient algorithm to implementing it using appropriate data structures.

introduces computer architecture at the digital logic implementation level, at the instruction set level, and at the level where programming languages are translated into the underlying machine instructions.

introduces fundamental techniques for interfacing between computer software and hardware platforms, including the composition of, and connections within, a multilevel operating system. Students learn how to design substantial parts of an operating system.

introduces students to the different software process models, to project management and the software requirements engineering process, as well as to systems analysis and design as a problem-solving activity.

introduces students to the use of programming interfaces for computer networking and to understand how the Internet works on the level of protocols. It focuses on the most commonly used of those protocols that are in the vast majority of modern computer systems.

introduces the basic knowledge needed for managing large volumes of data. It covers topics in information management and database systems from storage and retrieval to security and privacy of data.

covers ethical and social considerations of computing to provide students with the basis to address these issues by ethical and technical actions. Case studies are used to illustrate ethical and social issues of computing.

covers the analysis of social network structures, the flow of data within them and the methods to extract useful information about these networks, their participants and the content of their communication. Security and trust issues are also covered.

is an introduction to programming and computer science with an emphasis on the development of multimedia applications. The course introduces the fundamental principles of programming, including object-oriented and event-driven programming. Students will develop an understanding of how to use and create classes and methods and combine them with multimedia libraries to produce animations, handle input from keyboard and mouse, and import sounds and videos to produce multimedia applications which can be directly deployed on the Internet.

introduces the use of scripting languages to solve common data analysis tasks. The control structures and expressions of the language are first discussed. Script solution to storing/retrieving data sets, searching data sets, and performing numeric and statistical calculation are covered. Plotting and visualization for data sets are also presented.

is a comprehensive treatment of the C/C++ programming languages. It is intended for students with some first programming experience. This course starts with a discussion of fundamentals of C and C++, moves on to the object-oriented aspects of C++, and introduces some advanced topics. It is an essential course for mastering the power of this rich programming language.

covers tools, work flows and concepts used in software development in a concentrated introductory set of topics. The essential work flows (with their underlying concepts) used to edit, build, test, combine with existing software and find existing software are introduced. The tools covered include text editors, programming language translators, file management tools, debuggers, scripting tools, source control tools, and building, testing and deployment tools. The architecture and use of an Integrated Development Environment are discussed.

studies the Web information system from a programming perspective. It teaches how Web data are transferred across the network, how to design interactive browser contents, and how to provide dynamic pages from the server.

covers basic algorithmic techniques and data structures that are used to embed basic intelligent behaviors, such as problem solving, reasoning and learning in software systems and agents.

provides an overview of popular nature-inspired computing methods. Methods that are inspired by both biological and non-biological systems are considered. These methods have been applied to solve problems in various areas of computing such as optimization, machine learning, and robotics. Particular examples of nature-inspired computing methods studied include cellular automata, neural networks, evolutionary computing, swarm intelligence, artificial life, and complex networks. Contributions made in the field of nature-inspired computing that have led to advances in the natural sciences are also discussed.

introduces concepts and algorithms in machine learning for regression and classification tasks. The course gives the student the basic ideas and intuition behind model selection and evaluation, and selected machine learning methods such as random forests, support vector machines, and hidden Markov models.

provides exposure to traditional desktop, mobile and games contexts with respect to interaction design theory and practice. The impact of context on design principles is explored. An introduction to each programming context will be provided and a minimal set of software development tools for each context will be introduced. Practical application of interaction design principles will involve design and prototyping of desktop, mobile and games applications.

provides students with the fundamental knowledge and skills in the fields of computer vision, computer graphics, and visualization. Visual perception is responsible for most of our impressions about the world around us. This course introduces how computers are used to both mimic the human visual system (e.g., recognize shapes) and to create visual content (e.g. synthesize images). Related techniques on image synthesis, processing and analysis are discussed under a unified framework. How visual computing principles were used to create visual effects in movies and commercials is also examined.

introduces students to the basic concepts and techniques for data mining and knowledge discovery. Students will develop an understanding of the essential data mining technologies, and be able to design and evaluate methods for simple data mining applications.

(same as Biology 3951) deals with the development and application of computational methods to address biological problems. The course will focus on the fundamental concepts, ideas and related biological applications of existing bioinformatics tools. This course will provide hands-on experience in applying bioinformatics software tools and online databases to analyze experimental biological data, and it will also introduce scripting language tools typically used to automate some biological data analysis tasks.

is a course for students who are admitted to CICS. Students are required to register for this non-credit course every semester during their internship. This course is open only to students who have been accepted into the Internship Program and provides an opportunity for qualified students to obtain rewarding job experience of 8, 12 or 16 months of continuous duration, during the course of their studies.

is a study of several programming languages of vocational significance. The use of appropriate programming paradigms to solve some significant problems will be illustrated.

demonstrates the tools and techniques used in the construction of small software systems. The software tools and techniques to be covered include analysis and design of software components, software construction tools (e.g. linkers, builders, debuggers), software library use and design, and system integration.

is an introduction to formal algorithmic problem solving. Various algorithm design techniques that sometimes yield efficient solutions are studied. Deterministic and nondeterministic machines (finite state automata, pushdown automata and Turing machines) are discussed and used to efficiently solve problems such as the String Matching Problem, the parsing of Context-free Languages, and to introduce the theory of NP-completeness. In addition, Turing machines are used to prove the unsolvability of certain problems. Tractable, intractable and undecidable problems are contrasted. Basic issues related to parallelization are discussed as well.

main objectives are the development of algorithms for the numerical solution of mathematical problems and the study of the numerical stability of these algorithms. The efficiency of these algorithms with respect to speed and storage requirements is considered as well. Emphasis is also placed on the study of the sensitivity of selected problems to perturbations in the data. There is also a brief introduction to the development of numerical algorithms that take advantage of advanced computer architectures, such as pipeline processors, array processors and parallel processors.

is an introduction to the Linear Programming Problem (LPP). The emphasis is placed upon developing the most recent and numerically reliable algorithms for the solution of the Linear Programming Problem. The numerical stability of these algorithms will be examined as well. Geometric understanding of the LPP. Simplex method for the LPP. Sparse matrix LPP. Duality and postoptimality analysis. Extensions to the simplex algorithm. Principles of interior algorithms for the LPP.

is an introductory course for students interested in learning the fundamentals of game programming. Topics include vector math for games, fundamentals of rendering, introduction to animation and artificial intelligence, collision detection, game physics and user-interfaces. Students are required to write a fully functional game during the course.

(same as Engineering 8814) studies how to develop methods that enable a machine to “understand” or analyze images. The course introduces the fundamental problems in computer vision and the state-of-the-art approaches that address them. Topics include feature detection and matching, geometric and multi-view vision, structure from X, segmentation, object tracking and visual recognition.

introduces the students to the state-of-the-art concepts and developments in the field of 3D computer graphics. The underlying algorithms, as well as the basic techniques to develop interactive 3D graphics systems including games and simulators, are presented. Topics of the course include 3D geometrical transformations, 3D projections, 3D modeling and rendering, 3D graphics languages and systems. Advanced photorealistic rendering and image-based rendering techniques may also be covered.

provides an introduction to specific state-of-the-art algorithmic techniques and data structures that are used to efficiently implement human-like abilities (e.g., awareness, memory, rational decision-making (under uncertainty), movement, co-operation in groups) in computer game agents.

covers interactive representation of data using a modern programming library. Topics include an introduction to the software platform and the principles for data selection, analysis, design and creation of dynamic visualizations. Students produce interactive web-based objects, addressing problems in the presentation and understanding of large data collections. The techniques discussed are applicable to different sources and types of data.

(same as Biology 4606) provides students with the basis to analyse a variety of biological data within an integrated programming environment for data manipulation, calculation and graphical display. Students will learn to extract meaningful information from data generated by high-throughput experimentation. The course will introduce one such integrated programming environment and will explore the computational and statistical foundations of the most commonly used biological data analysis procedures.

covers programming language design considerations; syntactic and semantic structure; survey of typical features and operations; analysis of facilities for control and data structuring; language extensibility; execution models; formal specification of programming languages.

studies properties of formal grammars and languages; syntax-directed parsing and code generation; top-down and bottom-up parsing methods; LL(k) and LR(k) grammars and parsers; Code optimization; compiler writing tools.

will have topics to be studied announced by the Department.

surveys the major topics of software engineering. Areas covered include: requirements capture, system design and design approaches, verification and validation (including formal methods and testing), and management of the software development process.

studies the design and implementation of an operating system’s kernel. The main components used in operating system implementations include: context switches, process management, memory management, interprocess communication, file systems and system calls. The data structures and algorithms used in implementing the above components are studied. The different architectural styles of kernel implementation are also considered. Real-time operating systems are also discussed.

examines the architecture and instruction sets for several microprocessors. The use of microprocessors as device controllers; comparisons of hardware and programmed techniques; microprocessor interfacing with external devices; methods of I/O; bus structures; modern microprocessor support devices are discussed.

will have topics to be studied announced by the Department.

is an introduction to linear algebra; solution to linear systems; scaling, improving and estimating accuracy; the linear least squares problem; the eigenvalue problem; singular value decomposition of a matrix; the generalized eigenvalue problem.

will have topics to be studied announced by the Department.

will give an overview of techniques for the design of efficient optimal-solution and heuristic algorithms. It will include an introduction to various advanced data structures for set and string processing that are used to further optimize algorithm efficiency.

is an in-depth study of various types of formal machines and their associated languages. Effective computability and other formalisms, such as lambda calculus will be studied as well.

is an in-depth discussion of computational complexity theory. Topics covered in the course include: models of computation (for both serial and parallel computations); complexity measures; reducibility; complexity classes (NP, PSPACE, NC, LOGSPACE and P); and randomized computations.

discusses classical problems in combinatorial optimization and graph algorithms, including matching, colorability, independent sets, isomorphism, network flows and scheduling. Special families of graphs are discussed and algorithms that would otherwise be NP-hard or complete are shown to be polynomial time when restricted to such families.

will have topics to be studied announced by the Department.

covers tasks involving human languages, such as speech recognition, text understanding, and keyword-based information retrieval which underlie many modern computing applications and their interfaces. To be truly useful, such natural language processing must be both efficient and robust. This course will give an introduction to the algorithms and data structures used to solve key NLP tasks, including utterance understanding and generation and language acquisition, in both of the major algorithmic paradigms used today (rule-based and statistical). The emphasis will be primarily on text-based processing though speech-based processing will be addressed where possible.

introduces students to database processing, database management systems and database design considerations. It will cover the theory and methodologies essential for the relational database design, implementation, manipulation, optimization and management.

will centre on the key analytical and algorithmic tools and concepts of digital image processing. Topics will include Transformations, Enhancement, Encoding, Data Bases, Segmentation and Description.

looks at how the operation of computer networks requires the following: a) communication between two computers, b) information transfer between two computers not directly connected, and c) services that need computer communication. This course focuses on the standard solutions and services used to fulfill the previous requirements. These include: physical transmission of signals, reliable communication based on unreliable communication channels, the routing of messages between connected computers to reach computers that are not directly connected, e-mail, file transfer, name servers, remote terminal access and the World Wide Web. Particular attention will be placed on the workings of the Internet.

will give an overview of computational problems and algorithms for these problems associated with a variety of analyses of biological molecular data.

examines the fundamental constraints, technologies, and algorithms of autonomous robotics. The focus of this course will be on computational aspects of autonomous wheeled mobile robots. The following topics will be covered: major paradigms in robotics, methods of locomotion, kinematics, simple control systems, sensor technologies, stereo vision, feature extraction, modelling uncertainty of sensors and positional information, localization, SLAM, obstacle avoidance, and 2-D path planning.

focuses on the design and implementation of software in a mobile networking environment. The primary topics to be covered in this course include software engineering, network computing, graphics programming, and human-computer interaction for mobile devices. A modern mobile device with advanced networking and graphic features, including multi-touch interaction and motion sensors will be used as the primary platform for development in this course.

has as its main objective to develop a working prototype of a software system as a team effort. A group of students will work on a project for a term, experiencing the advantages and difficulties of team projects.

introduces computer science honours students to research activities, familiarizes them with a special problem in computer science, and provides independent study on an advanced topic under the direct supervision of a member of the computer science faculty. The topic is decided in consultation with the supervisor. The student is required to produce a written report on the project, to include the literature search on the topic, and to present this work at a departmental seminar prior to the last week of the semester.

will be offered as departmental resources permit.