Computer Science Department

This course introduces coding for everyday problem solving. Programming fundamentals are introduced with an intuitive programming language and a simple programming environment. The students will obtain first-hand experience with live coding examples and exercises. Students from all disciplines can learn to develop their programming abilities without any prior knowledge. For computer science major and honours students CSCI 128 may be used only as an approved or open elective. Students who have received credit for CSCI 161 or equivalent are not permitted to enrol in CSCI 128. Three credits.

This course enables students to use a variety of software tools to assist in their post-secondary studies and future careers. The course covers a broad range of information and communication tools essential for analyzing and presenting data, communicating information, organizing and writing papers, and preparing talks, slide presentations and posters. Webpage management is introduced. Topics covered support students in education, business, humanities and the health/social/physical sciences. For computer science major and honours students CSCI 135 may be available only as an approved or open elective. Three credits.

An introduction to computers, algorithms and programming. Topics include problem analysis, algorithm development, data representation, control structures, arrays, and file manipulation. Three credits and two-hour lab.

Continuing from the material in CSCI 161, this course covers memory management and data abstraction via classes and objects, and introduces the linear data structures lists, stacks, and queues. Structured programming is encouraged via modular development. Prerequisite: CSCI 161. Three credits and two-hour lab.

This course exposes students to the various impacts of technology on modern society with the goal of further developing their critical thinking and their ability to make informed decisions in this rapidly changing information age. Topics covered include privacy and security, biotechnology, cybercrime, genetic engineering, artificial intelligence, digitization and intellectual property, ethical issues in computing. Other topics and/or their emphasis may vary by semester. Students from every background will benefit from this course. Three credits.

The course will provide students with the basic understanding of the theory and practice of data science and its applications in different real-world domains. Student will also gain practical skills in handling structured and unstructured data, analyzing and visualizing data, data mining, as well as gain hands-on experience of software tools and apply the basic techniques to their own different scientific, engineering and business applications. Prerequisite: One of CSCI 125, 128, 161 or 225. Three credits.

This course provides a deep investigation of foundational data structures and algorithms. Criteria for selecting appropriate data structures and algorithms for a given problem are presented. General problem solving is emphasized throughout the course. Specific topics include stacks, queues, lists, trees, searching, sorting, traversals, recursion, graphs, hashing, and complexity analysis. Prerequisite: CSCI 162. Three credits and two-hour lab.

This course covers basic computer arithmetic, architectures, and instruction sets; in-depth study of the central processing unit, memory and input/output organization; and microprogramming and interfacing. Prerequisite: CSCI 162. Three credits and two-hour lab.

An introduction to the theory and practice associated with the design and implementation of databases. Topics include database models (relational model in detail), design, normalization, transactions, SQL, and a DBMS. Credit will be granted for only one of CSCI 275 or BSAD 384. Prerequisite: CSCI 162. Three credits.

An introduction to sets, binary relations and operations; induction and recursion; partially ordered sets; simple combinations; truth tables; Boolean algebras and elementary group theory, with applications to logic networks, trees and languages; binary coding theory and finite-state machines. Cross-listed as MATH 277. Prerequisites: MATH 101, 102 or 107 or 127 or 122 or CSCI 162. Three credits.

An introduction to the design, analysis, and implementation of algorithms to solve common computational problems. Basic algorithm design techniques such as the greedy strategy, divide-and-conquer, and dynamic programming, as well as network flows, intractability, and NP-completeness will be discussed. Prerequisites: CSCI 255, 277. Three credits and two-hour lab.

An introduction to the theoretical foundations of computer science, examining finite automata, context-free grammars, Turing machines, decidability and undecidability, and complexity theory. Strategies will be developed to help categorize problems as tractable or intractable. Prerequisites: CSCI 255, 277. Three credits.

This course covers communication systems; environments and components; common carrier services; network control, design and management; distributed and local networks. Prerequisite: CSCI 255. Three credits and two-hour lab.

An overview of operating systems functions: file management, CPU scheduling, process management, synchronization, memory management, and deadlock handling. UNIX will be introduced and used in this course. Prerequisite: CSCI 255 and CSCI 263. Three credits and two-hour lab.

The course covers techniques for the design and management of large software projects, including structured programming, debugging, and testing methodologies. Examples of large systems will be provided and a programming project will be completed. Prerequisite: CSCI 255. Three credits.

Students will prepare and present a thesis based on original research conducted under the supervision of a faculty member. Credit will be granted for only one of CSCI 490 or CSCI 493. Restricted to students in the honours program. Required for honours students. Six credits.

The purpose of this non-credit course is to assist students in carrying out research, composition, and oral presentation. Students will present a project topic in the fall term and their project in the spring. Attendance at departmental seminars is mandatory. No credit.

An introduction to the core concepts of artificial intelligence, including state space, heuristic search techniques, knowledge representation, logical inference, uncertain reasoning, and machine learning. Specific methods covered include neural networks, genetic algorithms, and reinforcement learning. Prerequisites: CSCI 255, 263, 277. Three credits.

This course focuses on automated theorem proving. We start with a rigorous treatment of propositional and first order calculus (with equality) and the method of natural deduction, giving a thorough investigation of the soundness and completeness proofs and decidability. Then we compare and contrast several automated theorem proving methods such as tableau, resolution, sequent style calculus and rewrite systems. Extensions to other logics will be discussed. Students will implement one of the automated theorem proving methods. Three credits.