Department of Computer Science



Similar documents
Department of Computer Science

Department of Computer Science

Department of Computer Science

MEng, BSc Applied Computer Science

MEng, BSc Computer Science with Artificial Intelligence

Department of Computer Science

Division of Mathematical Sciences

COMPUTER SCIENCE. FACULTY: Jennifer Bowen, Chair Denise Byrnes, Associate Chair Sofia Visa

How To Get A Computer Science Degree At Appalachian State

Bachelor of Games and Virtual Worlds (Programming) Subject and Course Summaries

M.S. Computer Science Program

Eastern Washington University Department of Computer Science. Questionnaire for Prospective Masters in Computer Science Students

DEGREE PLAN INSTRUCTIONS FOR COMPUTER ENGINEERING

Master Degree Program in Computer Science (CS)

COURSE TITLE COURSE DESCRIPTION

Master of Science in Computer Science

Page 1 of 5. (Modules, Subjects) SENG DSYS PSYS KMS ADB INS IAT

Computer Science. Master of Science

Computer Science MS Course Descriptions

Doctor of Philosophy in Computer Science

Computer Science. General Education Students must complete the requirements shown in the General Education Requirements section of this catalog.

Department of Computer Science

CS Master Level Courses and Areas COURSE DESCRIPTIONS. CSCI 521 Real-Time Systems. CSCI 522 High Performance Computing

Computer Science (COMP)

Graduate Certificate in Systems Engineering

Master of Arts in Mathematics

Computer Science. Requirements for the Major (updated 11/13/03)

One LAR Course Credits: 3. Page 4

INFORMATION TECHNOLOGY PROGRAM

Master of Science in Computer Science Information Systems

Diablo Valley College Catalog

How To Get A Computer Engineering Degree

Academic Catalog

Master s Program in Information Systems

Bachelor of Science in Information Technology. Course Descriptions

Course Syllabus For Operations Management. Management Information Systems

Graduate Co-op Students Information Manual. Department of Computer Science. Faculty of Science. University of Regina

Please consult the Department of Engineering about the Computer Engineering Emphasis.

Professional Organization Checklist for the Computer Science Curriculum Updates. Association of Computing Machinery Computing Curricula 2008

Applied mathematics and mathematical statistics

The Master s Degree with Thesis Course Descriptions in Industrial Engineering

Information Systems. Administered by the Department of Mathematical and Computing Sciences within the College of Arts and Sciences.

Software Engineering Transfer Degree

Assessment for Master s Degree Program Fall Spring 2011 Computer Science Dept. Texas A&M University - Commerce

MATHEMATICS (MATH) 3. Provides experiences that enable graduates to find employment in sciencerelated

Assessment Plan for CS and CIS Degree Programs Computer Science Dept. Texas A&M University - Commerce

Mathematics (MAT) MAT 061 Basic Euclidean Geometry 3 Hours. MAT 051 Pre-Algebra 4 Hours

REGULATIONS FOR THE DEGREE OF MASTER OF SCIENCE IN COMPUTER SCIENCE (MSc[CompSc])

Computer Science GRADUATE HANDBOOK

How To Get A Computer Science Degree

Master of Science (M.S.), Major in Software Engineering

Proposal for Undergraduate Certificate in Large Data Analysis

Essential Mathematics for Computer Graphics fast

Department of Computer Science

University of Dayton Department of Computer Science Undergraduate Programs Assessment Plan DRAFT September 14, 2011

Degrees Major in Computer Science Minor in Computer Science Major in Software Engineering

FACULTY STUDY PROGRAMME FOR POSTGRADUATE STUDIES

Computer Science Courses-1

MASTER OF SCIENCE IN COMPUTER

Clarke College. Major Requirements

MATH. ALGEBRA I HONORS 9 th Grade ALGEBRA I HONORS

Computer and Information Sciences

PHILOSOPHY OF THE MATHEMATICS DEPARTMENT

Datavetenskapligt Program (kandidat) Computer Science Programme (master)

Current Standard: Mathematical Concepts and Applications Shape, Space, and Measurement- Primary

LONG BEACH CITY COLLEGE MEMORANDUM

Stage III courses COMPSCI 314

ADVANCED SCHOOL OF SYSTEMS AND DATA STUDIES (ASSDAS) PROGRAM: CTech in Computer Science

Penn State Harrisburg Computer Science

REGULATIONS FOR THE DEGREE OF MASTER OF SCIENCE IN COMPUTER SCIENCE (MSc[CompSc])

NEW YORK STATE TEACHER CERTIFICATION EXAMINATIONS

Course Descriptions - Computer Science and Software Engineering

Winter 2016 Course Timetable. Legend: TIME: M = Monday T = Tuesday W = Wednesday R = Thursday F = Friday BREATH: M = Methodology: RA = Research Area

School of Computer Science

Introduction to Computer Graphics

Eastern Washington University Department of Computer Science. Questionnaire for Prospective Masters in Computer Science Students

COLLEGE OF INFORMATION TECHNOLOGY

New trend in Russian informatics curricula: integration of math and informatics

Core Courses Seminar (0-2) Non-credit Ph.D. Thesis (0-1) Non-credit Special Studies (8-0) Non-credit. Elective Courses

COMPUTER SCIENCE, BACHELOR OF SCIENCE (B.S.)

CS & Applied Mathematics Dual Degree Curriculum Content

FACULTY OF COMPUTER SCIENCE AND INFORMATION TECHNOLOGY AUTUMN 2016 BACHELOR COURSES

INFORMATION TECHNOLOGY (IT) 515

Sequence of Mathematics Courses

Master of Science in Computer Science (Thesis option)

Curriculum for the Bachelor Degree in Computer Science (CS)

Bachelor and Master of Science degrees in Mathematics and Statistics at University of Helsinki

Erik Jonsson School of Engineering and Computer Science

MASTER OF SCIENCE IN COMPUTER AND INFORMATION SYSTEMS

İZMİR INSTITUTE OF TECHNOLOGY GRADUATE SCHOOL OF ENGINEERING AND SCIENCES DEPARTMENT OF COMPUTER ENGINEERING DOCTORAL PROGRAM IN COMPUTER ENGINEERING

Recommended Course Sequence. Computer Information Systems. Computer Information Systems Major. First Semester Credits. Second Semester.

Accelerated Bachelor of Science/Master of Science in Computer Science. Dual Degree Program

Department of Economics

COMPUTER SCIENCE. Department of Mathematics & Computer Science

Computer Science. 232 Computer Science. Degrees and Certificates Awarded. A.S. Degree Requirements. Program Student Outcomes. Department Offices

Department of Education

Mathematics. Mathematics MATHEMATICS Sacramento City College Catalog. Degree: A.S. Mathematics AS-T Mathematics for Transfer

Credit and Grading Systems

Reasons for need for Computer Engineering program From Computer Engineering Program proposal

Transcription:

117 Department of Computer Science Chairperson: Nasri, Ahmad H. rofessor: Nasri, Ahmad H. Associate rofessors: Attie, aul C.; Karam, Marcel R.; Safa, Haidar H.; Turkiyyah, George M. Assistant rofessor: Abu Salem, Fatima K. Senior Lecturer: Jureidini, Wadi N. Lecturers: Awad, Mohamad M.; Haidar, May MA.; Keyrouz, Walid T.; Ladan, Mohamad I. Instructors: Mukaddam, Wassim G.; Sidani-Bohsali, Hayat A. Assistant Instructors: Akkari, Maha A.; Aoude, Loa K.; Arnaout, Huda A.; Bou Karam, Wajih W.; Fatayri, Nour F.; Haddad, Daniel G.; Masri, Hani A.; Moussa, Bassam H.; Wehbe, Dana A.; Yassine, Zahra M.; Youssef, Kamal H. The Department of Computer Science offers a program leading to the degree of Master of Science (MS) in Computer Science. For more information about the department visit its webpage at http://www.cs.aub.edu.lb/. Graduate rogram Mission Statement In addition to the university requirements for graduate study in the Faculty of Arts and Sciences, The faculty is committed to cultivating lifelong learning that empowers the student to pursue continuous self-renewal through replenishing her/his knowledge base in an information technology driven age. The faculty offers excellent undergraduate programs leading to bachelor s degrees as well as graduate education leading to master s degrees in most fields. It expects to offer hd degrees in selected fields in the future. The faculty builds its choices on areas of excellence as it develops its resources. The faculty considers research to be an essential element of faculty activity. Quality research is encouraged and supported to maintain the highest standard of education and to attract outstanding faculty and students. The faculty also emphasizes the importance of high-quality teaching and continuously monitors teaching effectiveness. Student advising, another important faculty duty, is crucial to the proper running of its liberal arts program. To achieve excellence in education, the faculty continuously revises its curricula, enhances its different academic units by assessing their needs for equipment and research facilities, and concentrates on recruiting and maintaining prominent faculty in all professorial ranks. The active engagement of all its academic units in achieving its goals is vital for the lasting success of its three major areas of study: the humanities, the social sciences, and the basic sciences. art time

118 Department of Computer Science MS in Computer Science In addition to the university requirements for graduate study in the Faculty of Arts and Sciences, students must complete 21 credits and a thesis (thesis option), or 27 credits and a project (project option), as detailed below. For both options the student must take 12 credits: one course from each of the four categories: Theory, Systems, Software and Applications, as listed in http://wwwlb.aub.edu.lb/~webmcs/. These courses are as follows: CMS 356 or CMS 357; CMS 371, CMS 372, CMS 373, or CMS 374; CMS 363 or CMS 366; CMS 377, CMS 385, or CMS 393. Additional courses in each of these categories could be offered/considered by the department. The remaining credits (9 for the thesis option and 15 for the project option) are to be taken in coordination with the student s adviser. For more information about the program, visit http://www.cs.aub.edu.lb/ and http://wwwlb.aub.edu.lb/~webmcs/. Graduate Courses CMS 350 Discrete Models for Differential Equations 3.1; 3 cr. A detailed study of methods and tools used in deriving discrete algebraic systems of equations for ordinary and partial differential equations: Finite Difference and Finite Element discretization procedures; generation and decomposition of sparse matrices, finite-precision arithmetic, illconditioning and pre-conditioning, Scalar, vector and parallelized versions of the algorithms. The course includes tutorial immersion sessions in which students become acquainted with state-ofthe-art scientific software tools on standard computational platforms. rerequisites: linear algebra and the equivalent of MATH/CMS 251 (which can be taken concurrently) or consent of the instructor. Same as MATH 350. Annually. CMS 351 Optimization and Non-Linear roblems 3.1; 3 cr. A study of practical methods for formulating and solving numerical optimization problems that arise in science, engineering, and business applications. Newton s method for nonlinear equations and unconstrained optimization. Simplex and interior-point methods for linear programming. Equality and inequality-constrained optimization. Sequential Quadratic rogramming. Emphasis is on algorithmic description and analysis. The course includes an implementation component where students develop software and use state-of-the-art numerical libraries. rerequisite: MATH/CMS 350 or consent of the instructor. Same as MATH 351. Annually. CMS 354 The Finite Element Method 3.0; 3 cr. A course that presents the theoretical foundations of the finite element method and some of its applications to partial differential equations. Topics include Sobolev spaces, existence and uniqueness of weak solutions and the Lax-Milgram lemma, regularity of weak solutions and a priori estimates, the Galerkin method, piecewise polynomial approximations, approximating solutions of boundary value problems for elliptic equations, and initial value problems for parabolic and hyperbolic equations. rerequisites: CMS 251 and MATH 218 or MATH 219. Biennially. CMS 356 Design and Analysis of Algorithms 3.0; 3 cr. A course that studies advanced data structures and algorithms, with an emphasis on the design of algorithms. Topics include advanced graph and search algorithms, dynamic programming, amortized analysis, parallelism, greedy and approximate algorithms, string and pattern matching, computational geometry, and an introduction to the class of N-complete problems. rerequisite: CMS 256 or graduate standing. Annually.

119 CMS 357 Complexity Theory 3.0; 3 cr. A course that discusses complexity classes of algorithms, especially those arising from time and space analysis of bounded computations. Topics include sequential, deterministic, parallel, and non-deterministic models of computation, the Turing machine model, the class N, questions of completeness and reducibility, and the hierarchy of complexity classes. rerequisite: CMS 257 or graduate standing. Annually. CMS 358 Introduction to Symbolic Computing 3.0; 3 cr. Introductory topics in computer algebra and algorithmic number theory that include Fast multiplication of polynomials and integers, Fast Fourier transforms, primality testing, and integers factorization. Applications to cryptography and pseudo-random number generation. Linear algebra and polynomial factorization over finite fields. Applications to error-correcting codes. Introduction to Grobner bases. rerequisite: Good background in programming, linear algebra, discrete mathematics or consent of instructor. Same as MATH 351. Annually. CMS 360 Special Topics in Computational Science 3.0; 3 cr. A course on selected topics in computational science, which change according to the interests of visiting faculty, instructors, and students. Selected topics cover state-of-the-art tools and applications in computational science. rerequisite: Consent of instructor. Same as MATH 360. Annually. CMS 363 Software Engineering 3.0; 3 cr. A course that studies techniques that facilitate the definition and development of reliable software systems. Topics include developing system requirements, requirement analysis, formulation of system architecture, establishing a detailed design, system integration, testing, and delivery. rerequisite: CMS 282 or graduate standing. Annually. CMS 366 Object-Oriented Software Development Methods 3.0; 3 cr. An introduction to object-oriented methods for the systematic development of software systems and reusable components. Topics include object-oriented life cycles, analysis and design techniques such as object modeling and event traces and their application using case tools, approaches for evolving designs into implementations, and management issues in applying object-oriented technologies and in controlling projects effectively. rerequisite: CMS 282 or graduate standing. Annually. CMS 367 Object-Oriented Technology 3.0; 3 cr. A course on advanced topics in object-oriented technology with in-depth treatment of design patterns, frameworks, concurrent, and distributed computing. rerequisite: CMS 366 or consent of instructor. Annually. CMS 368 rogramming Language Design 3.0; 3 cr. A course that studies unconventional and modern concepts of programming languages. Topics include concepts of exception handling, higher order functions and recursion, concurrent programming, mutual exclusion and synchronization, message passing, monitors, and support for concurrency control. rerequisite: CMS 258 or graduate standing. Annually. CMS 371 Advanced Computer Architecture 3.0; 3 cr. A course that discusses the structure of computer systems using processors, memories, input/output devices, and interfaces as building blocks. Topics include computer system instruction set design and implementation, memory hierarchies and pipelining, issues and tradeoffs involved in the design of computer system architectures with respect to the design of instruction sets, and parallelism and its exploitation in specific machines such as hypercubes and transputers. rerequisite: CMS 255 or graduate standing. Annually.

120 Department of Computer Science CMS 372 Advanced Operating Systems 3.0; 3 cr. A course that discusses advanced topics in OS with an exposure to distributed systems. Topics include virtual memory management, synchronization and communication, protection and security, operating system extension techniques, distributed and parallel systems, and modification of an existing operating system. rerequisite: CMS 272 or graduate standing. Annually. CMS 373 arallel Computing 3.0; 3 cr. A course that discusses the design, analysis, and implementation of algorithms for parallel computers. Topics include selection, merging, sorting, searching, matrix computations, numerical problems, and fast Fourier transforms. Students develop skills in designing parallel algorithms and analyzing their asymptotic running time and memory requirements, and develop medium-sized parallel codes using modern languages and libraries. rerequisites: CMS 255 and CMS 256 or graduate standing. Annually. CMS 374 Compiler Construction 3.0; 3 cr. Same as CMS 274. Graduate students taking the course are expected to do extra reading, a term paper and/or an additional project. rerequisites: CMS 255, CMS 257 or consent of instructor. Annually. CMS 377 Internals of Database Management Systems 3.0; 3 cr. Same as CMS 288. Graduate students taking the course are assigned extra work in the form of outside reading, a term paper and/or an additional project. rerequisite: CMS 277 or graduate standing. Annually. CMS 378 Advanced Database Applications 3.0; 3 cr. A course on advanced topics in database systems and their applications. Topics are chosen from object databases, data mining, schema evolution, distributed databases, web enabled databases, and databases for e-commerce applications. rerequisite: CMS 277 or graduate standing. Annually. CMS 384 Advanced Computer Networks 3.0; 3 cr. This course examines advanced topics in computer networks such as routing on the Internet, I multicasting, quality of service, Internet telephony, Iv6, Multirotocol Label switching (MLS), network performance, network security, overlay networks, etc. The course covers also the architectures and main components of wireless local area networks (IEEE 802.11), Mobile I Networks, Mobile Ad hoc Networks (MANETS), and WiMax networks (as defined in IEEE 802.16 standard). Some other topics may be covered through students research projects, presentations, and assigned reading. The course starts by presenting a quick overview of the major protocols of TC/I stack. rerequisite: CMS 284 or consent of instructor. Annually. CMS 385 Advanced Computer Graphics 3.0; 3 cr. A course that presents the basic concepts of 3D computer graphics. Topics include 3D object representations and manipulations, 3D transformation and viewing, hidden-surface and hiddenline removal, shading models, rendering, texture mapping, ray-tracing, and animation techniques. rerequisite: CMS 285 or consent of instructor. Annually. CMS 386 Computer-Aided Geometric Design 3.0; 3 cr. Same as CMS 286. Graduate students taking the course are assigned extra work in the form of outside reading, a term paper and/or an additional project. rerequisite: CMS 285 or consent of instructor. Annually. CMS 388 Computer Animation 3.0; 3 cr. A course that introduces the basic techniques and algorithms in Computer Animation. Topics include: history and applications of computer animation, modeling, interpolation, key framing, morphing, deformation, forward and inverse kinematics, particle systems, and rigid body dynamics. rerequisite: CMS 285 or Consent of instructor. Annually.

121 CMS 387 Data Visualization 3.0; 3 cr. A course on techniques in visualizing scientific and other types of data. Topics include a review of computer graphics fundamentals, 2D and 3D data types, differential operators and metric spaces, visualization for 2D and 3D data sets, physical models, methods of computational science, visualization schemes for scalar, vector, and other types of data, ISO-surface and volume visualization, visual monitoring, and interactive steering. rerequisite: CMS 385 or graduate standing. Annually. CMS 392 Knowledge Representation and 3.0; 3 cr. Reasoning under Uncertainty Deductive logic as a tool for formal reasoning in AI and its limitations; probability theory as another tool for this purpose; emphasis on Bayesian belief networks, a technology for expert system applications such as medical diagnosis; syntax semantics and inference algorithms for Bayesian belief networks, in addition to extensions concerning reasoning over time and planning under uncertainty. rerequisite: CMS 287 or consent of instructor. Annually. CMS 393 Building AI Systems 3.0; 3 cr. Key algorithms for building AI systems; algorithms for searching, backward and forward chaining, production-rule systems, truth maintenance, reasoning with uncertainty, and constraint satisfaction; application areas including diagnosis, temporal reasoning, and planning. rerequisite: CMS 287. or consent of instructor. Annually. CMS 394 Computer Arabization 3.0; 3 cr. A course that discusses issues and techniques that arise in computer Arabization. Topics include Arabic text editing, morphology, information retrieval, language comprehension, spelling and grammar checking, www browsers, and computer-aided education. rerequisite: Consent of instructor. Biennially. CMS 395 Subdivision for Modeling and Animation 3.0; 3 cr. A course on subdivision surfaces and their use in geometric modeling and animation. Topics include polar form of Bezier and B-splines curves and surfaces; subdivision curves; subdivision surfaces; analysis of limit curves and surfaces; Subdivision for Modeling: shape control, interpolation, digitizing and designing objects; Basic Animation and Subdivision: key framing, free-form deformation, morphing, warping, particle systems. rerequisite: CMS 285 or consent of instructor. Annually. CMS 395A/ 395B Comprehensive Exam rerequisite: Consent of adviser. 0 cr. CMS 396 Special Topics in Computer Science 1-3 cr. A course in which topics may vary each semester and are expected to be in areas of active research, such as computer-aided geometric design, databases, object orientation, and artificial intelligence. Students may register for this course twice (or more) on condition that course content differs. rerequisite: Consent of instructor. Annually. CMS 397 Computer Science Tutorial 1-3 cr. CMS 398 MS roject 3 cr. CMS 399 MS Thesis 9 cr.