He or she is welcome to talk with faculty to discuss mutual interest in a particular topic and the availability of the faculty member for an individual instruction course. Please contact the graduate admissions office for details. The proposal should describe the project, list the official reader sand be signed by the thesis advisor.
Offers students an opportunity to practice reading and discussing scientific literature, presenting scientific work, and distilling the key ideas and contributions of papers through required weekly paper summaries.
Topics may include asymptotic notation, recurrences, loop invariants, Hoare triples, sorting and searching, advanced data structures, lower bounds, hashing, greedy algorithms, dynamic programming, graph algorithms, and NP-completeness.
Covers principles of proof such as truth tables, inductive proof, and basic logic and the counting techniques and arguments needed to estimate the size of sets, the growth of functions, and the space-time complexity of algorithms.
Offers an opportunity to learn to translate statements about the behavior of computer programs into logical claims and to gain the ability to prove such assertions both by hand and using automated tools.
Topics include heuristic search and game trees, knowledge representation using predicate calculus, automated deduction and its applications, problem solving and planning, and introduction to machine learning.
Introduces the basic design of computing systems, computer operating systems, and assembly language using a RISC architecture. Topics include design patterns, transactions, performance trade-offs, security implications, and reliability. Covers interpreters; static and dynamic scope; environments; binding and assignment; functions and recursion; parameter-passing and method dispatch; objects, classes, inheritance, and polymorphism; type rules and type checking; and concurrency.
Introduces relational database management systems as a class of software systems. Also covers the counting techniques and arguments needed to estimate the size of sets, the growth of functions, and the space-time complexity of algorithms. The entity-relationship model and normalization are used in problems.
Requires students to give a twenty- to thirty-minute formal presentation on a topic of their choice in computer science. Shows which aspects of Scrum are required and how they manage project risk. Presents a comparative approach to object-oriented programming and design.
Once submitted, the Graduate Committee may accept or reject the proposal, ask for revisions, or ask that additional readers be added to the proposal.
Course content depends on instructor. Includes exercises using a commercial relational or object-relational database management system. Course work includes both the creation and implementation of original user interface designs, and the evaluation of user interfaces created by others.
Considers approaches to proving termination, correctness, and safety for programs. Students are expected to work on a project that produces a professional-quality mobile application and to demonstrate the application that they have developed.
Offers students an opportunity to learn team management and communication. Introduces students to the field of computer science and the patterns of thinking that enable them to become intelligent users of software tools in a problem-solving setting.
Introduces modern program design paradigms. Offers students an in-depth look at research in a particular subarea of computer science, information science, data science, or cybersecurity.
Also covers the construction of distributed programs, with an emphasis on high-level protocols and distributed state sharing. This course is an introduction to computing and programming.
Seeks to benefit students with a curriculum that supports the development of key business communication skills, project and client management skills, and frameworks for business analysis. Introduces approaches for authentication ensuring you know who someone is and authorization ensuring they have access to a given resource or service.
Mobile and Wireless Systems.Hello, I'll be starting my masters in computer science this fall - and I've signed up for Programming Design & Paradigm and Algorithms for the.
The PhD in Computer Science prepares students for careers in academia and industry—from conducting research to developing systems to publishing and The PhD in Computer Science prepares students for careers in academia and industry—from conducting research to developing systems to publishing and presenting papers.
Computer science for everyone Now more than ever, computer science is everywhere. Our innovative, interdisciplinary programs deliver the knowledge and perspective you need to succeed in a highly demanding job market.
The Master of Science in Computer Science (MSCS) is designed to prepare students for a variety of careers in computer science. course offerings will vary by location and modality.
Other courses offered at the graduate level at Northeastern University may be taken as electives provided written permission is given by your faculty advisor.
The Master of Science in Computer Science program is for experienced professionals seeking to enhance their knowledge and expand their technology leadership responsibilities in organizations that design, develop, market, or utilize computing systems.
Computer science as a discipline draws its inspiration from mathematics, logic, science, and engineering.
From these roots, computer science has fashioned paradigms for program structures, algorithms, data representations, efficient use of computational resources, robustness and security, and communication within computers and across networks.Download