CS Study Plan: Some CS Background
Term I Course # Course Name MA 115 Calculus I Functions of one variable, limits, continuity, derivatives, chain rule, maxima and minima, exponential functions and logarithms, inverse functions, antiderivatives, elementary differential equations, Riemann sums, the Fundamental Theorem of Calculus, vectors and determinants.
3-0-6 CS 115 Introduction to Computer Science This is an introductory programming course using the Java language. The topics include: basic facts about object-oriented programming and Java through inheritance and exceptions; recursion; UML diagrams and how to read class diagrams; ethics in computer science; and some basic understanding about computer systems: the compile/link/interpret/execute cycle and data representation.
3-2-4 Science I 3-0-3 CS 146 Web Fundamentals This course introduces students to the infrastructure underlying the Web, including protocols and markup languages. It also addresses the question of how one presents large volumes of information to people who need to find out what they are looking for quickly. The scope of the course ranges from mechanics to aesthetics. Social and ethical issues are also discussed, including the concept of information ecologies for social acceptance. Networks and protocols; pervasive computing; Web protocols; markup languages and XML; defining information architecture; understanding information needs and information-seeking behaviors; organizing Web sites and intranets; navigation systems; search systems; thesauri; from research to design: strategies for information architecture; enterprise information architecture; ethics on the Web; and information ecologies.
3-0-3 PE 115 Physical Education 0-2-0 Total 12-4
Term II Course # Course Name Ma 116 Calculus II
Techniques of integration, infinite series and Taylor series, polar coordinates, double integrals, improper integrals, parametric curves, arc length, functions of several variables, partial derivatives, gradients and directional derivatives.
3-0-6 CS 284 Data Structures This is a course on standard data structures, including sorting and searching and using the Java language. The topics include: stages of software development; testing; UML diagrams; elementary data structures (lists, stacks, queues, and maps); use of elementary data structures in application frameworks (e.g., JFC); searching; sorting; and introduction to asymptotic complexity analysis.
4-0-4 Science II 3-0-3 Science Lab 0-3-0 MA 134 Discrete Mathematics This course provides the background necessary for advanced study of mathematics or computer science. Topics include propositional calculus, predicates and quantifiers, elementary set theory, countability, functions, relations, proof by induction, elementary combinatorics, elements of graph theory, mends, and elements of complexity theory.
3-0-6 HUM Humanities 3-0-6 PE 200 Physical Education 0-2-0 Total 16-5
Term III Course # Course Name CS 385 Algorithms This is a course on more complex data structures, and algorithm design and analysis, using the C language. Topics include: advanced and/or balanced search trees; hashing; further asymptotic complexity analysis; standard algorithm design techniques; graph algorithms; complex sort algorithms; and other "classic" algorithms that serve as examples of design techniques.
4-0-8 CS 334 Automata and Computation Introduction to recursive functional programming and equational reasoning; lists as inductive types and list induction; introduction to formal languages, automata, and the theory of computation; regular expressions, finite state machines, and pumping lemma; context free grammars and push down automata; turing machines, recursive enumerability, and unsolvable problems; and complexity and intractability. A number of models of computation are considered, as well as their relation to various problem classes (e.g. solvable problems and polynomial time solvable problems). Some experiments are performed that involve writing small Scheme programs.
3-0-3 CS 383 Computer Organization and Programming Basic structure of the stored program computer, addressing methods and program sequencing, instruction sets and their implementation, the CPU and microprogrammed control, input/output organization, peripherals and interfacing, and main memory. Detailed study of a small machine. Assignments are devoted to assembly language programming.
3-0-3 MGT 111 Social Psychology and Organizational Behaviour Using an applied and experiential format, this course exposes students to theory, methods and research in organizational behavior and social psychology. Topics relating to individual differences and group dynamics in organizational settings are stressed. Learning occurs through discussion, group activities, and the completion of assessment instruments. Emphasis is on helping students understand and improve their skills in key areas, including decision-making, leadership, negotiation, and conflict resolution.
3-0-0 HUM Humanities 3-0-6 PE 200 Physical Education 0-2-0 Total 16-2
Term IV Course # Course Name CS 392 Systems Programming Introduction to systems programming in C on UNIX. Students will be introduced to tools for compilation, dynamic linking, debugging, editing, automatic rebuilding, and version control. Some aspects of the UNIX system call interface will be studied, drawn from this list: process creation, signals, terminal I/O, file I/O, inter-process communication, threads, network protocol stacks, programming with sockets, and introduction to RPC. Style issues to be covered include: naming, layout, commenting, portability, design for robustness and debugability, and language pitfalls. X programming and GUI design will be covered, if time allows.
3-0-3 CS 496 Principles of Programming Languages An introduction to programming language design and implementation, with an emphasis on the abstractions provided by programming languages. Assignments include implementing one or more interpreters for simple procedural languages, in a functional language such as Scheme or ML. Recursive types and recursive functions; structural induction. Abstract data types. Abstract syntax. Implementing languages with interpreters. Static vs. dynamic scoping, closures, state. Exceptions. Types: type-checking, type inference, static vs. dynamic typing. Object-oriented languages: classes and interfaces, inheritance and subtyping. Polymorphism and genericity.
3-0-3 CS 347 Software Development Process This course provides a general introduction to the essentials of the software development process, that series of activities that facilitate developing better software in less time. The course introduces software development and deployment life cycles, requirements acquisition and analysis, software architecture and design, and resource management and scheduling in the implementation phase. Students gain experience with tools and methodologies for configuration management and project management. Security engineering is considered as an essential part of the software development process, particularly from the standpoint of applied risk management.
3-0-3 MA 222 Probability and Statistics Introduces the essentials of probability theory and elementary statistics. Lectures and assignments greatly stress the manifold applications of probability and statistics to computer science, production management, quality control, and reliability. A statistical computer package is used throughout the course for teaching and for assignments. Contents include: descriptive statistics, pictorial and tabular methods, and measures of location and of variability; sample space and events, probability axioms, and counting techniques; conditional probability and independence, and Bayes' formula; discrete random variables, distribution functions and moments, and binomial and Poisson distributions; continuous random variables, densities and moments, normal, gamma, and exponential and Weibull distributions unions; distribution of the sum and average of random samples; the Central Limit Theorem; confidence intervals for the mean and the variance; hypothesis testing and p-values, and applications for the mean; simple linear regression, and estimation of and inference about the parameters; and correlation and prediction in a regression model.
3-0-6 HUM Humanities 3-0-6 PE 200 Physical Education 0-2-0 Total 15-2
Term V Course # Course Name CS 442 Database Management Systems Introduction to the design of relational databases and the use of standard relational query languages. Topics include: relational schemas; keys and foreign key references; relational algebra (as an introduction to SQL); SQL; Entity-Relationship (ER) database design; translating from ER models to relational schemas and from relational schemas to ER models; functional dependencies; and normalization.
3-0-6 CS 511 Concurrent Programming The study of concurrency as it appears at all levels and in different types of computing systems. Topics include: models of concurrency; languages for expressing concurrency; formal systems for reasoning about concurrency; the challenges of concurrent programming; race conditions; deadlock; livelock and nondeterministic behavior; prototypical synchronization problems, such as readers-writers and dining philosophers; mechanisms for solution of these problems, such as semaphores, monitors, and conditional critical regions; important libraries for concurrent programming; message passing, both synchronous and asynchronous; and applications of multithreaded concurrent programming and parallel algorithms. Substantial programming required.
3-0-3 Applied Statistics 3-0-3 HUM Humanities 3-0-6 HUM Humanities 3-0-3 PE 200 Physical Education 0-2-0 Total 15-2
Term VI Course # Course Name CS 492 Operating Systems The use and internals of modern operating systems. Lectures focus on internals whereas programming assignments focus on use of the operating system interface. Major topics include: the process concept; concurrency and how to program with threads; memory management techniques, including virtual memory and shared libraries; file system data structures; and I/O.
3-0-3 CS 488 Computer Architecture An introduction to the functional level structure of modern pipelined processors and the empirical and analytic evaluation of their performance. Topics include: empirical and analytic techniques for measuring performance (use of various means, Amdahl's Law, and benchmarks); tradeoff analysis; principles of instruction set design and evaluation (memory addressing, operations, types and sizes of operands, instruction set encoding, CISC vs. RISC, and related compilation issues); pipelining (basics, data hazards, and control hazards); and memory systems.
3-0-3 Science/Math Elective 3-0-3 CS SD Elective 3-0-3 HUM Humanities 3-0-6 PE 200 Physical Education 0-2-0 Total 15-2
Term VII Course # Course Name CS 551 Software Engineering and Practice I Software design and development theory of software design, with emphasis on large systems. Models of the software process: specifications development, designing, coding, and testing. Program abstraction with functional abstraction and with abstract data types. Top-down and bottom-up development methods. Common software architecture models. Specification validation, design verification, testing strategies, and test coverage issues.
3-0-3 CS 573 Fundamentals of CyberSecurity This course studies the mathematical models for computer security (Bell-LaPadula, Clark-Wilson, Biba, and Gligor models). It analyzes and compares, with respect to formal and pragmatic criteria, the properties of various models for hardware, software, and database security. Topics also include: formal specification and verification of security properties, operating system security, trust management, multi-level security, security labeling, security auditing and intrusion detection, security policy, safeguards and countermeasures, risk mitigation, covert channels, identification and authentication, password schemes, access control lists, and data fusion techniques. The course includes a project.
3-0-3 Science/Math Elective 3-0-3 Tech Elective 3-0-3 HUM Humanities 3-0-6 Total 15-0
Term VIII Course # Course Name CS 552 Software Engineering and Practice II Covers the practical aspects of the software process. Cost and schedule estimation; management systems; technical vs. administrative responsibilities; documentation; libraries; configuration management; automated software tools; and documentation. The class is partitioned into software teams, each of which develop and manage a typical large-scale software development process. Projects are drawn from industry and government.
3-0-3 Tech Elective 3-0-3 Free Elective 3-0-3 Free Elective 3-0-6 HUM Humanities 3-0-6 Total 15-0
CS Study Plan: Weak Background
Term I Course # Course Name MA 115 Calculus I Functions of one variable, limits, continuity, derivatives, chain rule, maxima and minima, exponential functions and logarithms, inverse functions, antiderivatives, elementary differential equations, Riemann sums, the Fundamental Theorem of Calculus, vectors and determinants.
3-0-6 CS 105 Introduction to Scientific Computing This is a first course in computer programming for students with no prior experience. Students will learn the core process of programming: given a problem statement, how does one design an algorithm to solve that particular problem and then implement the algorithm in a computer program? The course will also introduce elementary programming concepts like basic control concepts (such as conditional statements and loops) and a few essential data types (e.g., integers and doubles). Exposure to programming will be through a self-contained user-friendly programming environment, widely used by the scientific and engineering communities, such as Matlab. The course will cover problems from all fields of science, engineering, and business.
2-2-0 Science I 3-0-3 CS 146 Web Fundamentals This course introduces students to the infrastructure underlying the Web, including protocols and markup languages. It also addresses the question of how one presents large volumes of information to people who need to find out what they are looking for quickly. The scope of the course ranges from mechanics to aesthetics. Social and ethical issues are also discussed, including the concept of information ecologies for social acceptance. Networks and protocols; pervasive computing; Web protocols; markup languages and XML; defining information architecture; understanding information needs and information-seeking behaviors; organizing Web sites and intranets; navigation systems; search systems; thesauri; from research to design: strategies for information architecture; enterprise information architecture; ethics on the Web; and information ecologies.
3-0-3 PE 115 Physical Education 0-2-0 Total 11-4
Term II Course # Course Name Ma 116 Calculus II
Techniques of integration, infinite series and Taylor series, polar coordinates, double integrals, improper integrals, parametric curves, arc length, functions of several variables, partial derivatives, gradients and directional derivatives.
3-0-6 CS 115 Introduction to Computer Science This is an introductory programming course using the Java language. The topics include: basic facts about object-oriented programming and Java through inheritance and exceptions; recursion; UML diagrams and how to read class diagrams; ethics in computer science; and some basic understanding about computer systems: the compile/link/interpret/execute cycle and data representation.
3-2-4 Science II 3-0-3 Science Lab 0-3-0 MA 134 Discrete Mathematics This course provides the background necessary for advanced study of mathematics or computer science. Topics include propositional calculus, predicates and quantifiers, elementary set theory, countability, functions, relations, proof by induction, elementary combinatorics, elements of graph theory, mends, and elements of complexity theory.
3-0-6 HUM Humanities 3-0-6 PE 200 Physical Education 0-2-0 Total 15-7
Term III Course # Course Name CS 284 Data Structures This is a course on standard data structures, including sorting and searching and using the Java language. The topics include: stages of software development; testing; UML diagrams; elementary data structures (lists, stacks, queues, and maps); use of elementary data structures in application frameworks (e.g., JFC); searching; sorting; and introduction to asymptotic complexity analysis.
4-0-4 CS 334 Automata and Computation Introduction to recursive functional programming and equational reasoning; lists as inductive types and list induction; introduction to formal languages, automata, and the theory of computation; regular expressions, finite state machines, and pumping lemma; context free grammars and push down automata; turing machines, recursive enumerability, and unsolvable problems; and complexity and intractability. A number of models of computation are considered, as well as their relation to various problem classes (e.g. solvable problems and polynomial time solvable problems). Some experiments are performed that involve writing small Scheme programs.
3-0-3 CS 383 Computer Organization and Programming Basic structure of the stored program computer, addressing methods and program sequencing, instruction sets and their implementation, the CPU and microprogrammed control, input/output organization, peripherals and interfacing, and main memory. Detailed study of a small machine. Assignments are devoted to assembly language programming.
3-0-3 HUM Humanities 3-0-6 HUM Humanities 3-0-3 PE 200 Physical Education 0-2-0 Total 16-2
Term IV Course # Course Name CS 385 Algorithms This is a course on more complex data structures, and algorithm design and analysis, using the C language. Topics include: advanced and/or balanced search trees; hashing; further asymptotic complexity analysis; standard algorithm design techniques; graph algorithms; complex sort algorithms; and other "classic" algorithms that serve as examples of design techniques.
4-0-8 CS 496 Principles of Programming Languages An introduction to programming language design and implementation, with an emphasis on the abstractions provided by programming languages. Assignments include implementing one or more interpreters for simple procedural languages, in a functional language such as Scheme or ML. Recursive types and recursive functions; structural induction. Abstract data types. Abstract syntax. Implementing languages with interpreters. Static vs. dynamic scoping, closures, state. Exceptions. Types: type-checking, type inference, static vs. dynamic typing. Object-oriented languages: classes and interfaces, inheritance and subtyping. Polymorphism and genericity.
3-0-3 CS 347 Software Development Process This course provides a general introduction to the essentials of the software development process, that series of activities that facilitate developing better software in less time. The course introduces software development and deployment life cycles, requirements acquisition and analysis, software architecture and design, and resource management and scheduling in the implementation phase. Students gain experience with tools and methodologies for configuration management and project management. Security engineering is considered as an essential part of the software development process, particularly from the standpoint of applied risk management.
3-0-3 MA 222 Probability and Statistics Introduces the essentials of probability theory and elementary statistics. Lectures and assignments greatly stress the manifold applications of probability and statistics to computer science, production management, quality control, and reliability. A statistical computer package is used throughout the course for teaching and for assignments. Contents include: descriptive statistics, pictorial and tabular methods, and measures of location and of variability; sample space and events, probability axioms, and counting techniques; conditional probability and independence, and Bayes' formula; discrete random variables, distribution functions and moments, and binomial and Poisson distributions; continuous random variables, densities and moments, normal, gamma, and exponential and Weibull distributions unions; distribution of the sum and average of random samples; the Central Limit Theorem; confidence intervals for the mean and the variance; hypothesis testing and p-values, and applications for the mean; simple linear regression, and estimation of and inference about the parameters; and correlation and prediction in a regression model.
3-0-6 HUM Humanities 3-0-6 PE 200 Physical Education 0-2-0 Total 16-2
Term V Course # Course Name CS 442 Database Management Systems Introduction to the design of relational databases and the use of standard relational query languages. Topics include: relational schemas; keys and foreign key references; relational algebra (as an introduction to SQL); SQL; Entity-Relationship (ER) database design; translating from ER models to relational schemas and from relational schemas to ER models; functional dependencies; and normalization.
3-0-6 CS 392 Systems Programming Introduction to systems programming in C on UNIX. Students will be introduced to tools for compilation, dynamic linking, debugging, editing, automatic rebuilding, and version control. Some aspects of the UNIX system call interface will be studied, drawn from this list: process creation, signals, terminal I/O, file I/O, inter-process communication, threads, network protocol stacks, programming with sockets, and introduction to RPC. Style issues to be covered include: naming, layout, commenting, portability, design for robustness and debugability, and language pitfalls. X programming and GUI design will be covered, if time allows.
3-0-3 MGT 111 Social Psychology and Organizational Behaviour Using an applied and experiential format, this course exposes students to theory, methods and research in organizational behavior and social psychology. Topics relating to individual differences and group dynamics in organizational settings are stressed. Learning occurs through discussion, group activities, and the completion of assessment instruments. Emphasis is on helping students understand and improve their skills in key areas, including decision-making, leadership, negotiation, and conflict resolution.
3-0-0 Applied Statistics 3-0-3 HUM Humanities 3-0-6 PE 200 Physical Education 0-2-0 Total 15-2
Term VI Course # Course Name CS 492 Operating Systems The use and internals of modern operating systems. Lectures focus on internals whereas programming assignments focus on use of the operating system interface. Major topics include: the process concept; concurrency and how to program with threads; memory management techniques, including virtual memory and shared libraries; file system data structures; and I/O.
3-0-3 CS 488 Computer Architecture An introduction to the functional level structure of modern pipelined processors and the empirical and analytic evaluation of their performance. Topics include: empirical and analytic techniques for measuring performance (use of various means, Amdahl's Law, and benchmarks); tradeoff analysis; principles of instruction set design and evaluation (memory addressing, operations, types and sizes of operands, instruction set encoding, CISC vs. RISC, and related compilation issues); pipelining (basics, data hazards, and control hazards); and memory systems.
3-0-3 Science/Math Elective 3-0-3 CS SD Elective 3-0-3 HUM Humanities 3-0-6 PE 200 Physical Education 0-2-0 Total 15-2
Term VII Course # Course Name CS 551 Software Engineering and Practice I Software design and development theory of software design, with emphasis on large systems. Models of the software process: specifications development, designing, coding, and testing. Program abstraction with functional abstraction and with abstract data types. Top-down and bottom-up development methods. Common software architecture models. Specification validation, design verification, testing strategies, and test coverage issues.
3-0-3 CS 573 Fundamentals of CyberSecurity This course studies the mathematical models for computer security (Bell-LaPadula, Clark-Wilson, Biba, and Gligor models). It analyzes and compares, with respect to formal and pragmatic criteria, the properties of various models for hardware, software, and database security. Topics also include: formal specification and verification of security properties, operating system security, trust management, multi-level security, security labeling, security auditing and intrusion detection, security policy, safeguards and countermeasures, risk mitigation, covert channels, identification and authentication, password schemes, access control lists, and data fusion techniques. The course includes a project.
3-0-3 Science/Math Elective 3-0-3 CS 511 Concurrent Programming The study of concurrency as it appears at all levels and in different types of computing systems. Topics include: models of concurrency; languages for expressing concurrency; formal systems for reasoning about concurrency; the challenges of concurrent programming; race conditions; deadlock; livelock and nondeterministic behavior; prototypical synchronization problems, such as readers-writers and dining philosophers; mechanisms for solution of these problems, such as semaphores, monitors, and conditional critical regions; important libraries for concurrent programming; message passing, both synchronous and asynchronous; and applications of multithreaded concurrent programming and parallel algorithms. Substantial programming required.
3-0-3 HUM Humanities 3-0-6 Total 15-0
Term VIII Course # Course Name CS 552 Software Engineering and Practice II Covers the practical aspects of the software process. Cost and schedule estimation; management systems; technical vs. administrative responsibilities; documentation; libraries; configuration management; automated software tools; and documentation. The class is partitioned into software teams, each of which develop and manage a typical large-scale software development process. Projects are drawn from industry and government.
3-0-3 Tech Elective 3-0-3 Free Elective 3-0-3 Free Elective 3-0-6 HUM Humanities 3-0-6 Total 15-0
CS Study Plan: Honors Students
Term I Course # Course Name MA 115 Calculus I Functions of one variable, limits, continuity, derivatives, chain rule, maxima and minima, exponential functions and logarithms, inverse functions, antiderivatives, elementary differential equations, Riemann sums, the Fundamental Theorem of Calculus, vectors and determinants.
3-0-6 CS 181 Introduction to Computer Science Honors I Getting acquainted with C++: data types, input and output, functions, writing simple C++ programs, flow control, Boolean expressions, decision statements, if/then, and switch/case. Loop operations, while, do/while, and for loops. Arrays and pointers. Defining structs and classes, constructors and destructors, and operator overloading using an example String class. Templates. Abstract data types: vectors, lists, stacks, queues, and priority trees with applications. Trees and simple sorting with searching algorithms. By invitation only. Students who complete this class are exempt from CS 115 and CS 284.
3-2-4 Science I 3-0-3 CS 146 Web Fundamentals This course introduces students to the infrastructure underlying the Web, including protocols and markup languages. It also addresses the question of how one presents large volumes of information to people who need to find out what they are looking for quickly. The scope of the course ranges from mechanics to aesthetics. Social and ethical issues are also discussed, including the concept of information ecologies for social acceptance. Networks and protocols; pervasive computing; Web protocols; markup languages and XML; defining information architecture; understanding information needs and information-seeking behaviors; organizing Web sites and intranets; navigation systems; search systems; thesauri; from research to design: strategies for information architecture; enterprise information architecture; ethics on the Web; and information ecologies.
3-0-3 PE 115 Physical Education 0-2-0 Total 12-4
Term II Course # Course Name Ma 116 Calculus II
Techniques of integration, infinite series and Taylor series, polar coordinates, double integrals, improper integrals, parametric curves, arc length, functions of several variables, partial derivatives, gradients and directional derivatives.
3-0-6 CS 182 Introduction to Computer Science Honors II An overview of the C++ language. Algorithm design and computational complexity. Abstract data types. Review of fundamental data structures: vectors, lists, stacks, and queues. Trees and binary trees. Heaps and priority queues with applications. Dictionaries with applications. Implementation of dictionaries using binary search trees, AVL trees, and red-black trees. Sorting algorithms. Graphs and networks with applications. Graph implementations and depth-first and breadth-first searching with applications. Other graph algorithms. Students who complete this class are exempt from CS 385.
4-0-4 Science II 3-0-3 Science Lab 0-3-0 MA 134 Discrete Mathematics This course provides the background necessary for advanced study of mathematics or computer science. Topics include propositional calculus, predicates and quantifiers, elementary set theory, countability, functions, relations, proof by induction, elementary combinatorics, elements of graph theory, mends, and elements of complexity theory.
3-0-6 HUM Humanities 3-0-6 PE 200 Physical Education 0-2-0 Total 16-5
Term III Course # Course Name CS 392 Systems Programming Introduction to systems programming in C on UNIX. Students will be introduced to tools for compilation, dynamic linking, debugging, editing, automatic rebuilding, and version control. Some aspects of the UNIX system call interface will be studied, drawn from this list: process creation, signals, terminal I/O, file I/O, inter-process communication, threads, network protocol stacks, programming with sockets, and introduction to RPC. Style issues to be covered include: naming, layout, commenting, portability, design for robustness and debugability, and language pitfalls. X programming and GUI design will be covered, if time allows.
3-0-3 CS 334 Automata and Computation Introduction to recursive functional programming and equational reasoning; lists as inductive types and list induction; introduction to formal languages, automata, and the theory of computation; regular expressions, finite state machines, and pumping lemma; context free grammars and push down automata; turing machines, recursive enumerability, and unsolvable problems; and complexity and intractability. A number of models of computation are considered, as well as their relation to various problem classes (e.g. solvable problems and polynomial time solvable problems). Some experiments are performed that involve writing small Scheme programs.
3-0-3 CS 383 Computer Organization and Programming Basic structure of the stored program computer, addressing methods and program sequencing, instruction sets and their implementation, the CPU and microprogrammed control, input/output organization, peripherals and interfacing, and main memory. Detailed study of a small machine. Assignments are devoted to assembly language programming.
3-0-3 HUM Humanities 3-0-6 HUM Humanities 3-0-3 PE 200 Physical Education 0-2-0 Total 15-2
Term IV Course # Course Name CS 488 Computer Architecture An introduction to the functional level structure of modern pipelined processors and the empirical and analytic evaluation of their performance. Topics include: empirical and analytic techniques for measuring performance (use of various means, Amdahl's Law, and benchmarks); tradeoff analysis; principles of instruction set design and evaluation (memory addressing, operations, types and sizes of operands, instruction set encoding, CISC vs. RISC, and related compilation issues); pipelining (basics, data hazards, and control hazards); and memory systems.
3-0-3 CS 496 Principles of Programming Languages An introduction to programming language design and implementation, with an emphasis on the abstractions provided by programming languages. Assignments include implementing one or more interpreters for simple procedural languages, in a functional language such as Scheme or ML. Recursive types and recursive functions; structural induction. Abstract data types. Abstract syntax. Implementing languages with interpreters. Static vs. dynamic scoping, closures, state. Exceptions. Types: type-checking, type inference, static vs. dynamic typing. Object-oriented languages: classes and interfaces, inheritance and subtyping. Polymorphism and genericity.
3-0-3 CS 347 Software Development Process This course provides a general introduction to the essentials of the software development process, that series of activities that facilitate developing better software in less time. The course introduces software development and deployment life cycles, requirements acquisition and analysis, software architecture and design, and resource management and scheduling in the implementation phase. Students gain experience with tools and methodologies for configuration management and project management. Security engineering is considered as an essential part of the software development process, particularly from the standpoint of applied risk management.
3-0-3 MA 222 Probability and Statistics Introduces the essentials of probability theory and elementary statistics. Lectures and assignments greatly stress the manifold applications of probability and statistics to computer science, production management, quality control, and reliability. A statistical computer package is used throughout the course for teaching and for assignments. Contents include: descriptive statistics, pictorial and tabular methods, and measures of location and of variability; sample space and events, probability axioms, and counting techniques; conditional probability and independence, and Bayes' formula; discrete random variables, distribution functions and moments, and binomial and Poisson distributions; continuous random variables, densities and moments, normal, gamma, and exponential and Weibull distributions unions; distribution of the sum and average of random samples; the Central Limit Theorem; confidence intervals for the mean and the variance; hypothesis testing and p-values, and applications for the mean; simple linear regression, and estimation of and inference about the parameters; and correlation and prediction in a regression model.
3-0-6 HUM Humanities 3-0-6 PE 200 Physical Education 0-2-0 Total 15-2
Term V Course # Course Name CS 442 Database Management Systems Introduction to the design of relational databases and the use of standard relational query languages. Topics include: relational schemas; keys and foreign key references; relational algebra (as an introduction to SQL); SQL; Entity-Relationship (ER) database design; translating from ER models to relational schemas and from relational schemas to ER models; functional dependencies; and normalization.
3-0-6 CS 511 Concurrent Programming The study of concurrency as it appears at all levels and in different types of computing systems. Topics include: models of concurrency; languages for expressing concurrency; formal systems for reasoning about concurrency; the challenges of concurrent programming; race conditions; deadlock; livelock and nondeterministic behavior; prototypical synchronization problems, such as readers-writers and dining philosophers; mechanisms for solution of these problems, such as semaphores, monitors, and conditional critical regions; important libraries for concurrent programming; message passing, both synchronous and asynchronous; and applications of multithreaded concurrent programming and parallel algorithms. Substantial programming required.
3-0-3 MGT 111 Social Psychology and Organizational Behaviour Using an applied and experiential format, this course exposes students to theory, methods and research in organizational behavior and social psychology. Topics relating to individual differences and group dynamics in organizational settings are stressed. Learning occurs through discussion, group activities, and the completion of assessment instruments. Emphasis is on helping students understand and improve their skills in key areas, including decision-making, leadership, negotiation, and conflict resolution.
3-0-0 Applied Statistics 3-0-3 HUM Humanities 3-0-6 PE 200 Physical Education 0-2-0 Total 15-2
Term VI Course # Course Name CS 492 Operating Systems The use and internals of modern operating systems. Lectures focus on internals whereas programming assignments focus on use of the operating system interface. Major topics include: the process concept; concurrency and how to program with threads; memory management techniques, including virtual memory and shared libraries; file system data structures; and I/O.
3-0-3 Science/Math Elective 3-0-3 Free Elective 3-0-6 CS SD Elective 3-0-3 HUM Humanities 3-0-6 PE 200 Physical Education 0-2-0 Total 15-2
Term VII Course # Course Name CS 551 Software Engineering and Practice I Software design and development theory of software design, with emphasis on large systems. Models of the software process: specifications development, designing, coding, and testing. Program abstraction with functional abstraction and with abstract data types. Top-down and bottom-up development methods. Common software architecture models. Specification validation, design verification, testing strategies, and test coverage issues.
3-0-3 CS 573 Fundamentals of CyberSecurity This course studies the mathematical models for computer security (Bell-LaPadula, Clark-Wilson, Biba, and Gligor models). It analyzes and compares, with respect to formal and pragmatic criteria, the properties of various models for hardware, software, and database security. Topics also include: formal specification and verification of security properties, operating system security, trust management, multi-level security, security labeling, security auditing and intrusion detection, security policy, safeguards and countermeasures, risk mitigation, covert channels, identification and authentication, password schemes, access control lists, and data fusion techniques. The course includes a project.
3-0-3 Science/Math Elective 3-0-3 Tech Elective 3-0-3 HUM Humanities 3-0-6 Total 15-0
Term VIII Course # Course Name CS 552 Software Engineering and Practice II Covers the practical aspects of the software process. Cost and schedule estimation; management systems; technical vs. administrative responsibilities; documentation; libraries; configuration management; automated software tools; and documentation. The class is partitioned into software teams, each of which develop and manage a typical large-scale software development process. Projects are drawn from industry and government.
3-0-3 Tech Elective 3-0-3 Free Elective 3-0-6 Free Elective 3-0-3 HUM Humanities 3-0-6 Total 15-0
The computer science major is fundamentally focused on the hardware-software interface. In any computer science major, operating systems is the most important course for that major. It teaches fundamental concepts such as interrupt-driven execution, virtual memory management, I/O devices and protection in multiprogramming. The computer science major covers additional topics including: