Advanced Programming
sort by: Relevancy | Title | Rating try advanced search for more options
-
This course is the second of a two-term sequence. The focus is on coding techniques for approaching the Shannon limit of additive white Gaussian noise (AWGN) channels, their performance analysis, and design principles. After a review of Principles of Digital Communication I and the Shannon limit for AWGN channels, the course begins by discussing small signal constellations, performance analysis and coding gain, and hard-decision and
This course uses the theory and application of atomistic computer simulations to model, understand, and predict the properties of real materials. Specific topics include: energy models from classical potentials to first-principles approaches; density functional theory and the total-energy pseudopotential method; errors and accuracy of quantitative predictions: thermodynamic ensembles, Monte Carlo sampling and molecular dynamics...more
-
This is an introductory chemistry course for students with an unusually strong background in chemistry. Knowledge of calculus is recommended. Emphasis is on basic principles of atomic and molecular electronic structure, thermodynamics, acid-base and redox equilibria, chemical kinetics, and catalysis. The course also covers applications of basic principles to problems in metal coordination chemistry, organic chemistry, and biological chemistry.
-
Welcome to Georgetown University Founded in 1789, Georgetown University is the nation's oldest Catholic and Jesuit university. Today, Georgetown is a major international research university that embodies its founding principles in the diversity of our students, faculty, and staff, our commitment to justice and the common good, our intellectual openness, and our international character. Georgetown is ranked No. 21 among national...more
-
Concentrates on recognizing and solving convex optimization problems that arise in engineering. Topics include: Convex sets, functions, and optimization problems. Basics of convex analysis. Least-squares, linear and quadratic programs, semidefinite programming, minimax, extremal volume, and other problems. Optimality conditions, duality theory, theorems of alternative, and applications. Interiorpoint methods. Applications to signal...more
-
The purpose of this course is to introduce you to basics of modeling, design, planning, and control of robot systems. In essence, the material treated in this course is a brief survey of relevant results from geometry, kinematics, statics, dynamics, and control. The course is presented in a standard format of lectures, readings and problem sets. Lectures will be based mainly, but not exclusively, on material in the Lecture Notes....more
-
This course is all about understanding: understanding what's going on inside your computer when you flip on the switch, why tech support has you constantly rebooting your computer, how everything you do on the Internet can be watched by others, and how your computer can become infected with a worm just by turning it on. In this course we demystify computers and the Internet, along with their jargon, so that students understand not only...more
-
This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing.
-
This course will go in-depth in the theory of how war is conducted within the confines of the game Starcraft. There will be lecture on various aspects of the game, from the viewpoint of pure theory to the more computational aspects of how exactly battles are conducted. Calculus and Differential Equations are highly recommended for full understanding of the course. Furthermore, the class will take the theoretical into the practical...more
-
Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language.
-
Stanford University offers a Professional Certificate in Advanced Computer Security that can be earned entirely through part-time online study. The program is administered through the Stanford Center for Professional Development. Recommended Background: Students should have the equivalent of a BS in Computer Science and a background in computer security. Requirements and Costs: The certificate requires successful completion of 6...more
-
Basic concepts of operating systems and system programming. Utility programs, subsystems, multiple-program systems. Processes, interprocess communication, and synchronization. Memory allocation, segmentation, paging. Loading and linking, libraries. Resource allocation, scheduling, performance evaluation. File systems, storage devices, I/O systems. Protection, security, and privacy.
