The Department of Computer Science & Mathematics was founded in 2002 to provide a focus for research and teaching in computer science, information technology and mathematics. The academic program of the department includes the teaching of computer science and mathematics in the undergraduate and post-graduate students of the different faculties of this university. Since the beginning, the department has grown to a total of eleven full time teachers. The undergraduate students of the faculty of Agricultural Engineering and Technology have the option to obtain a degree in Agricultural Engineering with major in computer science during the last three semesters. The department is actively involved in a three-year project offering one year post-graduate diploma in Information and Communication Technology which is financed by the Ministry of Science, Information and Technology, People’s Republic of Bangladesh. The Department is offering M.S. degree in Computer Science from the January – June, ’06 semester. Attempts are being made to offer long and short term diploma and certificate courses on computer science and information technology to the teachers, officers, students and other staffs of this university. The department has a number of highly qualified and foreign-trained academic personnel, who on concerted and sincere efforts offers courses on computer science and mathematics to the student in different faculties of this university. The department has a modern computer laboratory with large number of computers and up-to-date software from where utility services are provided to researchers of this university. The multi dimensional academic background of the teaching staff, their research activities and the dynamic course-curriculum will make it a foremost department in this university. For further information, contact Head of Department of Computer Science and Mathematics at:

**Tel:** 880-91-55695-97/2850

**Fax:** 880-91-55810

## Curriculum M.S. Degree Programme

## Syllabuses of M.S. Courses

### CSM 6101 Structured Programming Language | Credit – 3

Programming concepts; Program development stages; Flow charts; Number systems: binary, octal, decimal and hexadecimal systems; Structured programming language: data types, operators, expressions, control structures; Functions and program structure: function basics, parameter passing conventions, scope rules and storage classes, recursion; Header files; Preprocessor; Pointers and arrays; User defined data types: structures, unions, enumerations; dynamic data structures; class and objects; Stack, Queue and Tree; Input and Output: standard input and output, formatted input and output, file access; Variable length argument list; Command line parameters; Error Handling; introduction to a functional programming language ( LISP or PROLOG).

### CSM 6102 Advanced Database Systems | Credit – 3

Object Oriented Database; Data Model, Design, Languages; Object Relational Database: Complex data types, Querying with complex data types, Design; Distributed Database: Levels of distribution transparency, Translation of global queries to fragment queries, Optimization of access strategies, Management of distributed transactions, Concurrency control, Reliability, Administration; Parallel Database: Different types of parallelism, Design of parallel database; Multimedia Database Systems: Basic concepts, Design, Optimization of access strategies, Management of Multimedia Database Systems, Reliability; Database Wire-housing/Data mining : Basic Concepts and algorithms.

### CSM 6201 Discrete Mathematics | Credit – 2

Set theory; Relations; Functions; Graph theory; Propositional calculus and predicate calculus; Mathematical reasoning: induction, contradiction and recursion; counting; Principles of inclusion and exclusion; Generating functions, recurrence relations; Algebraic structures: rings and groups.

### CSM 6503 Computer Graphics and Animation | Credit – 3

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 modelling, Ray tracing, Radiosity methods, Global illumination models, Volume rendering techniques; Advanced Animation: Animation articulated structures, Soft object animation, Procedural animation.

### CSM 6701 Advanced Data Structures & Algorithms | Credit – 3

Internal data representation; Abstract data types; Elementary data structures: arrays, lists, stacks, queues, trees, graphs; Advanced data Structures: heaps, Fibonacci heaps, B-trees; Recursion, sorting, searching, hashing, storage management. Techniques for analysis of algorithms; Methods for the design of efficient algorithms: divide and conquer, greedy method, dynamic programming, back tracking, branch and bound; Basic search and traversal techniques; Topological sorting; Connected components, spanning trees, shortest paths; Flow algorithms; Approximation algorithms; Parallel algorithms; Algebraic simplification and transformations; Lower bound theory; NP-completeness, NP-hard and NP-complete problems.

### CSM 6702 Graph Theory | Credit – 2

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.

### CSM 6202 Mathematical Analysis for Computer Science | Credit – 2

Recurrent problems; Manipulation of sums; Number theory; Special numbers; Generating functions. Random variables; Stochastic process; Markov chains (discrete parameter, continuous parameter, birth-death process); Queuing models (birth-death model, Markovian model), open and closed queuing network; Application of queuing models.

### CSM 6203 Numerical Methods | Credit – 2

Introduction; Solution of algebraic and transcendental equations: method of iteration, False Position method, Newton-Rhapson method; Solution of simultaneous linear equations: Cramer’s rule, Iteration method, Gauss-Jordan Elimination method, Choleski’s process; Interpolation: diagonal and horizontal difference, differences of a polynomial, Newton’s formula for forward and backward interpolation, Spline interpolation; Integration: general quadrature formula, Trapezoidal rule, Simpson’s rule, Weddle’s rule; Solution of ordinary differential equations: Euler’s method, Picard’s method, Milne’s method, Taylor’s series method, Runge-Kutta method; Least squares approximation of functions: linear and polynomial regression, fitting exponential and trigonometric functions.

### CSM 6204 Simulation and Modeling | Credit – 2

Simulation modeling basics: systems, models and simulation; Classification of simulation models; Steps in a simulation study; Concepts in discrete-event simulation: event-scheduling vs. process-interaction approaches, Time-advance mechanism, organization of a discrete-event simulation model; Continuous simulation models; Combined discreet-continuous models; Monte Carlo simulation; Simulation of queuing systems; Building valid and credible simulation models: validation principles and techniques, statistical procedures for comparing real-world observations and simulation outputs, input modeling; Generating random numbers and random variates; Output analysis. Simulation languages; Analysis and modeling of some practical systems; Concepts covered in lecture applied in computer laboratory assignments.

### CSM 6301 Computer Arithmetic | Credit – 2

Integer arithmetic, Floating point arithmetic; Single precision and double precision; Interrupt handling high-speed adders; Standard and recorded multipliers, Booth’s 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, CORD1C computations, Logarithmic number system (LNS) processor.

### CSM 6401 Advanced Artificial Intelligence | Credit – 2

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.

### CSM 6402 Symbolic Machine Learning-I | Credit – 2

Introduction, Supervised and Unsupervised learning in prepositional 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, Neural network and Fuzzy logic.

### CSM 6403 Advanced Syntactic Pattern Recognition | Credit – 2

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.

### CSM 6404 Data Mining | Credit – 2

Introduction; Data warehousing and OLAP technology for data mining; Data preprocessing; Data mining primitives, languages and systems; Descriptive data mining: characterization and comparison; Association analysis; Classification and prediction; Cluster analysis; Mining complex types of data; Applications and trends in data mining.

### CSM 6405 Symbolic Machine Learning-II | Credit – 2

Introduction, 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.

### CSM 6406 Speech Recognition | Credit – 2

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: sub word units, statistical modeling, context-dependent units; Task oriented models.

### CSM 6407 Machine Translation | Credit – 2

Theoretical problems: Definition, Context dependency, interpretation and translation; Engineering problems of machine translation: Maintainability, tunability, modularity, and efficiency; Linguistics-based MT: Compositionality and isomorphism, Declarative frameworks, Constraint-based formalisms; Knowledge-based MT: Translation and understanding, Design of interlinguas, The conceptual lexicon; Statistics-based MT: E-M algorithms, Alignment of bilingual corpora, Translation templates; Example-based MT: Similarity measures, Levels of comparison; Treatment of context dependency: Knowledge-based transfer, Sublanguage-based MT, Translation units.

### CSM 6501 Computer Communications and Networks | Credit – 2

Queuing models for circuit switching, packet switching and protocols, Digital switching, Traffic analysis, Network synchronization, control and management, Fiber optics Networks, Gigabit networks, Metropolitan and Wide area networking, Network security: Real-time protocols, Network agents, Recent advances in internet protocols, Asynchronous transfer mode (ATM) protocol and service categories, Quality of services, ATM traffic management call admission control, Congestion control, Video streams on ATM, ATM switch architecture and their performances, Spread spectrum techniques, Mobile communications: CDMA, GSM. CDPD; Wireless LAN, Wireless ATM, Wireless personal communications.

### CSM 6502 Multimedia Systems | Credit – 2

Overview to Multimedia Systems, Multimedia storage, Data compression techniques for audio and video, Synchronization, Multimedia networking and protocols, QOS principles, Video streams on ATM, Mobile multimedia communications, Operating system support for multimedia, Hypermedia system, Standards for multimedia, Multimedia database and Multimedia Applications.

### CSM 6504 Distributed Computing Systems | Credit – 2

Distributed object systems, Retrieving and caching of distributed information, Distributed data replication and sharing, Performance issues, Algorithms for deadlock detection, Concurrency control and synchronization in distributed system, Models for distributed computation, Networking facilities and resource control and management methods in network and distributed operating systems, Collaborative applications, Wide area network computing, Web based commerce, Agent systems and Market based computing.

### CSM 6505 Elements of Cryptography | Credit – 2

Classical Cryptography: Introduction to simple cryptosystems, Cryptanalysis; Shannon’s Theory: Perfect secrecy, Entropy, Product cryptosystems; Data Encryption Standard: Description of DES, Differential cryptanalysis; RSA System and Factoring: Public-key cryptography, RSA cryptosystem, Attacks on RSA, Factroing algorithms; Other Public-key cryptosystems: ElGamal cryptosystem and discrete logs, Merkle-Hellman Knapsack System; Signature Schemes: ElGamal signature schemes, Digital signature standard, Fail-stop signatures; Hash Functions: Signatures and Hash functions, Collision-free Hash functions, Birthday attack; Key Distribution and Key Agreement: Key predistribution, Kerboros, Diffie-Hellman key exchange; Identification Schemes: Schnorr identification scheme, Okamoto identification schemes; Authentication Codes: Computing deception probabilities, Combinatorial bounds, Entropy bounds; Secret Sharing Schemes: Shamir threshold scheme, Access structure and general secret sharing; Pseudo-random Number Generation: Indistinguishable probability distribution, probabilistic encryption; Zero-knowledge proofs: Interactive proof systems, computational Zero-knowledge proofs.

### CSM 6601 Project Management | Credit – 2

Organizational issues; basic management techniques; network methods; definition of tasks; CPM in detail; resource allocation; small scale projects; maintenance and enhancements; leadership and motivation; implementation projects.

### CSM 6703 Computational Geometry | Credit – 2

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-dimension 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.

### CSM 6801 Mathematical Programming | Credit – 2

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

### CSM 6802 Neural Networks | Credit – 2

Fundamentals of Neural Networks; Back propagation and related training algorithms; Hebbian learning; Cohonen-Grossberg learning; The BAM and the Hopfield Memory; Simulated Annealing; Different types of Neural Networks: Counter propagation, Probabilistic, Radial Basis Function, Generalized Regression, etc; Adaptive Resonance Theory; Dynamic Systems and neural Control; The Boltzmann Machine; Self-organizing Maps; Spatiotemporal Pattern Classification, The Neocognition; Practical Aspects of Neural Networks.

### CSM 6803 Petri Net Theory and Modeling of Systems | Credit – 2

Definition and types of Petri nets, Terms and notations marking, Importance of net theory, Transition firings, Practical modeling examples, Siphons and traps, Live ness and safeness, Behavioral properties, Deadlocks and siphons, Structural properties, Stochastic Petri Net (SPN).

### CSM 6804 Fuzzy Systems | Credit – 2

Basic Concepts of Fuzzy set theory; Fuzzy numbers; Aggregation operations of Fuzzy sets; The theory of approximate reasoning; Introduction to Fuzzy logic control; Fuzzy System Models and Developments; Fuzzy logic controllers; Defuzzification methods; Linguistic descriptions and their analytical forms; The flexible structure of fuzzy systems; Practical Aspects of fuzzy systems.

### CSM 501 Engineering Mathematics | Credit-3

Laplaces transformation: Elementary transformation and their properties; Solution of differential equations by Laplace’s transforms; Application of Laplace’s transforms, Fourier transforms and separation of variables of boundary value problems; Numerical Analysis: Roots of algebraic and transcendental equations. Bisection method. The secant method. The Newton-Raphsoon method. Finite difference. Finite difference algebra; Interpolation and Extrapolation with equal intervals (finite difference) and unequal intervals (divided difference). Lagrangian interpolation and Richardsons extrapolation; Numerical Integration. The trapezoidal rule. The Simpsons Rule; Numerical Differentiation; Ordinary initial value problems. Euler’s method. Runge-Kutta method (First order linear equations); Partial differential equations. Crank-Nicholsons method. The Laplace’s equations; Partial differential equation: One dimensional heat equations. Two dimensional wave equations. Solution under different boundary and initial conditions; Solution of Laplace’s equations.

### CSM 512 Computer Programming and Application | Credit-2

Standard Data Types: Control structures; program design techniques; data structures (string records and arrays); procedures and recursion; corrections and efficiency of algorithms; program debugging; Storing algorithms (insertion sort, merge sort and quick sort); files and sets; pointers and dynamic data structures (lists stacks, queues and trees); searching algorithms (linear search, binary search, binary tree search, hash tables); introduction to object oriented programming; introduction to function programming language (lisp of prolog); Database management system: Database concept and fundamental; relational model fundamental; database design (normalization, dependencies, views and security); relational calculus and use of QUEL; SQL as query language; Programming practice using turbo pascal and Lisp/Prolog; Use of micro-based database package FOXPRO in database management and data retrieval.

### CSM 515 Computer Science | Credit – 2

Computer fundamentals: Computer systems, number systems and their internal representations, binary arithmetic’s information coding, introduction to digital circuits and their design. Programming fundamentals; control structures; variable modifiers; pointer variables; functions; arrays; characters and strings; structures; recursive functions; disc I/Os; introduction to data structures. Object oriented concepts, polymorphism, inheritance, function overloading, operator overloading.

## Ph.D. Degree Programme

The department is considering to offer Ph.D. degree soon.

## Laboratory Facilities

As an youngest department of the faculty, born in 2002, the department is growing fast with establishing modern laboratory facilities. The department has well equipped with 40 microcomputers, logic trainer set, microprocessor training kit, multimedia projector and internet browsing facilities for students.