Download Document

1995-96.DOC
University of Rajshahi
Faculty of Science
Department of Computer Science
Syllabus for BSc(Honours)
Session 1995-96
Part-1: 1996: [ First Year ]
Examinations: Part-2: 1997: [ Second Year ]
Part-3: 1998: [ Third Year ]
The BSc(Honours) syllabus in Computer Science (CS) shall consist of CS and Related Courses. The
CS Courses will cover 1200 Marks and the Related Courses will cover 400 Marks, aggregating to a total of
1600 Marks. The CS Courses will be taught during the 1st, 2nd and 3rd years and the Related Courses will be
taught during the 1st and 2nd years only.
The Year of Examinations and the Year-wise Distribution of Marks of the CS and Related Courses
Will be as Follows:
Examinations
CS
Related
Total
Part-1:1996
300
200
500
Part-2:1997
300
200
500
Part-3:1998
600
-
600
Grand Total
1600
The CS courses will consist of 15 [ Fifteen ] Theoretical Courses, each of 50 Marks aggregating
to 750 Marks and Practical courses of 6 [ Six ] one-day experiments each of 50 Marks aggregating to
300 marks. The Sessional and Viva-Voce Examinations will carry 150 Marks.
The Examination of each Theoretical Course will be of 3 [ Three ] Hours Duration and the Examination of
each Practical Course Including Computer Lab Practice will be of 6 [ Six ] Hours Duration.
In the First Year, the students have to take CS Courses covering300 Marks and the Related Courses
covering 200 Marks. TheCS Courses will consist of Four Theoretical Courses, each of 50 Marks and 1 [
One ] Laboratory Experiment of 50 Marks and a Sessional and Viva-Voce Examinations of 50 Marks.
In the Second Year, the students have to take CS Courses covering 300 Marks and the Related
Courses covering 200 Marks. The CS Courses will consist of Four Theoretical Courses, each of 50 Marks
and 2[ Two ] Laboratory Experiments, each of 50 Marks. There will be no Sessional and Viva-Voce
Examination at the end of the Second Year.
In the Third Year, the students have to take CS Courses covering 600 Marks. There will be no Related
Courses in the Third Year. The CS Courses will consist of Seven Theoretical Courses, each of 50 Marks,
aggregating to 350 Marks and 3 [ Three ] Laboratory Experiments, each of 50 Marks, aggregating to 150
1
Marks. At the end of Third Year, there will be a Sessional Examination of 50 Marks and a General VivaVoce Examination of 50 Marks, aggregating to 100 Marks.
For the Related Subjects, there will be a total of 7 Theoretical Courses, each of 50 Marks and a Practical
Examination of 50 Marks, aggregating to 400 marks. The Examination of each Theoretical Course will be of
3 hours duration. The duration of the Practical Examination of the Related Courses will be decided by the
respective departments offering the Related Courses.
The Course Titles and the Mark Distributions will be as follows:
Courses:
Marks
First Year:
Departmental Courses:
CS 101
CS 102
CS 103
CS 104
: Computers and Programming
: Discrete Mathematics and Numerical Methods
: Digital Systems
: Circuit Theory and Machines
50
50
50
50
CS 105 : Programming and Circuit Lab
Sessional + Viva-Voce
50
25 + 25
50
: Algebra, Trigonometry, and Vectors
: Integral and Differential Calculus
: Introductory Statistics
: Electricity and Magnetism
50
50
50
50
Related Courses:
Math 112
Math 115
B-Stat 111
PH 112
Sub Total Marks, M1 =
500
Second Year:
Departmental Courses:
CS 201
CS 202
CS 203
CS 204
CS 205
CS 206
: Advanced Programming
: Data Structures and Algorithms
: Computer Architecture & Organization
: Microprocessors and Interfacing
: Programming, Data Structure & Algorithms Lab
: Microprocessor and Interfacing Lab
2
50
50
50
50
50
50
Related Courses:
Math 215
B-Stat 212
PH 214
PH 215
: Matrices and Differential Equations
: Probability Distributions
: Electronics
: Electricity, Magnetism and Electronics Lab
50
50
50
50
Sub Total Marks, M2 =
500
Third Year:
Departmental Courses:
CS 301
CS 302
CS 303
CS 304
CS 305
CS 306
CS 307
: Operating Systems and Systems Programming
: Automata Theory and Compiler Design
: Data Communication and Computer Networks
: Database Management System
: Information Systems and System Analysis
: Software Engineering
: Artificial Intelligence
50
50
50
50
50
50
50
CS 308 : Systems Programming Lab
CS 309 : Software Development & DBMS Lab
CS 310 : Data Communication Lab & Information Systems Lab
50
50
50
Sessional Examination
50
General Viva-Voce
50
Sub Total Marks, M3 =
600
Grand Total Marks, M = M1 + M2 + M3 = 1600 Marks
3
Course Details
CS 101: Computers and Programming
[ BSc Hons Part-I Examination, 1996:60 Lectures ]
[ Full Marks-50: Duration of Examination-3 Hours ]
History and generation of computers, Introduction to different parts of a computer, Input and output devices,
Graphics, Memory and processor, Floppy Disk and Hard Disk, Disk Drives, Files and operating systems.
Disk Operating System (DOS). An overview of DOS commands. Brief ideas about hardware, software and
firmware. Learning useful editors and tools for maintenance of Microcomputers. Practicing Software
Packages on DBMS, Spread Sheet, Word-Processing and Graphics.
Overview of high-level languages: Pascal and Fortran. Problem solving, programming languages,
syntax/semantics, and design methodology. Definition of data, data types, constants, variables, expressions,
arithmetic statements, input and output statements. Selection and looping control structures.
Subprograms/Procedures, parameters and their passing mechanism into subprograms/procedures, functions
and additional control structures. Enumerated data types and data structures. Typical problems using arrays,
multi-dimensional arrays. Records and file handling mechanism. Pointers and linked lists. A brief discussion
about stacks, queues and binary
trees.
Books Recommended:
1. Dutta, B
2. Lutfar Rahman and Alamgir Hossain
3. Rajaraman, V
Sahaj Computer
Adhunik Computer Bigyan
Fundamentals of Computers
ForTran:
5. Nyhoff and Leestma
6. Alam, S S and Sen, S K
7. Ramkumar
Fortran 77 for Engineers and Scientists
Computer and Computing with Fortran 77
Programming with Fortran 77
Pascal:
8. Dale and Orshallic
9. Gottfried
10. Feibel, W
Pascal
Programming with Pascal
Turbo Pascal 6 Disk Tutor
CS 102: Discrete Mathematics and Numerical Methods
[ BSc Hons, Part-I Examination,1996: 60 Lectures ]
[Full Marks 50: Duration of Examination 3 Hours]
Discrete Mathematics:
Set theory, Elementary Number Theory, Graph Theory, Paths and Trees; Generating Functions. Algebraic
structures, Semi-graphs, permutations group, symmetry groups. Binary relations, functions, Morphism of
algebraic structures. Mathematical reasoning and proof techniques. Theories with inductions. Propositional
calculus and predicate calculus.
4
Numerical Methods:
Solutions of Polynomials and Transcendental Equations; Interpolation and Polynomial Approximation;
Numerical Differentiation and Integration; Numerical Solutions of Ordinary Differential Equations.
Books Recommended:
1. Rosen, K H
2. Nicodemi, O
3. Kuo, S S
4. Sastry, S S
Discrete Mathematics and Its Applications
Discrete Mathematics
Computer Application of Numerical Methods
Methods of Numerical Analysis
CS103: Digital Systems
[ BSc Hons, Part-I Examination, 1996: 60 Lectures ]
[ Full Marks-50: Duration of Examination- 3 Hours ]
Number system and codes, Digital logic, Boolean Algebra, De-Morgan's law, Logic Gates and their Truth
Tables, Canonical forms, Combinational logic circuits, Minimization technique, Arithmetic and data handling
logic circuits. Decoders, Encoders, Multiplexers, Demultiplexers. Combinational circuit design, Flip Flops,
Half-Adder, Full-Adder, Race around problems, Counters, Asynchronous Counters, Synchronous counters
and their applications, Odd Sequence Counter Design, Register of different types and their applications;
Minimization of sequential circuits, and Memory units.
Books Recommended:
1. Tocci
Digital Systems
CS104: Circuit Theory and Machines
[ BSc Hons, Part-I Examination, 1996: 60 Lectures ]
[ Full Marks-50: Duration of Examination- 3 Hours ]
Network Analysis Technique: Review of network theorems. Transient and Time Domain Analysis:
Properties of step function. Response of ideal circuit elements to a step function stimulus. Response of
simple RL and RC circuits to a step function. AC theory and Frequency Domain Analysis: Properties of
sinusoidal and Square waveforms. Phasor and phasor diagram to simple circuits. The 'j' operator and its
application to circuit analysis. Total, active and reactive power. Phase Vs. Frequency plots. Introduction to
Decibel notations. Resonance phenomena: Series and parallel resonance. Q and 3dB bandwidth. Use of
resonant circuits as filters. Fourier methods of Waveform analysis.
DC Machines: General arrangement of DC machine; Ring wound armature; Windings; EMF calculation in
armature winding; Armature reaction; Compensating winding commutator.
DC Generators: Armature and field connection; Separately excited generator; Shunt wound generator; Series
wound generator; Compound wound generator.
DC Motors: DC machine as motor; Speed of a motor; Torque; Torque of a electric motor; Starting resistor;
Speed and torque characteristics of electric motor; Speed control of a DC motor.
5
AC Machines: Alternator; Single and polyphase induction motors; Synchronous motors.
Books Recommended:
1. Theraza, B L
2. Corcoran
Electrical Technology
Alternating Current Circuits
Math112: Algebra, Trigonometry and Vector
[ BSc Hons, Part-I Examination, 1996: 60 Lectures ]
[ Full Marks-50: Duration of Examination-3 Hours ]
1. a) Algebra of sets, De Morgan's rule, Relation and Function.
b) Determinants : Properties and Crammer's rule.
2. Theory of Equations:
a) Theorems, Relation between roots and coefficients.
b) Solution of cubic Equations.
3. a) De Moiver's Theorem.
b) Deduction from De Moiver's Theorem.
4. a) Functions of Complex Arguments.
b) Gregory's Series.
5. a) Summation of Series.
b) Hyperbolic Functions.
6. Vector Addition, Multiplication and Differentiation.
7. Vector Differential Operator - Grad., Div. and Curl.
Books Recommended
1. Barnside and Panton
2. Bernard and Child
3. Hall and Knight
4. Das and Mukherjee
Theory of Equations
Higher Algebra
Higher Algebra
Higher Trigonometry
Math115: Differential and Integral Calculus
[ BSc Hons Part-I Related Examination, 1996: 60 Lectures ]
[ Full Marks-50: Duration of Examination-3 Hours ]
1. Functions: Domain, Range, Inverse Function and Graphs of
Function; Limits, Continuity and Indeterminate Form.
2. Ordinary Differentiation: Differentiability, Differentiation and Leibnitz Theorem.
3. a) Expansions of Functions: Rolle's Theorem, Mean Value Theorem, Taylor's and
6
Maclaurin's Formulae.
b) Maxima and Minima of Functions of one variable.
4. a) Partial Differentiation: Euler's Theorem, Tangents and Normals.
b) Asymptotes.
5. Indefinite Integral: Methods of Substitutions, Integration by Parts, Special
Trigonometric Functions and Rational Fractions.
6. Definite Integral: Fundamental Theorem, General Properties, Evaluation of Definite
Integral and Reduction Formulas.
7. Multiple Integral: Determination of Length, Areas, and Volumes.
Books Recommended:
1. Ayres, F
2. Das and Mukherjee
3. Das and Mukherjee
4. Edwards
Calculus
Differential Calculus
Integral Calculus
Differential Calculus
B-Stat-111: Introductory Statistics
[ BSC Hons Part-I Related Examination, 1996: 60 Lectures ]
[ Full Marks-50: Duration of Examination-3 Hours ]
Statistics : Meaning and Scope, Variables and Attributes, Collection and presentation of statistical data,
Frequency distribution and Graphical Representation.
Elements of Probability: Sample space, Events, Union and Intersection of Events.Probability of Events,
Frequency Limit and probabilities. Addition law of probability, Application of occupancy problem.
Conditional probability, Multiplicative law of probability.
Association of Attributes: Basic Ideas, Independence of association and disassociation, Measures of
Association, Partial Association.
Linear Regression:Linear Regression involving Nonrandom variables, Principles of Least squares, Lines of
Best fit, Residual Analysis.
Large Sample Test of Significance: Basic ideas of sampling, Distribution, Population and Sample,
Tendency of Normality of Statistics. Standard errors of Mean, Variance & Population, Test of Significance in
large sample, Comparison of means, proportion and variances, correlation and regression coefficients.
Books Recommended:
1. Cramer, H
2. Hoel, P G
3. Anderson, A J B
The Elements of probability
Introductory Statistics
Interpreting Data
7
Phys112: Electricity and Magnetism
[ BSc Hons Part-I Related Examination, 1996: 60 Lectures ]
[ Full Marks-50: Duration of Examination-3 Hours ]
1. Electrostatics:
Electric Dipole; Electric field due a dipole; Dipole in an external electric field; Gauss's Law and its
applications.
2. Capacitors:
Parallel plate capacitors with dielectrics; Dielectrics and Gauss's law; Susceptibility; Permittivity; Dielectric
co-state energy in an electric field.
3. Electric Current:
Electronic theory of conductivity; conductors, semi-conductors, insulators and superconductors; Current and
current density; Kirchhoff's law and its applications.
4. Magnetism:
Magnetic Dipole; Field due to a dipole; Mutual potential energy of two small magnets; Magnetic shell;
Energy in a magnetic field; Magnetometers.
5. Electromagnetic Induction:
Faraday's law of electromagnetic induction; Faraday's laws; Ampere's law; Motional EMF; Self and mutual
inductances; Galvanometers: Moving coil, Ballistic and Dead beat types.
6. Thermoelectricity:
Thermal EMF; Seebeck, Peltier and Thompson effects; Laws of addition of thermal EMFs; Thermoelectric
power.
7. DC and AC Circuits
Books Recommended:
1. Haque, Roy and Rafiqullah
2. Kipp, A
3. Halliday and Resnic
Concepts of Electricity and Magnetism
Electricity and Magnetism
Physics Part-II
CS201: Advanced Programming
[ BSc Hons Part-II Examination, 1997: 60 Lectures ]
[ Full Marks-50: Duration of Examination-3 Hours ]
Background of C, Identifiers, Variables, Constants, Operators and Expressions; Program Control Statements;
Functions; Arrays; Pointers; Structures, Unions and user defined Variables; Input Output and Disk Files; The
Turbo C Preprocessor; Turbo C's Memory Models; Turbo C's Screen and Graphics Functions; The Turbo C
8
Environment; The Turbo C Integrated Programming Environment; The Turbo C Text Editor; Compiler and
Linker Options; The Turbo C Library; Linking Libraries and Header Files; I/O Functions; String, Memory
and Character Functions; Mathematical Functions; Time-, Date-, and System-Related Functions; Dynamic
Allocation; Directory Functions; Process Control Functions; Text Screen and Graphics Functions.
An Overview of C++ ; A Closer Look at Classes and Objects; Function and Operator Overloading;
Inheritance, Virtual Functions and Polymorphism; Using C++'s I/O Class Library; The C++ Environment;
The C++ Integrated Development Environment; Using the C++ editor; Debugger and Profiler; Power
Programming : Tapping important C and C++ libraries; Power programming : Macros and Procedures; Using
the Command-Line Compiler, VROOMM, and Multiple File Projects; ;Low Level Interface.
Books Recommended :
1. Ritchie and Kernighan
2. Balaguruswamy, E
3. Stan Kelly-Bootle
4. Kochan, S G
The C Programming Language
Programming in ANSI C
Mastering Turbo C
Programming in C
CS202: Data Structures and Algorithms
[ BSc Hons Part-II Examination, 1997: 60 Lectures ]
[ Full Marks-50: Duration of Examination-3 Hours ]
Introduction to Programming Methodologies and Design of Algorithms, Survey of Basic Data Structures
like Arrays, Stacks, and Queues, Linked List Structures, Garbage, Collection and Compaction, Graphs and
Trees, Tree Traversals, Internal and External Sorting Techniques, R-Trees, Symbol Table Structures,
Fundamental Types, Sets and Sequences, Recursive Sets, Hash Techniques. Advanced Data Structure:
Heaps, Binary Search Trees etc.
Books Recommended:
1. Reingold and Hansen
2. Horowitz and Shahny
3. Taunenbaum, Langsam
Data Structure
Analysis of Algorithms
Data Structure Using C and Augestein
CS203: Computer Architecture and Organization
[ BSc Hons Part-II Examination,1997: 60 Lectures ]
[ Full Marks-50: Duration of Examination-3 Hours ]
Review of conventional computer architecture, description methods and performance evaluation. Alternate
approach to CPU, Memory, Communication buses and I/O organization. Arithmetic, Logic and I/O units of
computer; Instruction and their formats; Number and data Representation; Working principle of a small
computer; Examples of mainframe, mini and microsystems. Implementation of digital system and Processor
components.
Microprogramming : I/O structures, Interrupt Processing, Memory Organization. Influences on computer
architecture, including technological innovation, new application areas. Case study of specialized machines
including Array Associative, Functional processor and General-Purpose machines that aim at high
performance.
9
CS204: Microprocessors and Interfacing
[ BSc Hons Part-II Examination, 1997: 60 Lectures ]
[ Full Marks-50: Duration of Examination-3 Hours ]
An Overview of VLSI technology. General Architecture of Microprocessors. Detailed study of a Standard
Microprocessor System, its Instruction Sets, Programming, Memory Sub-Systems, Bus Timing and
Standards, Input/Output Interfacing: Polling and Interrupts, Microprocessor Organization, Bus Structure,
Architecture Options for Microprocessor. Detailed study of 8-bit, 16- bit and 32-bit Processors. Use of MDS
for Microprocessor Based System Design, Linear Signal Processing Chips. Study of Associated (supporting)
Chips of a Microprocessor System. Comparative study of a few popular Microprocessors.
Machine and Assembly Instruction Types and their Formats, Instruction Sets and Applications, Addressing
Modes Address Modifications, Macros and Subroutines; Assembler, Cross-Assemblers, Interrupt Processing.
Books recommended :
1. Raffiquzzaman, M
2. Malvino, A P
3. Padmanabhan, T R
4. Liu and Gibson
Microprocessors and Microcomputer based System Design
Digital Computer Electronics
Digital Systems and Microprocessors
Microprocessor Systems: The 8086/8088 Family
Math215: Matrices and Differential Equations
[ BSc Part-II Related Examination, 1997: 60 Lectures ]
[ Full Marks-50: Duration of Examination-3 Hours ]
Algebra of matrices, Adjoint, Inverse and Rank of a matrix-defination, properties and evaluation.
Elementary transformation-echelon, canonical and normal forms. Solution of systems of linear equationsconsistency and solution of homogeneous system by matrix method, and reduction to equivalent system.
Characteristics equation, eigenvalues, eigenvectors and Caley-Hamilton theorem. Similar matrices and
diagonalization.
Solution of first order and first degree, and first order and higher degree equations.
Solution of higher-order linear differential equations.
Series solutions of linear differential equations.
Books Recommended;
1. F Ayres
2. McDuffe
3. Khanna, M L
4. Ross, S L
5. Ayres, F
6. Sharma, B D
Theory and problems of Matrices
Theory of Matrices
Matrices
Introduction to Ordinary Diff. Equations
Differential Equations
Differential Equations
10
B-Stat-212: Probability Distribution
[ BSc Hons Part-II Related Examination, 1997: 60 Lectures]
[ Full Marks-50: Duration of Examination-3 Hours ]
Probability : sample Space. Events. Union and Intersection of Events. Probability of Events. Frequency Limit
and Probability. Addition law of probability. Realization of M and N Events.
Guessing and Classical Occupancy Problems. Conditional Probability. Multiplication Law of Probability.
Bayes' Theorem. Statistical Independence. Repeated trials. Dependent and Independent Trials. Random
Variables and their expectation & variances. Probability Generating Function. Chebysev's Inequality.
Conditional Expectation and Conditional Variance.
Study of Probability Distribution : Study of Binomial, Poisson and Normal Distribution. Negative Binomial,
Hypergeometric, Logarithmic, and Weibull distributions. Bivariate Normal distribution.
Books Recommended:
1. Cramer, H
2. Grimmett and Stirzaker
3. Linday, D V
4. Lipschutz, S
The Elements of Probability Theory
Probability and Random Process
Introduction to Probability and Statistics
Probability
PHYS-214: Electronics
[ BSc Hons Part-II Related Examination, 1997: 60 Lectures ]
[ Full Marks-50: Duration of Examination-3 Hours ]
1. Circuit Analysis:
Concepts of Electrical Networks; Thevenin's and Norton's Theorems; Superposition Theorem; Maximum
Power Transfer Theorem; Equivalence of Pi, T, Star and Delta Conversions; Lattice Networks; Constant KType Low-Pass, High Pass, Band-Pass and Band-Elimination Filters;
2. Semiconductor Diode and Rectifiers:
N- and P-Type Semiconductors; 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.
3. Transistor:
PNP and NPN Junction Transistors; Vc - Ic Characteristics; CB, CE and CC Configurations; Transistor
Action; Bias Stabilization; Different Types and Biasing; Operating Point; DC and AC Load Lines; Dynamic
Transfer Curve; Current, Voltage and Power Gains. Transistor as a Circuit Element; Transistor Hybrid
Parameters.
4. Amplifiers:
Transistor DC Amplifiers; CE, CB and CC Amplifiers and their Equivalent Circuits and Computation of
Current, Voltage and Power Gains; Class A, Class B and Class C Amplifiers; Operational Amplifiers.
5. Feedback Amplifiers and Oscillators:
11
Feedback Principles and Characteristics; Current and Voltage Feedback Amplifiers; Positive Feedback;
Oscillators and Conditions for Sustained Oscillations; RC Phase Shift, Harteley and Collpit and Crystal
Oscillators.
Books Recommended:
1. Mortershead, A
2. Millman and Helkias
3. Theraja, B L
Electronic Devices and Circuits
Integrated Electronics
Basic Electronics
CS301: Operating Systems and Systems Programming
[BSc Hons Part-III Examination, 1998: 60 Lectures ]
[ Full Marks-50: Duration of Examination-3 Hours ]
The functions of an operating system. Basic concept: Batch processing, Multiprogramming, Time Sharing:
Memory, I/O, Processor and Data management: Concurrent Processes, Synchronization and Protection
Issues, File Systems. Examples of simple Operating Systems and Job Control Languages. System Calls and
User commands. Virtual Machines, Efficient Technique and Methods of Process managements, Memory
Managements, I/O deadlocks, Deadlock avoidance, critical section- problems, Scheduling process,
Interprocess communication.
Assembly Language Programming: Design of Assemblers and Macroprocessors: Design of Linkage Editors
and Loaders.
Input-output programming.
Books Recommended:
1. Operating Systems: Design and Tanenbaum
2. Operating System Concepts
3. Introduction to Operating System
A S Implementation
Shilverscartz and Patterson
Haberman, A N
CS302: Automata Theory and Compiler Design
[ BSc Hons Part-III Examination, 1998: 60 Lectures ]
[ Full Marks-50: Duration of Examination-3 Hours ]
Formal models of automata, language, and compatibility and their relationship. Finite automata and regular
expressions. Properties of regular sets. Contexts-free grammars. Push-down automata. Properties of Contextfree Languages. Turing machines. Halting problem. Undecidability and computability. Recursive function
theory. Chomsky Hierarchy. Deterministic Context-free languages. Closure properties of families of
languages. Computational complexity theory. Intractable problems. Application in parsing, pattern matching
and the design of efficient algorithms.
The Structure of Compilers and translators: Lexical and Syntax analysis, Topdown and Bottom-up Parsing.
Internal form of source program; Semantic analysis, symbol table, Error Detection and recovery; Code
Generation & Optimization; Grammars & Languages, Interpreter. Runtime Implementation of various
programming constructs; Writing various parts of a Compiler.
12
Books recommended:
1. Aho and Ullman
2. Lewis and Stern
3. Hopcroft and Ullman
4. Adamek
Principles of Compiler Design
Compiler Design Theory
Introduction to Automata Theory, Languages and Computation
Automata and Algebras
CS303: Data Communication and Computer Networks
[ BSc Hons Part-III Examination, 1998: 60 Lectures ]
[ Full Marks-50: Duration of Examination-3 Hours ]
Principles of Data Transmission, Modern Role of computers in data communication; Computer Networking
and their structures; Packet and message switching, Components of computer networks: Host, IMP, terminal,
concentrators etc. Broadcast channel,interface message processor hardware; network software design,
protocol hierarchy; ISO reference model; physical, datalink, network, transport and other layers; satellite link,
local area network (LAN); IMP Software for network control, queue management, editing, message
formatting, routing and flow control.
Book Recommended:
1. W Stallings
2. A S Tanenbaum
3. L Reiss
4. J Ronaync
Data and Computer Communications, MacMillan, 1986.
Computer Network, Prentice-Hall, 1988.
Introduction to Local area Networks with Microcomputer
Experiments, Prentice-Hall, 1990.
The Integrated Services digital Network, Pitman 1987.
CS304: Database Management System
[ BSc Hons Part-III Examination, 1998: 60 Lectures ]
[ Full Marks-50: Duration of Examination-3 Hours ]
Introduction to Database concepts: Difference between a file system and a Database system; goals of DBMS
including data independence, consistency, Data Security and Integrity, DBMS models: Hierarchical, Network
& Relational models; Data description & Query language; Physical Database Design; Case studies;
Introduction to distributed database, Crash recovery, concurrency control.
Books Recommended:
1. John Grant
2. Martin
3. J Dates
4. Ulllman
Logical Introduction to Database, HBJ Publishers, 1987.
Database Management System,
An Introduction to Database Systems, Addison Wesley, 1983.
Database Management Systems.
CS305: Information Systems and System Analysis
[ BSc Hons Part-III Examination, 1998: 60 Lectures ]
[ Full Marks-50: Duration of Examination-3 Hours ]
Information and general concepts of formal information systems, Analysis of information requirements for
modern organization. Modern data processing technology and its application, information systems structures,
13
designing information outputs, classifying and coding data, physical storage media considerations, logical
data organization.
System analysis, general system design, detail system design. Project management and documentation.
Includes all phases of software life cycle from requirement analysis to the completion of a fully
implementation system.
Books Recommended:
1. E M Awad
System Analysis and Design, Galgotia Publication Ltd, 1994.
2. P Edwards
System Analysis & Design, McGrow-Hill, 1993.
3. J G Burch Jr., F R Strater and G Grundnitski
Information Systems: Theory and Practice, 5th Ed., John Wiley &
Sons.
4. G Scott
Pricipals of Management Information Systems, McGraw-Hill,1986.
5. A Daniels and D Yeates
Basic system analysis, Galgottia, 1990.
CS306: Software Engineering
[ BSc Hons Part-III Examination, 1998: 60 Lectures ]
[ Full Marks-50: Duration of Examination-3 Hours ]
Overview, requirement, definition, specification and design of Software engineering; language issues;
programming practice, testing and debugging, documentation; maintenance and evolution; prototyping,lifecycle models, S/W process models, project management, modularity, structured design, data specification,
functional specification, documentation and verification.
Books Recommended:
1. Hans van Vliet
2. S I Wattam
3. Martyn Ould
4. R S Pressman
5. M L Shooman
6. D V Steward
7. T Palmer
8. G J Meyers
Software Engineering Principles & Practice, Wiley, 1993
Software Engineering, Galgotia
Strategies for Software Engineering, Wiley 1990.
Software Engineering, McGraw Hill, 1987.
Software Engineering, McGraw Hill, 1983.
Software Engineering with System Analysis and Design, Brooks/Cole,
1987.
Software Design and User Interface, Systems International, 1987.
The Art of Software Testing, Wiley, 1987.
CS307: Artificial Intelligence
[ BSc Hons Part-III Examination, 1998: 60 Lectures ]
[ Full Marks-50: Duration of Examination-3 Hours ]
Principle of knowledge representation, user interface, and inference engine of artificial intelligence. Use of AI
languages like Prolog, LISP etc to develop expert systems. An overview on LISP machines.
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.
14
Books Recommended
1. D W Patterson
2. E Rich & K Knight
3. H Schild
4. C F Chabris
5. R Beale and T Jackson
Introduction to Artificial Intelligence and Expert Systems,
Prentice Hall of India Pvt Ltd,1992.
Artificial Intelligence, Tata-McGraw-Hill Publication
Company Limited, 1992.
Artifical Intelligence Using C, Osborne-McGraw Hill, 1987.
Artificial Intelligence and Turbo Pascal, Galgotia Pub, Pvt. Ltd, 1990
An Introduction to Neural Computing, Adam Hilger Pub, 1990.
15