UCLA Graduate Catalog 1980-81 - Registrar - UCLA

ENGINEERING AND APPLIED SCIENCE / 129
212C. Computer Communications Networks. (For- machine architectures to facilitate direct or nearly organization and system control. Arithmetic promerly
numbered Engineering 223C.) Prerequisite:
Computer Science 212A. Computer communication
network models, analysis and design techniques are
examined. Experience with an existing international
network (the ARPANET) is discussed and
the operational procedures and pitfalls are presented.
Measured performance and cost effectiveness
of large scale computer networks are considered.
Mr. Kleinrock (Sp)
direct execution of high level languages: Algol-like
machines including Burroughs B6700, microprogramming
and microprogrammable
machines, measurements and their use in architecture
design. Mr. Berry, Mr. Martin (Sp)
239. Current Topics in Computer Science-Programming
Languages and Systems . (f to 4
courses ) (Formerly numbered Engineering 226Z.)
Prerequisite: consent of the instructor. Review of
cessors: algorithms and implementation. Storage
system organization: hierachy and management)
Communication organization and control.
Mr. Avizienis, Mr. Ercegovac (F,W,Sp)
252A. Computer Science Design : Arithmetic Processors.
(Formerly numbered Engineering 225A.)
Prerequisite: Computer Science 251A or consent of
instructor. Concepts of number systems, digital
numbers, algorithms; logic and organization of
219. Current Topics in Computer System Model- current literature in an area of computer science digital arithmetic processors; conventional
ing Analysis. (% to 3 courses) Prerequisite: consent programming languages and systems in which the arithmetic; algorithm acceleration; floating-point
of the instructor. Review of current literature in an instructor has developed special proficiency as a and significance arithmetics; redundant, signed-
area of Computer System Modeling Analysis in consequence of research interests. May be repeated digit, residue number systems; error detecting
which the instructor has developed special profi- for credit, provided no duplication exists. codes for digital arithmetic; algorithm evaluatipn
ciency as a consequence of research interests. Stu- The Staff, Computer Science Department by analysis and simulation.
dent reports on selected topics. May be taken for
(F,W,Sp)
Mr. Avizienis, Mr. Ercegovac (F,Sp)
credit more than once with consent of the instructor.
The Staff, Computer Science Department
(F,W,Sp)
221. Economics of Computers . Prerequisite: consent
of instructor. Basic economic factors in data
processing. Buyers and sellers; products; applications;
major cost factors. Selection and operation of
a data processing system.
Mr. Estrin, Mr. Melkanoff (F)
241A. Data Management Systems . (Formerly numbered
Engineering 226D.) Prerequisite: Computer
Science 131 or Management 113A-113B, or equivalent;
Computer Science 141 or equivalent. Information
and file handling in higher level languages,
storage devices and operating systems. Secondary
index organizations. Models and architecture of
data management systems. Logical and physical
structures. Query languages. Commercially available
generalized file management and data base
253A. Computer System Design : Fault Tolerance.
(Formerly numbered Engineering 225C.) Prerequisite:
Computer Science 251A. Specification of
fault-tolerance: fault classes, measures of
reliability. Fault masking, fault detection, and system
recovery algorithms. Methodology of implementation.
Analytic modeling and evaluation.
Design of fault-tolerance systems. Tolerance of
man-made faults. Fault-tolerant software.
Mr. Avizienis, Mr. Rennels (W)
231A. Advanced Topics in Programming
Languages . (Formerly numbered Engineering
225P.) Prerequisite: Computer Science 131. Presentation,
analysis and discussion of specialized
programming languages, new higher level
languages and new and/or advanced features of
programming languages.
Mr. Berry, Mr. Melkanoff (W)
231B. Advanced Topics in Computer Language
Design . Prerequisites: Computer Science 132, 141,
M123B, 232A or 232B. Treatment of current topics
in computer language design including design
goals of modern languages, levels of abstraction,
methodologies for standardization and proposals
for new problem oriented and extensible languages.
Enrollment limited to allow individual application
of language design principles. Mr. Uzgalis (Sp)
232A. Operational Semantics of Programming
Languages . (Formerly numbered Engineering
225K.) Prerequisite: Computer Science courses
123B and 131. (May be taken concurrently.)
Interpreter Models of Programming Language
Semantics: information structure models, Vienna
definition language, lambda calculus, LISP definition,
interpreter equivalence and correctness.
management systems. Management information
253B. Advanced Topics in Fault-Tolerant Comput-
systems. Mr. Cardenas, Mr. Muntz, Mr. Popek
ing. Prerequisite: Computer Science 253A. Analysis
(W,Sp)
and discussion of the modeling, design, and evalua-
241B. Data Base, Software , and Information Systion of fault-tolerant computer systems. Emphasis
tems. Prerequisites: Computer Science 131 or Man- on current research results and new systems in the
agement 113A-113B, and Computer Science 241A, stages of design and development. May be repeated
or equivalent. Data base systems technology. for credit, provided no duplication exists.
Application program development technology.
Mr. Avizienis, Mr. Rennels (Sp)
Information system development cycle and
254A. Computer Memories and Memory Systems.
methodology. Systems analysis. Feasibility and
(Formerly numbered Engineering 225D.) Pre-
cost/effectiveness studies. Software architecture,
requisite: Computer Science 251A or consent of in-
management, costing. Automated program and
structor. Generic types of memory systems; control,
data base generation. Problem statement languages.
access modes, hierarchies and allocation
Various topics at instructor's discretion, emphasiz-
algorithms. Characteristics, system organization
ing data base technology. Mr. Cardenas (F)
and device considerations of ferrite memories, thin
242A. Privacy and Security in Computer Informa- film memories and semiconductor memories.
tion Systems . Prerequisites: Computer Science 111
Mr. Chu, Mr. Rennels (F,Sp)
or consent of the instructor. Analysis of the tech-
255A. Data Communications in Computer Sysnical
difficulties of producing secure computer
tems. (Formerly numbered Engineering 225F.) Pre-
information systems that provide guaranteed conrequisite:
Engineering 120A and Computer Science
trolled sharing, with emphasis on software models
251 A or consent of instructor. Intraprocessor Com-
and design. Examination and critique of current
munications: communication between processor,
systems and practices. Possible certifiability of such
memory and input/output. Multiprocessor com-
systems. Relevant social issues. Mr. Popek (W)
munication , switching and multiplexing.
Mr. Berry, Mr. Melkanoff (F) 243A. Relational Data Bases . Prerequisites: Com- Multicomputer systems: interprocess communica-
232B. Semantics of Programming Languages. (Formerly
numbered Engineering 225L.) Prerequisites:
Computer Science M123B or equivalent, or consent
of the instructor. Syntax-directed semantics of context-free
languages. Knuthian semantic systems (Ksystems)
and their mathematical formulation. Ksystem
formulation of programming language
semantics; translational and denotational semantics.
Properties of K-systems; equivalence of K-sysputer
Science 131, 141. The Relational Model of
Data: definition and operations; relational
languages. Relational Data Bases: experimental and
commercial; design methodology.
Mr. Melkanoff, Mr. Parker (F)
243B. Abstract Data Types and Program Specification.
Prerequisites: Computer Science 141, Computer
Science M123B. The notions of abstract data
type and abstract program specification permit one
tions, synchronization, flow control, file allocation
and dead lock problems. Communications with
remote multiple terminals: measurements and
modeling, error detection and handling, optimal
block size, line control protocol, and multiplexing.
Mr. Chu (W)
255B. Distributed Processing and Distributed Data
Base System. Prerequisite: Computer Science 255A.
Interprocess communications, protocol, interface
tems. Applications of current research interest. to understand how programs manipulate data, design , bus structures , system reconfiguration,
Mr. Martin (F) independently of their implementations. These error recovery. Task partitioning, performance
234A. Correctness Proofs. Prerequisite: consent of
the instructor. Theoretical and practical aspects of
correctness proofs. Partial correctness, total correctness,
and termination. Axiomatic semantics and
proof systems. Abstraction and correctness of
implementations. Formulation, execution, and
assessment of correctness proofs. Topics of current
research interest. Mr. Martin (W)
notions also give powerful techniques for program optimization, microprocessor based distributed
structuring and verification. The class will include processing system. File allocation, directry design,
programming exercises. Mr. Goguen (W) deadlock, consistency, synchronization, file
availability, query optimization , data translation.
249. Current Topics in Data Structures . (' to 3
Examples, tradeoffs, and design experiences.
courses) Prerequisite: consent of the instructor.
Mr. Chu (Sp)
Review of current literature in an area of Data
Structures in which the instructor has developed 256A. Interactive Computer Graphics . (Formerly
special proficiency as a consequence of research numbered Computer Science 274A.) Prerequisite:
234B. Advanced Topics in Software Engineering.
Prerequisites: Computer Science 131 and Computer
Science 232A or 232B. A course to explore current
topics in software engineering and closely related
topics, i.e., structured program, program proofsanalysis
and synthesis of programs, abstract data
types, modularity, debugging, programming teams.
Mr. Berry (Sp)
interests. Student reports on selected topics. May be
taken for credit more than once with the consent of
the instructor.
The Staff, Computer Science Department
(F,W,Sp)
251A. Advanced Computer Architecture. Prerequisites:
Computer Science 151A, 151B, and 111,
or consent of instructor. Functional and structural
Computer Science 174 or equivalent. Current topics
in interactive computer graphics system design,
development, and applications. Mr. Bussell (Sp)
257A. Computer System Design: Comparative
Architecture and Synthesis Methods. (Formerly
numbered Engineering 225B.) Prerequisite: Computer
Science 252A. Advanced topics in Computer
System Architecture. Elucidate important proper-
234C. High Level Language Computer Architec- models of computer systems. Architecture and ties of computer systems and study methods for
ture . Prerequisites: Computer Science 131 and organization at microprogramming, machine modeling, evaluating, and synthesizing them.
Computer Science 232A or 232B. A study of language and operating system level. Processor
Mr. Estrin (W)