GUC Curriculum

Introduction to and in-depth study of the components of modern compilers: lexical, syntax, and semantic analysis; intermediate code generation; code generation and optimization; regular/context-free grammars, parsing, symbol manipulation, type checking, syntax trees, three-address code.

Practical compiler implementation as a four-milestone programming project. The final implementation generates executable code for the JVM or other target architectures.

Managing IT/IS projects through planning and execution of lifecycle phases: cost estimation, risk management, scheduling, staffing, resource allocation, communication, and control. Discusses best practice and why projects succeed or fail.

Study of how to program computers to behave in ways usually attributed to intelligence. Search algorithms, knowledge-based AI systems, logic and reasoning (resolution), planning, learning, and plan execution — motivated via an agent-oriented approach.

Fundamentals of embedded systems hardware and software design. ARM processor architecture and ISA, assembly programming of ARM-based devices, and writing efficient C for ARM targets.

Broader view of processor architectures including memory and I/O subsystems. Queuing-theory analytical methods for multiprocessor and shared-memory systems; area, time, and power consumption tradeoffs.

Design and analysis of algorithms: rates of growth, recurrences, divide and conquer, Master Theorem, dynamic programming, greedy algorithms, graph algorithms, string matching, and NP-completeness.

Taken during study abroad; content introduced Android from the basics up to a mid/upper level of command.

Fundamental graphics algorithms: 2D/3D primitives, solid modeling, 2D/3D transformations, curves and surfaces, projection, hidden surface removal, mapping techniques, color, lighting, and shading.

Concepts of computer architecture: performance measurement, instruction sets, pipelines, instruction-level parallelism, memory hierarchy, and multithreaded/multiprocessor systems.

Fundamentals of operating systems: nature, history, function within a computer system, process scheduling, synchronization, deadlocks, memory management, file systems, and I/O.

Major phases of the software lifecycle: analysis, specification, design, implementation, and testing. Team-based software project spanning requirements, architecture, procedural maturity, and ethics.

Advanced database internals. Indexing (single, multilevel, B-trees, hashing), query optimization (heuristic, cost-based), transactions and concurrency control, recovery techniques, XML, and web services.

Basic concepts and analytical tools of management: global business environment, production, logistics, operations, investments, export orientation, innovation and technology management, budgeting.

Theory and skills of database systems. High-level conceptual design with ER/EER, relational model, ER-to-relational mapping, basic SQL. Semester-long project implementing a small application on an RDBMS.

Formal languages and automata, computability theory, and introduction to complexity. Classifies problems by hardness and investigates mathematical models of computation.

Analysis and design of advanced combinational and sequential circuits. Hardware Description Languages, Verilog HDL modeling, FPGA design flow, pipelining, and fast adders.

Multimedia systems in three parts: presentation and authoring (image, graphics, video, animation, audio); data compression algorithms; and communication, retrieval, and quality-of-service.

Propositional and predicate logic, formal proof methods, sets and relations, graphs and trees, and algorithms (Dijkstra, Prim). Validation of programs and major applications in computer science.

Team-based object-oriented software development in Java: inheritance, polymorphism, interfaces, encapsulation. Plan and implement a network-enabled application with a GUI.

Components of a computer system and their interaction. How software runs on a processor and how to write efficient assembly-language programs.

Several programming paradigms — Logic (Prolog), Functional (Haskell), Procedural (C), Object-Oriented (Java). Covers naming, parameter passing, typing, polymorphism, memory management, and exceptions.

Signals and systems, linear time-invariant systems, Fourier series, continuous-time and discrete-time Fourier transforms, sampling and reconstruction, communication systems.

Op-amps, sinusoidal steady-state (AC) analysis, power calculations in AC circuits, balanced three-phase circuits, frequency-selective circuits, and Laplace transform analysis.

Principles of scientific research: locating sources, critiquing studies, conducting a literature review, and synthesizing findings into a well-structured paper.

Descriptive and inferential statistics, probability theory, discrete/continuous random variables, standard distributions, Central Limit Theorem, estimation, hypothesis testing, regression, and quality control.

Classical data structures and algorithms in Java: complexity analysis, sorting and searching, linked lists, stacks, queues, trees, hash tables, graphs, and graph algorithms.

Graphic language of engineering: lines and marks used to represent imagination or reality; tools spanning the engineering design process from first concept through development and evaluation.

Foundation of electrical engineering: building and analyzing electric circuits in steady-state and transient regimes using Kirchhoff laws and various analysis methods.

Oral communication for college and career: presentation skills, team-work in problem solving, leading and participating in group discussions, working across cultures.

Vector calculus (gradient, divergence, curl), integral theorems (Green's, Stokes', Gauss'), integral transforms, Fourier series, and partial differential equations with initial/boundary-value solutions.

Thermodynamics (laws, kinetic gas theory, heat engines), waves (wave equation, sound, Doppler, interference), and optics (geometrical, imaging, interference, diffraction, polarization), with a lab component.

Basic components of digital systems and gate-level digital hardware design. Binary numerical systems, Boolean algebra, logic gates, combinational and sequential circuit analysis and design.

Basics of computer programming in an object-oriented framework using Java. Fundamental data types, decisions/iterations, methods/recursion, classes/objects, and arrays.

Methods and procedures for the production of goods: manual material removal, machining, forming, welding, casting. Workshop experience plus product-management context.

Analyzing information through scientific thinking: problem solving, observation, analysis, inference, interpretation, argumentation in reading/oral/written expression, plus questionnaire design and reporting.

Infinite sequences and series, Taylor and Maclaurin expansions, first/second-order ODEs; vectors, matrices, linear systems, eigenvalues and eigenvectors, structure of linear vector spaces, linear difference/differential equations.

Electric charges, forces and fields, Gauss' law, potential, capacitors, current, resistance; magnetic fields and sources, Faraday/Lenz laws, inductors, motors/generators, DC and AC circuits.

Fundamentals of formal computer science: algorithm discovery and design, efficiency, data representation, Boolean logic and circuits, computer organization and assembly.

Pre-calculus foundations (real numbers, trigonometry, complex numbers, functions), continuity, limits, differentiation rules and applications, integration techniques, and applications on curves and surfaces.

Calculus-based Newtonian mechanics: vector algebra, kinematics, forces, Newton's laws, energy, momentum, collisions, rotational dynamics, gravitation, elasticity, fluid mechanics, oscillatory motion.

Modern atomic models, chemical bonding, periodic table, stoichiometry of chemical reactions, electrochemistry, and chemical kinetics.

Structured approach to academic reading and writing: viewing topics from multiple perspectives, organizing and structuring ideas, and sharpening critical reading and academic writing.