Courses I Took/Am Taking

CSC108H1 -- Introduction to Computer Programming

Structure of computers; the computing environment. Programming in an object-oriented language such as Java. Program structure in an object-oriented language: classes, objects, methods, fields. Internal structure of methods: elementary data types, statements, control flow. Arrays; searching, sorting and complexity; user interfaces and event-driven programming. Practical (P) sections consist of supervised work in the computing laboratory. These sections are offered when facilities are available, and attendance is required.

CSC148H1 -- Introduction to Computer Science

Abstract data types and data structures for implementing them. Linked data structures. Encapsulation and information-hiding. Object-oriented programming in a language such as Java. Specifications. Analyzing the correctness and efficiency of programs using mathematical reasoning. Recursion. Recurrence relations for analysing the efficiency of recursive code. This course assumes programming experience in an object-oriented language such as C++ or Java, as provided by CSC108H. Practical (P) sections consist of supervised work in the computing laboratory. These sections are offered when facilities are available, and attendance is required.

CSC209H1 -- Software Tools and Systems Programming

Software development techniques, typically in the UNIX environment. Particular emphasis on what happens in the system when programs run. Core topics: software utilities (e.g. pipes, filters) shell programming, system calls, signals, file processing, introduction to concurrency (e.g. synchronization, mutual exclusion, race conditions, producer-consumer problem), processes. Additional topics may include: scripting languages, Internet programming languages, network programming (e.g. sockets).

CSC228H1 -- File Structures and Data Management

An introduction to techniques for storing, accessing and managing long-term data in computer systems. Hardware and software aspects of data processing: processors, storage devices, communications, file I/O control. Techniques for organizing and managing files: serial files, direct files, indexed files, multikey files, integrated files, file systems. Introduction to data base management systems with emphasis on relational data base systems.

CSC238H1 -- Discrete Mathematics for Computer Science

A rigorous treatment of certain aspects of discrete mathematics, with applications to Computer Science. Topics include mathematical induction, program correctness, recurrences, divide-and-conquer algorithms, finite state machines, and an introduction to the propositional and predicate calculus.

CSC258H1 -- Computer Organization

Computer structures, machine languages, instruction execution, addressing techniques, and digital representation of data. Computer system organization, memory storage devices, and microprogramming. Block diagram circuit realizations of memory, control and arithmetic functions. There are a number of laboratory periods in which students conduct experiments with digital logic circuits.

CSC270H1 -- Fundamental Data Structures and Techniques

Standard programming methods, with an introduction to C and C++. Use of classes to represent abstract data types. Graph representation and graph algorithms. Simulation: data structures and program organization for event-driven models. Representation of floating-point numbers; introduction to numerical methods. Optimization using dynamic programming. Programming assignments stress both the proper use of abstract data types (lists, stacks, trees, heaps) and approaches to writing larger, more complex programs.

CSC340H1 -- Information Systems Analysis and Design

Theory, tools and techniques of information systems analysis and design. Topics include: theory of systems and organizations; structured analysis and design; user interface design.

CSC378H1 -- Data Structures and Algorithm Analysis

Abstract data types such as priority queues and dictionaries. Advanced data structures for main memory resident information, such as binomial heaps, leftist trees, self-adjusting lists and balanced search trees. Algorithm analysis: worst case, average case, and amortized complexity. Introduction to lower bounds. Emphasis is given to problem solving and a theoretical treatment of the data structures.

CSC408H1 -- Software Engineering

The structure and unique characteristics of large software systems. The software process and software project management including project planning, risk management, staffing and organizational issues. Review of requirements analysis and specification. Software development techniques, version control, configuration management, system construction tools. Software system testing and quality assurance. Software maintenance and product delivery strategies. A course project is used to illustrate software engineering techniques.

CSC434H1 -- Data Management Systems

Concepts, approaches, and techniques in data base management systems (DBMS): data and information management; logical models of data bases: relational, network, and hierarchical DBMS’s; operational requirements; implementation considerations; DBMS architecture; data base design.

CSC458H1 -- Computer Networks

Computer communication network design and operation. Representation of information on physical channels; error detection and recovery; local area networks; deadlock and congestion avoidance; internetworking and gateways; network naming and addressing; remote procedures. Emphasis on fundamental principles rather than case studies, but with examples from real networks.

CSC468H1 -- Operating Systems

Principles of operating systems. The operating system as a control program and as a resource allocator. The concept of a process is central: synchronization, mutual exclusion, deadlock. Additional topics include memory management, file systems, process scheduling, and protection. Some treatment of multiprocessor issues, such as threads and scheduling. Case studies from systems such as Unix and Mach. Experimentation with a simple operating system using a concurrent programming language.

ACT240H1 -- Mathematics of Investment and Credit

Interest, discount and present value, as applied to determine prices and values of annuities, mortgages, bonds, equities; loan repayment schedule and consumer finance payments in general; yield rates on investment given the cost on investments.

ECO105Y1 – Principles of Economics for Non-Specialists

An introduction to the principles and methods of economics. Lecture topics include: economic growth, the importance of productivity, internal trade, competitive markets, macroeconomic issue, employment, banking systems, monetary policy.

ECO200Y1 – Microeconomic Theory

Theory of markets and prices. Determination of prices through the basic economic units, the household as consumer and as supplier of inputs and business firm as producer and as employer of inputs. The pricing system as the mechanism by which the social decisions are made in a market economy.

MAT137Y1 – Calculus

Limits and continuy, the mean values and the inverse function theorems, the integral, the fundamental theorem, elementary transcendental functions, Taylor's theorem, sequence and series, uniform convergence and power series.

MAT223H1 – Linean Algebra

This is a first undergraduate course in linear algebra taken by students from a variety of disciplines. The course covers: linear systems, matrix arithmetic, real vector spaces, introduction to linear mappings and 
diagonalization. Students will be required to understand all theoretical concepts involved, be able to solve the standard problems in each section and be able to do simple , short proofs of particular statements. 

PHL245H1 – Modern Symbolic Logic

The application of symbolic techniques to assessment of argument. Propositional calculus and quantification theory. Logical concepts, techniques of natural duduction.

PHY140Y1 – Foundations Of Physics

The motion of single particles and rigid, extended bodies (Newtonian Mechanics); planetary motion, gravitational collapse; black holes: Special Relativity and an introduction to elementary particle physics; the description of large numbers, e.g., a gas, of weakly interacting particles (Statistical Mechanics); the breakdown of Newtonian mechanics in the microscopic world; introduction to Quantum Mechanics, wave-particle duality and the uncertainty principle.

STA220H1 – The Practice of Statistics I

This course presents the basic statistical methodology used in many fields of application. The emphasis of this course is on concepts and techniques and will be useful to students who seek to gain an understanding of the use of statistics i n their own field) or Sta(257,261) . However, Sta220&221(or 229) will be accepted in lieu of Sta250H as a prerequisite for Sta255H, after which, further studies in Statistics may be pursued. 

STA257H1 - Probability with Statistics and Applications 

Events and random variables, the Bernoulli random variable, Fundamental Laws of Probability and Expectation, Inequalities,Continuity of P and E,distribution functions, Conditional Probability, Independence; Discrete and continuous random variables: definitions,probability functions,probability density functions, probability and moment generating functions, characteristic functions, various expectation calculations, examples of the preceding applied to binomial, Poisson, geometric, normal, exponential and other types of random variables, an introduction to the Poisson process; Random vectors (multivariate distributions) including the multivariate normal, functions of random vectors, mean vector and variance covariance matrices, the change of variables formula, probability integral transformation; Some large-sample results including a central limit theorem and laws of large numbers. Rigorous proofs of these; Statistical applications and concepts .