Post Baccalaureate Certificate in Computer Science (Non - Credit)

Course Descriptions

  • PBC 162 – Calculus II
    Transcendental functions, methods of integration, improper integrals, infinite series, polar coordinates, and introduction to differential equations.
    Prerequisites: Calculus I
  • PBC 220 - Computer Programming II
    Common APIs including list, priority queue, set, and map, and their efficient implementations in an object-oriented language using fundamental data structures. Sorting and other applications of recursion. Combining asymptotic analysis and experiments to extrapolate running times. Using APIs in a software project.
    Prerequisites: Computer Programming I, Calculus I
  • PBC 314 - Computer Organization and Architecture
    Digital logic and digital systems. Machine level representation of data. Assembly level machine organization. Memory system organization and architecture. Interfacing and communication. Functional organization. Multiprocessing and alternative architectures.
    Prerequisites: Computer Programming II, or Data Structures
    Corequisites: PBC 220 - Computer Programming II, PBC 309 - Discrete Mathematics I
  • PBC 317 - Data Structures and Algorithm Analysis
    Basic algorithmic analysis. Algorithmic strategies. Fundamental computing algorithms. Distributed algorithms. Cryptographic algorithms. Geometric algorithms
    Prerequisites: PBC 220 - Computer Programming II, PBC 309 - Discrete Mathematics I
  • PBC 322 - C Programming and UNIX
    C programming: Functions and program structure. Core language elements. Pointer arithmetic. System tools for C programming. Programming for UNIX: The UNIX system call interface. Interfaces to the internet. Scripting.
    Prerequisites: PBC 220 - Computer Programming II
  • PBC 405 - Computer Science Seminars
    A range of topics in Computer Science, as embodied in the seminars hosted by the Department.
    Prerequisites: 12 credits in PBC courses
  • PBC 427 - Theory of Computing
    Sets, relations, and languages. Automata theory. Basic computability theory. Turing machines. The complexity classes P and NP.
    Prerequisites: PBC 220 - Computer Programming II, PBC 309 - Discrete Mathematics I
  • PBC 224 - Introduction to Probability and Statistics
    Probability distributions, random variables, expectation and variance, point estimation, interval estimation, testing of hypothesis, analysis of variance.
    Prerequisites: Calculus I
  • PBC 309 - Discrete Mathematics I
    Mathematical methods of computer science and computer engineering. Mathematical reasoning, sets, relations, functions, Boolean algebra, combinatorics, graphs.
    Prerequisites: Calculus I
    Corequisite: Calculus II