|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
4.00 Credits
Lecture/discussion-4 hours. Prerequisite: course 67; or courses 22A and 25. Coding theory, error correcting codes, finite fields and the algebraic concepts needed in their development. Not open for credit to students who have completed former course 149B.-II. (II.)
-
4.00 Credits
Lecture/discussion-4 hours. Prerequisite: course 67. Basic concepts of groups, symmetries of the plane. Emphasis on the techniques used in the proof of the ideas (Lemmas, Theorems, etc.) developing these concepts. Precise thinking, proof writing, and the ability to deal with abstraction.-I. (I.)
-
4.00 Credits
Lecture/discussion-4 hours. Prerequisite: course 150A. Bilinear forms, rings, factorization, modules.- II. (II.)
-
4.00 Credits
Lecture/discussion-4 hours. Prerequisite: course 150B. Group representations, fields, Galois theory.- III. (III.)
-
4.00 Credits
Lecture-3 hours; project. Prerequisite: course 22A or 67; one of the following courses: 25, 108, 114, 115A, 141, or 145. Relational model; relational algebra, relational calculus, normal forms, functional and multivalued dependencies. Separability. Cost benefit analysis of physical database design and reorganization. Performance via analytical modeling, simulation, and queueing theory. Block accesses; buffering; operating system contention; CPU intensive operations. Offered irregularly.
-
4.00 Credits
Lecture-3 hours; project. Prerequisite: Computer Science Engineering 30 or equivalent; course 22B and one of the following courses: 25, 67, 108, 114, 115A, 141 or 145. Introduction to computational mathematics, symbolic computation, and computer generated/verified proofs in algebra, analysis and geometry. Investigation of rigorous new mathematics developed in conjunction with modern computational questions and the role that computers play in mathematical conjecture and experimentation.-I. (I.)
-
4.00 Credits
Lecture-3 hours; extensive problem solving. Prerequisite: course 22A or 67. Linear algebra; linear equations; orthogonal projections, similarity transformations, quadratic forms, eigenvalues and eigenvectors. Applications to physics, engineering, economics, biology and statistics.-I, II, III. (I, II, III.)
-
4.00 Credits
Lecture-3 hours; extensive problem solving. Prerequisite: Computer Science: Engineering 30 or equivalent; courses 21C or 25; 22A or 67. Linear programming, simplex method. Basic properties of unconstrained nonlinear problems, descent methods, conjugate direction method. Constrained minimization. Programming language required.-III. (III.)
-
4.00 Credits
Lecture-3 hours; discussion-1 hour. Prerequisite:two years of high school algebra, plane geometry, plane trigonometry, and analytical geometry, and satisfying the Mathematics Placement Requirement. Introduction to differential calculus via applications in biology and medicine. Limits, derivatives of polynomials, trigonometric, and exponential functions, graphing, applications of the derivative to biology and medicine. Not open for credit to students who have completed course 16B, 16C, 21A, 21B, or 21C. Only 2 units of credit to students who have completed course 16A. GE credit: SciEng.-I, II, III. (I, II, III.)
-
4.00 Credits
Lecture-3 hours; discussion-1 hour. Prerequisite:course 16A, 17A, or 21A. Introduction to integral calculus and elementary differential equations via applications to biology and medicine. Fundamental theorem of calculus, techniques of integration including integral tables and numerical methods, improper integrals, elementary first order differential equations, applications in biology and medicine. Not open for credit to students who have completed course 16C, 21B, or 21C. Only 2 units of credit for students who have completed course 16B. GE credit: SciEng.-I, II, III. (I, II, III.)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|