- HBA · 4 years
- Work experience details
- ~High 80s to low 90s


University of New Brunswick · Fredericton, for the named programme profile.

AI-generated ink illustration
Conceptual study artwork, not a photograph of teaching facilities.
Unidex · generated with ImageGen
Checked 2026-11-05
Symbolic subject artwork; no university facility depicted
Academic minimum
The university publishes a 75% academic minimum, not an entering-average range.
UNB current degree-specific Canadian provincial admission selector · Ontario high-school minimumSee the published deadlines below.
Alberta high-school applicants to Computer Science; named elective groups refer to the university's full approved list
British Columbia high-school applicants to Computer Science; named elective groups refer to the university's full approved list
Manitoba high-school applicants to Computer Science; named elective groups refer to the university's full approved list
New Brunswick high-school applicants to Computer Science; named elective groups refer to the university's full approved list
Newfoundland and Labrador high-school applicants to Computer Science; named elective groups refer to the university's full approved list
Nova Scotia high-school applicants to Computer Science; named elective groups refer to the university's full approved list
Ontario high-school applicants to Computer Science; named elective groups refer to the university's full approved list
Prince Edward Island high-school applicants to Computer Science; named elective groups refer to the university's full approved list
Quebec high-school applicants to Computer Science; named elective groups refer to the university's full approved list
Saskatchewan high-school applicants to Computer Science; named elective groups refer to the university's full approved list
NunavutNorthwest Territories high-school applicants to Computer Science; named elective groups refer to the university's full approved list
Yukon high-school applicants to Computer Science; named elective groups refer to the university's full approved list
Applicants to this exact programme; named routes only
Primary entry to the held Fredericton programme; Canadian document route
Bachelor of Computer Science
Current calendar degree and curriculum variants. Entry and completion rules differ; minors and unrelated diploma/joint-degree sections are excluded.
BCS
Study the protection of information assets through a prescribed sequence of computer science courses.
Current2026/27 Fredericton degree required courses and named alternatives. Each listed Engineering discipline, degree option or accelerated Nursing route has separate requirements; the union is not a single mandatory plan.
The source identifies these five Computer Science courses across the first year. It says five courses each term but does not assign each listed course to a term; no semester placement is inferred.
Explore fundamental programming concepts such as classes, methods, decisions, loops, inheritance, and arrays. Gain skills in problem analysis and algorithm design. Learn about program structure and readability. Examine the Java API libraries.
UNB complete current official course definitionBuild on skills from CS 1073 in problem analysis and algorithm design. Learn more about program structure and readability. Explore testing and debugging, data abstraction, encapsulation, inheritance, polymorphism, sorting and searching, exceptions, files, recursion, and, simple data structures.
UNB complete current official course definitionLearn about the motivation for and capabilities of database management systems; the role of databases in a three-tier application architecture; relational data model; relational algebra; functional dependencies and normalization; SQL language, including creating, loading, updating, modifying, and querying database tables; data integrity, security and privacy; entity relationship data modeling; CRUD analysis; stored procedures; accessing a database using an API such as JDBC. Gain exposure to selected advanced topics such as data warehouses, big data, and XML.
Published notes: Credit can only be obtained for one of CS 1543, CS 1103, INFO 1103.
UNB complete current official course definitionExplore many of the fundamental concepts and theories used throughout computer science. Learn about the history of computers, computer hardware, system software, programming languages, networking, theory of computation, social issues, and other topics within computer science. Examine topics relevant to various areas of study within the BCS program.
Published notes: This course may not be taken for credit by BCS students beyond first year or by BScSwE students beyond first year.
UNB complete current official course definitionLearn about topics in discrete mathematics important in computer science, including: propositional logic, predicate logic using quantifiers, direct and indirect proofs, summation and product notation, mathematical induction, elementary set theory and counting. Gain experience writing mathematical proofs.
Published notes: Credit cannot be counted for both CS 1303 and MATH 2203 .
UNB complete current official course definitionChoose MATH 1003 OR MATH 1053, not both. The source’s shortened enriched-calculus title does not rename the held official course identity.
Functions and graphs, limits, derivatives of polynomial, log, exponential and trigonometric functions. Curve sketching and extrema of functions.
Published notes: Credit may be obtained for only one of MATH 1003, MATH 1053 , MATH 1823 or MATH 1843 . Part-time students will be charged a course fee for the MATH 1003 credit.
UNB complete current official course definitionThe syllabus is similar to that for MATH 1003 , with more emphasis placed both on the theory of calculus and interesting applications. The course will be of special interest to students with strong mathematical backgrounds. Any interested student (with or without high school calculus) is encouraged to consult with the Mathematics Department.
Published notes: Credit may be obtained for only one of MATH 1003 , MATH 1053, MATH 1823 , or MATH 1843 .
UNB complete current official course definitionChoose MATH 1013 OR MATH 1063, not both. Native known weights remain 3 and 4 credits respectively; no equal-weight conversion is invented.
Definition of the integral, fundamental theorem of Calculus, Techniques of integration, improper integrals. Ordinary differential equations. Taylor polynomials and series.
Published notes: Credit may be obtained for only one of MATH 1013 or MATH 1063 .
UNB complete current official course definitionThe syllabus for this course is similar to that of MATH 1013 . As with MATH 1053, more emphasis is placed on theory, mathematical rigor and interesting applications.
Published notes: Credit may not be for only one of MATH 1013 or MATH 1063 .
UNB complete current official course definitionExplore the fundamentals of the discipline of software engineering with focus on the software development life cycle. Learn about software development methodologies and processes, requirements analysis, modeling, architecture, design, implementation, testing, and maintenance. Examine basic principles of software management.
Published notes: Credit can only be obtained for one of CS 2033, CS 2043, ECE 4403 .
UNB complete current official course definitionLearn about lower-level computer operations and the association with higher-level procedural programming constructs. Explore binary representation of data, instruction formats and execution, assembler programming, scope, functions, user-defined data types using both low- and high-level programming languages.
UNB complete current official course definitionLearn about procedural program development and supporting tools, using the C language. Explore the implementation of data structures and algorithms, memory management, and performance techniques. Use software tools for program development such as compilation/linking, building, debugging, and version control.
UNB complete current official course definitionLearn about fundamental ideas in theoretical computer science: functions and relations, formal languages, finite automata, regular languages, context-free grammars, context-free languages, push-down automata, pumping lemmas, Turing machines, the Church-Turing thesis, recursive and recursively enumerable languages, the Chomsky hierarchy, the halting problem and other unsolvable decision problems, problem reducibility, and fundamental computational complexity classes.
UNB complete current official course definitionLearn about formal specifications of abstract data types and their data structure representations, operations, and algorithms. Explore priority queues, dictionaries, graphs, heaps, hash tables, binary search trees, balanced trees,and graph adjacency representations. Examine sorting, searching, dynamic storage handling, and fundamental graph algorithms. Learn about asymptotic analysis of time and space complexity and use it throughout the course. Implement a variety of data structures and graph algorithms.
UNB complete current official course definitionLearn the characteristics of algorithms that lead to efficient computer solutions for discrete problems. Explore a variety of different algorithm classes and design techniques, including divide and conquer, greedy, dynamic programming, and backtracking, are introduced and compared. Gain an understanding of design and analysis of randomized algorithms, along with strategies for dealing with computationally hard problems. Normally, discuss one or more models of parallel algorithms.
UNB complete current official course definitionExamine the fundamental role of an operating system in relation to the operation of applications. Learn essential theory of operating systems, including processes, process synchronization, interprocess communications, process scheduling, storage (primary and secondary) management, resource sharing, security, I/O, and user interfaces. Explore at least one of the major Unix shell languages.
UNB complete current official course definitionLearn computer organization and architecture, digital logic, interfacing and I/O strategies, memory architecture, functional organization, multiprocessing, and performance enhancements.
UNB complete current official course definitionLearn the fundamentals of data communication and application programming in a networked environment. Gain exposure to data transmission, data link concepts, networking concepts, network security, application protocols, net-centric computing and web programming.
Published notes: CS 2263 is recommended.
UNB complete current official course definitionExplore the social context of computing, professional and ethical responsibilities, risks and liabilities of computer-based systems, intellectual property, privacy and civil liberties, and professional certification. Learn to write technical reports in Computer Science. Complete an independent study component resulting in a technical report, typically a survey paper. Develop technical writing, oral presentation and library skills.
UNB complete current official course definitionEnhance technical writing and anal y tical skills by preparing and presenting a comprehensive technical report, which is typically a critical analysis paper.
UNB complete current official course definitionLines and planes, the geometry and algebra of vectors, systems of linear equations, matrix algebra, linear independence, linear transformations, determinants, complex numbers, eigenvectors, diagonalization, rotation matrices, quadratic forms, least squares.
UNB complete current official course definitionThis course introduces the basic concepts of linear algebra, mainly in finite dimensional real vector spaces. Systems of linear equations, vector and matrix algebra, bases and dimension of subspaces, row and column spaces, linear transformations and matrix representations, inner products, determinants, eigenvectors and diagonalization. Applications as time permits.
UNB complete current official course definitionThe first half of a two-part sequence covering various topics in probability and statistics. This course provides an introduction to probability theory and the theory of random variables and their distributions. Probability laws. Discrete and continuous random variables. Means, variances, and moment generating functions. Sums of random variables. Joint discrete distributions. Central Limit Theorem. Examples drawn from engineering, science, computing science and business.
UNB complete current official course definitionThe second half of a two-part sequence covering various topics in probability and statistics. This course provides an introduction to essential techniques of statistical inference. Samples and statistics versus populations and parameters. Brief introduction to method of moments and maximum likelihood. Tests and intervals for means, variances and proportions (one and two-sample). Multiple regression, residual plots. Analysis of variance, brief introduction to experimental design. Chi-squared tests. Examples drawn from engineering, science, computing science and business. Use of a statistical computer package.
UNB complete current official course definitionProbability spaces: combinatorial probability; conditional probability and independence. Random variables: discrete distributions; continuous distributions; expectation, variance, and covariance; linear combinations. Statistics: descriptive and graphical statistics; sampling distributions. Inference: point estimation; confidence intervals; hypothesis tests; paired data designs; two sample inference; regression, correlation.
Published notes: Credit can be obtained for only one of STAT 2043, STAT 2253, STAT 2263 , STAT 2264 or STAT 2593 .
UNB complete current official course definitionLearn error analysis, convergence and stability. Explore approximation of functions by polynomials. Investigate numerical quadrature and differentiation. Learn the solution of linear and non-linear equations and the solution of ordinary differential equations. Gain in-depth understanding of numerical algorithms and stress applications in the applied sciences, as well as the influence of finite precision and arithmetic on computational results. N OTE : Intended for Computer Science and Engineering students. Credit can only be obtained for one of CS 3113, MATH 3413 or ECE 2412.
UNB complete current official course definitionAnalytic geometry and vectors. Parametric curves. Polar, cylindrical and spherical coordinates. Functions of several variables, partial derivatives, applications to max-min. Double and triple integrals.
UNB complete current official course definitionFunctions of several variables, partial derivatives, multiple integrals, vector functions, Green's and Stokes' Theorems.
UNB complete current official course definitionProvides an introduction to abstract algebra via the study of group theory. Covers axioms of group theory, permutation groups, subgroups, Lagrange’s Theorem, quotient groups and homomorphisms. Further topics may include the classification and structure of groups and applications to geometry, matrix algebra, or number theory.
UNB complete current official course definitionAxiomatic systems, non-Euclidean geometry, transformations in geometries, topological properties of figures. As well as serving mathematics majors, this course will be of particular benefit to prospective mathematics teachers.
UNB complete current official course definitionPrimes, unique factorization, congruences, Diophantine equations, basic number theoretic functions. As well as serving mathematics majors, this course will be of particular benefit to prospective mathematics teachers.
UNB complete current official course definitionLinear algebra and its generalizations are at the heart of contemporary mathematics. Provides a rigorous treatment of linear algebra. Covers fields, vector spaces, bases and dimension, linear operators, inner product spaces, and canonical forms.
UNB complete current official course definitionTopics selected from: Principle of inclusion and exclusion, Mobius inversion, generating functions, systems of distinct representatives, Ramsey's Theorem, duality in external problems, duality in programming, dynamic programming, block designs, introduction to matroid theory, signal-flow graphs. (The course is also of interest to students in Computer Science and Engineering.)
UNB complete current official course definitionGraphs, Euler paths, tournaments, factors, spanning trees, applications; graph colourings, planar graphs, Menger's theorem, flows in networks, flow algorithms.
UNB complete current official course definitionApplications of algebraic and combinatorial methods to a selection of problems from coding theory, computability, information theory, formal languages, cybernetics and the social and physical sciences.
UNB complete current official course definitionStrategic games, n-person games in normal form, dominated strategies, Nash equilibrium, mixed strategies and mixed strategy equilibrium, games with perfect information, games with imperfect information, Bayesian games, extensive games. The course introduces basic non-cooperative game theory and analytical tools for decision makers (consumers, firms, politicians, governments). It is suitable for Mathematics, Economics, Computer Science, Management Science, Political Science, Social Science and Science students or any student with a minor in such disciplines, in particular those in the Mathematics/Statistics-Economics option.
Published notes: this course is cross-listed as ECON 4673 . Students cannot obtain credit for both MATH 3373 and ECON 4673 (or ECON 5673).
UNB complete current official course definitionThe course introduces the basic concepts of mathematical logic, including the Axiom of Choice and its equivalents; propositional logic; languages and structures, axioms and theories, models; elements of model theory (Completeness, Compactness, Löwenheim-Skolem theorems, nonstandard models); theory of computability (ChurchTuring Thesis, recursive functions and sets, recursively enumerable sets, decision problems, the Halting Problem); Gödel's Incompleteness Theorems.
UNB complete current official course definitionIntended for Mathematics, Science or Engineering students. Error analysis, convergence and stability. Approximation of functions by polynomials. Numerical quadrature and differentiation. The solution of linear and nonlinear equations and the solution of ordinary differential equations. This course will emphasize the understanding of numerical algorithms and stress applications in the applied sciences, as well as the influence of finite precision and arithmetic on computational results. Credit will not be given for both MATH 3413 and CS 3113 .
UNB complete current official course definitionMeasurement of interest, compound interest, annuities, amortization schedules and sinking funds, bonds.
UNB complete current official course definitionThe numerical solution of ordinary differential equations, and partial differential equations of elliptic, hyperbolic and parabolic type. The course is a basic introduction to finite difference methods, including the associated theory of stability, accuracy and convergence. Students will gain practical experience using state-of-the-art numerical solvers and visualization tools, while solving practical problems from the physical and biological sciences.
UNB complete current official course definitionConcepts, models and techniques in survival analysis including types of censoring and truncation, Kaplan-Meier estimators, log-rank statistics, parametric models, proportional hazards models, extended PH models, competing risks, recurrent events and frailty models.
UNB complete current official course definitionRandomization, one and two way classifications. Latin squares, factorial experiments, nesting, incomplete blocks, linear regression. Emphasis on applications. Extensive use of a statistical computer package.
UNB complete current official course definitionVisualization and representation of multidimensional data. Multivariate normal distribution , confidence regions, multivariate regression, MANOVA. Exploratory and confirmatory factor analysis, elementary causal modelling.
UNB complete current official course definitionA study of the basic principles of clear prose writing, focusing on essay structure and organization, paragraph structure, sentence structure, grammar, punctuation, and word choice, as well as revising and proofreading. Students will submit numerous written assignments.
UNB complete current official course definitionBy studying non-fiction prose models and by writing essays, students will work to improve their writing, explore techniques to craft effective essays, and develop critical and analytical skills applicable to a wide range of disciplines. Tutorials use exercises and discussions to assist this development.
UNB complete current official course definitionTwo weekly lectures examine a variety of short stories (and perhaps one or two novels) from the nineteenth, twentieth, and twenty-first centuries. Weekly small tutorials teach critical and writing skills (such as grammar, punctuation, organization, and argumentation) applied to the course readings.
UNB complete current official course definitionPolynomial, logarithmic and exponential functions. Limits and derivatives. Extreme values and related rates. Basic linear programming. Simple integration and differential equations, with stress on applications to business and economics.
Published notes: Credit may be obtained for only one of MATH 1003 , MATH 1053 , MATH 1823, or MATH 1843 .
UNB complete current official course definitionMatrices and systems of linear equations. Linear programming concepts; graphical solution of two variable problems. Permutations and combinations. Elementary probability. Mathematics of finance.
Published notes: Credit for MATH 1833 will not be given if the student has previously taken either MATH 1503 or MATH 2213 .
UNB complete current official course definitionPolynomial, logarithmic, and exponential functions. Matrices and systems of linear equations. Limits and continuity. Differentiation of elementary functions. Curve sketching and optimization. Integration of polynomial and exponential functions.
Published notes: Credit may be obtained for only one of MATH 1003 , MATH 1053 , MATH 1823 , or MATH 1843.
UNB complete current official course definitionThis course is intended for students who anticipate a career as an elementary or middle school teacher. The course focuses on topics taken from the K-8 curriculum with extensions beyond classroom topics to show the 'how' and 'why' behind school mathematics. The major topics are problem solving, number concepts, number and relationship operations, patterns and relations, shape and space, as well as data management and probability. Intended for students registered in arts programs. Not available for credit to students who would have 6 ch of Level 1000 mathematics in their degree programs.
UNB complete current official course definitionThe techniques of natural deduction, including conditional proof, indirect proof and separation of cases. Emphasizes applications in sentence logic and in the logic of quantification up to the logic of relations.
UNB complete current official course definitionThis course is designed to promote and enhance student success at UNB. Stresses access to campus resources and provides practical demonstrations of effective study practices. Includes formal lectures as well as small group tutoring. Students normally enrol in the section oriented to their specific faculties. Degree credit for the course is at the discretion of individual faculties.
UNB complete current official course definitionLogic, methods of proof, mathematical induction, elementary set theory, functions and relations.
Published notes: This course is designed for students desiring a good grounding in the foundations of mathematics. Theorems and proofs are an important part of the course. Credit will not be given for both MATH 2203 and CS 1303 . Students majoring in Mathematics must take MATH 2203.
UNB complete current official course definitionAn introductory course to practical aspects of digital system design. The course covers digital logic design, including basic design concepts and implementation technology, number representation, synthesis of combinational and sequential logic, and the use of HDL and computer-based tools.
UNB complete current official course definitionThis is an introductory course to practical aspects of digital system design. Course includes the design of digital circuits with CAD tools and VHDL hardware description language.
UNB complete current official course definitionRegister transfer systems and datapaths, microprocessors, microprocessor architecture and operation, instruction formats, assembly language programming, procedures and parameter passing, system bus timing, interfacing memory IO ports, serial and parallel data transfer, interrupts.
UNB complete current official course definitionUndertake a project at a depth not provided elsewhere in the curriculum. Plan the thesis during the preceding term, with the topic approved by a faculty member acting as a supervisor before term start s . Submit a detailed proposal, schedule, progress reports, and final thesis report to the coordinator with supervisor approval, and present a seminar. Detailed guidelines available from coordinator in the preceding term. Normally offered as an eight month course over fall and winter terms, and available over the summer term as a four month course.
Published notes: Open to all CS students in their final year with a B average in the previous assessment year or a B CGPA. To receive an Honours designation please refer to the CS Curriculum regulations in the program Section of the Calendar.
UNB complete current official course definitionLearn the fundaments of information security focusing on understanding the modern threat landscape. Explore key topics, including malicious software (malware) threats, attacks and vulnerabilities such as denial-of-service (DoS) attacks. Learn core security defence mechanisms including intrusion detection, cryptography, authentication, and access control. Gain an understanding of introductory security planning practices, including risk assessment and incident response.
UNB complete current official course definitionSurvey the principles and practice of information security. Become familiar with conventional encryption, asymmetric and symmetric cryptology, digital signatures, key exchange, authentication, electronic mail security, network management security, the common criteria, and threat risk management.
UNB complete current official course definitionExplore the rudiments of information assurance, including IT infrastructure vulnerabilities, enterprise security threats, legal and ethical security issues, zero trust concepts, and risk management. Gain the ability to review and develop security-related employment practices and policies, guidelines, awareness programs, and IT security audits. Review contemporary issues in computer security, sources of computer security threats, ethical hacking, database security issues and solutions, and security administration.
UNB complete current official course definitionExplore the intersection of computer security and software engineering , emphasizing the correctness and robustness of software, as well as security as part of the software engineering process . Gain practical experience with building a software system and securing it. Become familiar with tools, guidelines, rules, principles, and other resources for addressing security issues in every phase of the software development life cycle (SDLC). Engage in a significant group-programming project to develop a novel piece of software.
UNB complete current official course definitionExplore advanced concepts of data communications systems design including architecture, media, communication channel, routing, protocols, protocol architecture. Focus on modeling and performance analysis and introduce network simulation using tools such as in ns2 and OpNet.
UNB complete current official course definitionExplore diverse topics related to privacy preservation including basic cryptographic techniques for privacy, homomorphic encryption techniques for privacy, database privacy, big data privacy, privacy in cloud platforms, privacy in crowdsourced platforms, privacy in healthcare, privacy in vehicular ad hoc networks, privacy in social network, location privacy, as well as privacy laws and regulations. Become familiar with both theoretical aspects and practical applications of privacy enhancing techniques.
UNB complete current official course definitionExamines advanced topics in network security, including: security risks and threats, security mechanisms across OSI model layers and wireless network security. Learn to analyze systems for vulnerabilities, implement security procedures and monitor systems for security breaches.
UNB complete current official course definitionExplore digital forensics notions and methods. Gain a basic understanding and legal awareness of computer security and forensics, techniques used in the evidentiary process, various methodologies intrinsic to computer forensics with emphasis on computer incident response, and IT systems protection.
UNB complete current official course definitionBachelor of Computer Science
Current calendar degree and curriculum variants. Entry and completion rules differ; minors and unrelated diploma/joint-degree sections are excluded.
University-published career examples for Computer Science, including its published routes; some require further training or registration. These are examples, not ranked graduate outcomes.
Computer Science · Fredericton full time
2026–27 · Full-time tuition by campus · CAD
Canadian students example · Choose your category
Published tuition · Other charges extra
Housing and meals are outside this estimate.
Last updated