All courses, arranged by program, are listed in the catalog. If you cannot locate a specific course, try our advanced search link. Current class schedules, with posted days and times, may be found on the Registrar's Office website or by logging directly into SiS.
Mathematical topics necessary for graduate study in computer science in the areas of discrete mathematics, probability, linear algebra and proof techniques. Material may include topics such as: summations, sets, relations, functions, recurrences, graphs, trees, elementary combinatorics, basic axioms and laws of probability, discrete random variables, probability distributions, matrices, Boolean algebra, logarithms.
Pre-req: MATH 1310 Calculus I and MATH 1320 Calculus II.
An advanced introduction to theoretical computer science. This course will cover the fundamentals of automata, formal languages, and computability theory.
Pre-Req: COMP.4040 Analysis of Algorithms.
Advanced algorithms and complexity analysis. Dynamic programming; greedy algorithms; amortized analysis; shortest path and network flow graph algorithms; NP-completeness; approximation algorithms; number-theoretic algorithms; string matching; computational geometry. Additional topics may include linear programming, parallel algorithms, fast Fourier transforms, polynomial, integer, and matrix algorithms. Readings may include conference and journal papers from the algorithms literature.Abstract types, lists, trees, graphs, sets; relevant algorithms and their worst and average case analyses; fast transforms; polynomial, integer, and matrix algorithms; NP-completeness.
Advanced algorithms topics, such as design and analysis of geometric and combinatorial algorithms, computability andcomplexity.
Pre-Req: 91.503 Algorithms or Instructor permission.
Topics in algorithm design and analysis; mapping and modeling; issues in complexity; lower bounds; models of parallel computation.
This course covers polynomial-time hierarchy and polynomial space, circuit complexity, structure of NP, probabilistic machines and complexity classes, complexity of counting, interactive proof systems, probabilistically checkable proofs, complexity of approximation problems, and average-case NP-completeness.
Pre-Reqs. COMP 5020 Foundations of CS, and COMP 5030 Algorithms.
A continuation of 91.513 with a focus on current topics and topics of special interest. Examples of recent topics include: The semantic Web and ontologies, Web services, Peer-to-peer networks, Information Search and Retrieval, Autonomous intelligent agents and Multi-modal presentations.
Pre-Req: COMP.5130 Internet & Web Systems I.
This course provides insight into multiprocessing operating systems including processor memory, peripheral, and file systems management in batch, timesharing, real time, and distributed systems targeted for various hardware. Particular emphasis will be placed on techniques of virtual memory as well as the problems of concurrency in both centralized and distributed systems. An OS simulation is a required programming project. Some topics to be covered are process synchronization; high-Level mechanisms for concurrency; processor scheduling and system analysis; deadlock; virtual memory; distributed systems; computer security.
The design and implementation of an interactive multiprocessing operating system to run on a bare hardware system. Separate teams manage the major subsystems with in-class design reviews to coordinate system integration. A functioning system is a class requirement.
Pre-Req: COMP.5150 Operating Systems I.
This course will focus on existing and proposed technologies for storing digital information. Both hardware and software issues will be examined, beginning with device and controller organization and proceeding through aggregation techniques, interconnect architectures and host consideration. At each level, specific components will be evaluated with respect to critical storage criteria, such as bandwidth and latency, fault tolerance, infrastructure requirements and cost.
Object-oriented techniques for analysis, specification, and design. Static information models and state-based dynamic behavior models applied to rapid prototyping projects that both use and implement object-oriented CASE tools.
Computer vision has seen remarkable progress in the last decade, fueled by the ready availability of large online image collections, rapid growth of computational power, and advances in representations and algorithms. Applications range from 3-D scene reconstruction, to visual Simultaneous Localization and Mapping (SLAM) for robotics, to real-time human body pose estimation. This introductory computer vision course explores various fundamental topics in the area, including the principles of image formation, local feature analysis, segmentation, multi-view geometry, image warping and stitching, structure from motion, and object recognition.
Pre-req: COMP 1020 Computing II, MATH 1320 Calculus II, and MATH 3220 Discrete Structures II.
The purpose of this class is to ground students in the basics of how humans interact with technology, and make students aware of the breadth of topic areas related to human-computer interaction (HCI). This course emphasizes theoretical constructs such as the Model-Human Processor, and includes seminal readings by the original researchers. Further, the course emphasizes techniques for understanding users' tasks, formulating users' requirements, and assessing proposed designs using heuristic evaluation. As part of understanding users' needs, students will consider social, organizational, and ethical perspectives on information technology. Students are also exposed to specialty topics in human-computer interaction such as multi-user computing, universal access to computer applications, and internationalizing interfaces. This course includes a project to design, develop, document, and orally present a prototype interface. At the end of the course students will be able to cite basic principles of human interaction and devise and carry out a usability engineering plan to aid in developing new human interfaces.
This course is an introduction to methods used to evaluate the design of human-computer interaction (HCI). Students will apply examples of all three of the major types of HCI evaluation techniques: inspection, analytical, and empirical techniques. The course also covers HCI experiment design and data analysis, including threats to experimental validity. The course project consists of a formal usability test. This project requires students to learn principles of ethical treatment of human subjects, complete the University's Institutional Review Board applications and training for human-subject testing, conduct testing sessions, analyze data, recommend design changes, and document results in a professional manner. At course completion, students will have demonstrated skills for assessing the effectiveness of interface designs and will understand how evaluation fits into computer products' lifecycles.
Topics of mutual interest to the instructor and student(s) (Formerly 91.530).
A one-semester course designed to provide students with hands-on understanding of the underlying concepts of programming languages, the principles of their design, and the fundamental methods for their implementation. An executable metalanguage such as Scheme or SML is used throughout the course, facilitating the design of high-level, concise interpreters that are easy to comprehend. The approach is analytical because the salient features of the imperative, functional, object-oriented, and logic programming paradigms are described in the executable meta-language.
Pre-Req: COMP 3010 Org Programming Languages or COMP 4060 Compiler Construction I.
This course implements a compiler for a complete language. Topics include grammars, syntax, elements of parsing and recursive descent, semantics, basic code generation, fast compilation runtime support. Programming project required.
This course covers the basic topics for the interdisciplinary field of visual analytics. This course is not just for computer science students but also for analysts and scientists in different disciplines. The topics include visual analytics science and technology, perception, cognitive processes and human tasks and reasoning, data and knowledge representation, visualization and interaction, statistical and analytic methods, data mining and knowledge discovery, and evaluation and usability. Numerous examples of systems, tools and applications will be presented.
Pre-Requisites: COMP 3010 Org Programming Languages or COMP 3040 Foundations of Comp Science; or Instructor permission.
This course looks at classical and novel methodologies for the visualization of large and complex data sets. The course covers both scientific and information visualization starting with data modeling, human perception and cognition, basic and advanced techniques, interaction, formal models, real time systems, and frameworks for integrated analysis and visualization. Examples used come from numerous areas including the biomedical literature and security.
This course introduces principles and techniques behind natural language processing (NLP), and covers a large selection of important automatic text processing tasks. Selected topics include n-gram language models, part-of-speech tagging, statistical parsing, word sense disambiguation, discourse segmentation, information extraction, sentiment analysis, machine translation. Quantitative techniques are emphasized, with a focus on applying statistical models to large collections of text. The course provides students with a hands-on experience in building a substantial NLP application of their choice.
Pre-req: 91.422 Machine Learning.
Search and games, knowledge representation paradigms, natural language understanding, planning, perception. Use of the LISP language for one or more programming projects.
This introductory data mining course will give an overview of the models and algorithms used in data mining, including association rules, classification, clustering, etc. The course will teach the theory of these algorithms and students will learn how and why the algorithms work through computer labs.
Pre-Req: COMP 5430 Artificial Intelligence, or COMP 5730 Database I.
This introductory course gives an overview of machine learning techniques used in data mining and pattern recognition applications. Topics include: foundations of machine learning, including statistical and structural methods; feature discovery and selection; parametric and non-parametric classification; supervised and unsupervised learning; use of contextual evidence; clustering, recognition with strings; small sample-size problems and applications to large datasets.
Pre-Reqs: COMP 1020 Computing II, MATH 3220 Discrete Structures ll and MATH 3860 Probability & Statistics I.
Introduction to the hardware, software and mathematics of 2- and 3-dimensional interactive computer graphics systems, including standards, modeling, transformations, hidden-surface removal, shading, and realism.
Lighting models, photo-realism, animation, constructive solid geometry, and distributed graphics.
A broad interpretation of robotics to mean systems that interact with people, each other, and the world around them, using sensors, actuators, communications, and a control program. Project- and lab-based course that involves electronics, embedded coding, mechanical design, and research.
This course will focus on the artificial intelligence side of robotics in a project- and lab-based course. Topics to be covered include robot architectures, mapping and localization, learning, vision, multi-agent systems and current research areas.
Topics of mutual interest to the instructor and student(s).
Complete genomic sequences of human, other mammals, and numerous other organisms are known for some time. From early on, comparisons or analyses of genomic sequences require aids on computer programming. After brief introductions to molecular biology for Computer Science students, the course will examine computer algorithms used in bioinformatics problems including sequence alignment, phylogeny, DNA sequencing, and data analyses.
A survey of parallel computer architectures, parallel programming languages, and parallel algorithms, with emphasis on solving practical problems with parallel computers. A final project, typically a substantial parallel program, is required. Usually offered during the Spring semester.
Basic concepts and techniques of computer network security; data encryption algorithms; public-key cryptography and key management; data authentication; network security protocols in practice; wireless network security; network perimeter security; the art of anti malicious software; the art of intrusion detection. Students will implement encryption and authentication algorithms as network applications.
Pre-Reqs: MATH 3210 Discrete Structures I , COMP 4040 Analysis of Algorithms and COMP 4130 Data Communications I.
Applied computer security topics such as a computer and network forensics, virtual private networks, denial of service, viruses and worms, intrusion detection systems, smart cards, biometrics, programming language security, web security and privacy, e-commerce; case studies of deployed systems; policy and legal considerations.
Resource sharing; computer traffic characterizations; multiplexing; network structure; packet switching and other switching techniques; design and optimization; protocols; routing and flow control; simulation and measurement; communications processors.
Continuation of 91.563
Pre-Req: COMP.5630 Data Communications I.
The two main purposes of this seminar course are to involve students in current human-computer interaction (HCI) research and to learn to critique others' HCI research. Each offering of the seminar will center on a theme of applying HCI techniques to a particular type of interaction such as human interfaces for robots, pervasive computing, or social media. Students will be expected to read and critique a number of papers from the current literature in the designated topic area. Further, class members will form a research team (led by the course instructor) to perform original research in the topic area. Class members will co-author a paper based on their research results with the goal of submitting it to a conference. By the end of the course, students will be able to describe the state-of-the-art in the course topic, recognize examples of good and poor research techniques, document research to high academic standards, and become productive members of HCI research teams.
Pre-Req: 91.555 Comp Networks or 91.563 Data Communication I.
Study of various database models including hierarchical, network, relational, entity-relationship, and object-oriented models. This course also covers data design, integrity, security, concurrency, recovery, query processing, and distribution.
Continuation of Data Base I. Various issues in the implementation of database systems will be covered.
Pre-Req: COMP.5730 Data Base I.
There is currently no description available for this course.
This course covers advanced topics in network optimization on continuous and discrete models, including the max-flow problem, the min-cost flow problem, simplex methods for min-cost flow, dual ascent methods for min-cost flow, auction algorithms for min-cost flow, nonlinear network optimization, convex separable network problems, and network problems with integer constraints.
Pre-Req: 91.503 Algorithms.
This is a proposed new 600-level course. The topics are advanced topics in Information Retrieval and Mining, including (but not limited to) Search and Information Retrieval, Visual Text Mining, Document Retrieval and Analysis, Non-textual Retrieval (including Image-, Sound, Video-Retrieval). The course's format is a seminar: (advanced, doctoral) students will be reading and presenting the current state-of-the-art literature. Course requirements include weekly bibliography reports (at least 2 new entries each week) class presentations, two term papers, and a term project.
Pre-Req: 91.514 Internet & Web Systems II; and Instructor permission.
This course will cover modern information visualization research. Student will read and summarize current research and published papers. If a student already has a thesis topic or is already doing research, the student will participate in the development of a proposal for exteral funding related to their thesis topic or research. If a student does not have a thesis topic, the student will develolp their thesis proposal.
Pre-Req: COMP 5411 Sci Data Visualization or COMP 5460 Comp Graphics I or COMP 5270 Computer Human Interaction; or Instructor permission.
This course covers advanced topics in data visualization. Coverage will be topical and may include advanced graph & text visualization, modern coordinated visualizations, collaborative visualization knowledge visualizations, security visualization, web-based visualization, and high-performance visualization. Theory will also be covered.
Pre-Req: 91.541 Data Visualization.
This course continues with 91.421/91.544 Data Mining and explores the state of the art research advances in mining large amount of data especially algorithms in association classification, clustering, and applications such as web mining and spatio-temporal data mining.
Pre-req: COMP 4210 Data Mining or COMP 5440 Data Mining
This course will cover state-of-art wireless networking research topics, including communications, management, security, sensors, and mobile applications. Students will read and summarize current research and published papers, and do experimental projects.This course allows subtitle (topics), and students can take this course multiple times with different subtitle (topics). The subtitle (topic) of this course is to be determined when the course is offered.
This is a topic course, with a subtitle to be determined by the instructor. it covers advanced topics in network security of mutual interests to the faculty and students.
Pre-Req: 91.561 Computer & Network Security I.
This course covers advanced topics in database management systems, including query processing and optimization, indexing, transaction management, data warehousing, data mining, etc. It also covers spartio-temporal databases, search engines, stream and sensor databases, and open problems for research.
This course covers advanced topics in approximation algorithms for NP-hard problems, including combinatorial algorithms and LP-based algorithms for set cover, k-cut, k-center, feedback vertex set, shortest superstring, knapsack, bin packing, maximum satisfiability, scheduling, Steiner tree, Steiner Forest, Steiner network, facility location, k-median, semidefinite programming. It also covers counting problems, shortest vector, hardness of approximation, and open problems for research.
This covers advanced topics in computational combinatorial optimization. Topics will be drawn from practical applications in various areas, including wireless sensor networks, different types of complex networks, online social networks, bioinformatics, and computational medicine.
This course introduces the concepts and techniques of systems and network administration. The course covers topics in a wide range from host management, network management, host and network security to automating system administration. In this course learners will be installing and configuring various popular network based services in a Linux environment.
Students must already have completed a bachelor's degree in a related discipline to enroll in this course and in a graduate career.
This course examines the strategies for deploying and auditing secure systems. IT auditors primarily study computer systems and networks form the point of vies of examining the effectiveness of their technical and procedural controls to minimize risks. Risk analysis and the implementation of corresponding best practice control objectives will be studied. The material will include methodologies that help auditors to: Discover what's really going on at a point in time., Find out about potential problems, before it's too late to fix them., Evaluate business situations objectively., Make informed, if difficult decisions., Implement corrective actions, changes and improvements where needed.
This course investigates the organization and deployment of contemporary operating systems. The process model is examined both generically and in the context of the current Linux/Unix and Windows implemantations. Process attributes such as address spaces, threads, channels and handles, access rights, scheduling behavior and states and state transitions will be studied. Memory management, deadlock management and the file system development are also evaluated. A subsystem of system configuration options will be considered during the course in order to highlight the functional deployment of the core OS issues discussed. Pre-req: BS in IT or equivalent. Cannot be used toward MS or PhD in Computer Science.
This course will develop a systematic framework for the life cycle management of large scale applications. Beginning with requirements assessments, and impact analysis, and continuing through regulatory compliance, lifetime maintenance, scalability concerns, and end-of-life evolution, the material in this course will characterize the stages and transitions of large scale applications. Deployment and management tools will be examined in the context of live applications, with an emphasis on convergent analysis and configuration. Several case studies will be considered, including operating systems, database applications, mailing systems and collaboration systems.
This course will investigate the current state of virtualization in computing systems. Virtualization at both the hardware and software levels will be examined, with emphasis on the hypervisor configurations of systems such as Vmware, Zen and Hyper-V. The features and limitations of virtual environments will be considered, along with several case studies used to demonstrate the configuration and management of such systems. Para-virtualized software components will be analyzed and their pros and cons discussed. Processor and peripheral support for virtualization will also be examined, with a focus on emerging hardware features and the future of virtualization.
This course explores the application of knowledge, skills, tools, and techniques that project managers use when managing information technology projects as well as the current IT factors that affect IT project management decision making. Special emphasis will be placed on learning the best practices currently used by organizations and practitioners to ensure the best chance for project success by learning and applying the concepts of managing scope, risk, budget, time, expectations, quality, people, communications, procurement, and externally provided services. Students will be expected to perform research in the above areas as well as using tools such as Microsoft Project to solve project management related problems. Special attention will also be placed on the issues affecting project managers today such as PMOs, virtualization, green IT, and out sourcing. Practical examples will be used to demonstrate the concepts and techniques, plus you will receive hands on experience by working on a case study.
The amount of data generated by businesses, science, Web, and social networks is growing at a very fast rate. This course will cover the algorithms and database techniques required to extract useful information from this flood of data. Data mining, which is the automatic discovery of interesting patterns and relationships in data, is a central focus of the course. Topics covered in data mining include association discovery, clustering, classification, and anomaly detection. Special emphasis will be given to techniques for data warehousing where extremely large datasets (e.g.,many terabytes) are processed. The course also covers Web mining. Topics covered include analysis of Web pages and links (like Google) and analysis of large social networks (like Facebook).
This course explores the differences between the Traditional Project management and the Agile management approaches, introduces the principles of Agile Development through applications within each major Project Management process: Project Initiation, Project Planning, Project Execution, and Project Closing. The project will be developed in a timely manner, using Agile techniques that encourage frequent adaptation, self-organization, accountability and with a focus towards rapid delivery. upon completion, students will understand how to apply Agile principles and practices, recognize ways to increase team performance through better communication and close involvement of stake holders, and recognize the key success criteria for implementing Agile Projects.
Today, we are surrounded by big data applications. Smartphone and sensor data, medical and scientific data, financial data, web and text data, and social network data are just a few examples. As a result, mining useful information and discovering knowledge from the big data are increasingly important. It is fair to say that, without data mining, we would not be able to make good use of this large amount of data. In this course, we learn the state-of-the-art techniques in data mining and analysis. Topics include types and properties of data, exploring data, classification, association analysis, cluster analysis, and anomaly detection.
This course focuses on enterprise-level information security, privacy and regulatory compliance through study of the rapidly emerging Information Governance (IG) discipline which is applied to electronic documents, records management and output of information organization-wide. The key principles of IG will be examined including the security, privacy and compliance of corporate e-documents/records as well as email, social media, instant messaging, cloud computing, and mobile computing. The student will learn how IG leverages existing information technologies to enforce policies, procedures and controls to manage information risk in compliance with legal and litigation demands, external regulatory requirements, and internal governance objectives.
Intrusion Detection Systems is a survey of the hardware and software techniques that are applied to the detection, identification, classification and remediation of compromised information systems. From this introduction to intrusion detection systems, students will develop a solid foundation for understanding IDS and how they function. This course will give students a background in the technology of detection network attacks. It will introduce all the concepts and procedures used for IDS (intrusion Detection Systems) and IPS (intrusion Prevention Systems). Students will have hands-on experience with implementing and configuring software and hardware based IDS in a network infrastructure. This course is designed with a network administrator in mind.
This course focuses on best practices for designing and building a comprehensive Cybersecurity Program based on the NIST Framework for Improving Critical Infrastructure Cybersecurity ("The Framework"). The Framework was issued on February 12, 2014, as directed by President Obama in Executive Order 13636. This framework provides guidance for reducing cybersecurity risk for organizations, and this course will examine its basic tenets of: "Cybersecurity Fundamentals", techniques applied to "Building a Controls Factory", "Cybersecurity Programs" "Establishing Cybersecurity Centers of Expertise" and "The Cybersecurity Program Implementation Roadmap".
This course provides an introduction to the fundamental concepts in the design and implementation of computer communication networks, their protocols, and applications. Topics to be covered include: an overview of network architectures, applications, network programming interfaces (e.g. sockets) , transport, congestion, routing, and data link protocols, addressing, local area networks, network management, and emerging network technologies. Cannot be used toward MS or D.Sc. in Computer Science.
This course is aimed to provide students with a solid understanding of key concepts of computer network security and practical solutions to network security threats. Topics to be covered include common network security attacks, basic security models, data encryption algorithms, public-key cryptography and key management, data authentication, network security protocols in practice, wireless network security, network perimeter security and firewall technology, the art of anti-malicious software, and the art of intrusion detection. Pre-Req: BS in IT or Equivalent. Cannot be used toward MS or D.Sc. in Computer Science.
Identifying, preserving and extracting electronic evidence. Students learn how to examine and recover data from operating systems, core forensic procedures for any operating or file system, understanding technical issues in acquiring computer evidence and how to conduct forensically sound examinations to preserve evidence for admission and use in legal proceedings.
This course covers principles and practices of wireless networks, including cellular networks, wireless LANs, ad hoc mesh networks, and sensor networks. The potential attacks against these wireless networks and the security mechanisms to defend these networks will be discussed. Topics to be covered include cellular network architecture, wide-area mobile services, wireless LANs and MACs, introduction to emerging wireless networks, survey of malicious behaviors in wireless networks, securing wireless WANs and LANs, securing wireless routing, securing mobile applications, wireless intrusion detection and prevention, challenges in securing next-generation wireless networks, and privacy issues in wireless networks.
This course starts with an overview of modern distributed models, exposing the design principles, systems architecture, and innovative applications of parallel, distributed, and cloud computing systems. The course will focus on the creation and maintenance of high-performance, scalable, reliable systems, providing comprehensive coverage of distributed and cloud computing, including: Facilitating management, debugging, migration, and disaster recovery through virtualization. Clustered systems for research or ecommerce applications. Designing systems as web services. Principles of cloud computing using examples from open-source and commercial applications.
This course is a continuation of the 94.565 Cloud Computing course and will cover in further detail such topics as Cloud Based Storage, Virtualization, Service Oriented Architecture (SOA), High Availability, Scaling, and Mobile Devices. The course will also study the role of Open Source cloud software such as Hadoop, OpenStack and others. Similar to the first course where hands-on projects included the use of Cloud Services such as Amazon Web Services (AWS), Google Apps and App Engine, and Windows Azure, this course will continue with those services and add others such as Rackspace and VMware. Current articles and publications in this fast moving field of Cloud Computing will also be followed.
Pre-req: 94.565 Cloud Computing, or Permission of the Instructor.