Topics include history, protocols, Hyper Text Transfer Protocol (HTTP), File Transfer Protocol (FTP), Simple Mail Transfer Protocol (SMTP), Domain Name System (DNS), peer-to-peer (P2P), transport layer design issues, transport layer protocols, Transmission Control Protocol (TCP), User Datagram Protocol (UDP), TCP congestion control, network layer, Internet Protocol version 4 (IPv4), Internet Control Message Protocol (ICMP), Internet Protocol version 6 (IPv6), routing algorithms, routing protocols, Open Shortest Path First (OSPF), Routing Information Protocol (RIP), Border Gateway Protocol (BGP), datalink layer and local area networks carrier sense multiple access with collision detection (CSMA/CD), Ethernet, virtual local area networks (VLANs), Point-to-Point Protocol (PPP), Multi-Protocol Label Switching, wireless and mobile networks, multimedia networking, security in computer networks, cryptography, and network management. Throughout this course, there is an emphasis on correctness proofs and the ability to apply the techniques taught to design efficient algorithms for problems from a wide variety of application areas. Note that if one course mentions another as its prerequisite, the prerequisites of the latter course are implied to be prerequisites of the former course as well. Boolean algebra and logic minimization techniques; sources of delay in combinational circuits and effect on circuit performance; survey of common combinational circuit components; sequential circuit design and analysis; timing analysis of sequential circuits; use of computer-aided design tools for digital logic design (schematic capture, hardware description languages, simulation); design of simple processors and memory subsystems; program execution in simple processors; basic techniques for enhancing processor performance; configurable logic devices. E81CSE347R Analysis of Algorithms Recitation. A second major in computer science can expand a student's career options and enable interdisciplinary study in areas such as cognitive science, computational biology, chemistry, physics, philosophy and linguistics. E81CSE433S Introduction to Computer Security. Registration and attendance for 347R is mandatory for students enrolled in 347. Students acquire the skills to build a Linux web server in Apache, to write a website from scratch in PHP, to run an SQL database, to perform scripting in Python, to employ various web frameworks, and to develop modern web applications in client-side and server-side JavaScript. Prerequisite: permission of advisor and submission of a research proposal form. CSE 332: Data Structures and Parallelism Covers abstract data types and structures including dictionaries, balanced trees, hash tables, priority queues, and graphs; sorting; asymptotic analysis; fundamental graph algorithms including graph search, shortest path, and minimum spanning trees; concurrency and synchronization; and parallelism. Prerequisite: CSE 330S. The goal of the course is to design a microprocessor in 0.5 micron technology that will be fabricated by a semiconductor foundry. School of Electrical Engineering & Computer . Prerequisite: CSE 247; CSE 132 is suggested but not required. Theory courses provide background in algorithms, which describe how a computation is to be carried out; data structures, which specify how information is to be organized within the computer; analytical techniques to characterize the time or space requirements of an algorithm or data structure; and verification techniques to prove that solutions are correct. A few of these are listed below. Emphasis is given to aspects of design that are distinct to embedded systems. Students work in groups and with a large game software engine to create and playtest a full-featured video game. Student at Washington University in St. Louis, Film and Media Studies + Marketing . E81CSE431S Translation of Computer Languages. Prerequisite: CSE 131/501N, and fluency with summations, derivatives, and proofs by induction. and, "Why do the rich get richer?" Important design aspects of digital integrated circuits such as propagation delay, noise margins and power dissipation are covered in the class, and design challenges in sub-micron technology are addressed. Prerequisites: CSE 247 and CSE 361S. This course covers a variety of topics in the development of modern mobile applications, with a focus on hands-on projects. While we are awash in an abundance of data, making sense of data is not always straightforward. Integrity and security requirements are studied in the context of concurrent operations on a database, where the database may be distributed over one or more locations. Teaching Assistant for CSE 332S Object-Oriented Software Development Laborator. Open up Visual Studio 2019, connect to GitHub, and clone your newly created repository to create a local working copy on your h: drive. University of Washington - Paul G. Allen School of Computer Science & Engineering, Box 352350 Seattle, WA 98195-2350 (206) 543-1695 voice, (206 . Prerequisites: Comfort with algebra and geometry at the high school level is assumed. The course emphasizes understanding the performance implications of design choices, using architecture modeling and evaluation using simulation techniques. Topics include compilation and linking, memory management, pointers and references, using code libraries, testing and debugging. Measurement theory -- the study of the mismatch between a system's intended measure and the data it actually uses -- is covered. This course introduces students to fundamental concepts in the basic operation of computers, ranging from desktops and servers to microcontrollers and handheld devices. Prerequisite: CSE 361S. All computers are made up of 0s and 1s. Computational geometry is the algorithmic study of problems that involve geometric shapes such as points, lines, and polygons. Not available for credit for students who have completed CSE 373. Prerequisite: CSE 247. Topics covered will include various C++ language features and semantics, especially from the C++11 standard onward, with studio exercises and lab assignments designed to build proficiency in using them effectively within and across the different programming paradigms. Professor of Computer Science, Second Major in Computer Science + Mathematics, Combined Undergraduate and Graduate Study, Bachelor's/Master's Program in Engineering webpage, https://cse.wustl.edu/academics/undergraduate/index.html, Bachelor of Science in Computer Engineering, Bachelor of Science in Computer Science + Economics, Bachelor of Science in Computer Science + Mathematics, Bachelor of Science in Business and Computer Science. This course introduces students to quantum computing, which leverages the effects of quantum-mechanical phenomena to solve problems. A study of data models and the database management systems that support these data models. Prerequisite: CSE 131. we do not want to mix our visual studio and linux programs, so create a new folder outside of the folder you are storing your 332 github repositories. Website: heming-zhang.github.io Email: hemingzhang@wustl.edu EDUCATION Washington University in St.Louis, St.Louis, MO August 2019 - Present McKelvey School of Engineering Master of Science, Computer Science Major GPA: 4.0/4.0 Central China Normal University, Wuhan, China September 2015 - June 2019 School of Information Management Bachelor . Prerequisite: CSE 131 [COMMON EXAMS ON XXX] Note that this course will be held in-person. A knowledge of theory helps students choose among competing design alternatives on the basis of their relative efficiency and helps them to verify that their implementations are correct. Students will learn several algorithms suitable for both smooth and nonsmooth optimization, including gradient methods, proximal methods, mirror descent, Nesterov's acceleration, ADMM, quasi-Newton methods, stochastic optimization, variance reduction, and distributed optimization. Washington University undergraduates seeking admission to the graduate degree program to obtain a master's degree in computer science or computer engineering do not need to take the Graduate Record Examination (GRE). We will cover both classic and recent results in parallel computing. Students electing the project option for their master's degree perform their project work under this course. P p2 Project ID: 53371 Star 2 92 Commits 1 Branch 0 Tags 31.8 MB Project Storage Forked from cse332-20su / p2 master p2 Find file Clone README CI/CD configuration No license. Prerequisites: CSE 247, ESE 326 (or Math 3200), and Math 233. Problems pursued under this framework may be predominantly analytical, involving the exploration and extension of theoretical structures, or they may pivot around the design/development of solutions for particular applications drawn from areas throughout the University and/or the community. System-level topics include real-time operating systems, scheduling, power management, and wireless sensor networks. An introduction to user centered design processes. Additional information can be found on our CSE website, or any of the CSE faculty can offer further guidance and information about our programs. Prerequisites: CSE 260M. Time is provided at the end of the course for students to work on a project of their own interest. The course will provide an in-depth coverage of modern algorithms for the numerical solution of multidimensional optimization problems. This course covers data structures that are unique to geometric computing, such as convex hull, Voronoi diagram, Delaunay triangulation, arrangement, range searching, KD-trees, and segment trees. Boolean algebra and logic minimization techniques; sources of delay in combinational circuits and effect on circuit performance; survey of common combinational circuit components; sequential circuit design and analysis; timing analysis of sequential circuits; use of computer-aided design tools for digital logic design (schematic capture, hardware description languages, simulation); design of simple processors and memory subsystems; program execution in simple processors; basic techniques for enhancing processor performance; configurable logic devices. E81CSE532S Advanced Multiparadigm Software Development. Washington University in St. Louis. Acign (French pronunciation:[asie]; Breton: Egineg; Gallo: Aczeinyae) is a commune in the Ille-et-Vilaine department in Brittany in northwestern France. Prerequisites: CSE 240 and CSE 247. Students intending to take CSE 497-498 must submit a project proposal form (PDF) for approval by the department during the spring semester of the junior year. Open up Visual Studio 2019, connect to GitHub, . The course will also discuss applications in engineering systems and use of state-of-the-art computer codes. This course addresses the practical aspects of achieving high performance on modern computing platforms. Students also viewed. The course emphasizes familiarity and proficiency with a wide range of C++ language features through hands-on practice completing studio exercises and lab assignments, supplemented with readings and summary presentations for each session. Skip to content Toggle navigation. Washington University in St. Louis. Readings, lecture material, studio exercises, and lab assignments are closely integrated in an active-learning environment in which students gain experience and proficiency writing, tracing, and evaluating user-space and kernel-space code. However, the conceptual gap between the 0s and 1s and the day-to-day operation of modern computers is enormously wide. The course aims to teach students how to design, analyze and implement parallel algorithms. Applicants should apply during their final undergraduate year to the semester their graduate studies will begin. To help students balance their elective courses, most upper-level departmental courses are classified into one of the following categories: S for software systems, M for machines (hardware), T for theory, or A for applications. Bayesian probability allows us to model and reason about all types of uncertainty. GitHub Gist: instantly share code, notes, and snippets. Coding/information theory emerged in mid 20th century as a mathematical theory of communication with noise. CSE332: Data Structures and Parallelism. In this course we study many interesting, recent image-based algorithms and implement them to the degree that is possible. Elevation. We cover how to adapt algorithms to achieve determinism and avoid data races and deadlock. This is a lecture-less class, please do the prep work and attend studio to keep up. & Jerome R. Cox Jr. E81CSE447T Introduction to Formal Languages and Automata, An introduction to the theory of computation, with emphasis on the relationship between formal models of computation and the computational problems solvable by those models. The course implements an interactive studio format: after the formal presentation of a topic, students develop a related project under the supervision of the instructor. Most applications courses provide background not only in the applications themselves but also in how the applications are designed and implemented. Undergraduate Programs | Combined Undergraduate and Graduate Study | Undergraduate Courses | BroadeningExperiences | Research Opportunities | Advanced Placement/Proficiency. Applications are the ways in which computer technology is applied to solve problems, often in other disciplines. Jan 2022 - Present1 year 3 months. Examples of application areas include artificial intelligence, computer graphics, game design and computational biology. This course introduces the basic concepts and methods of data mining and provides hands-on experience for processing, analyzing and modeling structured and unstructured data. Students will have the opportunity to work on topics in graphics, artificial intelligence, networking, physics, user interface design, and other topics. Students will gain experience using these techniques through in-class exercises and then apply them in greater depth through a semester long interface development project. In the beginning, students investigate a curated collection of data sets, asking questions they find interesting and exploring data using a popular platform for such studies. Sensor networks, high-speed routers, specialized FPGA hardware, wireless devices, RF tags, digital cameras, robots, large displays and multiprocessors are just a few of the hardware devices undergraduates often use in their projects. The Department of Computer Science & Engineering (CSE) offers an array of courses that can be taken as requirements or electives for any of the undergraduate degree programs. The course culminates with a creative project in which students are able to synthesize the course material into a project of their own interest. Prerequisites: CSE 240, CSE 247, and Math 310. We also learn how to critique existing work and how to formulate and explore sound research questions. View Sections. cse 332 wustl githubhorse heaven hills road conditionshorse heaven hills road conditions Projects will include identifying security vulnerabilities, exploiting vulnerabilities, and detecting and defending against exploits.