SERIAL NO.
COURSE CODE COURSE NAME SYLLABUS PREREQUISITES CREDITS PROFESSOR SUGGESTED BOOKS OTHERS OTHER PREREQUISITES
Functions, limits, continuity, derivatives, rules for differentiation of algebraic and ALEKS Math Placement 76-100 (Students MyLab Math with Pearson eText --24-
repeating course may ask for permission Month Standlone Access Card -- for
1 MATH.1310 Calculus I transcendental function; chain rule, implicit differentiation, related rate problems,
number from the department) or pre-req of
4 John Lahoud
University Calculus: Early
Direct exam, may cost around 1000$ PREREQUISITE FOR? COURSE CODE COURSE NAME SYLLABUS
linearization, applied optimization, and curve sketching. Introduction to area and integration. MATH.1290. Transcedentals. (4th Edition)
A workshop course that thoroughly explores the writing process from pre-writing to revision, Provides a review of pre-calculus, algebra and trigonometry integrated with
with an emphasis on critical thinking, sound essay structure, mechanics, and academic Anti Req for ENGL.1010 - students cannot Thomas Desmond, Frank Morris, the second half of Calculus I. Inverse trig functions and their derivative,
2 ENGL.1010 College Writing I integrity. Students will read, conduct rhetorical analyses, and practice the skills required for receive credit for both ENGL.1010, 3 Charles Raras, Theresa DeFranso, MATH.1310 MATH.1290 Calculus IB logarithmic functions and their derivative, related rates, L'Hospital's Rule,
optimization problems, curve sketching, linearization, Newton's Method,
participation in academic discourse. Students will write expository essays throughout the ENGL.1110 and ENGL.1010S. Charles Archer, Richard Keating hyperbolic functions and their derivative, antiderivatives. Completion of this
semester, producing a minimum of four formal essays. course is equivalent to MATH.131 0 Calculus I.
Robert Talbot, Timothy Rogers,
A workshop course that thoroughly explores the academic research writing process with an Pre-Req: ENGL.1010 or ENGL.1110 or Evanthlea Vlahakis, James Worthley, Introduction to object-oriented software development using the C++
emphasis on entering into academic conversation. Building on the skills acquired in College Guy Peartree, Robert Carr lii, programming language. The main ideas are encapsulation, class hierarchy
Writing I, students will learn to write extensively with source material. Key skills addressed HONR.1100 or CW1 Student Group waiver; Micheal Baron, Mary Levasseur, Paul and inheritance, polymorphism, copy control, operator overloading, dynamic
3 ENGL.1020 College Writing II include finding,assessing, and integrating primary and secondary sources, and using proper Anti Req for ENGL.1020 - students cannot 3 Francoeur, Cherry Hunter, Andrew COMP.2040, COMP.3010 COMP.2010 Computing III memory management, and templates. Additional topics include the Standard
receive credit for both ENGL.1020 and
documentation to ensure academic integrity. Students will produce analytical writing ENGL.1120. Johnson, Joanne Carota, Micheal Template Library (containers and iterators), class design diagrams, and
throughout the semester, including a minimum of four formal, researched essays. Silverman, Melissa Williamson- exception handling.
Pulkkinen (MANY MORE)
Computing II focuses on the implementation and applications of data
Oral and Written The main goal of this course is to enhance the student's understanding of the elements of Pre-Reqs: ENGL 1020 College Writing II; structures, including arrays, linked lists, stacks, queues, trees, binary trees,
4 ENGL.2200 Communication effective communication, and to put that knowledge into practice in a supportive, co-operative, Computer Science Majors only. 3 Mary Gormley COMP.3040, COMP.3050, COMP.4040 COMP.1020 Computing II binary search trees, heaps, graphs, and hash tables. Recursive approaches
workshop environment. Limited to Computer Science majors. are used. Performance analysis is discussed. Attention is paid to
programming style, documentation, and testing.
Advanced C++ programming, which deepens students' understanding of object-oriented C++, OOPS, SE, working with API's, Examines graph theory, trees, algebraic systems, Boolean algebra, groups,
5 COMP.2040 Computing IV analysis and design. Basic software engineering principles and practice, including work with Pre-Req: COMP.2010 Computing III. 3 Yelena Rykalova program translation, web software, CD COMP.3040, COMP.4040 MATH.3220 Discrete Structures II monoids, automata, machines, rings and fields, applications to coding theory,
(CORE SUBJECT) (VERY IMPORTANT &
APIs. Topics may include program translation, web software, parsing, and regular expressions. KIND OF DIFFICULT) logic design, and sorting.
A survey of the mathematical foundations of Computer Science. Finite automata and regular Probability and statistics with applications in the engineering sciences.
Foundations of Computer languages. Stack Acceptors and Context-Free Languages. Turing Machines, recursive and Pre-Req: COMP 1020 Computing II, and Probability of events, discrete and continuous random variables cumulative
6 COMP.3040 3 Robert Marceau TOC, DMS(1), DMS(2), CD COMP.4040 MATH.3860 Probability and Statistics I distribution, moment generatory functions, chi-square distribution, density
Science recursively enumerable sets. Decidability. Complexity. This course involves no computer MATH 3220 Discrete Structures II. functions, distributions. Introduction to estimation, hypothesis testing,
programming.
regression and correlation.
Examines the basic functional components of a computer system including the CPU, memory
systems, and I/O systems. Each of these three areas will be developed in detail with a focus on Pre-Req: EECE 2650 Intro to Logic Design,
7 COMP.3050 Computer Architecture the system design and component integration. Topics will include CPU control and ALU COMP 1020 Computing II, COMP 2030 Comp 3 William Moloney Jr, David COA
Org & Assembly Lang or EECE 3170 Hendrickson
operation, computer timing, data address and I/O bus activity, addressing model, programmed Microprocessor Syst Des I.
and DMA I/O, and instruction sets and micro code.
8 XXXX.XXXX Computer Science Ethics 3
Analytical approach to the study of programming languages. Description of the salient features
Organisation of Programming of the imperative, functional, logical, and object-oriented programming paradigms in a suitable
9 COMP.3010 Languages metalanguage such as Scheme. Topics include iteration, recursion, higher-order functions, Pre-Req: COMP.2010 Computing III. 3 Matteo Cimini, Charles Wilkes
types, inheritance, unification, message passing, orders of evaluation, and scope rules.
Elementary syntactic and semantic descriptions. Implementation of simple interpreters.
Presents an introduction to major operating systems and their components. Topics include
Introduction to Operating processes, concurrency and synchronization, deadlock, processor allocation, memory
10 COMP.3080 Systems management, I/O devices and file management, and distributed processing. Techniques in Pre-Req: COMP.3050 Computer Architecture. 3 William Moloney Jr, Charles Wilkes OS
operating system design, implementation, and evaluation will be examined.
Development of more sophisticated ideas in data type and structure, with an introduction to
the connection between data structures and the algorithms they support. Data abstraction.
Controlled access structures. Trees, lists, stacks, queues, graphs, arrays, hash tables. Algorithm
design strategies such as divide and conquer. Elementary techniques for analysis; asymptotic Pre-Reqs: COMP 1020 Computing II, MATH
analysis, recursion equations, estimation methods, elementary combinatorial arguments.
11 COMP.4040 Analysis of Algorithms Examination of problem areas such as searching and sorting, and the indicated 3220 Discrete Structures ll and MATH 3860 3 Sirong Lin, Benyuan Liu, Yu Cao DS, DAA
Probability & Statistics I.
representations and algorithms. The student will use the techniques learned in this course and
in previous courses to solve a number of logically complex programming problems using
pseudocode, with an emphasis on establishing algorithmic correctness and estimating time
and space complexity.
12 COMP.XXXX Project Course Part-1 3
13 COMP.XXXX Project Course Part-2 3
