| source UCLA (X) |
level |
department Program in Computing (X) |
Lecture, three hours; laboratory, one hour. Not open for credit to students with credit for course 1S or 10A; may not be taken concurrently with course 1S or 10A. Fundamentals of computers and computing; editors, spreadsheets, file manager; machine organization and computer hardware; Internet; software applications. P/NP or letter grading.
Score: 11.294046 Details | Listing | Web page
Lecture, one hour; laboratory, two hours. Preparation: some familiarity with computers. Not open for credit to students with credit for course 1; may not be taken concurrently with course 1. May be taken by students with credit for more advanced courses. Introduction to spreadsheets and databases in laboratory setting. P/NP grading.
Score: 11.294046 Details | Listing | Web page
Lecture, three hours; discussion, two hours. No prior programming knowledge required. Not open for credit to students pursuing specializations in Computing or to students with credit for course 20A. Basic principles of object-oriented programming and concepts, with applications from social sciences and humanities. Overview of Java programming language, programming with objects, control structures and functions, classes and object-oriented design, event-driven programming, application to multiagent models. P/NP or letter grading.
Score: 11.294046 Details | Listing | Web page
Lecture, three hours; discussion, two hours; laboratory, eight hours. Recommended requisite for students with no prior computing experience: course 1. No prior programming experience assumed. Basic principles of programming, using C++; algorithmic, procedural problem solving; program design and development; basic data types, control structures and functions; functional arrays and pointers; introduction to classes for programmer-defined data types. P/NP or letter grading.
Score: 11.294046 Details | Listing | Web page
Lecture, three hours; discussion, two hours; laboratory, eight hours. Enforced requisite: course 10A. Abstract data types and their implementation using C++ class mechanism; dynamic data structures, including linked lists, stacks, queues, trees, and hash tables; applications; object-oriented programming and software reuse; recursion; algorithms for sorting and searching. P/NP or letter grading.
Score: 11.294046 Details | Listing | Web page
Lecture, three hours; discussion, two hours; laboratory, eight hours. Enforced requisite: course 10B. More advanced algorithms and data structuring techniques; additional emphasis on algorithmic efficiency; advanced features of C++, such as inheritance and virtual functions; graph algorithms. P/NP or letter grading.
Score: 11.294046 Details | Listing | Web page
Lecture, three hours; discussion, two hours; laboratory, eight hours. Enforced requisite: course 10A. Introduction to symbolic computation using Lisp programming language. Basics: list structures, recursion, function abstraction. Advanced topics: knowledge representation, higher-order functions, problem-solving algorithms and heuristics. P/NP or letter grading.
Score: 11.294046 Details | Listing | Web page
Seminar, one hour. Discussion of and critical thinking about topics of current intellectual importance, taught by faculty members in their areas of expertise and illuminating many paths of discovery at UCLA. P/NP grading.
Score: 11.294046 Details | Listing | Web page
Lecture, three hours; discussion, two hours; laboratory, eight hours. Enforced requisite: course 10A. Introduction to Java computer language. Class and interface hierarchies; graphics components and graphical user interfaces; streams; multithreading; event and exception handling. Issues in class design and design of interactive Web pages. P/NP or letter grading.
Score: 11.294046 Details | Listing | Web page
Lecture, three hours; discussion, two hours; laboratory, eight hours. Enforced requisite: course 20A. Further aspects of use of classes, graphics components, exception handling, multithreading, and multimedia. Additional topics may include networking, servlets, database connectivity, and JavaBeans. P/NP or letter grading.
Score: 11.294046 Details | Listing | Web page
Lecture, three hours; discussion, two hours; laboratory, five hours. Enforced requisite: course 20B. Overview of Enterprise Java APIs: remote method invocation, database access with SQL, servlets, and JSP. Issues in implementation of server-side Java applications. Use of Java in conjunction with XML. Individual or group projects and presentations. P/NP or letter grading.
Score: 11.294046 Details | Listing | Web page
Lecture, three hours; discussion, two hours; laboratory, eight hours. Enforced requisite: course 10B. Description of machine organization and operation. Representation of information, instruction sets and formats, addressing modes, memory organization and management, input/output (I/O) processing and interrupts. P/NP or letter grading.
Score: 11.294046 Details | Listing | Web page
Lecture, three hours; discussion, two hours; laboratory, eight hours. Enforced requisite: course 10A. Recommended: course 10B. Introduction to core technologies of Internet, with focus on client-side Web programming. Fundamental protocols, static Web pages, Perl language, Common Gateway Interface, XML. P/NP or letter grading.
Score: 11.294046 Details | Listing | Web page
Lecture, three hours; discussion, two hours; laboratory, eight hours. Enforced requisite: course 40A. Study of advanced topics in Web programming, with focus on server-side technologies. P/NP or letter grading.
Score: 11.294046 Details | Listing | Web page
Lecture, three hours; discussion, one hour; laboratory, five hours. Enforced requisites: course 10B, Mathematics 31A, 31B, 61. Review of basic data structures: arrays, stacks, queues, lists, trees. Advanced data structures: priority queues, heaps, balanced trees. Sorting, searching techniques. Corresponding algorithms. P/NP or letter grading.
Score: 11.294046 Details | Listing | Web page
Seminar, three hours. Limited to 20 students. Designed as adjunct to lower division lecture course. Exploration of topics in greater depth through supplemental readings, papers, or other activities and led by lecture course instructor. May be applied toward honors credit for eligible students. Honors content noted on transcript. P/NP or letter grading.
Score: 11.294046 Details | Listing | Web page
Tutorial, three hours. Limited to students in College Honors Program. Designed as adjunct to lower division lecture course. Individual study with lecture course instructor to explore topics in greater depth through supplemental readings, papers, or other activities. May be repeated for maximum of 4 units. Individual honors contract required. Honors content noted on transcript. Letter grading.
Score: 11.294046 Details | Listing | Web page
Lecture, one to three hours; discussion, zero to one hour. Enforced requisite: course 10A. Variable topics in programming not covered in regular program in computing courses. May be repeated for credit with topic change. P/NP or letter grading.
Score: 11.294046 Details | Listing | Web page
Tutorial (supervised research or other scholarly work), three hours per week per unit. Entry-level research for lower division students under guidance of faculty mentor. Students must be in good academic standing and enrolled in minimum of 12 units (excluding this course). Individual contract required; consult Undergraduate Research Center. May be repeated. P/NP grading.
Score: 11.294046 Details | Listing | Web page
Lecture, three hours; discussion, two hours; laboratory, eight hours. Requisite: course 10B or equivalent familiarity with programming in C or C++ language. Introduction to programming of parallel computers. Shared and distributed memory parallel architectures; currently available parallel machines; parallel algorithms and program development; estimation of algorithmic performance; distributed computing; selected advanced topics. P/NP or letter grading.
Score: 11.294046 Details | Listing | Web page
Lecture, three hours; discussion, one hour; laboratory, three hours. Requisites: course 10B, Mathematics 115A. Design and analysis of cryptosystems for confidentiality and authentication. Classical cryptosystems and their security, modern private-key cryptosystems and applications, public-key cryptography and applications; generating prime numbers, factoring integers, discrete logarithms, digital signatures, perfect secrecy. P/NP or letter grading.
Score: 11.294046 Details | Listing | Web page
Lecture, three hours; discussion, one hour. Variable topics in programming and mathematics of programming not covered in regular program in computing courses. May be repeated for credit with topic change. P/NP or letter grading.
Score: 11.294046 Details | Listing | Web page
Seminar, three hours. Limited to 20 students. Designed as adjunct to undergraduate lecture course. Exploration of topics in greater depth through supplemental readings, papers, or other activities and led by lecture course instructor. May be applied toward honors credit for eligible students. Honors content noted on transcript. P/NP or letter grading.
Score: 11.294046 Details | Listing | Web page
Tutorial, three hours. Limited to students in College Honors Program. Designed as adjunct to upper division lecture course. Individual study with lecture course instructor to explore topics in greater depth through supplemental readings, papers, or other activities. May be repeated for maximum of 4 units. Individual honors contract required. Honors content noted on transcript. Letter grading.
Score: 11.294046 Details | Listing | Web page
Seminar, three hours. Considered equivalent to Mathematics 285A through 285L for purposes of degree requirements. Topics in various computational fields by means of lectures and informal conferences with staff members. S/U or letter grading.
Score: 11.294046 Details | Listing | Web page