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.

covers fundamental programming concepts and introduces object-oriented programming using Python. Students learn how to use primitive data types, and create and use fundamental data structures. They learn problem solving techniques, and apply them by designing and implementing algorithms, including search and sort, and simple recursive functions. They learn how to use control constructs and implement file and exception handling.

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.

- inactive course.

- inactive course.

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.

- inactive course.

advances from Introduction to Programming and studies object-oriented programming and user interfaces. Additional topics include event-driven programming, program correctness, and simple refactoring. 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.

- inactive course.

- inactive course.

- inactive course.

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.

- inactive course.

covers the basic principles and tools needed to design and develop secure general computer software and websites. These include regulations and other non-technical aspects of security and privacy, as well as secure practices in developing software. The knowledge, skills, and tools learned will prepare the learner to design and develop software and websites without common security vulnerabilities and to be able to protect themselves and their team from basic attacks.

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.

focuses on the design, implementation, and evaluation of interactive computing systems. This course introduces the fundamental theories, methods, and research in human-computer interaction (HCI), with an emphasis on understanding human behaviour while interacting with technology, general knowledge of HCI design issues, and a human-centered approach to software design. Topics include design principles, methods for evaluating interfaces with or without user involvement, and techniques for prototyping and implementing user interfaces of various modalities.

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.

will give students basic knowledge on how to pre-process raw data. The aim is to enable students to perform data pre-processing in small and large data sets, evaluate the effect of pre-processing techniques using data mining/machine learning methods, and to scale up the pre-processing of large datasets using distributed frameworks.

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.

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.

covers advanced algorithm design techniques, including divide-and-conquer, greedy algorithms, dynamic programming and network flows. The emphasis is on algorithmic problem solving and algorithm design and analysis methodologies, rather than on specific algorithms. NP-completeness and methods for dealing with intractability will also be discussed.

examines various models of computation and their computational power. Several measures of a problem's computational difficulty will be discussed.

is open only to students who have been accepted into the Co-operative Internship in Computer Science. This course provides an opportunity for qualified students to obtain rewarding job experience of 8, 12 or 16 months of continuous duration in fields related to computer science during the course of their studies. A grade of NC (No Credit) will be awarded for this course if the student is continuing the co-operative internship into the next semester.

- inactive course.

- inactive course.

considers the fundamental aspects of programming for parallel architectures. Almost all modern computers contain multiple processing units, since individual processors have effectively reached peak performance. This course will focus on the considerations and challenges of writing parallel programs, particularly for multicore processors and graphics processing units. Topics will include threaded programming, vectorization, parallel design patterns, synchronization and workload balancing, high-performance computing, remote procedure calls, detecting failures, and cloud systems.

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.

- inactive course.

provides an introduction to mathematical formulation and practical aspects of robotic manipulators. It will present kinematics, dynamics, control and programming vital to the effective use of robotic arms. Moreover, a complete yet straightforward robotic manipulator model will be developed to demonstrate these concepts with the help of high-level languages and frameworks. The course will also address robotics sensing, perception, and Artificial Intelligence topics applied to robotic manipulation.

covers the theory and secure practices of using cryptography in computer systems, advanced common attacks on software and websites, security and privacy on cloud, over networks, on databases, and in machine learning. Finally, it introduces active defence, penetration testing, and forensics. The knowledge, skills, and tools learned will prepare the learner to design, develop, analyze, test, and maintain a system with non-generic security and privacy requirements.

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.

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.

- inactive course.

- inactive course.

- inactive course.

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.

- inactive course.

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.

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.

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.

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.

will be offered as departmental resources permit.

are consecutive linked courses, based on independent study of an approved topic in Computer Science. The topic is chosen in consultation with a Faculty Advisor. The research project and type of work required from the student will depend on the project and can involve literature review; developing methodologies; collecting, analyzing and presenting data; writing code; interpreting results and determining the significance of findings. Deliverables include a dissertation proposal, formal written report and a departmental presentation.