| source UC Davis (X) |
level |
department Engineering: Computer Science (X) |
Lecture—3 hours; discussion—1 hour. Prerequisite: two years of high school algebra. Introduction to principles of computing. Methods and algorithms for solving problems by use of a digital computer. Not open for credit to students who have completed course 30 or Engineering 6.—I, II, III. (I, II, III.) Amenta, Ludaescher, Gertz
Score: 10.500234 Details | Listing | Web page
Lecture—3 hours; laboratory—3 hours. Computer uses in modern society. Emphasis on uses in non-scientific disciplines. Includes word processing, spreadsheets, web-page creation, elementary programming, basic computer organization, the uses of computers and their influence on society. Not intended for computer science majors. Not open for credit to students who have completed course 30. Only two units of credit allowed to students who have completed Plant Sciences 21. GE credit: SciEng, Wrt.—I, II, III. (I, II, III.) Liu
Score: 10.500234 Details | Listing | Web page
Lecture—3 hours; discussion—1 hour. Prerequisite: Mathematics 21A. Discrete structures and applications in computer science. Proofs, particularly induction. Introduction to propositional logic, logic circuit design, combinatorics, recursion and solution of recurrence relations, analysis of algorithms, graph theory and trees, finite state machines. Not open for credit to students who have completed course 100.—I, II, III. (I, II, III.) Bai, Gusfield, Koehl, Max, Rogaway
Score: 10.500234 Details | Listing | Web page
Lecture—3 hours; discussion—1 hour. Prerequisite: Mathematics 16A or 21A (may be taken concurrently); prior experience with basic programming concepts (variable, loops, conditional statements) recommended. Introduction to computers and computer programming, algorithm design, and debugging. Elements of good programming style. Programming in the C language. Use of basic UNIX tools.—I, II, III. (I, II, III.) Bai, Wu
Score: 10.500234 Details | Listing | Web page
Lecture—3 hours; discussion—1 hour. Prerequisite: course 30 or the equivalent with a grade of C- or better. Elements of program design, style, documentation, efficiency. Methods for debugging and verification. Operating system tools. Principles and use of object-oriented programming in C++. Basic data structures and their use.—I, II, III. (I, II, III.)
Score: 10.500234 Details | Listing | Web page
Lecture—3 hours; discussion—1 hour. Prerequisite: course 40. Comparative study of different hardware architectures via programming in the assembly languages of various machines. Role of system software in producing an abstract machine. Only one unit of credit allowed for students who have taken Electrical and Computer Engineering 70.—I, II, III. (I, II, III.) Farrens, Matloff
Score: 10.500234 Details | Listing | Web page
Lecture—3 hours; discussion—1 hour. Prerequisite: courses 20, 40 (C++ and UNIX); grade of C- or better in each course. Design and analysis of data structures for a variety of applications. Trees, heaps, searching, sorting, hashing, graphs. Extensive programming. Not open for credit to students who have completed course 110.—I, II, III. (I, II, III.) Chen, Joy, Rogaway
Score: 10.500234 Details | Listing | Web page
Internship. Prerequisite: lower division standing; project approval prior to period of internship. Supervised work experience in computer science. May be repeated for credit. (P/NP grading only.)
Score: 10.500234 Details | Listing | Web page
(P/NP grading only.)
Score: 10.500234 Details | Listing | Web page
(P/NP grading only.)
Score: 10.500234 Details | Listing | Web page
Lecture—3 hours; discussion—1 hour. Prerequisite: course 20; Mathematics 108 recommended. Fundamental ideas in the theory of computation, including formal languages, computability and complexity. Reducibility among computational problems.—I, II, III. (I, II, III.) Bai, Franklin, Gusfield, Rogaway, Martel
Score: 10.500234 Details | Listing | Web page
Lecture—3 hours; discussion—1 hour. Prerequisite: courses 20, 60. Complexity of algorithms, bounds on complexity, algorithms for searching, sorting, pattern matching, graph manipulation, combinatorial problems, randomized algorithms, introduction to NP-complete problems.—I, II, III. (I, II, III.) Gusfield, Martel, Rogaway
Score: 10.500234 Details | Listing | Web page
Lecture—3 hours; discussion—1 hour. Prerequisite: course 122A. Theory and practice of hard problems, and problems with complex algorithm solutions. NP-completeness, approximation algorithms, randomized algorithms, dynamic programming and branch and bound. Students do theoretical analysis, implementation and practical evaluations. Examples from parallel, string, graph, and geometric algorithms.—I. (I.) Rogaway, Gusfield, Martel
Score: 10.500234 Details | Listing | Web page
Lecture—3 hours; laboratory—1 hour. Prerequisite: course 10 or 30 or Engineering 6; Statistics 12 or 13 or 32 or 100 or 131A or Mathematics 135A; Biological Science 1A or Molecular and Cellular Biology 10. Fundamental biological, mathematical and algorithmic models underlying bioinformatics; sequence analysis, database search, gene prediction, molecular structure comparison and prediction, phylogenetic trees, high throughput biology, massive datasets; applications in molecular biology and genetics; use and extension of common bioinformatics tools.—III. (III.) Filkov, Gusfield
Score: 10.500234 Details | Listing | Web page
Lecture—3 hours; discussion—1 hour. Prerequisite: college level programming course; Biological Science 1A or Molecular and Cellular Biology 10. Fundamental biological, chemical and algorithmic models underlying computational structural biology; protein structure and nucleic acids structure; comparison of protein structures; protein structure prediction; molecular simulations; databases and online services in computational structural biology.—I. (I.) Koehl
Score: 10.500234 Details | Listing | Web page
Lecture—3 hours; discussion—1 hour. Prerequisite: course 30 or Engineering 6; Mathematics 22A. Matrix-vector approach using MATLAB for floating point arithmetics, error analysis, interpolations, numerical integration, matrix computations, nonlinear equations and optimization. Parallel computing for matrix multiplication and the Cholesky factorization.—III. (III.) Bai
Score: 10.500234 Details | Listing | Web page
Lecture—3 hours; discussion—1 hour. Prerequisite: courses 50 or Engineering Electrical and Computer 70; course 60; Mathematics 21C; Mathematics 22A or Mathematics 67. Univariate and multivariate distributions. Estimation and model building. Markov/Hidden Markov models. Applications to data mining, networks, security, software engineering and bioinformatics.—II. (II.) Davidson, Ghosal, Matloff
Score: 10.500234 Details | Listing | Web page
Lecture—3 hours; discussion—1 hour. Prerequisite: course 50 or Electrical Computer Engineering 70; course 60. Syntactic definition of programming languages. Introduction to programming language features including variables, data types, data abstraction, object-orientedness, scoping, parameter disciplines, exception handling. Comparative study of several high-level programming languages.—I, III. (I, III.) Olsson, Pandey, Su
Score: 10.500234 Details | Listing | Web page
Lecture—3 hours; discussion—1 hour. Prerequisite: course 140A. Continuation of programming language principles. Further study of programming language paradigms such as functional and logic; additional programming language paradigms such as concurrent (parallel), dataflow, and constraint; key implementation issues for those paradigms; and programming language semantics.—I. (I.) Olsson, Pandey
Score: 10.500234 Details | Listing | Web page
Lecture—3 hours; discussion—1 hour. Prerequisite: courses 20, 140A; course 120 recommended. Principles and techniques of lexical analysis, parsing, semantic analysis, and code generation. Implementation of compilers.—II. (II.) Pandey, Su
Score: 10.500234 Details | Listing | Web page
Lecture—3 hours; discussion—1 hour. Prerequisite: programming skill at the level of course 60. Goals and philosophy of scripting languages, with Perl and Python as prime examples. Applications include networking, threaded programming, and graphical user interfaces (GUI's). Offered in alternate years.—III. Matloff
Score: 10.500234 Details | Listing | Web page
Lecture—3 hours; discussion—1 hour. Prerequisite: course 40; course 154A or Electrical and Computer Engineering 70; course 154B or Electrical and Computer Engineering 170 strongly recommended. Basic concepts of operating systems and system programming. Processes and interprocess communication/synchronization; virtual memory, program loading and linking; file and I/O subsystems; utility programs. Study of a real operating system.—I, II, III. (I, II, III.) Levitt, Matloff, Wu
Score: 10.500234 Details | Listing | Web page
Lecture—3 hours; discussion—1 hour. Prerequisite: course 60; Mathematics 135A or Statistics 131A or Statistics 120 or Statistics 32. Overview of local and wide-area computer networks. IS0 seven-layer model. Physical aspects of data transmission. Data-link layer protocols. Network architectures. Routing. TCP/IP protocol suite. Local area networks. Medium access protocols. Network performance analysis. Only two units of credit for students who have taken course 157. (Same course as Electrical and Computer Engineering 173A.)—I, II, III. (I, II, III.) Chuah, Ghosal, Liu, Matloff, Mohapatra, Mukherjee
Score: 10.500234 Details | Listing | Web page
Lecture—3 hours; discussion—1 hour. Prerequisite: course 152A, 150. TCP/IP protocol suite, network layer protocols, transport layer protocols, transport layer interfaces, sockets, UNIX network programming, computer networking applications, remote procedure calls and network management.—I, II, III. (I, II, III.) Mukherjee, Ghosal, Matloff, Mohapatra
Score: 10.500234 Details | Listing | Web page
Lecture—3 hours; discussion—1 hour. Prerequisite: course 152A or Electrical and Computer Engineering 173A. Advanced topics and design projects in communication networks. Example topics include wireless networks, multimedia networking, network design and management, traffic analysis and modeling, network simulations and performance analysis. Offered in alternate years. (Same course as Electrical and Computer Engineering 173B.)—(III.) Chuah, Liu, van der Schaar, Mukherjee
Score: 10.500234 Details | Listing | Web page