Topics include security and cryptography basics, vulnerability analysis, secure software development, and distributed system security. Offered by, Topics of special interest to undergraduates. Foundation for courses on compilers; networks; operating systems; and computer architecture, where a deeper understanding of systems-level issues is required. Note: The department will drop students who fail to meet the prerequisites. Topics include video processing, visualization, virtual environments, adaptation and tutoring, image and scene modeling, analysis and synthesis, face and gesture recognition, and speech and natural language processing. Concepts and methods for the design of large-scale software systems. Topics include scan conversion, transformation, viewing, lighting, blending, texture mapping, and some advanced graphics techniques. Topics include use and implementation of linear and nonlinear data structures and the design and analysis of elementary algorithms. Literature review, project report, or other written product usually required. Required Prerequisite: CS 551B-.B- Requires minimum grade of B-. Topics to be covered include: data modeling with the Entity-Relationship model, the relational data model and its formal languages, SQL, the theory of database design, object databases, XML and Web data. Examines parallel algorithms and parallel programming languages relative to architecture of particular parallel computers. Offered by, Rigorous introduction to problem solving through development of computer programs. Requires final exhibition to faculty-industry panel. Offered by, Covers study of alternate computer security, including how these methods can be combined in a layered defense and factors that affect the selection of the architectures. save . Programming is a significant part of this course and students should expect to spend a good deal of time on the programming projects. Required Prerequisites: (CS 540B- and 583B-).B- Requires minimum grade of B-. Topics include role of various media and software components, local and wide area network protocols, network design, performance and cost considerations, and emerging advanced commercial technologies. Memory hierarchy, cache, and virtual memory input-output processing. CS 310 Programming Assignment #1. You are going to use 2-3 established libraries to quickly develop the internal representation of an advanced data structure (a graph) and simulate a simple graph algorithm. This course is taught from a programmatic perspective using C, with special topics in both Java and Python. Offered by, Models of operating systems. Barebones Unix - George Dillon Offered by, Principles and methods for knowledge representation, reasoning, learning, problem solving, planning, heuristic search, and natural language processing and their application to building intelligent systems in a variety of domains. CS 310 Programming Assignment 4 Due: May 5th (Sunday) 11:59pm, 2019. Includes a project to introduce problem solving using computers. Offered by, Basic principles of visual perception and their implementation on computer systems. Notes: No more than 24 credits of, Dissertation research under the supervision of the dissertation director. Required Prerequisites: (CS 681B-, 687B- or 688B-).B- Requires minimum grade of B-. Required Prerequisite: CS 555B-.B- Requires minimum grade of B-. Personally, I really like that. The principle of academic integrity is taken very seriously and violations are treated gravely. Topics include early visual processing, edge detection, segmentation, intrinsic images, image modeling, representation of visual knowledge, and image understanding. CS at GMU. Uh oh! Notes: May be repeated if topics substantially different. Topics include decision theory and Bayes' theorem, density (parametric and nonparametric) estimation, linear and nonlinear discriminant analysis, SVM and kernel methods, SRM and model selection, performance evaluation, mixture of experts (AdaBoost), dimensionality reduction, feature selection and extraction, and clustering. New comments cannot be posted and votes cannot be cast. This course analyzes many examples of autonomic systems as well as various techniques to design and build such systems. Program testing and debugging are discussed to verify that problems are solved correctly. For this assignment, you have to represent and manipulate polynomials represented as linked lists. May only be taken in the first semester at GMU. This is the discussion forum for sections 001/003/004 only with Prof. Russell and Prof. Zhong. It is suggested that you implement these tasks in the given order: See the Examples Page for what the simulator should be able to do when you are done, and then see the Task Details Page for a walk-through of each specific task. Offered by, Original or expository work evaluated by committee of three faculty members. A large portion of the course is devoted to projects, normally performed in student teams, who apply the techniques presented. Students complete projects involving real images. Lectures and Labs are offered in groups. George Mason University Summer 2017 Schedule and Lecture Materials. Offered by, Fundamental principles and techniques for implementing computational algorithms to solve problems in biology arising from the need to process large volumes of genomic information. Techniques for the use of analytic and simulation models, design of experiments, hypothesis testing, and statistical analysis of data are presented. Offered by, Special topics in computer science not occurring in regular computer science sequence. Enrollment limited to students in the Volgenau School of Engineering college. Offered by, Examines advanced compiler techniques such as code optimizations for sequential and parallel machines; compilers for logical, functional, or object-oriented languages; and other topics in current literature. Students will learn the proper engineering use of techniques such as information hiding, classes, objects, inheritance, exception handling, event-based systems, and concurrency. * May be taken concurrently.C Requires minimum grade of C. Required Prerequisites: (((COMM 100C or 101C) and ENGH 302C) or (HNRS 110C and 122C) or (HNRS 110C and 130C) or (HNRS 131C, 240C, 260C, 261C, 360C or 361C)) and (CS 105C or 110C).C Requires minimum grade of C. Required Prerequisites: (CS 211C and (MATH 113C or 124C)).C Requires minimum grade of C. Required Prerequisites: CS 310C and (ENGH 302C or (HNRS 110C and 122C) or (HNRS 110C and 130C) or (HNRS 131C, 240C, 260C, 261C, 360C or 361C)).C Requires minimum grade of C. Enrollment is limited to students with a major, minor, or concentration in Applied Computer Science, Computer Science, Software Engineering or Systems Engineering. report. Welcome to CS310! | CS 310: Data Structures (001/003/004) is a course taught at George Mason University by Notes: This course cannot be taken for credit by students of the MS CS, MS ISA, MS SWE, CS PhD or IT PhD programs. May not be taken for credit by students in the PhD CS or accelerated MSCS programs. Offered by, Data communications and networking protocols, with study organized to follow layers of Internet Protocol Suite (TCP/IP family of protocols). Searching and Hashing. Program 1 is here. GMU is an Honor Code university; please see the Office for Academic Integrity for a full description of the code and the honor committee process, and the Computer Science Department’s Honor Code Policies regarding programming assignments. Data structures include disjoint sets, heaps, and dynamic trees. Offered by, Abstract concepts that underlie much advanced work in computer science, with major emphasis on formal languages, models of computation, logic, and proof strategies. Offered by, Programming-intensive lab course. Required Prerequisite: CS 112*C.* May be taken concurrently.C Requires minimum grade of C. Enrollment is limited to students with a major in Applied Computer Science or Computer Science. Offered by, Research and analysis of selected problems or topics in computer science. © 2020-2021 George Mason University. Emphasizes system integration in terms of perception, control, action, and adaptation. The course Offered by Computer Science. Documents (210) Data Structures Questions & Answers. Emphasizes experimental design, applications, and performance evaluation. This course is intended to help students learn to think in the manner necessary to fully grasp the nature and power of the digital world around us. Students will learn how to approach larger and more challenging programming problems than the projects in CS 211. Offered by, Intensive introduction to legal, social, and ethical issues surrounding software development and computer use. Research findings must be reported in a professionally prepared document and presented in a public meeting at the end of the semester. Offered by, Introduction to the language C, as well as operating system concepts, in UNIX, to prepare students for topics in systems programming. 5 comments. Representing and Manipulating Polynomials. Offered by, Focuses on technological and development environments in developing multimedia applications. Students have the opportunity to earn 3-6 credits in graduate coursework that count towards both the BS and MS degrees. Focuses on data structures, recursion, backtracking, dynamic programming, and debugging. Coursicle. Offered by, Covers the software subsystems that are involved in defending computer systems. best. Covers classic problems in data mining, such as clustering, association rule mining, and others from the point of view of scalability. Required Prerequisites: (CS 682B- and 686B-).B- Requires minimum grade of B-. Singamshetty's and Ravalla's office hours are held in Rm. Offered by, Covers the techniques to mine large datasets, including Distributed File Systems and Map-Reduce, similarity search, and data stream processing. Material focuses on algorithms for both theoretical and practical models of parallel computation. CS 310: Data Structures. Students will practice to design, develop, and implement a relational ORACLE database and use the database for queries, transaction processing, and report generation. Offered by, Readings and research for early stage PhD students under the direction of a Computer Science faculty member. Offered by, Covers statistical pattern recognition, neural network, and statistical learning theory approaches. Topics include sorting, graph algorithms, numerical algorithms, and computational complexity. Topics include visualization, modeling, rendering, animation, simulation, virtual reality, graphics software tools, and current research topics. Introduction to object-oriented requirements modeling, including use of case modeling, static modeling, and dynamic modeling using the Unified Modeling Language (UML) notation. Thank you for adding your classes! CS 310 Curve? Advice: Look up big O explanations. Offered by, Networked virtual environment overview, networking and multimedia concepts, virtual simulation concepts, efficiency/performance issues, and online conferencing/virtual classrooms. GMU Course BSIT Required Course; CS 112 & CS 211 – Both must be completed to earn substitution credit: IT 106 & IT 206: MATH 113: MATH 108: MATH 123 & MATH 124 – Both must be completed to earn substitution credit: MATH 108: MATH 125: IT 102 or MATH 112: STAT 344: STAT 250: GMU Course BSIT Concentration Course; CS 310: IT 306: ECE 331: ECE 301 Studies threats and architecting solutions against them, including but not limited to access control and identity management, network and system security, intrusion detection and recovery systems, monitoring and forensic systems. Notes: May be repeated if topics are substantially different. For this assignment, you have to design a hash table that is used as the basis for implementing an "in-memory" database of student records. CS 310 Programming Assignment #2 Searching and Hashing Due: Friday, March 12 12:00 PM (noon) Overview For this assignment, you have to design a hash table that is used as the basis for implementing an “in-memory” database of student records. Offered by, Covers fundamental principles and techniques for implementing computational algorithms to solve problems in biology arising from the need to process large volumes of genomic information. Coreq: CS 105 or CS 110. Your email addresses don't match. Offered by, An introduction to concepts, methods, and tools for the creation of large-scale software systems. CS 310 continues the study of data structures from CS 211. Enrollment is limited to Graduate level students. Offered by, Advanced topics not occurring in regular sequence. This is a doctoral seminar based on reading and analysis of current papers. Also covers practical constructions and applications, such as how to correctly use block ciphers and hash functions for the tasks above. Focuses on identifying algorithmic patterns in problems, describing problem solutions in high-level pseudocode, then implementing in a procedural programming language. GMU's CS310 Final Semester Project (Spring 2019). Approximately 8.75% of total grade; Submit to Blackboard; Deadlines Milestone Deadline: 11:59pm Saturday 6/17/2017; Final Deadline: 11:59pm Saturday 6/24/2017; Code Distribution Project Code: distrib-hw1.zip; Milestone Tests: HW1MilestoneTests.java; Final Tests: HW1FinalTests.java; CHANGELOG: Wed Jun 21 09:31:02 EDT 2017 Updates to fix … Teams will explore the various facets of a complete design using sophisticated tools. Topics include principles and architectures of wireless and mobile networking and fundamental issues of wireless communications with energy-constrained, mobile devices. The three libraries you are going to use are: There are 5 tasks in this assignment. Reviews recent papers and reports. Notes: May not be taken for credit by students in the PhD CS or accelerated MSCS programs. Enrollment is limited to students with a major in Computer Science. Offered by, Work on a research proposal that forms the basis for a doctoral dissertation. Exams Midterm exam: Wednesday, March 7, in regular class time Final exam: Monday, May 13, … 67% Upvoted. Emphasizes fundamental results from real-time scheduling theory and relevance to computer system design. Students in a Non-Degree Undergraduate degree may not enroll. Meets project or thesis requirement for MS in computer science. Deep learning is a Machine Learning approach based on learning data representations as opposed to designing task-specific algorithms. Email: Confirm Email: Please enter a valid gmu.edu email address. The Java Collections Framework - This is a collection of existing simple data structures (lists, queues, sets, maps, etc.) Offered by Coll Visual & Performing Arts. Nordstrom's teaching style is that of someone who's business first. Professional code often uses existing libraries to quickly prototype interesting programs. Overview of Data Mining principles, models, supervised and unsupervised learning, pattern finding. Offered by, Reading and research on a specific topic under the direction of a faculty member. Topics include user interfaces, event-based programming, interprocess communications, networking, mobile-specific capabilities and performance in a resource restricted environment. Offered by, Techniques to store, manage, and use data including databases, relational model, schemas, queries and transactions. Required Prerequisite: CS 580B-.B- Requires minimum grade of B-. 2 Computer Science, BS deadline for extension requests is the add deadline for the semester in which the course is required. 3 Attributes. Course is based around a project with multiple segments, each covering one aspect of networked virtual environments, plus a final session where one- or two-person teams create a minimally functional networked virtual environment over the Internet using multicast network software. Assume you want to spend the last week doing the EC and getting additional help. Enrollment is limited to Graduate or Non-Degree level students. Topics include basic data types, pointers, elementary data structures, file/output, bitwise operations, and Unix commands for compilation and debugging. Notes: Major programming project required. Massively parallel architectures and Hadoop. On Line Transaction Processing, Data Warehousing, star schema, On Line Analytical Processing. Topics include analysis and design of algorithms and architectures for planning, navigation, sensory data understanding, sensor fusion, spatial reasoning, motion control, knowledge acquisition, learning concepts and procedures, self-organization, and adaptation to environment. Topics include design and construction of language processors, formal syntactic definition methods, parsing techniques, and code-generation techniques. Notes: May be repeated for credit when subject differs. Basic programming concepts are covered in detail including expressions, control structures, simple data types, and input/output. Uses LISP, PROLOG, or expert system programming language. 184. Technologies include face, fingerprint, and iris recognition; and speaker verification. Offered by, Special and emerging topics in computer science or closely related disciplines. Methods, tools, notations, and validation techniques to analyze, specify, prototype, and maintain software requirements. Central focus is applying familiar and new algorithms and data structures to novel circumstances. Offered by, Issues in design and implementation of distributed systems and applications. Problems from various application domains such as natural language processing and computer vision will be discussed. Some things that stung me from the transfer was just some previous basic knowledge of big O, lack of TESTING, and time management. Note: Lectures and labs are offered in groups. Topics include range searching, polygon triangulation, convex hulls, motion-planning, visibility, and mesh generation. Notes: Topics chosen in consultation with advisor. We will send an email to this address with a link to validate your new email address. Specific topics include regular and context-free languages, Turing machines, NP-completeness, and undecidability. The early era of the Internet and the personal computer led to the need for "computer literacy." Emphasizes data structures used to represent geometric objects and algorithms for manipulating those data structures. Possible topics include: Learning Theory (PAC, error bounds, VC-dimension); Learning manifolds; Transfer learning; Active learning; Learning with structured data (e.g. The course covers the concepts of Multilayer Perceptrons (MLPs) and algorithms to train them (gradient descent, backpropagation), Regularization of DL, Convolutional Networks (CNNs), Autoencoders, Recurrent Networks (RNNs), and Deep Generative Models including Generative Adversarial Methods. Offered by, This project based course will teach fundamental principles of software development for the mobile device environment, emphasizing the application of numerous academic concepts and the new design and programming paradigms that stem from the use of mobile devices. Projects involve designing and programming basic security tools, secure programs, and distributed systems. 4400 University Drive, Fairfax, Virginia 22030, Phone: 703-993-1000 | Contact via Skype | Student Consumer Information | Privacy Statement | FOIA. CS 310 at George Mason University (GMU) in Fairfax, Virginia. Covers the process of formally proving that constructions meet the appropriate security definitions. Enrollment limited to students in a Master of Science degree. In collaboration with undergraduate students from VSITE's CS game design concentration, student teams design and develop complete computer-based and online serious and/or entertainment games. Submit Email. Work fast with our official CLI. CS 310 Data Structures Spring 2017 Syllabus The course syllabus is here. Satisfies MS breadth requirement only if explicitly stated in syllabus in given section. The PDF will include all information unique to this page. Enrollment limited to students in the VS-PHD-CS program. Offered by, Master's degree candidates undertake a project using knowledge gained in MS program. graphs); Topic modeling; Learning with text; Graphical Models (Bayesian Networks); Learning HMMs. Students will learn how to approach larger and more challenging programming problems than the projects in CS 211. Notes: Intended as terminal course in computer programming. Offered by, This course provides an introduction to wireless and mobile networking. Intermediate debugging techniques and unit testing are covered. Quick Links. Offered by, Introduces students to computer systems from a programmer's perspective. Offered by, An introduction to database management with focus on architecting databases and using them in applications. Offered by, Addresses some graphics game techniques including collision detection, levels of detail, physics-based simulations, textures, maps, and shadows. Notes: May be repeated if topics substantially different. Textbook The text is Mark Allen Weiss, Data Structures & Problem Using Java, 4th ed., Addison Wesley, 2010. Presents algorithms that model and simulate physical and biological systems and focuses on motion-planning algorithms for robotic systems in the presence of obstacles. Offered by, Decision-guidance systems support an iterative process of giving actionable recommendations to and extracting feedbacks from human decision-makers, with the goal of arriving at the best possible course of action. School: George Mason University (GMU) * Professor: Anthony Steversonn, {[ professorsList ]} Anthony Steversonn, Nordstrom,D, DavidJ.Nordstrom, Jyh-MingLien, RichardH.Carver, Yutao Zhong * We aren't endorsed by this school. Offered by, Practical issues in designing and implementing concurrent and distributed software. I transferred in Spring 2017, and my first real CS course at Mason if I recall was CS 262 along with CS 310. Offered by, Real-time systems and principles supporting design and implementation. Considers algorithm design and analysis for PRAM and existing SIMD and MIMD type architectures. hide. Offered by, Study of the internal architecture of database systems. Offered by, Data structures and analytical techniques to study graph algorithms. Privacy and ethical use of computing are also discussed along with guest lectures to sample current computer science research. Offered by, Special topics in computer science not occurring in existing courses. Notes: All computer science majors are required to take this course within their first year. Only one such course should be used for breadth requirements. Notes: May be repeated if topics are substantially different. C and Java are fairly similar, thus it’s not wildly crazy.