Course Criteria

Add courses to your favorites to save, share, and find your best transfer school.
  • 3.00 Credits

    Introduction to mathematical logic, different classes of automata and their correspondence to different classes of formal languages, recursive functions and computability, assertions and program verification, denotational semantics. MATH/EECS 343 and MATH 410 cannot both be taken for credit. Offered as EECS 343 and MATH 343.
  • 3.00 Credits

    The design and analysis of real-world circuits. Topics include: junction diodes, non-ideal op-amp models, characteristics and models for large and small signal operation of bipolar junction transistors (BJTs) and field effect transistors (FETs), selection of operating point and biasing for BJT and FET amplifiers. Hybrid-pi model and other advanced circuit models, cascaded amplifiers, negative feedback, differential amplifiers, oscillators, tuned circuits, and phase-locked loops. Computers will be extensively used to model circuits. Selected experiments and/or laboratory projects. Prereq: EECS 245.
  • 3.00 Credits

    This course studies important concepts underlying the design, definition, implementation and use of modern programming languages including syntax, semantics, names/scopes, types, expression, assignment, subprograms, data abstraction, and inheritance. Imperative, object-oriented, concurrent, functional, and logic programming paradigms are discussed. Illustrative examples are drawn from a variety of popular languages, such as C++, Java, Ada, Lisp, and Prolog. Recommended preparation: EECS 233, EECS 337.
  • 3.00 Credits

    Optimization techniques including linear programming and extensions; transportation and assignment problems; network flow optimization; quadratic, integer, and separable programming; geometric programming; and dynamic programming. Nonlinear optimization topics: optimality criteria, gradient and other practical unconstrained and constrained methods. Computer applications using engineering and business case studies. Recommended preparation: MATH 201.
  • 3.00 Credits

    Introduction to design, modeling, and optimization of operations and scheduling systems with applications to computer science and engineering problems. Topics include, forecasting and time series, strategic, tactical, and operational planning, life cycle analysis, learning curves, resources allocation, materials requirement and capacity planning, sequencing, scheduling, inventory control, project management and planning. Tools for analysis include: multi-objective optimization, queuing models, simulation, and artificial intelligence.
  • 3.00 Credits

    Fourier transform analysis and sampling of signals. AM, FM and SSB modulation and other modulation methods such as pulse code, delta, pulse position, PSK and FSK. Detection, multiplexing, performance evaluation in terms of signal-to-noise ratio and bandwidth requirements. Prereq: EECS 246 or requisites not met permission.
  • 3.00 Credits

    Economic analysis of engineering projects, focusing on financial decisions concerning capital investments. Present worth, annual worth, internal rate of return, benefit/cost ratio. Replacement and abandonment policies, effects of taxes, and inflation. Decision making under risk and uncertainty. Decision trees. Value of information.
  • 3.00 Credits

    Fundamental bounds on transmission of information. Signal representation in vector space. Optimum reception. Probability and random processes with application to noise problems, speech encoding using linear prediction. Shaping of base-band signal spectra, correlative coding and equalization. Comparative analysis of digital modulation schemes. Concepts of information theory and coding. Applications to data communication. Prereq: EECS 246 or requisites not met permission.
  • 3.00 Credits

    This course covers basic computational methods of organizing and analyzing biological data, targeting senior and junior level students from both mathematical/computational sciences and life sciences. The aim of the course is to provide the students with basic skills to be able to understand molecular biology data and associated abstractions (sequences, structure, gene expression, molecular network data), access to available resources (public databases, computational tools on the web). Implement basic computational methods for biological data analysis, and use understanding of these methods to solve other problems that arise in biological data analysis. Topics covered include DNA and protein sequence databases, pairwise sequence alignment and sequence search (dynamic programming, BLAST), multiple sequence alignment (HMMs, CLUSTAL-W), sequence clustering, motif finding, pattern matching, phylogenetic analysis (tree reconstruction, neighbor joining, maximum parsimony, maximum likelihood), gene finding, functional annotation, biological ontologies, analysis of gene expression data, and network biology (protein protein interactions, topology, modularity).
  • 3.00 Credits

    Formulation, modeling, planning, and control of manufacturing and automated systems with applications to computer science and engineering problems. Topics include, design of products and processes, location/spatial problems, transportation and assignment, product and process layout, group technology and clustering, cellular and network flow layouts, computer control systems, reliability and maintenance, and statistical quality control. Tools and analysis include: multi-objective optimization, artificial intelligence, and heuristics for combinatorial problems. Offered as EECS 360 and EECS 460.
To find college, community college and university courses by keyword, enter some or all of the following, then select the Search button.
(Type the name of a College, University, Exam, or Corporation)
(For example: Accounting, Psychology)
(For example: ACCT 101, where Course Prefix is ACCT, and Course Number is 101)
(For example: Introduction To Accounting)
(For example: Sine waves, Hemingway, or Impressionism)
Distance:
of
(For example: Find all institutions within 5 miles of the selected Zip Code)
Privacy Statement   |   Terms of Use   |   Institutional Membership Information   |   About AcademyOne   
Copyright 2006 - 2024 AcademyOne, Inc.