COM SCI 252A
Arithmetic Algorithms and Processors
Computer Science · 4 units · Graduate courses (200-299)
Number systems: conventional, redundant, signed-digit, and residue. Types of algorithms and implementations. Complexity measures. Fast algorithms and implementations for two-operand addition, multioperand addition, multiplication, division, and square root. Online arithmetic. Evaluation of transcendental functions. Floating-point arithmetic and numerical error control. Arithmetic error codes. Residue arithmetic. Examples of contemporary arithmetic ICs and processors.
Letter grading.
Requisites
Official UCLA wording
Requisite: course 251A.
BruinTree reads · Prerequisite
confidence 1.00 · from textRequires
Everything that has to come before this course, not just the courses named in the requisite above.
COM SCI 252A
- COM SCI 251AAdvanced Computer Architecture
- COM SCI M151BComputer Systems Architecture
- COM SCI M51ALogic Design of Digital Systems
- EC ENGR M16Logic Design of Digital Systems
1 direct requisite. Showing 5 courses over 3 levels; the branches marked with a count carry on past it. Every course here opens its own tree.
Unlocks
What this course is a requisite for, and what those courses lead to in turn.
No course in the catalog lists this as a requisite.