CS 354
Prereq/Coreq: EL E 427
Course Descriptions 16:49
Electrical Engineering
Computer Science (CS)
51 courses in the 1989–90 Undergraduate Calendar, read from the scanned original. The text comes from OCR, so check the scanned page before relying on a detail.
CS 100 Introduction to Computer UsageF,W,S 2C,2L 0.5
An introduction to universally applicable computer services. Hands-on experience with common software and hardware, supported by examples of applications and social implications chosen from many disciplines. Topics include: electronic mail, word processing, spreadsheets, record management, and hardware and software concepts.’
Antireq: CS 131, 132
CS 100 cannot be counted for credit toward a BMath Honours or four-year General degree.
CS 102 Intreduction to Computer ProgrammingF,W,S 3C,2L 0.5
Fundamental techniques of algorithm design and program development. Introduction to a programming language applicable to the student's field of study. Topics include: structured programming, simple data elements, sequential operations, iterative statements, selection statements, data aggregations, functions and subroutines.
Prereq: Computer literacy (e.g. CS 100 or extensive high school computing)
Antireq: CS 131, 132
Divisions of the course will be application-oriented: CS 102 COM (commerce), CS 102 SCI (sciences).
CS 102 SSC (social sciences), and CS
102 HUM (humanities). Not all divisions will be offered each term.
CS 102 cannot be counted for credit toward a BMath Honours or four-year General dagree.
CS 131 Principles of Computer Science 1F,W,S 3C,1T,3L 0.5
An introduction to the use of computers in problem solving, including an overview of computer science, introduction to algorithms and structured programming, correctness and efficiency, file and data base management, communications and networks. Labs will emphasize hands-on exposure to modern applications software and to the use and development of appropriate software tools.
Prereq: Full-time degree registration in the Faculty of Mathematics
Antireq: CS 100, 140, 180, 212, 234, 235, 240, 250
Also offered at St. Jerome's College in the Fall term
CS 132 Principles of Computer Science 2F,W,S 3C,1T,3L. 0.5
An introduction to data representation and numerical problem solving, including an overview of programming systems and machine architectures, linked lists, hashing techniques, dynamic storage allocation, techniques for zero-finding and area-finding, solving linear equations, simulation and decidability. Labs will emphasize hands-on exposure to the use and development of appropriate software tools.
Prereq: CS 131 and full-time degree registration in the Faculty of Mathematics
Antireq: CS 100, 102, 140, 180, 212, 234, 235, 240, 250
Also offered at St. Jerome's Coliege in the Winter term
CS 212 Programming Principles and PracticeF,W,S 3C 0.5
High-level languages, including their specification and translation. Structured programming. Use of data structures, including lists and trees. Recursion: Sorting. Introduction to computational complexity and correctness.
Prereq: One of CS 102, 140, or equivalent
Antireq: CS 131, 132, 234, 240, 241, 242
CS 212 cannot be counted for credit toward a BMath Honours or four-year General degree.
Course Descriptions 16:105 Mathematics.
Computer Science
CS 230 Introduction to Computers and Computer SystemsF,W 3C 0.5
Basic computer architecture. Machine language and assembly language. I/O and interrupt handling. CPU scheduling, memory management, and file systems. Computer networks and data communications. Prereq: One of CS 132, 212 Antireq: CS 117, 235, 241, 242, 250, EL E 222
CS 241 Principles of Computer Science 3F,W 2C,1T 0.5
The relationship between high-levet languages and the computer architecture that underlies their implementation, including basic machine architecture, assemblers, specification and translation of programming languages, linkers and loaders, block-structured languages, parameter passing mechanisms, and comparison of programming languages.
Prereq: CS 132 and an all-inclusive cumulative math average of at least 60%
Antireq: CS 212, 230, 234, 235, 240, 250
CS 242 Principies of Computer Science 4F,W,S 2C,1T 0.5
The function of modern operating systems and their relationship to the computer architecture that underlies their implementation, including file systems, I/O and interrupt handling, CPU scheduling and swapping, memory management, parallel processing. The course also includes an overview of computer networking, performance monitoring, modeling and simulation, and the social implications of computing.
Prereq: CS 241
Antireq: CS 117, 212, 230, 234, 235, 240, 250
CS 316 Introduction to Statistical Problem Solving by ComputerW 3C,1L 0.5
This is an applications oriented course which prepares the nonmathematica) student to use the computer as a research tool. Topics include aids for statistical analysis and the preparation of documents such as reports and theses. The course provides sufficient background for application to other problems specific to the individual's field.
Prereq: One statistics course and computer literacy (e.g. CS 100 or high school computing), or consent of instructor
CS 316 cannot be counted for credit toward a BMath degree.
16:106 Course Descriptions Mathematics: Computer Science
CS 330 Introduction to Business SystemsF,W,S 3C 0.5
A study of application software systems in the business environment. Topics include data models of business functions, file and data base systems, and integrated accounting systems. Students modify an integrated accounting system and also work with a selection of commercially available software systems.
Prereq: One of CS 102, 132, 140, 180, or equivalent, and a knowledge of accounting (e.g. ACC 101 or ACC 121/122).
CS 330 cannot be counted for credit in a Computer Science Major program.
CS 334 Data Types and StructuresF,S 3C 0.5
Top-down design of data structures. Using representation- independent data types. Introduction to commonly used data types, including lists, sets, mappings, and trees. Selection of data representation. .
Prereq: CS 230 or 234, and thirdyear standing
Antireq: CS 340
CS 334 cannot be counted for credit in a Computer Science Major program.
CS 335 Computing SystemsW 3C 0.5
A study of those hardware and software .
components comprising a computing system, with an emphasis on the role of operating systems in the support of programming activities. Topics include: computer architecture; input/output; operating systems; linkers, loaders, and libraries.
Prereq: CS 230 or (CS 234 and 235)
Antireq: CS 350, 351
CS 335 cannot be counted for credit in a Computer Science Major program.
CS 337 Introduction to Numerical AnalysisW 3C 0.5
Pitfalls in computation; solution of linear algebraic equations; polynomial interpolation; least squares; numerical integration and differentiation. The intent is to expose students to the theory behind modern algorithms for solving mathematical problems.
Prereq: CS 132 or 140, MATH 1348 or 136, MATH 1308 or 138, and thirdyear standing. MATH 235 or (MATH 230B and 234A) is recommended.
Antireq: CS 372, 374
CS 337 cannot be counted for credit in a Computer Science Major program.
CS 340 Data StructuresF,W,S 3C 0.5
Levels of data description and their role in the design of structures. Design of data representations for primary and secondary store. Introduction to the analysis of algorithms.
Prereq: CS 240 or 242, C&O 230, and third-year standing in a Computer Science Major program
Antireq: CS 334
CS 350 Machine StructuresF,W 3C 0.5
The intent is to give a basic understanding of what goes on inside a computer, of machine architecture, and of some fundamental operating system services. Topics include: detailed introduction to hardware; representation of data; memory; central processor; addressing schemes; inpuVoutput; linking and toading.
Prereq: CS 250 or EL E 222, and third-year standing in a Computer Science Major program. CS 358 or EL E 323 is strongly recommended.
Antireq: CS 242, 335, 351
The final offering wil! be Winter, 1990..
CS 351 Digital Design and ArchitectureF,W,S 3C 0.5
Boolean atgebra. Design and analysis of both combinational and sequential circuits. Registers, counters, memory, programmable logic. CPU control logic, the arithmetic-logic unit. Input/output and interrupts.
Prereq: CS 242 and third-year standing in a Computer Science Major program .
Antireq: CS 335, 350, 358, EL E 323
CS 354 Software SystemsF,W 3C 0.5
An introduction to the system software of modern computing systems, with an emphasis on the management of hardware resources and the support of multiple processes. Major topics: object-oriented programming, critical sections and synchronization, primitives for concurrency control, the deadlock problem, memory management, file systems, introduction to distributed computing.
Prereq: CS 340 and third-year standing in a Computer Science Major program. CS 351 is recommended.
This course has been revised for students who have taken CS 242. Winter, 1990 will be the last offering of the old version and simultaneously the first offering of the new version. In that term, students who have taken CS 241, 242 should select the MCS division of CS 354; students who have taken CS 240, 250 should select the MCQ division.
CS 360 Introduction to the Theory of ComputingF,W 3C 0.5
Models of computers including finite automata and Turing machines. Basics of formal languages with applications to syntax of programming languages. Unsolvable problems and their relevance to the semantics of programming. Concepts of computational complexity including algorithm optimality.
Prereq: CS 240 or 242, C&O 230, and third-year standing
CS 372 Introduction to Scientific Computation: Numerical Linear AlgebraF,W,S 3C 0.5
Pitfalls in computation. Direct solution of linear algebraic systems. Iterative solution of linear algebraic systems. Least-squares computations. Iterative solution of f(x) = 0. Minimization of functions of several variables.
Prereq: CS 132 or 140, MATH 230B or 237, MATH 234A or 235
Antireq: CS 337
CS 374 Introduction to Scientific Computation: Numerical Approximation |F,W,S 3C 0.5
Pitfalls in computation. Polynomial interpolation. Orthogonal polynomials and least-squares approximations. Numerical integration and differentiation. Data fitting.
Prereq: CS 132 or 140, MATH 230B or 237, MATH 234A or 235
Antireq: CS 337
CS 430 Applications Software EngineeringF 3C 0.5
An investigation into the role and function of software engineering practice in the construction of computer based systems. Topics include: requirements and specification; documentation techniques; analysis and design; implementation; testing and maintenance; management issues.
Prereq: CS 230 of 234, anda CS half-credit labelled CS 330 or higher, and third-year standing
Coreq: CS 335 is recommended
Antireq: CS 446
CS 430 cannot be counted for credit in a Computer Science Major program.
CS 432 Business Systems AnalysisF,S 3C 0.5
Survey of organization and management theory. Systems theory and the systems approach. Systems design. Data base concepts. Implementation and evaluation of computer based information systems. .
Prereq: CS 334 or 438, and thirdyear standing
Antireq: CS 482
CS 432 cannot be counted for credit in a Computer Science Major program.
CS 435 Topics in Computing SystemsW 3C 0.5
An overview of some more advanced computer techniques, with an emphasis on their application in the analysis and design of systems. Topics include: data communication; queueing theory fundamentals; 2-D graphics; advanced software and hardware architectures; computer selection.
Prereq: CS 335 and third-year standing
CS 435 cannot be counted for credit in a Computer Science Major program.
CS 437 Simulation by ComputerW 3C 0.5
An introduction to the basic techniques of simulation. Discrete simulation models; random number generators; the SIMSCRIPT and GPSS languages; analysis of simulation output; continuous simulation models and the CSMP language. .
Prereq: CS 230 or 234, STAT 220, and third-year standing
Antireq: CS 457
CS 437 cannot be counted for credit in a Computer Science Major program.
CS 438 F,W,S 3C 0.5
Computer Applications in Business: Data Bases A user-oriented approach to the management of large collections of data. Methods used for the storage, selection and presentation of data. Common data base management systems. &
Prereq: One of CS 230, 234, 330, and third-year standing
Antireq: CS 448
CS 438 cannot be counted for credit in a Computer Science Major program.
CS 442 Principles of Programming LanguagesF,S 3C 0.5
An exposure to important concepts and issues in contemporary programming languages. Data types, abstraction, and polymorphism. Program structure. Lambda calculus and functional programming, logic programming, object-oriented programming. Semantics of programming languages. Critical comparison of language features and programming methodologies using examples drawn from a variety of programming languages including Lisp, Prolog, ML, Ada, Smalltalk, Icon, APL, and Lucid. Programming assignments involve the use of some of these languages.
Prereq: CS 340 and fourth-year standing in a Computer Science Major program
CS 444 Compiler ConstructionW 3C 0.5
Phases of compilation. Lexical analysis and a review of parsing. Compilercompilers and translator writing systems. LEX and YACC. Scope rules, block structure, and symbol tables. Runtime stack management. Parameter passage mechanisms. Stack storage organization and templates. Heap storage management. Intermediate code. Code generation. Macros. Prereq: CS 340, 360 and fourth-year Standing in a Computer Science Major program ’
Course Descriptions 16:107 Mathematics: Computer Science
CS 446 Software System Design and implementationF,W,S 3C 0.5
An investigation into the role and function of software engineering practice in the design and implementation of computer based systems. Topics include: structural design; procedural design; testing and reliability; management topics; programming languages and coding; portability techniques; maintenance; performance measurement and analysis.
Prereq: CS 240 or 242, and fourthyear standing in a Computer Science Major program. CS 354 is recommended.
Antireq: CS 430
CS 448 Introduction to Database ManagementF,W,S 3C 0.5
The course introduces the student to the techniques that have been developed for processing very large collections of data. The requirement that data be held on secondary storage (disks and tapes) has an enormous impact on the design of algorithms to access that data.
Prereq: CS 340 and fourth-year standing in a Computer Science Major program
Antireq: CS 438
CS 450 Computer ArchitectureF,S 3C 0.5
The course is intended to prepare the student to choose a suitable computer for a given application. Review of combinational and sequential logic circuits. Discussion of “building block” — central processing units, stores, input/output systems, and bus structures. Case studies of machines. Prereq: CS 351 or (CS 242 and ELE 323) or (CS 350 and CS 358) or (CS 350 and EL E 323), and fourth-year standing in a Computer Science Major program
CS 452 Real-time ProgrammingF,W,S 3C 0.5
Intended to give students experience with tools and techniques of real-time programming, this course includes not only issues of microcomputer architecture and a real-time programming language and operating system, but also hands-on experience programming a microcomputer for applications such as process contral, data acquisition and communication.
Prereq: CS 354 and fourth-year standing in a Computer Science Major program. CS 350 or 351 is recom mended.
16:108 Course Descriptions
CS 454 Distributed SystemsF,W,S 3C 0.5
An introduction to distributed systems, emphasizing the multiple levels of software in such systems. Specific topics include fundamentals of data communications, network architecture and protocols, local-area networks, concurrency control in distributed systems, recovery in distributed systems, and clock synchronization.
Prereq: CS 354 and fourth-year standing in a Computer Science Major program. CS 350 or 351 is recommended.
CS 457 Queueing Models: Analysis, Simulation, and ComputerW 3C 0.5
Applications : An introduction to the basic results of queueing theory and the techniques of discrete event simulation. Emphasis is placed on the application of queueing models to computer systems and computer communication networks. Prereq: STAT 231, 333, CS 240 or 242, and fourth-year standing in a Computer Science Major program Antireq: CS 437
CS 458 Design of Microprocessor-Based SystemsF,S 3C 0.5
An introduction to the design of digital systems such as those used in microcomputers, control and industrial applications, or those dedicated to specific tasks. Topics include: digital electronics, microprocessors, memory chips and systems, standard and specialized peripheral chips, development and integration systems, and case studies. Laboratory-oriented: small teams design and implement microprocessorbased systems.
Prereq: CS 351 or 358, and fourthyear standing ina Computer Science Major program. CS 350 is recommended for those students who do not have CS 351.
CS 462 Formal Languages and ParsingF 3C 0.5
Languages and their representations. Grammars — Chomsky hierarchy. Regular sets and sequential machines. Context-free grammars — normal forms, basic properties. Pushdown automata and transducers. Operations on languages. Undecidable problems in language theory. Applications to the design of programming languages and compiler construction.
Prereq: CS 360 and fourth-year standing
CS 464 Computational Complexity TheoryW 3C 0.5
The classification of problems according to the computational resources required for their solution, with emphasis on properties of feasible computations rather than on specific algorithms. Topics include: time and space complexity, tfactable and intractable problems, computation using randomness, parallel computation. Prereq: CS 360 and fourth-year Standing
CS 466 Algorithm Design and AnalysisF,S 3C 0.5
Design of good algorithms and analysis of the resources they consume. Lower bounds on the resource requirements of algorithms to compute certain functions. Problems from the following areas are discussed in this tight: sorting and order statistics, data structures, arithmetic computations, the NP-complete problems.
Prereq: CS 340 and fourth-year standing. CS 360 is recommended.
CS 472 Numerical Linear AlgebraW 3C 0.5
Direct methods for the numerical solution of linear systems of equations and linear least squares problems. Numerical methods for solving the algebraic eigenvalue probiem.
Prereq: CS 372, or CS 337 and consent of instructor. CS 374 is recommended.
CS 473 Numerical Linear ProgrammingF 3C 0.5
Methods for the minimization and maximization of piecewise linear functions and linear functions subject to linear constraints, with applications to linear programming and data fitting. Emphasis is on algorithms, numerical considerations and software implementation.
Prereq: One of CS 372, C&O 350, or CS 337 and consent of instructor. CS 374 is recommended.
Crosslisted as C&O 458
CS 476 Numerical Solution of Differential and Integral EquationsF 3C 0.5
Initial value problems: existence and uniqueness of solutions, one step methods, multistep methods, stability, error analysis. Boundary value problems: shooting and discretization methods, implementation problems especially for non-linear equations. Integral equations: correspondence to ordinary differential equations, initial value and boundary value problems, solution techniques.
Prereq: CS 374, or CS 337 and consent of instructor. CS 372 is recommended.
Cross-listed as AM 441
CS 482 Techniques in Systems AnalysisF,W,S 3C 0.5
Techniques in organization and management theory. Organization of large software systems. Data base concepts. Implementation of computer based information systems. Survey of current topics of interest such as distributed processing, microcomputers and on-line systems.
Prereq: CS 340 and fourth-year standing in a Computer Science Major program
Coreq: CS 448
Antireq: CS 432
CS 486 Introduction to Artificial inteiligenceF,W,S 3C 0.5
Goals and methods of artificial intelligence. Methods of general problem solving. Introduction to mathematical logic. Mechanical theorem proving. Game playing. Natural language processing.
Prereq: CS 240 or 242, and fourthyear standing in a Computer Science Major program
CS 487 Introduction to Symbolic ComputationW 3C 0.5
An introduction to the use of computers for symbolic mathematical computation, involving traditional mathematical computations such as solving linear equations (exactly), analytic differentiation and integration of functions, and analytic solution of differential equations. ——
Prereq: CS 240 or 242, PMATH 334 or consent of instructor, and fourth-year standing
CS 488 Introduction to Computer GraphicsF,W,S 3C 0.5
Software and hardware for interactive computer graphics. Implementation of device drivers, 3-0 transformations, clipping, perspective, and input routines. Data structures, hidden surface removal, colour shading techniques, and some additional topics will be covered.
Prereq: CS 340, MATH 234A or 235, and fourth-year standing in a Computer Science Major program
CS 492 The Sociai Implications of ComputersW 2C,1D 0.5
This course is designed to consider the problems caused for organizations and society by the advent of computer technology so that constructive solutions to these problems may be discussed. Prereq: CS 340 and fourth-year standing in a Computer Science Major program
CS 494 Computers and the Law of information TechnologyF,W 3C 0.5
An introduction to the subject of computer law, examining current legal issues and problems relating to the use of computer- based information systems, the protection of computer software and data bases, and the acquisition and sale of computer systems.
Prereq: Fourth-year standing in a Computer Science Major program
CS 498 Ad d Topics in Comput Sclence See the Course Offerings List for topics0.5
available. Prereq: Fourth-year standing in a Computer Science Major program
CS 499 Readings in Computer Science0.5
This course cannot be used to satisfy any 400-level course requirement ina Computer Science Major program.
CS 117 Computers and Microcom- puters: Principles of Operation and Programming
Not offered in 1989–90.