| source UC San Diego (X) |
level |
department Computer Science and Engineering (CSE) (159) |
Introduces the concepts and skills necessary to effectively use information technology. Includes basic concepts and some practical skills with computer and networks.
Score: 10.332533 Details | Listing | Web page
Exploration of concepts in mathematics and engineering as they relate to classical architecture in Rome, Italy. Geometrical constructions and engineering analyses of the Colosseum, Pantheon, St. Peter’s Basilica and Square, Roman bridges and aqueducts, etc.
Score: 10.332533 Details | Listing | Web page
(Formerly CSE 62A) Introduction to algorithms and top-down problem solving. Introduction to the C language including functions, arrays, and standard libraries. Basic skills for using a PC graphical user interface operating system environment. File maintenance utilities are covered. (A student may not receive credit for CSE 5A after receiving credit for CSE 10 or CSE 11 or CSE 8B or CSE 9B or CSE 62B or CSE 65.)
Score: 10.332533 Details | Listing | Web page
Basic Unix. Basics of Java language. Classes, methods, and parameters. Modularity and abstraction. Documentation techniques. Testing and verification techniques. Basic inheritance. Event-driven programming. Programming with AWT library or other similar library. CSE 8A, CSE 8B, and CSE 8AL is a slower paced version of CSE 11 with more programming practice. Concurrent enrollment with CSE 8AL is required. Students who have taken CSE 8B or CSE 11 may not take CSE 8A. Majors only.
Score: 10.332533 Details | Listing | Web page
Exercises in the theory and practice of computer science under the supervision of an instructor. Hands-on experience with designing, editing, compiling, and executing programming constructs and applications. Must be taken concurrently with CSE 8A. CSE 8A, CSE 8B, and CSE 8AL is a slower paced version of CSE 11 with more programming practice. Students who have taken CSE 8B or CSE 11 may not take CSE 8AL. Majors only.
Score: 10.332533 Details | Listing | Web page
Continuation of the Java language. Continuation of programming techniques. More on Inheritance. Exception handling. CSE 8A-B is a slower paced version of CSE 11 with more programming practice. (Students who have taken CSE 9A or CSE 9B or CSE 10 or CSE 11 may not take CSE 8B.)
Score: 10.332533 Details | Listing | Web page
Introduction to computer science and programming using the Java language. Basic UNIX. Modularity and abstraction. Documentation, testing and verification techniques. Basic object-oriented programming including inheritance and dynamic bind. Exception handling. Event-driven programming. Experience with AWT library or other similar library.
Score: 10.332533 Details | Listing | Web page
Basic data structures including stacks, queues, lists, binary trees, hash tables. Basic object-oriented design including encapsulation, polymorphism, classes as the implementation of abstract data types. Memory management, pointers, recursion, and big-o notation. Uses the C/C++ and Java programming language.
Score: 10.332533 Details | Listing | Web page
Hands-on exploration of software development tools and techniques. Investigation of the scientific process as applied to software development and debugging. Emphasis is on weekly hands-on laboratory experiences, development of laboratory notebooking techniques as applied to software design.
Score: 10.332533 Details | Listing | Web page
Basic discrete mathematical structure: sets, relations, functions, sequences, equivalence relations, partial orders, and number systems. Methods of reasoning and proofs: propositional logic, predicate logic, induction, recursion, and pigeonhole principle. Infinite sets and diagonalization. Basic counting techniques; permutation and combinations. Applications will be given to digital logic design, elementary number theory, design of programs, and proofs of program correctness. Credit not offered for both Math. 15A and CSE 20. Equivalent to Math 15A.
Score: 10.332533 Details | Listing | Web page
This course will provide an introduction to the discrete mathematical tools needed to analyze algorithms and systems. Enumerative combinatorics: basic counting principles, inclusion-exclusion, and generating functions. Matrix notation. Applied discrete probability. Finite automata. Credit not offered for both Math. 15B and CSE 21. Equivalent to Math 15B.
Score: 10.332533 Details | Listing | Web page
Introduction to organization of modern digital computers—understanding the various components of a computer and their interrelationships. Study of a specific architecture/machine with emphasis on systems progrmming in C and Assembly languages in a UNIX environment.
Score: 10.332533 Details | Listing | Web page
Introduction to software development and engineering methods, including specification, design, implementation, testing, and process. An emphasis on team development, agile methods, and use of tools such as IDE’s, version control, and test harnesses.
Score: 10.332533 Details | Listing | Web page
The objective of the course is to help the programmer create a productive UNIX environment. Topics include customizing the shell, file system, shell programming, process management, and UNIX tools.
Score: 10.332533 Details | Listing | Web page
Helps the Java programmer to be productive in the C++ programming environment. Topics include the similarities and differences between Java and C++ with special attention to pointers, operator overloading, templates, the STL, the preprocessor, and the C++ Runtime Environment.
Score: 10.332533 Details | Listing | Web page
A seminar format discussion led by CSE faculty on topics in central areas of computer science, concentrating on the relation among them, recent developments, and future directions.
Score: 10.332533 Details | Listing | Web page
This course helps students to read and write technical English better, and to read and write software better. They write short papers responding to a CSE-related book, learn the basics of functional programming, and do a project using a functional language.
Score: 10.332533 Details | Listing | Web page
The Freshman Seminar Program is designed to provide new students with the opportunity to explore an intellectual topic with a faculty member in a small seminar setting. Freshman seminars are offered in all campus departments and undergraduate colleges, and topics vary from quarter to quarter. Enrollment is limited to 15 to 20 students, with preference given to entering freshmen.
Score: 10.332533 Details | Listing | Web page
Independent reading or research by special arrangement with a faculty member.
Score: 10.332533 Details | Listing | Web page
Descriptive and analytical presentation of data structures and algorithms. Lists, tables, priority queues, disjoint subsets, and dictionaries data types. Data structuring techniques include linked lists, arrays, hashing, and trees. Performance evaluation involving worst case, average and expected case, and amortized analysis. Credit not offered for both Math. 176 and CSE 100. Equivalent to Math. 176.
Score: 10.332533 Details | Listing | Web page
Design and analysis of efficient algorithms with emphasis of non-numerical algorithms such as sorting, searching, pattern matching, and graph and network algorithms. Measuring complexity of algorithms, time and storage. NP-complete problems. Credit not offered for both Math. 188 and CSE 101. Equivalent to Math 188.
Score: 10.332533 Details | Listing | Web page
Descriptive and analytic introduction to storage system architectures. Disk drive storage media organization and run-time performance; external indexing data structures B+trees and linear hashing algorithms. Disk arrays, RAID data organization, reliability, sparing, data declustering, and video servers.
Score: 10.332533 Details | Listing | Web page
An introduction to the mathematical theory of computability. Formal languages. Finite automata and regular expression. Push-down automata and context-free languages. Computable or recursive functions: Turing machines, the halting problem. Undecidability. Credit not offered for both Math. 166 and CSE 105. Equivalent to Math 166.
Score: 10.332533 Details | Listing | Web page
Topics include private and public-key cryptography, block ciphers, data encryption, authentication, key distribution and certification, pseudorandom number generators, design and analysis of protocols, zero-knowledge proofs, and advanced protocols. Emphasizes rigorous mathematical approach including formal definitions of security goals and proofs of protocol security.
Score: 10.332533 Details | Listing | Web page
Introduction to object-oriented analysis and design. Object-oriented modeling methods for analysis and design, object-oriented general design paradigms, object-oriented design techniques. Cyclic development of object-oriented systems.
Score: 10.332533 Details | Listing | Web page
1 - 25 26 - 50 51 - 75 76 - 100 101 - 125 126 - 150 151 - 159