A survey of computer systems and software. An introduction to computer programming and data organization. An emphasis on using application packages for personal and business use. The social impact of computing. Not recommended for students with previous computer science background.

An introduction to computer hardware and software, data organization, problem-solving and programming. Exposure to application packages for personal and business use. For students who wish a balance between programming and the use of software packages.

Introductory problem-solving, programming and data organization techniques required for scientific applications using a general purpose programming language. Topics include control structures, data representation and manipulation, and interfacing to applications software. For students who require a good understanding of programming but are not planning on taking additional specialist Computing and Information Science courses.

Technically intensive introduction to object-oriented programming and problem solving concepts. Control and basic data structures, objects, class libraries, organizational approaches, and basic algorithms are introduced. This course is required for students in a Computing and Information Science major or minor programme and for those wishing to take additional computing courses.

Provides a foundation in finite mathematics which is required for further computer science courses. Abstract representation of structures and algorithms. Topics include graph theory, logic, and set theory.

This course is intended to introduce the student to techniques in modern applications development using current technologies and practices. The emphasis of the first part of the course ranges from building and maintaining WEB sites to search engines and multimedia presentations. The second part of the course is concerned with building and maintaining simple databases as needed for the management of scientific data. This is done in conjunction with packages for mathematical and statistical analysis, and presentation techniques. Cannot be taken for credit by B.A. or B.SC. students taking a major or minor in Computing and Information Science.

An advanced examination of data structures. Their representation in both a high-level programming language and as abstractions. Analysis of algorithms, comparative performance, and complexity. Structures include trees, graphs, hashtables, sets, object-oriented hierarchies, and templates.

Techniques and tools used in the development of large software systems. Methods for organizing and constructing modular systems, manipulating files, an introduction to interface design, and use of databases. Software tools for managing projects, database connectivity, configuration management, and system application programmer interfaces.

A sequel to CIS*1650 Structured Programming using a general purpose procedural language. Topics include string processing, record manipulation in memory and on disk, static and dynamic data structures, recursion, and pointers. Fundamental algorithms are introduced for sorting, searching, text processing and other important tasks.

Operating Systems in theory and practice. Components in a system: scheduling and resource allocation; process management, multi-programming, multi-tasking; I/O control and file systems; mechanisms for client-server computing. Examples from contemporary operating systems.

Boolean algebra, minimization of Boolean expressions. Design of combinational and sequential logic circuits. Memory design. Control, ALU, bus design. Microprogramming and CPU design.

Examination of the software engineering process and the production of reliable systems. Techniques for the design and development of complex software. Topics include formal specifications, risk analysis, quality assurance, metrics, standards, integration, safety critical issues and ethics.

An introduction to the issues and techniques encountered in the design and construction of software systems. The theory and models of software evolution. Topics include quality, requirements and specifications, prototyping, design principles, object-oriented analysis and design, testing and debugging.

Simulation model classification. Continuous and discrete languages. Process and transaction oriented systems. GPSS: entities, processing logic, chains, queue disciplines. Random number generators. Design and optimization of simulation applications and validation techniques.

The design and analysis of efficient computer algorithms: standard methodologies, asymptotic behaviour, optimality, lower bounds, implementation considerations, graph algorithms, matrix computations (e.g. Strassen's method), NP-completeness.

Review of data organization and data management principles with the perspective of analyzing applications suitable for implementation using a DBMS. Analysis of several data base models, query specification methods, and query processing techniques. Overview of several related issues including concurrency control, security, integrity and recovery. Student's are expected to demonstrate concepts through project assignments.

A critical appraisal of programming languages, language paradigms, implementations of selected language concepts. Introduction to formal language specification. Compilation techniques, including parsing and code generation.

Central processor architectures, control and microprogramming, memory systems, special architectures, underlying support for special architectures, architectures suitable for very large scale integration. Offered in even-numbered years and may be offered in odd-numbered years.

Fundamental concepts of coding and information theory. Communication technology. Design and behaviour of long haul and local area computer networks, with special emphasis on protocols and packet switched networks.

Methods for user interface software design, including interface representations and testing. Evaluation and design of sample application systems. Impacts of computer-based information systems on individuals and organizations. Implementation and testing tools. Planning of learning stages and design of assistance subsystems. Offered in odd-numbered years and may be offered in even-numbered years.

This course addresses the basic concepts and methodologies used to build distributed systems applications, using either the UNIX or the Microsoft platforms. The course deals with building information infrastructures involving a base network layer, middleware and application layer. The emphasis is on the enabling methodologies for building complex distributed information systems.

Advanced techniques for information management. Analysis of advanced indexing structures. Information retrieval, feedback strategies, text searchings, automatic indexing. Database query optimization and system support. Web based retrieval. Offered in even-numbered years and may be offered in odd-numbered years.

A variety of advanced topics mainly from areas within general information processing. Subject areas discussed in any particular semester will depend on the interests of the students and the instructor. Students should check with the Department of Computing and Information Science to determine what topic will be offered during specific semesters and which prerequisites, if any, are appropriate.

A variety of advanced topics within Computing Science. Subject areas discussed in any particular semester will depend upon the interests of both the students and the instructor. Students should check with the Department of Computing and Information Science to determine what topic will be offered during specific semesters and which prerequisites, if any, are appropriate.

An introduction to finite automata, formal languages and sequential machines. Models of computation, including Turing machines and the hierarchy of machines/languages. Decidability and computability.

The following topics will be covered in some detail: heuristic search, A* algorithms, game searches, logic based knowledge representation. Other knowledge representation methods will be introduced, especially frames, scripts, semantic nets and models of uncertain reasoning. An introduction to expert systems. These ideas will be further explored through the development of a substantial project using A.I. software tools. Time permitting, topics such as perception, pattern recognition, natural language understanding etc. may be discussed. Offered in even-numbered years and may be offered in odd-numbered years.

Image enhancement, image smoothing, thresholding, segmentation, region growing, decision-theoretical methods, information theory, neural networks, syntactic/structural methods, applications. Computer graphic experience expected. Offered in odd-numbered years and may be offered in even-numbered years.

Introduction to computer graphics. Topics include graphics programming concepts, geometrical transformations, viewing 3-D projections, raster graphics, sculptured surfaces, hidden line removal, image processing and other special topics. Practical issues will be covered by assignment using currently available graphics equipment.

Planning, developing and writing a research proposal under individual faculty supervision. The course, in continuation with CIS*4910 provides senior undergraduates an opportunity to pursue an independent course of study. The topic selected will be determined by agreement between the student and the faculty member with expertise in the area.

This course is a continuation of CIS*4900. The student will conduct and write an undergraduate thesis under the individual supervision of a faculty member. In addition the student is required to present his/her work in a seminar and also participate in the critical analysis and review of the work of other students taking this course.