UCLA: Computer Science
Para inscribirse en unas Summer Sessions en UCLA, debes seleccionar 2 cursos de Summer Sessions. A continuación puedes ver todos los cursos del área Computer Science, contenido y horario.
Recomendamos:
1.- Ver en qué sesión (fechas y duración) se imparte cada uno de los cursos de esta área.
2.- Cuando sepas los cursos que más te interesan comprueba el horario para que no se solapen entre ellos.
DURACIÓN FECHAS SESSION
6 semanas Junio 25 – Agosto 3 Session A
6 semanas Agosto 6 – Septiembre 14 Session C
8 semanas Junio 25 – Agosto 17 Session A
10 semanas Junio 25 – Agosto 31 Session A
REQUISITOS: Nivel Avanzado, TOEFL 79iBT, CAE, IELTS 6.5
Cursos de Computer Science:
| Computer Science | nº de creditos | duración en semanas | Sesión |
| Introduction to Computer Science I | 4 | 8 | A |
| Logic Design of Digital Systems | 4 | 8 | A |
| Computer Systems Architecture | 4 | 8 | A |
| Digital Design Project Lab | 4 | 8 | A |
| Introduction to Algorithms and Complexity | 4 | 8 | A |
| Introduction to Formal Languages and Automata Theory | 4 | 8 | A |
Precios INTERNATIONAL REGISTRATION FEE: 700 € | ||||||
 | ||||||
| TIPO DE ALOJAMIENTO | DURACIÓN | FECHAS | | PRECIO | ||
| | | ||||
| | | ||||
| Campus Media P. | 6 semanas. | Jun 24 - Ago 3// Ago 5 - Sep 14 | | 2.385,00 € | ||
| | | ||||
| Apartamento S.C. | 8 semanas. | Jun 24 - Ago 17 | | 3.130,00 € | ||
| | | ||||
| Apartamento S.C. | 10 semanas | Jun 24 - Ago 31 | | 3.880,00 € | ||
COMPUTER SCIENCE
Introduction to Computer Science I
Ma y Jue 12:00P 1:50P
Course Description: Lecture, four hours; discussion, two hours; outside study, six hours. Introduction to computer science via theory, applications, and programming. Basic data types, operators and control structures. Input/output. Procedural and data abstraction. Introduction to object-oriented software development. Functions, recursion. Arrays, strings, pointers. Abstract data types, object-oriented programming. Examples and exercises from computer science theory and applications. Letter grading.
Logic Design of Digital Systems
Lu y Mie 10:00A 11:50A
Lecture, four hours; discussion, two hours; outside study, six hours. Introduction to digital systems. Specification and implementation of combinational and sequential systems. Standard logic modules and programmable logic arrays. Specification and implementation of algorithmic systems: data and control sections. Number systems and arithmetic algorithms. Error control codes for digital information. Letter grading.
Computer Systems Architecture
Lu y Mie 10:00A 11:50A
Lecture, four hours; discussion, two hours; outside study, six hours. Requisites: courses 33, and M51A or Electrical Engineering M16. Recommended: courses 111, and M152A or Electrical Engineering M116L. Computer system organization and design, implementation of CPU datapath and control, instruction set design, memory hierarchy (caches, main memory, virtual memory) organization and management, input/output subsystems (bus structures, interrupts, DMA), performance evaluation, pipelined processors. Letter grading.
Digital Design Project Laboratory
Ju 2:00P 4:00P
Laboratory, four hours; discussion, two hours; outside study, six hours. Requisite: course M151B or Electrical Engineering M116C. Design and implementation of complex digital subsystems using field-programmable gate arrays (e.g., processors, special-purpose processors, device controllers, and input/output interfaces). Students work in teams to develop and implement designs and to document and give oral presentations of their work. Letter grading.
Introduction to Algorithms and Complexity
Lu y Mie 2:00P 5:00P
Lecture, four hours; discussion, two hours; outside study, six hours. Requisites: course 32, and Mathematics 61 or 180. Designed for junior/senior Computer Science majors. Introduction to design and analysis of algorithms. Design techniques: divide-and-conquer, greedy method, dynamic programming; selection of prototypical algorithms; choice of data structures and representations; complexity measures: time, space, upper, lower bounds, asymptotic complexity; NP-completeness. Letter grading.
Introduction to Formal Languages and Automata Theory
Ma y Mie 4:00P 6:00P
Lecture, four hours; discussion, two hours; outside study, six hours. Requisites: course 32, and Mathematics 61 or 180. Designed for junior/senior Computer Science majors. Grammars, automata, and languages. Finite-state languages and finite-state automata. Context-free languages and pushdown story automata. Unrestricted rewriting systems, recursively enumerable and recursive languages, and Turing machines. Closure properties, pumping lemmas, and decision algorithms. Introduction to computability. Letter grading.
Add this page to your favorite Social Bookmarking websites
