Lectures include stoichiometry, atomic structure and bonding, states of matter and intermolecular forces, chemistry of the elements.

Lectures include chemical kinetics, thermochemistry, thermodynamics, equilibrium, acids and bases, electrochemistry, and coordination chemistry.

Atoms and molecules, states of matter, chemistry of the elements.

Rates of reactions, thermodynamics and equilibrium, electrochemistry, modern applications of chemistry.

The correlation of structure and chemical bonding in carbon compounds with the physical properties and chemical reactivity of organic molecules. Discussion will be based on functional groups with emphasis on hydrocarbons and derivatives that contain halogens, oxygen, sulfur and the hydroxyl group. Introduction to stereochemistry, three dimensional structure, reaction mechanisms, especially addition to double bonds, nucleophilic substitution and elimination reactions, and methods of structure determination. The study covers the functional group chemistry of alkanes, alkenes, alkynes, alcohols, ethers and sulfides.

Continuation of the study of structural and chemical properties of the basic functional groups of organic compounds including aromatic compounds, aldehydes, ketones, carboxylic acids and their derivatives and amines. Illustration of these functional groups in natural products such as carbohydrates, amino acids and proteins, nucleic acids and lipids and discussion of the application of spectroscopic methods for structure determination in simple organic molecules.

This course provides an overview of computing science concepts for students with little or no programming background. Topics include representation of data, machine architecture, operating system concepts, properties of algorithms and computational problems, syntax of a high-level procedural programming language, basic data types and control structures. Students do introductory programming in this course.

An introduction to Computing Science in which you learn to solve simple problems by writing small computer programs in JAVA. This course presents a high-level object-oriented computing model based on objects as well as primitive data types, control structures and methods. It will be limited to basic elementary algorithms and techniques for constructing elegant and robust solutions to simple problems. The laboratories will offer you the opportunity to translate concepts presented in lectures into interesting application programs.

The course provides a review of programming principles (specification, implementation and testing), and an extension of object-oriented concepts from CS1140 including data abstraction, modular program construction and program reuse. The emphasis is on dynamic data structures (eg. lists, string, stacks, queues, tables), and their associated algorithms (eg. recursion, traversal, sorting, searching, hashing).

This course provides an introduction to computer communications and computer networks. Topics will include communication hardware and software, protocols, local area and wide area networks, and network management.

This course introduces you to the principles, methods, tools, and practices of a professional programmer working in a rich programming environment. The lectures focus on the fundamental principles of programming methodology based on abstract data types and their implementations. The laboratories offer an intensive apprenticeship opportunity for the aspiring software developer. You will use the programming languages C and C++ and software development tools supported by the Microsoft Windows and UNIX programming environment.

This course will provide education students with the basic skills for using the most common information technology tools currently applied in schools. The types of tools include Internet tools, digital media processing, multimedia/hypermedia presentations, spreadsheets, and databases. The course offers a number of advanced modules dealing with more complex topics in these areas plus additional tools such as those for editing digital video and sound.

The first course of a two course sequence on algorithm design and analysis stream, with the emphasis on the fundamentals such as searching, sorting and graph algorithms. Examples include divide and conquer, dynamic programming, greedy method, backtracking, and local search methods. Analysis techniques will be developed to aid in judging program efficiency.

This course introduces the fundamentals of PC hardware. Students will open up machines, install devices such as hard drives, I/O cards, video cards as well as memory, CD/DVD ROM drives, install operating systems, explore a variety of different software packages, attach communications equipment and supporting software. Topics include system hardware (e.g. motherboards, processors, storage devices, memory), device drivers, operating systems (e.g. Windows, Linux), troubleshooting and maintenance of LAN (lLocal Area Network)-based PC, etc.

General introduction to number representation, architecture and organization concepts of von Neumann machines, assemble level programming, exception handling, peripheral programming, floating point computations and memory management.

An introductory course to present the tools of set theory, logic and induction, and their use in the practice of reasoning about algorithms and programs. Basic set theory. The notion of a function. Counting. Propositional and predicate logic and their proof system will be studied. Inductive definitions and proofs by induction will be covered along with program specification and correctness.

The course includes basic concepts in computer data organization and information processing; hardware, physical organization, and access methods for fine storage; file I/O; introduction to database systems.

Formerly CT3110 Graphical input and output devices; segments; interactive input techniques; user interface design; windowing and clipping; 2D and 3D transformation; 3D modelling and viewing; hidden-line and hidden-surface removal.

Formerly CT3130 Introduction to computer communication networks. Digital data and voice transmission. Protocols for error and flow control, media access for LANs and MANs, routing and condition control, interconnection of networks. Introduction to recent advances in networks.

This course introduces the underlying concepts and essential techniques of Artificial Intelligence (AI). Topics cover core concepts in AI, such as intelligent agents, heuristic and adversarial search, game playing, knowledge representation and reasoning, making decisions, and machine learning fundamentals. The techniques and technologies mastered in this course will provide the foundational knowledge to design and implement various AI-based solutions to solve real-world problems across practice areas.