MASTER OF SCIENCE IN COMPUTER SCIENCE
(With pre-requisite courses)

Admission Requirements:
Minimum Bachelor Degree with computer literacy.

Degree Requirement:
§ Completion of 22 courses & Thesis (72 credits).
§ Passing all courses individually and maintaining a minimum CGPA of 3.0.

Duration: 5-6 trimesters (4 months makes a Trimester)

Tuition Fees:
Admission Fee: Tk. 10,000
Per credit: Tk. 1,825
Total: Tk. 1,41,400
LIST OF THE COURSES

Pre-requisite Courses

After Completing Pre-requisite courses (30 credits), student will be awarded Graduate Diploma in Computer Science.

Required Courses (Any Ten)

MS 600 M. Sc. Thesis 12 credit hours
All M. Sc. candidates will require to undertake supervised study and research culminating in a thesis in their field of specialization. The completed thesis should be bind and printed in accordance with the regulation of IBAIS University.

MSCS WAIVER POLICY

Waiver may be given for Pre-requisite courses as detailed below:

To apply for pre-requisite undergraduate credit equivalents, a student must have an average grade of C or better and courses must have been taken within the past 5 years.

MCS 501 and MCS 502 - 4.5 credit hours in Structured Programming Language of courses equivalent to CSIT 121 and CSIT 122 at IBAIS UNIVERSITY

MCS 503 - 6 credit hours in Mathematics of courses equivalent to MATH 115 and MATH 125 at IBAIS UNIVERSITY

MCS 511 - 4.5 credit hours in Digital Logic Design of courses equivalent to CSE 223 and CSE 224 at IBAIS UNIVERSITY

MCS 521 and MCS 522 - 4.5 credit hours in Database of courses equivalent to CSIT 221 and CSIT 222 at IBAIS UNIVERSITY

MCS 571 and MCS 572 - 9 credit hours in Data Structure and Algorithms of courses equivalent to CSIT 217, CSIT 218, CSIT 227 and CSIT 228 at IBAIS UNIVERSITY

MCS 591 - 4.5 Credit hours in Microprocessor of courses equivalent to CSE 413 and CSE 414 at IBAIS University.

MCS 593 - 4.5 credit hours in System Analysis and Design of courses equivalent to CSIT 311 and CSIT 312 at IBAIS UNIVERSITY

Syllabus

Prerequisite Courses

MCS 501 Computer Programming Language
Overview, Structure of C programme, Data Types and Data Type Qualifier, I/O Functions-Character I/O, Formatted I/O, Character Set, Identifiers, Keywords and Contents, Variables, Expressions, Statement and Symbolic Constants, Arithmetic operators, Relational Operators and Logical Operators, Assignment Operators, Increment/Decrement Operators, Unary Operator and Conditional Operator., Bit-wise Operators, Comma Operator, Precedence and Associativity, Branching: The IF statement (break and continue statement), Branching: SWITCH statement, GOTO statement and operator, Looping: FOR statement (break and continue), Looping: WHILE and DO WHILE statement, Storage class: Automatic, Static, Register and Extern, Functions: Access, Prototype, Argument Passing and Value Receiving, Functions: Pass-by-value, Pass-by-reference and Value Receiving , Functions: Command Line Parameter and Library Functions, Arrays: Initialization, Access, Passing and Receiving , Arrays: 2D handling, Arrays: Sorting and Searching , String Handling , Structure: Initialization, Access, Passing and Receiving, Structure: Embedded Structure, Union and Bit-fields, File: Types of File, Text File Handling, File: Binary File Handling , File: Data File Management Program, Pointer: Concept, Passing and Receiving, Memory Allocation and Release, Pointer: List or Tree Management by Self-Referential Structure, Pointer: Pointer and Multi-Dimensional Arrays, Enumeration, Macros, Pre-Processor and Compiler , Directives, Library, Compiler and Linker, Segment and Memory Model, Video Adapter, Modes and Graphics Initialization, Graphics Functions. Introduction to C++, OOP, Polymorphism and necessary features of C++.

MCS 502 Computer Programming Language Lab
Laboratory work based on MCS 501

MCS 503 Mathematics
Set theory, Elementary number theory, Graph theory, Paths and trees, Generating functions, Algebraic structures, Semi graph, Permutation groups, Binary relation, Mathematical logic, Propositional calculus and predicate calculus.

MCS 511 Digital Logic Design

Number systems and codes, Digital logic, Boolean algebra, De-Morgan's law, logic gates and their truth tables, canonical forms, Combinational logic circuits, minimization techniques, Arithmetic and data handling logic circuits, decoders and encoders, Multiplexers and demultiplexers, Combinational Circuit design, Flip-flops, race around problems, Counters: asynchronous counters, synchronous counters and their applications, TTL, MOS, CMOS, IIL logic gates and their circuits, PLA design, Synchronous and asynchronous logic design: state diagram, Mealy and Moore machines, State minimizations and assignments, Pulse mode logic, Fundamental mode design.

MCS 513 Computer Organization and Assembly Programming
Computer Organization:

Fundamentals of computer design, Performance and cost, Instruction set design and examples, Measurements, Basic processor implementation techniques: Hardwired and micro-programmemed control; Caches and multiprocessor caches, Design of I/O systems, I/O performances, Micro-programmemed control, Multiprocessors with examples
Assembly Language: Machine and Assembly instruction types and their formats, Character representation instructions, instruction execution, Machine language programmeming, instruction sets and their implementations, The assembly process, Addressing methods, Subroutines, macros and files, I/O programmeming, interrupts and concurrent processes.

MCS 521 Database Concepts
Concepts and methods in database system, File organization and retrieval, Data manipulation, Query formulation and language, Database models, Data description languages, database integrity and security, Data dictionary/directory systems, database administration, Database design, Survey of some existing database management systems, Some applications using commercial languages.

MCS 522 Database Concepts Lab
Laboratory work based on MCS 521

MCS 571 Data Structure and Algorithms
Concepts and examples, elementary data objects, elementary data structures, arrays, lists, stacks, queues, graphs, trees, Memory management, Sorting and searching, hash techniques. Techniques for analysis of algorithms, Methods for the design of efficient algorithms: divide and conquer, greedy method, dynamic programmeming, back tracking, branch and bound, Basic search and traversal techniques, graph algorithms, Algebraic simplification and transformations, lower bound theory, NP-hard and NP-complete problems.

MCS 572 Data Structure and Algorithms Lab
Laboratory work based on MCS 571

MCS 591 Microprocessor
Review of different microprocessors 80486, 68040, V70, Gmicro processors, Comparing the architectures: RISC and CISC; Instruction set of machines: SPARC, INTEL and MIPS; Study of microprocessors: Pentium II, Alpha 21064, MIS 6400, PA-RISC; Math coprocessors and microprocessors.

MCS 592 Microprocessor Lab
Laboratory work based on CSE 591

MCS 593 System Analysis & Design
Information, general concepts of formal information systems, analysis of information requirements for modern organizations, modern data processing technology and its application, information systems structures, designing information outputs, classifying and coding data, physical storage media considerations, logical data organization, systems analysis, general systems design, detail system design, Project management and documentation, Group development of an information system project: includes all phases of software life cycles from requirement analysis to the completion of a fully implemented system.

Required Courses

MCS 601 Data Security & Cryptography

MCS 602 Visual and Internet Programming

Concept of Visual Programming Environment, Multiple Documents Interface. ActiveX controls and ActiveX components, API, OLE Automation, Database programmeming and Active Data Objects. Introduction to the Web, Scripting Objects.

MCS 603 Decision Support System

What is Medical Informatics? What are decision-support systems?, Representation of medical knowledge-coding and classification, Representation in patient records, Introduction to Artificial Intelligence, Methods for decision-support, Strategies for Medical Knowledge Acquisition, Modeling for decision support, Evaluation of systems, Clinical Decision Support Systems, Illustrative example systems, Strategies for Medical Knowledge Acquisition, Human-computer Interaction.

MCS 604 Advanced Operating System

Operating system for time shared multiprocessor computer systems, preprocessor, management state modeling, job scheduling, process scheduling, process synchronization, time slicing and time sharing operating systems and sub systems. Memory management in a paged and segmented virtual memory systems. Performance evaluation of computer networks software, introduction to computer as a utility, introduction to security and large database system.

MCS 605 Computational Complexity
MCS 606 Computer Vision
MCS 607 Knowledge Based System
MCS 608 Theory of Computing & Complier Design
MCS 609 Cogic Programming

MCS 610 Advanced Algorithms

Introduction, Parallel processing, Parallel models, Performance of Parallel Algorithms, The work-time presentation framework, Basic techniques: Pointer jumping, Balanced trees, Divide and Conquer, Pipelining, Partitioning and symmetry breaking, List ranking, Euler-Tour technique, Tree contraction; Parallel searching, Merging, sorting and selection, Connected components, Minimum spanning trees, Biconnected Components, Directed graphs, Plane sweeping, Visibility problems, Simulation between PRAM models, Lower bounds for EREW, CREW and CRCW PRAMs.

MCS 611 Advanced Computer Architecture

Integer arithmetic, Floating point arithmetic; Single precision and double precision; Interrupt handling high speed adders; Standard and recorded multipliers, Booths multiplier, Canonical and multi bit scanning multipliers, Array multipliers; High radix non-restoring division, SKT division, Robertson division, Convergence division and cellular array dividers; Floating point processors; Binary squares and square roots, Evaluation of trigonometric functions and polynomials, Chen convergence computation, CORDIC computations, Logarithmic number system (LNS) processor.

MCS 613 Bio-informatics

MCS 614 VLSI Design

Overview of the design methodology: top-down design approach technology trends and design styles. Brief review of MOS transistor theory. MOS transistor as a switch: pass transistors. And transmission gates. nMOS inverter characteristics, CMOS inverter characteristics: influence of n/p ratio of transfer characteristics and noise margin. CMOS processing technologies, CMOS circuit characteristics and performance estimation: resistance and capacitance, raise and fall times, delay, gate resistor sizing, power consumption, CMOS logic design. Structured design methods: design styles, automated synthesis, circuit extraction, simulation and design rule checking (DRC). Design examples. CMOS subsystem design: adders and related functions, multipliers, memory systems, data paths, programmemable logic arrays (PLAs), Field programmeming gate arrays (FPGAs). VLSI testing, structured DFT, self test and built-in test.

MCS 615 Digital Signal Processing

Main features and application of digital signal processing. Introduction to speech, image and data processing. Discrete time signals, sequences. Linear systems, linear constant co-efficient difference equations. Sampling of continuous time signals. Two dimensional sequences and systems;Non parametric methods- discrete random processes, auto correlation sequence, periodogram; parametric method- auto regressive modeling, forward/backward linear prediction, Lavinson-Durbin algorithm, minimum variance method and Eigenstructure method -I and II.

MCS 616 Optical Fiber Communication

Introduction, Light propagation through Optical Fiber: Ray Optics theory and mode theory. Optical Fiber: types and characteristics, transmission characteristics, fiber joints and fiber couplers. Light sources: light emitting diodes and laser diodes. Detectors : PIN photo detector and avalanche photo detector. Receiver analysis: Direct detection and coherent detection, noise and limitation. Transmission limitations: chromatic dispersion, non linear refraction, four wave mixing and laser face noises. Optical amplifier: laser and fiber amplifiers, applications and limitations. Multi channel optical system: frequency division multiplexing, wave length division multiplexing and co-channel interference.

MCS 617 Combinatorial Optimization

Formulation techniques are studied, along with general approaches for solving integer and combinatorial optimization problems: basic polyhedral theory, cutting planes, branch and bound, minimum spanning trees, shortest paths, network flow problems, matching and mastoids. The course also covers NP-completeness and the traveling salesman problem.

MCS 622 Distributed System

Fundamental characteristics of distributed System. Architectural models for distributed systems, Examples of servers such as file servers and name servers, Remote Procedure Calls (RPC). The features of UNIX and other operating systems which are geared towards distributed working, including sockets and NFS. Multicast communication and other algorithms for agreement between distributed sites. Security in distributed system. Concurrency control and transactions in sharing of distributed data.

MCS 641 Advanced Artificial Intelligence

Introduction, Advanced search techniques in AI, Knowledge based system design, Advanced plan generating systems, Bayesian network and probabilistic reasoning, Learning in neural belief networks, Practical natural language processing, Computer vision, Introduction to Robotics.

MCS 642 Data Mining

Concepts and techniques of data mining and data warehousing, including concept, principle, architecture, design, implementation, application of data warehousing and data mining. Data warehousing and OLAP technology for data mining, Data preprocessing, Descriptive data mining: characterization and comparison, Association analysis, Classification and prediction, Cluster analysis, Mining complex types of data, Applications and trends in data mining

MCS 643 Neural Network

Fundamentals of Neural Networks, Back propagation and related training algorithms; Hebbian learning; Cohen-grossberg learning; The BAM and Hopfield memory; simulated Annealing; Different types of neural networks; Counter propagation probabilistic, radial basic function, generalized regression etc. Adaptive Resonance Theory; Dynamic systems and neural control; The Boltzman machine; Self organizing maps; spariotemporal pattern classification, The Neo-cognition, practical aspects of neural networks.

MCS 644 Fuzzy System

Basic concepts of Fuzzy set theory, Fuzzy numbers, Aggregration operations on fuzzy sets. The theory of approximate reasoning, Introduction to fuzzy logic control, fuzzy system model and developments, Fuzzy logic controllers, Defuzzification methods, Linguistic descriptions and their analytical forms, the flexible structure of Fuzzy systems.

MCS 645 Speech Recognition

Introduction, Speech signal: production, perception and characterization; Signal processing and analysis; Pattern comparison techniques: distortion measures, spectral-distortion measures, time alignment and normalization; Recognition system design and implementation: source-coding, template training, performance analysis; Connected word models: two level DP, level building algorithm, one-pass algorithm; Continuous speech recognition: subword units, statistical modeling, context-dependent units; Task oriented models.

MCS 646 Syntactic Pattern Recognition

Introduction to formal languages, String languages for pattern description, Higher dimensional pattern grammars, Syntax analysis as a recognition procedure, Stochastic languages, Error-correcting parsing for string languages, Error-correcting tree automata, Cluster analysis for syntactic patterns, Grammatical inference for syntactic pattern recognition, Application shape analysis of wave forms and contours, Syntactic approach to texture analysis.

MCS 647 Image Processing

This course covers the advanced research topics of image processing which include image digitization, description, enhancement, segmentation, image transforms, filtering, restoration, coding and retrieval. Students are encouraged to collect and evaluate recently published articles in the above mentioned topics.

MCS 648 Mathematical Programming

Basic concept of Mathematical Programming, Concepts of linear and quadratic programmeming, Convexity, Convex sets and convex functions, Concept of integer programmeming, Some examples of integer programmeming problems, Linear programmeming techniques, Graphical solution of linear programmeming problems, Simplex method, Dual simplex method, Different integer programmeming techniques, Revised simplex method.

MCS 649 Machine Learning

Introduction, Supervised and Unsupervised learning in propositional logic, Induction of decision trees, Noise and over-fitting issues, Minimum description length principle, Conceptual clustering, Version space, Nearest neighbor classifier, Genetic algorithm, Computational learning theory.
Learning in first order logic, Top-down and Bottom-up approaches for inducing first order theory, Handling noise, First order theory revision, Predicate invention, Application of Inductive Logic Programming, Multiple predicate learning, Different types of language bias, PAC Learnability, knowledge discovery in database and data mining, Text and image retrieval.

MCS 671 Parallel Algorithms

Introduction, Parallel processing, Parallel models, Performance of Parallel Algorithms, The work-time presentation framework, Basic techniques: Pointer jumping, Balanced trees, Divide and Conquer, Pipelining, Partitioning and symmetry breaking, List ranking, Euler-Tour technique, Tree contraction; Parallel searching, Merging, sorting and selection, Connected components, Minimum spanning trees, Biconnected Components, Directed graphs, Plane sweeping, Visibility problems, Simulation between PRAM models, Lower bounds for EREW, CREW and CRCW PRAMs.

MCS 672 Graph Theory

Introduction, Fundamental concepts, Trees, Spanning trees in graphs, Distance in graphs, Eulerian graphs, Digraphs, Matching and factors, Cuts and connectivity, K-connected graphs, Network flow problems, Graph coloring: Vertex coloring and edge coloring, Line graphs, Hamiltonian cycles, Planar graphs, Perfect graphs.

MCS 673 Computational Geometry

Searching and Geometric Data Structures: Balanced binary search trees, Priority-search trees Range searching, Interval trees, Segment trees, Algorithms and complexity of fundamental geometric objects: Polygon triangulation and art gallery theorem, Polygon partitioning, Convex-hulls in 2- and 3- dimension, Dynamic convex-hulls; Geometric intersection: Line segment intersection and the plane-sweep algorithm, Intersection of polygons; Proximity: Voronoi diagrams, Delunay triangulations, closest and furthest pair; Visualization: Hidden surface removal and binary space partition (BSP) trees; Graph Drawings: Drawings of rooted trees (Layering, Radial drawings, HV-Drawings, Recursive winding), Drawings of planar graphs (Straight-line drawings, Orthogonal drawings, Visibility drawings); Survey of recent developments in computational geometry.

MCS 691 Computer Graphics and Animation

Advanced Graphic Techniques: Graphics basics, Three dimensional drawings, Geometric forms and models, Hidden surfaces, Fractals; Advanced rendering Techniques: Shadow generation techniques, Texture and environment mapping techniques, Procedural texture mapping and modeling, Ray tracing, Radiosity methods, Global illumination models, Volume rendering techniques; Advanced Animation: Animation articulated structures, Soft object animation, Procedural animation.

MCS 692 Simulation and Modeling

Introduction to the basic concepts and methods for using computers to model various real world systems, model building, random number generator, statistical analysis of results, validation and verification techniques, Digital simulation of continuous system, Simulation and analytical methods for analysis of computer systems and practical problems in business and practice, introduction to simulation packages. Probability distribution and expectations, stochastic processes, discrete Markov chain and continuous time Marcov chain. Birth death process in queuing. Queuing models; M/M/1, M/M/C, M/G/1, M/D/1 and G/M/1. Solutions of network of queues-closed queuing models and approximate models.

MIS 701 Object Oriented Programming Language

Introduction to programmeming using C++ for its object oriented features will include structures.
File input/output, data abstraction, classes (constructors, destructors, data members, member
function), operator overloading, inheritance, virtual functions, polymorphism and templates. Java
Application, Java applets, Methods, Arrays, String & characters, Graphics & java2D, Basic
graphical user interface components, Multithreading, Multimedia, Files & streams, JDBC,
Servlets, RMI, Networking, Java beans.

MCS 721 Distributed Database Query Optimization & Control

Review of Databases and Computer Network, Levels of distribution Transparency, distributed database design, Translation of global queries to fragment queries, Optimization of access strategies, the management of distributed Transaction, Concurrency Control, Distributed Database Administration, Homogeneous and Heterogeneous distributed Database.

MCS 731 Data Communication & Networks

Network Architectures - Layered Architectures & ISO Reference Model. Physical Layer; Transmission Media, Isdn & Cellular Radio, Data Link Layer: Error Detection, Error Correction, Data Link Protocols & Examples, Medium Access Sublayer: Channel Allocation Procedure, Multiple Access Protocol, IEEE 802 Standard, Bridges, High Speed LANs Satellites Networks, Network Layer: Design Issues, Routine Algorithm, Congestion Central, Internet Working, Network Layer In Internet, Trans Port Layer, Transport Service & Protocols, Internet Transport Protocols, Application Layer: Network Security, Domain Name System, SNMP, E- Mail, WWW & Multi Media

MCS 751 Software Engineering & Project Management

Advanced concepts in software engineering. Topics may include new lifecycle paradigms, code reusability issues, formal specifications, new design methodologies, and others.
Planning, scheduling, cost management of projects, measuring progress, predicting success, controlling failure. Management tools and their use. Effectiveness and efficiency of software and personnel. Distributed software development. Quality control standards and practices.

MIS 781 Multimedia System Design

Introduction to multimedia, interface and characteristics of voice and video processing equipment, multimedia document architecture, multimedia storage, media encoding/compression schemes, multimedia networking and protocols, operating system support for multimedia, real time scheduling of time critical multimedia documents, multimedia editors, current communication standards and software.

MS 600 Thesis

All M. Sc. candidates will require to undertake supervised study and research culminating in a thesis in their field of specialization. The completed thesis should be bind and printed in accordance with the regulation of IBAIS University.