Islamic University, Kushtia, Bangladesh

Faculty of Applied Science & Technology

Department of Computer Science and Technology
Syllabus for Integrated B.Sc. (Honours) Courses
Session: 2001 – 2002
Final Examination: 2005

The integrated B.Sc. (Honours) courses in Computer Science and Technology shall be offered over the period of
four academic years. The examination will be held at the end of each academic year. The integrated (credit)
courses will consist of 42 courses of which 32 will be Theoretical and 7 Practical courses, and a Research Lab
equivalent to three unit courses. Each unit course will carry 50 marks. Students shall take 1 university (non-
credit) course carrying 100 marks. There shall be 200 Marks Tutorial examinations and 200 Marks Viva-Voce on the
departmental courses distributed over the four academic years. The grand total Marks will be 2600, out of which
credit courses will carry 2500 Marks and non-credit course 100 Marks. The examination of one unit theoretical
course shall be of three-hour duration and practical examination shall be of six-hour duration.

Year-wise Distribution of Courses along with Titles and the Marks will be as follows:

First Academic Year: 2001-2002

Integrated Courses:
CST 101: Computer Fundamentals 50
CST 102: Computer Programming 50
CST 103: Electricity, Magnetism and Electrical Networks 50
CST 104: Basic Electronics 50
CST 105: Algebra & Trigonometry (MATH 01) 50
CST 106: Calculus and Differential Equations (MATH 02) 50
CST 107: Electrical Machines and Instruments 50
CST 108: Mathematical Statistics 50
CST 109: Software Lab. 50
CST 110: Electronics Lab. 50
CST 111: Tutorial 50
CST 112: Viva-Voce 50
---------------------------------------------------------------------------------------
Total: 600

Non-Credit Course:
Islamic Studies / Bangladesh Studies 100

Second Academic Year: 2002-2003

Integrated Courses:
CST 201: Microprocessors and Assembly Language Programming 50
CST 202: Discrete Mathematics and Numerical Methods 50
CST 203: Data Structures and Algorithms 50
CST 204: Database Management Systems 50
CST 205: Object Oriented Programming 50
CST 206: Switching Devices and Pulse techniques 50
CST 207: Computer Architecture and Organization 50
CST 208: Geometry and Vector Analysis (MATH 03) 50
CST 209: Digital Systems 50
CST 210: Software Lab. 50
CST 211: Digital Electronics Lab. 50
CST 212: Tutorial 50
CST 213: Viva-Voce 50
-----------------------
Total: 650
 Third Academic Year: 2003-2004

Integrated Courses:
CST 301: Operating systems 50
CST 302: Formal Languages & Automata Theory 50
CST 303: Computer Peripherals and Interfacing 50
CST 304: System analysis and Design 50
CST 305: Digital Signal and Image processing 50
CST 306: Computer Network And Internetworking 50
CST 307: Computer Graphics 50
CST 308: Software Engineering 50
CST 309: Hardware Lab. 50
CST 310: Software Lab. 50
CST 311: Tutorial 50
CST 312: Viva-Voce 50
----------------------
Total: 600

Fourth Academic Year: 2004-2005

Integrated Courses:
CST 401: Compiler design 50
CST 402: Artificial Intelligence & Expert Systems 50
CST 403: Simulation and Modeling 50
CST 404: Pattern Recognition & Neural Computing 50
CST 405: Communication Engineering and telecommunication 50
CST 406: Visual Languages and Multimedia 50
CST 407: Internet and Web 50
CST 408: Software Lab. 50
CST 409: Research Lab. 150
CST 410: Tutorial 50
CST 411: Viva-Voce 50
-----------------------------
Total: 650
 First Academic Year: 2001-2002

CST 101: Computer Fundamentals

Computer Generations and Classification: Definition, functions and characteristics of computers, Block
diagram, Computer Generations, Moore’s Law, Classification of Computers, Hardware, Software and Firmware,
Computers’ impact on society.
Data representation: The decimal, binary, octal and hexadecimal number systems, Binary arithmetic in
computers, Conversion Algorithms. Binary Codes, Weighted binary codes, Non-weighted binary code, Error
detecting and correcting codes, Representation of characters, integers, and fractions in computers; Alphanumeric
codes.
Hardware Components: Input/output units, Memory units, CPU, Logic Circuits; Machine architecture; Distributed
Computer system, Parallel Computer System,
Software Components: Programming languages and their classifications, Assembler, Compiler and Interpreter,
Structured and blocked structured languages, procedural and non-procedural programming, Types of software:
Systems software, Application packages.
Operating Systems: Need for an Operating System (OS), Types of OS, Example of Operating Systems: DOS,
Windows and Linux.
Computers and Communications: Types of Communications with and among computers, Need for Computer
Communication Networks, Internet and the World Wide Web. Introduction to Hyper Text Markup Language (HTML)
and Web page.
Application Software: MS Word, MS Excel, MS Access etc.

Books Recommended:
1. Rajaraman, V Fundamentals of Computers
2. Jain, Satish Introduction to Computer Science Vol. I & II
3. Balasubramanian Elements of Computer Science Vol. I

CST 102: Computer Programming

Problem solving techniques: Problem Analysis, Algorithm, Flowchart, Debugging, Coding and Documentation.
Programming in C: An overview of C; variables, constants, operators and expressions; program control
statements; functions, arrays, pointers, Structures, unions and user-defined types and enumerations; Storage
Management and Dynamic Data Structures; Input output and disk files; Pre-processors, Bit field operators,
Libraries, Linking libraries and header files, Graphics programming.

Books Recommended:
1. H Schildt Turbo C/C++: The Complete Reference
2. Cochan S G Programming in C
3. Balagurusamy E Programming in ANSI C
4. Gottfried Programming with C

CST-103: Electricity, Magnetism and Electrical Networks

Electrical Circuit Analysis: Concepts of Electrical Networks; Nodal analysis with voltage and current sources;
Thevenin's and Norton's Theorems; Superposition Theorem; Maximum Power Transfer Theorem; Star and Delta
Conversions;
The Magnetic Field: Definition of B, Effect of magnetic force on current, Torque on a current Loop, Hall effect;
Ampere's Law: B near a long wire, Magnetic lines of induction, Two parallel conductors, B for a solenoid, The Biot-
Savart's Law.
Faraday's Law: Faraday's experiments, Faraday's laws of electromagnetic induction, Lenz's Law, Motional e.m.f,
Eddy current. Self and Mutual Inductance,
Magnetic properties of matter: Poles and dipole, Gauss's Law of magnetism, Hysterasis, Paramagnetism,
Diamagnetism, Ferromagnetism.
Transient: Transients in RC, RL, RLC Circuits; Energy in magnetic field.
Filters: Different types of Filters; T and p networks, K-Type Low-Pass, High Pass, Band-Pass and Band-
Elimination Filters;
AC Theory and Circuits: General AC Theory; AC Power; Average & RMS Value of AC Voltage & Current, Series
and Parallel Resonant circuits, Q Value & Bandwidth, Phasor Algebra;
Books Recommended:
1. Theraza, B L Electrical Technology
2. Hallidy and Resnic Physics Part-II
3. Ryder, J.D. Networks, Lines, and Fields.

CST 104: Basic Electronics

Energy Bands in Solids: The nature of the Atom, Atomic energy levels, Valence and conduction bands,
Conductors, Semiconductors and Insulators.
Semiconductor Diode and Rectifiers: Semiconductors’ characteristics and their types, P-N Junction Diodes and
their V-I Characteristics; Zener Diode, Ideal Rectifier Concept, P-N Junction Diode as a Rectifier; Half-wave and
Full-wave Rectifiers; Rectifier Filters and Ripple Factor, Voltage Regulator Using Zener Diode, Clipper, Clamper.
Transistor: PNP and NPN Junction Transistors; CB, CE and CC Configurations and their V c-Ic Characteristics;
Transistor Action; Different Types and Biasing; Bias Stabilization; Operating Point; DC and AC Load Lines;
Dynamic Transfer Curve, Transistor as a Circuit Element, Transistor Hybrid Parameters.
Transistor Amplifiers: Transistor DC Amplifiers; CE, CB and CC Amplifiers , their Equivalent Circuits and
Computation of Current, Voltage and Power Gains; Class A, Class B and Class C Amplifiers, class AB pushpull
Amlifier.
FET devices: Introduction to JFET, MOSFET, PMOS, NMOS & CMOS: biasing & application in switching circuits.
Feedback Amplifiers: Feedback Principles and Characteristics; Current and Voltage Feedback Amplifiers;
Positive and negative feedback.
Oscillators: Oscillators and Conditions for Sustained Oscillations; RC Phase Shift, Collpit and Crystal Oscillators.
Optoelectronic devices: PN & PIN photodiode, phototransistor; photoconductive cell; solar cell, LED, LCD &
alphanumeric display.

Books Recommended:
1. Millman and Helkias Electronic Devices and Circuits
2. Boylestad and Nashelsky Electronic Devices and Circuit Theory
3. Theraja, B L Basic Electronics
4. Malvino Electronics principles
5. Gupta and Kumar Hand Book of Electronics

CST 105: Algebra and Trigonometry (MATH 01)

Elements of Set Theory: Introduction to sets. Set Algebra. Types of sets: Finite, infinite, countable and
uncountable sets. Relations and Functions.
Matrices: Definition and Algebra of matrices; Special types of matrices. Determinant of a square matrix:
Properties; Crammer’s rule; Rank of a matrix; elementary transformation and normal form. The adjoint and
inverse of a square matrix. Matrix inversion by partitioning; Solution of system of linear equations: Gauss-Jordan
method.
Theory of equations: Relation between roots and coefficients. De Carte’s rule of sign. Solution of cubic and
biquardratic equations. Symmetric functions of the roots.
Trigonometry: Complex number. De-Moiver’s Theorem and it applications. Functions of complex arguments.
Gregory’s series. Summation of trigonometric series. Hyperbolic functions.

Books Recommended:
1. Bernard and Child Higher Algebra
2. Hall and Knight Higher Trigonometry
3. Das and Mukherjee Higher Trigonometry
4. Shahidullah and Bhattacharjee Higher Algebra and Trigonometry

CST 106: Calculus and Differential Equations (MATH 02)

Differential Calculus: Limits, continuity, and differentiation of real-valued functions. Successive differentiation.
Expansion of functions. Maxima and Minima. Partial differentiation. Tangent and Normal.
Integral Calculus: Methods of substitution. Integration by parts. Integration of special trigonometric and
rational functions. Fundamental Theorem Calculus. General properties of definite integrals. Simple definite
integrals and reduction formula. Length and areas of plane curves. Volumes and surface-areas of solids of
revolution.
Differential Equations: Exact Solution of First-Order Ordinary Differential Equations: Exact Differential
Equations and Integrating Factors, Separable Equations and Equations reducible to this form, Linear Equations
and Bernoulli Equations.
Explicit Solution of Higher-Order Linear Differential Equations: Basic Theory, Homogeneous Linear
Equation with Constant Coefficients, Method of Undetermined Coefficients, Variation of Parameters, Cauchy-
Euler Equation.
Series Solutions of Linear Differential Equations: Power Series Solutions about an Ordinary Point,
Solutions about Singular Points; The Method of Frobenius.

Books Recommended:
1. Ayres, F Calculus
2. Das and Mukherjee Differential Calculus
3. Das and Mukherjee Integral Calculus
4. Sapely L Ross Differential Equations

CST 107: Electrical Machines and Instruments

DC Machines: General arrangement of DC machine; Ring wound armature; Windings; EMF calculation in
armature winding; Armature reaction; Compensating winding commutator.
DC Generators: Characteristics of DC generators, Armature and field connection; Separately excited generator;
Shunt wound generator; Series wound generator; Compound wound generator.
Transformer: Equation; Design; Construction; Losses; Auto transformer.
DC Motors: DC machine as motor; Speed of a motor; Torque; Torque of a electric motor; Starting resistor; Speed
and torque characteristics of different types of electric motor; Speed control of a DC motor.
AC Machines: Principal of ac machine, Introduction to Alternator; Stepper Motors;
Electrical and Electronic Instruments: Essentials of Indicating Instruments, Ammeters and Voltmeters,
Oscilloscope,

Books Recommended:
1. Theraza, B L Electrical Technology
2. E. Hugus Electrical Technology

CST 108: Mathematical Statistics

Introduction: Definition and characteristic features of the science of statistics, Main divisions of statistical theory
Frequency Distribution and Measures of Location: Frequency distributions, Graphical Representation of
Frequency distributions, Forms of Frequency Curves, Caparison of frequency distribution, Measures of Location or
Measures of central tendency, Requisites for an ideal measure of central tendency.
Measures of Dispersions, Skewness & Kurtosis, Moment of Frequency distribution: Measures of
dispersion, characteristics of an ideal measure of dispersion, moments, Sheppard’s corrections to moments of
grouped frequency distributions, symmetrical and skewness, kurtosis, Pearson’s b-and g -coefficients, Factorial and
absolute moments.
Theory of Probability: Random experiments, Sample Space, Types of events, Mathematical and statistical
definition of probability, Theorem of total probability, its generalization and geometrical interpretation, Boole’s
inequality; Theorem of compound probability; Bayes theorem; set theoretic formulation of probability theory;Pair
wise independent events.
Discrete Probability Distributions: Discrete random variable; Probability mass function and distribution function;
Mathematical expectation; Covariance; Conditional Expectation- conditional variance, Moments generating function;
Cumulants; Probability generating functions; Binomial distributions; Poisson distributions, Negative Binomial
distributions, Hypergeometric distributions.
Continuous Probability Distributions: Univariate Continuous Probability Distributions; Moment generating
function, Cauchy and Weibull distributions.
Correlation and Regression: Correlation coefficient, Bivariate frequency distribution, Linear and curvilinear
regression, Standard error of estimate, Correlation of ranks, Correlation ratio, Bivariate normal distribution,
Properties of Normal Correlation Distribution, Intra-class correlation coefficient.

Books Recommended
1. Weatherburn, C. E. A First Course in Mathematical Statistics
2. Marek Fisz. Probability and Mathematical Statistics
3 Kapur, J. N. and Saxena, H. C. Mathematical Statistics
4. Manindra Kumar Roy Fundamentals of Probability & Probability Distributions
 CST 109: Software Lab
This Lab. is based on the courses CST 101 and CST 102. Simple exercises based on DOS, Windows and
Applications software, development of programs in BASIC and C languages.

CST 110: Electronics Lab

This Lab. is based on the courses CST103 and CST104. Experiments will be carried out to build and test some
electrical and electronic circuits.
 Second Academic Year: 2002-2003

CST 201: Microprocessors & Assembly Language Programming

Introduction: Microprocessors and microcomputers, Evolution of microprocessors, microprocessor applications,
Programming Languages, General architecture of microprocessor, The Memory, Input/Output (I/O), Co-processors.
Microprocessor Software Concepts: Instruction formats, Addressing Modes, Instruction Types, and Introduction
to Assembly Language Programming.
Intel 8085 microprocessor: Internal architecture, register structure, programming model, addressing modes,
instruction set, programming, memory subsystem, bus timing and standard.
Input/Output interfacing: Polling and interrupts, microprocessor organizations, architecture options for
microprocessor, I/O control signals, I/O port organization and accessing; Interfacing devices: Programmable and
non-programmable I/O ports, Programmable I/O ports: 8255A, Programming the 8255, applications, programmed
I/O, Standard I/O, Memory mapped I/O, Programmable communication interface: 8251A; DMA.
Intel 8086/8088 microprocessors: Internal architecture, register structure, programming model, addressing
modes, instruction set.
Overview of Other processors: Intel 80186, 80286, 80386, 80486 & Pentium microprocessors and other
advanced processors, Motorola 68000.
Assembly Language Programming: Machine & Assembly instruction types & their formats; Character
representation instructions; Instruction execution; control structures, Subroutines, Interrupt, I/O programming;
Assembler, Cross-Assemblers.

Books recommended
1. D. V. Hall Microprocessors and Interfacing
2. Malvino, A P Digital Computer Electronics
3. Padmanabhan, T R Digital Systems and Microprocessors
4. Liu and Gibson Microprocessor Systems: The 8086/8088 Family
5. M. Rafiquzzaman Microprocessor and Microprocessor based system

CST 202: Discrete Mathematics and Numerical Methods

Discrete Mathematics:
Mathematical Logic: Statements and Notation. Connectives: Negation, Conjunction, Disjunction, Statement
Formulas and Truth Tables. Conditional and Biconditional. Tautologies. Equivalence of Formulas. Duality Law.
Tautological Implications. Functionally Complete Sets of Connectives. Normal Forms, Ordering and Uniqueness of
Normal Forms. Rules of Inference. Methods of Proof. Predicate Calculus: Predicates, Statement Function,
Variables, and Quantifiers, Predicate Formulas, Free and Bound Variables, The Universe of Discourse. Rules of
Inference: Universal Specification, Existential Specification, Existential Generalization, and Universal
Generalization. Mathematical Induction.
Elements of Number Theory: Modular Arithmetic, and The Euclidean Algorithm.
Relations and Functions: Properties of Binary Relations, Composition of Binary Relations, Relation matrix and
Graph of a Relation. Functions: Characteristic function, Floor function, Ceiling function and Hashing functions.
Graphs: Introduction, definition and terminology, graph representations, traversals, connected components and
spanning trees, shortest path and transitive closure, activity networks, topological sort and critical paths,
enumerating all paths.
Trees: Basic terminology, Binary trees, binary tree representations, binary tree traversal; Binary search tree, tree
search, Insert into a search tree, tree sort algorithm, deletion from a search tree, Building a binary search tree,
Inserting a node, AVL trees, Forming a heap;
Elements of Group Theory: Semigroups, Isomorphism and Homomorphism of Semigroups, Groups, Group
Homomorphism.

Numerical Methods:
Solutions of Polynomials and Transcendental Equations. Interpolation. Least Squares Approximation of Functions.
Solution of systems of Linear equations by Gauss-Seidel iterative method. Numerical Differentiation and Integration.
Numerical Solutions of Ordinary Differential Equations.

Books Recommended:
1. Rosen, K. H. Discrete Mathematics and its Applications
2. Koleman & Busby Discrete Mathematical Structures for Computer Science
3. Trembley & Manohar Discrete Mathematical Structures with Applications to Computer Science
4. Sastry, S. S. Introductory Methods of Numerical Analysis
5. Scarborough, J. B. Numerical Mathematical Analysis
6. Rajaraman, V. Computer Oriented Numerical Methods

CST 203: Data Structures and Algorithms

Introduction: Basic Terminology, Elementary Data Organization, Data Structures, Algorithms, and Complexity of
Algorithms
Stacks, Queues and Recursion: Fundamentals, Different types of stacks and queues: Circular, dequeues etc.;
evaluation of expressions, multiple stacks and queues; Recursion: Direct and indirect recursion, depth of recursion;
Simulation of Recursion: Removal of Recursion; Towers of Hanoi.
Elements of Graphs and Trees: Graph Terminology, Paths and Circuits, Connectedness, Matrix Representation
of Graph and Isomorphism of graphs. Trees, Rooted trees, Path Lengths in Rooted Trees.
Linked Lists: Single linked lists, Linked stacks and queues, the storage pool, polynomial addition, equivalence
relations, sparse matrices, doubly linked lists and dynamic storage management, generalized lists, garbage
collection and compaction.
Extended binary trees: 2-trees, internal and external path lengths, Huffman codes/algorithm; Threaded binary
trees, binary tree representation of trees; Application of Trees: Set representation, decision trees, game trees;
Counting binary trees.
Sorting: Searching, bubble sort, shell sort, insertion sort, selection sort, quick sort, heap sort, 2-way merge sort,
sorting on several keys, practical considerations of internal sorting.
Algorithm Analysis: Techniques for analysis of algorithms, Methods for the design of efficient algorithm: divide
and conquer, greedy method, dynamic programming, back tracking, branch and bound, Basic search and traversal
techniques, graph algorithms, Algebraic simplification and transformation, lower bound theory, NP-hard and NP-
complete problems.

Books Recommended
1. Reingold and Hansen Data Structure
2. Horowitz and Shahny Analysis of Algorithms
3. Taunenbaum, Langsam Data Structure Using C
4. Robert L. Kruse Data Structure and Program Design
5. Lipschutz Data Structures, Schaum’s Outline

CST 204: Database Management Systems

Introduction to record oriented and object oriented data models. Informal design with E-R
model. Relational algebra and relational calculus. Query language based on relational
algebra relational calculus. SQL, PLSQL, Physical organization (File): Indexed sequential,
Hashed, Dynamic hashed with or without deferred splitting, B-trees and their usage in
organizing primary as well as secondary keys; Implementation of join and other relational
algebraic operations and their performance analysis. Data dependencies, Normal forms and
loseless join synthesis. Query optimization techniques. Case studies: ORACLE systems.
Concurrency control, Error recovery and security. An overview of distributed data base and
data base systems.
Books recommended:
1. Korth and Silverchatz Database System Concepts
2. O. William Principle of Database Systems
3. Jeffrey Ullman Relational Database Management System
4. M. M. Kashyap Database System Design
5. Al Stevens C Database Development

CST 205: Object Oriented Programming

Principle of Object Oriented Programming (OOP). Introduction to C++ as an OOP Language.
Basics of C++ programming: Tokens, Expressions Control Structures, and Functions in C++.
Classes and Objects, Constructors and Destructors, Parameterized Constructors, Friend
Functions, Function and Operator overloading and Type Conversions. Inheritance: Single,
Multilevel, Multiple, Hierarchical, and Hybrid inheritance; Virtual base classes, Constructor in
derived classes; Nesting of classes. Virtual Functions: Pointers to Objects, this pointer,
Pointer to derived classes, Virtual Functions, Pure Virtual Functions, Early versus late
binding. C++ I/O operations: C++ streams, C++ stream classes, Unformatted console I/O
operations, Formatting I/O, Creating manipulator functions, Classes for file stream
operations, Opening and Closing a File, Detecting EOF, File pointers and their manipulations,
Sequential, Random I/O operations, Error handling during file operations. Command-line
arguments.

Introduction to JAVA programming.

Books recommended:
1. Balagurusamy, E Object Oriented Programming with C++
2. Schildt, H Turbo C/C++: The Complete Reference

CST 206: Switching Devices and Pulse Techniques

Negative-resistance switching circuits: General characteristics of negative resistance devices, types of
negative-resistance devices, Tunnel diode, SCR, UJT: construction, operation and characteristics, tunnel diode
astable oscillator, a UJT relaxation oscillator and SCR power controller.
Multivibrators: Astable, Monostable and bistable multivibrators, circuit, operation, characteristics and
application, The 555 Timer; Multivibrators using Timer and operational amplifier.
Operational amplifiers: Ideal operational amplifier, Uses as an inverter, scale Changer, Phase shifter,
Integrator Differentiator, Adder and Analog Computer, Active Filters.
Study of logic families: DL, DTL, DCTL, ETL, TTL, ECTL, IIL, and MOS logic families.
Circuits for generating linear voltage slopes: Simple RC integrator, linear sweep generators using constant
current source, the miller integrator, the bootstrap sweep generator, practical bootstrap circuit,

Books Recommended:
1. Taub and Schelling Switching Devices and Circuits
2. Millman and Halkias Electronic Devices and Circuits
3. B L Theraja Basic Electronics
4. Gupta and Kumar Hand Book of Electronics

CST 207: Computer Architecture & Organization

Fundamentals of Computer Design: Introduction, definition of performance, job of computer designer, historical
perspectives.
Processor design: Introduction, Processor Organization, information representation, number formats; Instruction
types, assembly Language programming; Fixed point Arithmetic: Addition, subtraction, multiplication, division; ALU
design, Basic ALU Organization, floating point arithmetic, arithmetic processors; Stack processor.
Control design: Introduction, Instruction Sequence, instruction interpretation; Hardwired control: Design methods,
multiplier control unit, CPU control unit; Micro-programmed control: Basic concepts, control memory optimization,
multiplier control unit, Micro-programmed Computers: Conventional and nanny-programmed computers;
Memory Organization: Review of primary and secondary memories; memory hierarchies; High-speed memories,
Interleaved memories, Caches, associative memories.
System Organization: Communications: Introduction, bus control; I/O systems: Programmed I/O, DMA and
interrupts, I/O processors, Basic concepts of parallel processing.
RISC and CISC processors: Introduction, data dependency, addressing modes, condition code, register sets,
brief study of standard RISC and CISC processors.

Books Recommended
1. Hayes, J P Computer Architecture and Organization
2. Stone Introduction to computer Architecture
3. Sloan, M E Computer Hardware and Organization
4. Malvino, A P Digital Computer Electronics
5. Mano, M Computer System Architecture

CST 208: Geometry and Vector Analysis (MATH 03)

Analytical geometry of two dimensions: Cartesian and polar coordinates. Change of axes. Pair of straight
lines. The general second-degree equation, Circle, System of circles, parabola, ellipse, hyperbola.
Analytical geometry of three dimensions: Rectangular coordinates, plane, straight line, sphere, central
conicoids and general equation of the second degree.
Vector Analysis: Definitions and examples of vectors, Theorems on vector and scalar product of vectors.
Vector differentiation, vector differential operator, vector integration.
Books recommended
1. Askwith E H Analytical Geometry of Conic Sections
2. Rahman & Bhattacharjee A Text Book of Co-ordinate Geometry & Vector Analysis
3. Spiegel M R Vector Analysis & Tensor Calculus

CST 209: Digital Systems

Logic Gates and Minimization: Different types of Logic gates and their truth table, Boolean Algebra, Minimization
of switching functions: Karnaugh map, and Quine-McClusky methods.
Digital Arithmetic Circuits: Half adder, Full adder, Parallel adders, 2’s complement system, look-ahead carry
adder, the BCD adder
Combinational logic circuits: Decoder, Encoder, 7-segment decoder, Multiplexer and Demultiplexers.
Flip Flops and related devices: Latches, Clocked SR, JK, D & T flip-flops, FF timing considerations, Master-
slave flip-flops, FF applications, Frequency division & counting.
Counters and Registers: Asynchronous and Synchronous counters, n-mod counters, propagation delay, Parallel
up, down and up/down counters, presettable counters, cascading counters, Shift-register, Frequency counters,
Digital clock.
Digital-to-Analog conversion: D/A-converter circuitry, DAC specification, and DAC applications. Analog-to-Digital
conversion: Digital-ramp, Successive-approximation, Flash and tristate ADCs, Digital Voltmeter.
Semiconductor Technology: Semiconductor memory terminology, Read-Only Memories, ROM architecture,
ROM timing, types of ROMs, Flash Memory, ROM applications, Programmable Logic Devices. RAM architecture,
Static RAM and Dynamic RAM, Dynamic RAM structure and operation, DRAM read/write cycles, DRAM refreshing,
DRAM technology, Expanding word size and capacity, Magnetic bubble and CCD memory.

Books Recommended
1. Tocci, R.J. Digital systems
2. Malvino & Leach Digital principles and Applications
3. Jain R. P. Modern Digital Electronics
4. Taub and Schelling Switching devices and circuits

CST 210 : Software Lab.

This Lab. is based on the course CST203, CST204 and CST205. Exercises on Data Structures and Algorithms
using C/C++ language and Database programming projects using ORACLE will be carried out.

CST 211 : Hardware lab.

This Lab. is based on the courses CST201, CST206 and CST 209. The students will run assembly language
programs in the microprocessor trainers and microcomputers and develop hardware modules using IC chips.
Experiments based on Op-amp, FET, Power electronic devices and digital circuits like combinational and sequential
logic circuits will be built and tested.
 Third Academic Year: 2003-2004

CST 301: Operating System

Introduction: Evolution, Goals and Components of OS, Types of OS.
Process management: Process states and state transition, Process Control Blocks, Job and Process scheduling
CPU Scheduling: Scheduling levels, Objectives and criteria, CPU scheduling algorithms, Algorithm Evaluation
Process Synchronization: Process co-ordination, Critical section problems, Semaphores, Monitors, Classical
problems of process synchronization.
Deadlock: System Model, Deadlock Characterization, Methods for Handling Deadlocks, Deadlock prevention,
avoidance, and detection, Recovery form deadlock, Combined approach to deadlock handling.
Memory management: Logical versus Physical Address Space, Swapping, Memory allocation schemes, Paging
and Segmentation, Segmentation with Paging
Virtual memory: Demand paging, Performance of Demand Paging, Page replacement, Page replacement
algorithms, Allocation of frames, Trashing, Other Considerations, Demand Segmentation
Secondary storage management: Disk structure, Disk scheduling, Disk management, Swap-space
management, Disk reliability, Stable storage implementation
File-System: File and Directory concept, File system structure, Allocation method, Free space Management,
Directory Implementation.
Protection and Security.

Books Recommended
1. Silberschatz and Galvin Operating System Concepts
2. Stalling, William Introduction to Operating System
3. Milenkoviæ, Milan Operating Systems: Concepts and Design
4. Tanenbaum, Andrew S. Modern Operating Systems

CST 302: Formal Languages & Automata Theory

The Central Concepts: Introduction to Finite State Machines and Finite State Automata; Alphabets, Strings and
Languages.
Finite Automata: Deterministic Finite Automata, Non-deterministic Finite Automata, and their applications; Finite
Automata with Epsilon-Transitions.
Regular Expressions and Languages: Regular Expressions, Finite Automata and Regular Expressions,
Applications of Regular Expressions, and Algebraic Laws for Regular Expressions.
Properties of Regular Languages: The Pumping Lemma for Regular Languages and its applications; Closure
Properties and Decision Properties of Regular Languages; Equivalence and Minimization of Automata.
Context-Free Grammars and Languages: Context-Free Grammars; Parse Trees; Applications of Context-Free
Grammars; Ambiguity in Grammars and Languages.
Pushdown Automata: Definition and the languages of a PDA; Equivalence of PDA’s and CFG’s; Deterministic
Pushdown Automata.
Properties of Context-Free Languages: Chomsky and Greibach Normal forms for CFG’s; The Pumping Lemma
for CFL’s; Closure and Decision properties of CFL’s.
Introduction to Turing Machines: The Turing Machine, Programming Techniques for Turing Machines,
Extensions to the Basic Turing Machine, Restricted Turing Machines, Turing Machines and Computers.

Books Recommended
1. Hopcropt, J.E. & Ullman , J.D. Introduction to Automata Theory, Languages & Computation
2. Adamek Automata and Algebra

CST 303: Computer Peripherals and Interfacing

Input/Output Devices: Digitizer, Scanners, OCR, bar codes, magnetic card readers, touch screens, Printers,
Monitors etc.
Disks and Drives: Floppy Disk and Drives, Hard Disk and Drives, Compact Disk and Drives etc.
Interface between Computer and the outside world: Sensors, transducers and signal conditioning, Interfacing
Memory and I/O Devices such as monitors, printers, keyboard, disk drives, Data acquisition and some other smart
interface cards; IEEE488 and other buses and interfacing scientific instruments. Study of Microcomputer's chips,
Microprocessors Supporting Chips: Microprocessor Development Chips.
Interfacing real worlds: Display of decimal & alphanumeric character, Measurement of electrical quantities -
frequency, voltage, current etc. Temperature, water level & motor speed measurement. Traffic control.

Books Recommended
1. Rafiquzzaman Microprocessor and Microcomputer based system design
2. Artwick Microcomputer Interfacing
3. Ramesh Goanker Microcomputer Interfacing

CST 304: System Analysis and Design

Introduction: Information systems, General design consideration of information systems.
Overview: System concepts and the information systems environment, information needs, the concept of MIS,
decision support systems, executive information systems, data warehousing, the system development life cycle, the
role of system analyst.
System analysis: System planning and the initial investigation, information gathering, the tools of structured
analysis, feasibility study, cost/benefit analysis.
System design: The process and stages of systems design, input/output and forms design, organization and data
base design.
System implementation: System testing and quality assurance, implementation and software maintenance,
hardware/software selection and the computer contract, project scheduling and software security, disaster recovery
and ethics in system development.
Case studies: Various information systems such as: Library management system, inventory system, voter identity
management system, payroll system etc.

Books recommended
1. E. M. Awad Systems analysis and design
2. P. Edwards System analysis & design
3. G. Scott Principles of Management Information System

CST 305: Digital Signal and Image Processing

Introduction to Signals: Concepts of signals, systems and signal processing; classification of signals; Digital
signals and systems; Classification of discrete time signals; Sampling theorem; Fourier series and Fourier
transform; Autocorrelation.
The Z-Transform: The Z-Transform and its properties; The inverse Z-Transform.
The Discrete Fourier Transform (DFT): The Discrete Fourier Transform (DFT), redundancy in the DFT; The
Fast Fourier Transform (FFT); the FFT decimation in time & decimation in frequency; Interrelationship between the
DFT & Z-transform; Convolution of sequences & sectioning.
Digital Filter: Digital Filter characterization; Digital filter structures; Design of Digital Filters; Recursive Filter
design; Effects of finite word length; Simple models for quantization noise in recursive systems; Non-recursive filter
design via the DFT computational techniques; Other radix formulations; Other radix formulations; Spectral analysis
using the FFT; Speech processing algorithms;
Image processing: Image perception, sampling & quantization, transforms, representation, enhancement, filtering
and restoration, edge detection and histogram, image analysis and computer vision, image reconstruction.

Books Recommended
1. Proakis & Manolakis Digital Signal Processing
2. Oppenheim & Schafer Discrete Time Signal Processing
3. Anil Elements of Image Processing

CST 306: Computer Network And Internetworking

Introduction: Network types, Network architecture protocol hierarchy, Layer interface, Outline of OSI and TCP/IP
reference modes.
LAN and MAN: Topologies, Bus/tree and star using metallic media, ring topologies, Medium access control
protocol MAC performance, LAN/MAN standard. High speed LANs FDDI, fasts Ethernet.
WAN: Public network, Packet switching. Datagram and virtual circuit, routing traffic control and X.25 standard,
Circuit switched data network and X.21 interface.
Frame relay and cell relay: Spectrum of switching techniques, Frame relay service and protocol. ATM overview.
ATM cell header error control, ATM switches.
Internetworking: Network inter connection, bridge and getaway, connection and connectionless and connection
oriented internetworking, routing and fragmentation, Firewalls IP protocol and IP address, Internet control protocol
ICMP, ARP, RARP, multicasting domain name system and name server.
Some distributed application: Simple network management protocol. JAVA locating information on the web,
video on demand. Mbone-Multicast backbone.

Books Recommended
1. Stallings W Data Communications and Computer Networks
2. Tanenbaum Computer Networks
CST 307: Computer Graphics
Introduction to Computer Graphics: Introduction, Presentation graphics, Application Areas, GUI; Graphics
Hardware: Display devices Architecture and Input Devices;
Graphic Primitives: Drawing Points, Lines, Circles, Ellipse, Rectangles, Arcs; Polygons: Inside-outside tests,
polygon fill algorithms, Character generation;
Two-dimensional Viewing and Clipping: Viewing pipeline, Window to view port transformation, Point, Line,
Polygon, Curve and Text clipping;
Transformations of Objects: Basic transformations, Affine Transformations, Translations, Rotations, Scaling,
reflection and Shearing, Composite transformations matrices, Transformation of 3D objects (4´4 matrices).
Curve design: B-spline, Bezier curves and Surfaces, Fractal Geometry
3D Object Representation: 3D Graphics Pipeline, Projection: Different types of Parallel and Perspective Matrices;
B-Rep, Constructive Solid Geometry, Hidden lines and Surface detection: Back face Detection, Painters algorithm,
Z-buffering; light models,
Rendering: Constant, Goraud and Phong shading; Ray-tracing; Different Types of Color Model
Some Topics of Graphics: CAD, Image processing, Virtual reality and Animation.

Books recommended
1. Donald Hearn and Paullin Baker Computer Graphics
2. Vera B Anand Computer Graphics and Geometric Modeling for Engineers
3. Foley, Vandam, Feiner, Hughes Computer Graphics, Principle and Practice
4. Ala Watt Fundamentals of Three Dimensional Computer graphics
5. Steven R T Graphics programming in C.

CST 308: Software Engineering

Concepts of software engineering: Overview, definition, requirement, specification, design, language issues,
programming practice, testing and debugging, documentation, prototyping, life-cycle models, S/W process models.
Large and integrated software, Problem of software modification and maintenance.
Program design tools and techniques: Top-down and bottom-up design, Design representation, structured
programming, data directed design techniques.
Modular design, Object oriented software engineering, Approaches to programming. Implementation language,
Software tools.
Complexity, Storage and processing time analysis: Complexity measures, memory requirements, processing
time.
Program testing: Statistics on testing process, Test philosophy and type, different test methods, Comparing
different test methods, classification of tests.
Software reliability: Reliability theory, Concept of software repair and availability, Software errors and faults,
Estimating number of bugs in a program, reliability models, availability models.
Data collection, storage and retrieval.
Management technique: Requirements, specifications and initial design, performance, reliability and quality
measures, management and communication skills.
Software project Organization, Cost estimation, managing and development process, software maintenance,
Computer Aided Software Engineering (CASE) tools, The design and implementation of large, multi-module
program systems.

Books recommended
1. Pressman Software Engineering: A Practical approach
2. Easteal Software Engineering analysis & Design
3. V. Mukhi Borland C++ 3.0 for windows 3.1
4. S. Ladd C++ components & Algorithms
5. David Parsons Object oriented programming with C++

CST 309: Hardware Lab

This Lab. is based on the course CST 303 and CST 306. Development of circuits for serial and parallel interfacing
and writing routines in assembly code for tone generation, traffic light control, A/D and D/A interfacing and other
interfacing problems.

CST 310: Software Lab

This Lab is based on the course CST 301 and CST 307. The students will design, develop and test programs on
deadlock, disk and CPU scheduling algorithms.
 Fourth Academic Year: 2004-2005

CST 401: Compiler Design

Introduction: Phases of a compiler (lexical analyzer, syntax analyzer, semantic analyzer, intermediate code
generator, code optimizer, code generator, symbol-table manager & error handler).
Lexical analysis: role, finite automata, from regular expression to NFA, from NFA to DFA, design of a lexical
anlyzer generator using LEX.
Syntax analysis: role, CFG, writing a grammar, top-down parsing, bottom-up parsing, operator precedence
parsing, LR parser, using ambiguous grammar, parser generators (YACC).
Symbol table, structure and management.
Intermediate code generation: intermediate languages, declarations, assignment statement, Boolean
expression, case statements, backpatching, procedure calls.
Code generation: issues in the design of a code generator, target machine, runtime storage management, basic
blocks and flow graphs, register allocation and assignment, dag representation of basic blocks, peephole
optimazations, generating code from dags.
Code optimization: principle of source optimization, optimization of basic blocks, loop in flow graphs, global data
flow analysis, iterative solution of data flow equations.

Books recommended
1. Hopcroft and Ullman Introduction to Automata Theory, Languages and Computation
2. Adamek Automata and Algebra
3. Aho and Ullman Principles of Compiler Design
4. Lewis and Stern Compiler Design Theory

CST 402: Artificial Intelligence & Expert Systems

Introduction: Introduction to AI and intelligent agents.
Problem Solving: Solving Problems by Searching, Search Strategies, Heuristic search techniques, Game Playing.
Knowledge and Reasoning: Building a Knowledge Base Agent, Propositional logic, First order logic, Inference in
First order Logic,
Logic Programming: Logic programming using PROLOG, LISP.
Logical Action: Planning, partial order planning, Knowledge Engineering for Planning, Conditional Planning, A
Replanning Agent.
Uncertain Knowledge and Reasoning: Uncertainty, Probabilistic Reasoning Systems, Fuzzy Logic, Making
Simple Decisions
Knowledge Acquisition: Overview of different forms of learning, Learning Decision Trees, Neural Networks,
Genatic Algorithms, Intelligent Editors,
Introduction to Natural Language Processing
Selected topics in AI: Expert consultation, Development of Expert Systems, Pattern recognition, Computer vision,
Robotics.

Books recommended
1. "Artificial Intelligence: A Modern Approach" by Stuart Russell and Peter Norving; Prentice Hall,
2. "Introduction to Artificial Intelligence and Expert Systems", by Patterson, D. W; Prentice Hall,
3. "Artificial Intelligence" by Rich, E. et al, McGraw Hill,

CST 403: Simulation and Modeling

Simulation methods: Model building, random number generator, statistical analysis of results, validation and
verification techniques. Digital simulation of continuous systems. Simulation and analytical methods for analysis of
computer systems and practical problems in business and practice. Introduction to the simulation packages.
Modeling Methods: Introduction to modeling, additive and subtractive modeling; Different methods for Curves and
Surfaces modeling, Solid modeling: Representing Solid, Polyhedral modeling with Euler’s Formula, Non-polyhedral
modeling, Advanced modeling: Procedural models, Factual models, Physically based modeling.

Book Recommended:
1. J. A. Spriet Computer Aided Modeling & Simulation.
2. R. S. Lehman Computer Simulation and Modeling.
3. G. Cordon System Simulation.
4. James D. Foley , Vandam Computer Graphics.
 CST 404: Pattern Recognition and Neural Computing
Introduction to Pattern Recognition: Features, Classification, Learning; Statistical method, structural methods &
hybrid method; Application to Hand written character, Speech Recognition, Remote Sensing & biomedical area;
Learning algorithms; Syntactic approach; Introduction to Pattern Grammar and Languages; Parsing Techniques;
Pattern Recognition in CAD; Recent Trends.

Introduction to Neural Networks: The Basic Neuron, The Multi-layer Perception, Applications of Neural Network,
Kohonen Self-Organizing Networks, Hopfield Networks, Adaptive Resonance Theory, Associative Memory. Pattern
Recognition by Neural Network theory

Books Recommended:
1. Neural Computing: An Introduction Beale R and Jackson
2. An Introduction to Neural Computing Igor Aleksander and Helen Morton

CST 405: Communication Engineering and telecommunication

Introduction: Data and signal, Basic data communication system, Transmission impairments, Data rate,
Bandwidth and channel capacity.
Transmission media: Two-wire cable, coaxial cable, optical fiber. Radio waves, satellite communication.
Data encoding techniques: AM, FM, PM. ASK, FSK, PSK, QPSK. PCM, DM. NRZL, NRZI, Bipolar AMI,
Pseudotemetry, Manchester and differential Manchester encoding.
Data transmission techniques and multiplexing: Asynchronous and synchronous transmission. Simplex,
Duplex, Full duplex transmission. Frequency division and time division multiplexing. Carrier system.
Error detection techniques: Parity check, Longitudinal Redundancy check and CRC. Data link and error
control protocol: Basic characteristics, Flow and error control techniques, Framing. Stop and wait ARQ, HLDL
protocol.
Telecommunication: Introduction, simple telecommunication system. Basic of a switching system.
Telecommunication network: Major telecommunication network, Data transmission and data rates in PSTN.
Switching techniques of PSTN, Public Telecommunication network.
ISDN: Motivation and protocol for ISDN, ISDN standard, Expert system in ISDN. ISDN channel and broadband
ISDN. Transmission channel, Signaling, Numbering and addressing of ISDN.
Cellular telephony: Introduction, Control, Used Spectrum.

Books Recommended:
1. J. Mortein Communication Satellite System
2. 3. S. E. Matter & A. G Chynoweth Optical fibre telecommunication
3. M. S. Roden Analog and Digital communication Systems
4. Defatta, D, J, and Lucas, J. G. Digital signal processing
5. D C Agarwal Computer Communication & ISDN Systems, Khanna Publishers

CST 406: Visual Languages and Multimedia System

Introduction: Purpose of Visual languages; Basic components of a visual language.
Visual Basic: Basic components and their design techniques; Method, Event, and properties of each component;
Interaction with other programs; Graphics and Animation; Windows Registry; Application Programming Interface
(API) techniques; ActiveX control, Database Handling in Visual Basic.
Visual C++: Windows programming technique using C++; Project construction; Use of Microsoft Foundation Class
(MFC).
Hypertext Language: Web design and Implementation techniques; Web activation and addressing.
Multimedia: General concept of Audio, Video, Sound, Text and Graphics, Structure and Organization of
Multimedia, Multimedia Hardware, Digital Audio Technology, Multimedia Graphics and Animation, Digital Imaging
Technology, Multimedia Software, Visual Communication, Multimedia and Internet, Multimedia Project preparing,
costing and distributing.

Books Recommended:
1. John villamil-Casanova, Louis Molina Multimedia Production, Planning and Delivery
2. John villamil-Casanova, Louis Molina Multimedia, An Introduction
3. John villamil-Casanova, Leony Fernandez-Elia Multimedia Graphics
4. Ivor Horton, Wrox Press Ltd. Beginning Visual C++ 6
5. Evangelos Petroutsos Mastering Visual Basic 6
6. John villamil-Casanova, Louis Molina Multimedia on WEB
 CST 407: Internet and Web
Internet: Evolution of Internet, addressing and routing. Internet applications: FTP, Telnet, Email, Chat. World Wide
Web: HTTP protocol. Designing web pages: HTML, forms, CGI scripts and clickable maps. Perl, DHTML, XML. E-
Commerce and security issues including symmetric and asymmetric key, encryption and digital signature,
authentication. Emerging trends, Internet telephony, Intranet and extranet, firewall design issues.

Internet programming using JAVA: Data Types, Variables, and Arrays, Operators, Control Statements, Classes
and Methods, Inheritance, Packages and Interfaces, Exception handling, Multithreaded programming, Input/Output,
Abstract Window Toolkit (AWT) and Swing, Java Applet, Network Programming: Socket overview, Reserved
Socket, Internet Addressing, Java and the Net, InetAddress, TCP/IP Client Sockets, TCP/IP Server Sockets,
Datagrams, Datagram Server and Client.

Books Recommended:
1. Deitel and Deitel JAVA- How to program
2. Herbert Schildt and Patrick Naughton JAVA- The Complete Reference
3. Eliot Rusty Harold JAVA Network Programming

CST 408: Software Lab.

This lab is based on the courses CST-401, CST-402, CST-406 and CST-407. Software development and
programming exercises on Compiler construction and selected topics on AI.

CST 409: Research Lab.

Students shall choose their research topics with the consent of respective supervisors subject to the approval of
the departmental Academic Committee.