ANNA UNIVERSITY OF TECHNOLOGY, COIMBATORE

[Regulation 2008]

B E – COMPUTER SCIENCE AND ENGINEERING

Semester – V

Code. No Course Title L T P C

Theory
080230017 Discrete Mathematics 3 1 0 4

080230018 PC Hardware and Trouble Shooting 3 0 0 3

080230019 Software Engineering 3 0 0 3

080230020 Formal Languages and Automata Theory 3 1 0 4

080230021 Java Programming 3 0 0 3

080230022 Computer Networks 3 0 0 3

Practical
080230023 Software Engineering Lab 0 0 3 2

080230024 Java Programming Lab 0 0 3 2

080230025 Computer Networks Lab 0 0 3 2

080230017 DISCRETE MATHEMATICS L T P M C
3 1 0 100 4

UNIT I PROPOSITIONAL CALCULUS 10 + 3

Propositions – Logical connectives – Compound propositions – Conditional and biconditional

propositions – Truth tables – Tautologies and contradictions – Contrapositive – Logical
equivalences and implications – DeMorgan’s Laws – Normal forms – Principal conjunctive and
disjunctive normal forms – Rules of inference – Arguments - Validity of arguments.

UNIT II PREDICATE CALCULUS 9+3

Predicates – Statement function – Variables – Free and bound variables – Quantifiers –

Universe of discourse – Logical equivalences and implications for quantified statements
– Theory of inference – The rules of universal specification and generalization – Validity of
arguments.

UNIT III SET THEORY 10 + 3

Basic concepts – Notations – Subset – Algebra of sets – The power set – Ordered pairs and
Cartesian product – Relations on sets –Types of relations and their properties – Relational
matrix and the graph of relation – Partitions – Equivalence relations – Partial ordering – Poset –
Hasse diagram – Lattices and their properties – Sublattices – Boolean algebra –
Homomorphism.

UNIT IV FUNCTIONS 7+3

Definitions of functions – Classification of functions –Type of functions - Examples –

Composition of functions – Inverse functions – Binary and n-ary operations – Characteristic
function of a set – Hashing functions – Recursive functions – Permutation functions.

UNIT V GROUPS 9+3

Algebraic systems – Definitions – Examples – Properties – Semigroups – Monoids –

Homomorphism – Sub semigroups and Submonoids - Cosets and Lagrange’s theorem –
Normal subgroups – Normal algebraic system with two binary operations - Codes and group
codes – Basic notions of error correction - Error recovery in group codes.
TUTORIAL 15
TOTAL : 60
Text Book:
1. Trembly J.P and Manohar R, “Discrete Mathematical Structures with Applications to
Computer Science”, Tata McGraw–Hill Pub. Co. Ltd, New Delhi, 2003.
2. Ralph. P. Grimaldi, “Discrete and Combinatorial Mathematics: An Applied Introduction”,
Fourth Edition, Pearson Education Asia, Delhi, 2002.

References:

1. Bernard Kolman, Robert C. Busby, Sharan Cutler Ross, “Discrete Mathematical

Structures”, Fourth Indian reprint, Pearson Education Pvt Ltd., New Delhi, 2003.
2. Kenneth H.Rosen, “Discrete Mathematics and its Applications”, Sixth Edition, Tata
McGraw – Hill Pub. Co. Ltd., New Delhi, 2006
080230018 PC HARDWARE AND TROUBLE SHOOTING
L T P M C
3 0 0 100 3
Unit – I Introduction 9

Introduction - Computer Organization – Number Systems and Codes – Memory – ALU – CU –

Instruction prefetch – Interrupts – I/O Techniques – Device Controllers - Error Detection
Techniques – Microprocessor – Personal Computer Concepts – Advanced System Concepts –
Microcomputer Concepts – OS – Multitasking and Multiprogramming – Virtual Memory – Cache
Memory – Modern PC and User.

Unit – II Peripheral Devices 9

Introduction – Keyboard – CRT Display Monitor – Printer – Magnetic Storage Devices – FDD –
HDD – Special Types of Disk Drives – Mouse and Trackball – Modem – Fax Modem – CD ROM
Drive – Scanner – Digital Camera – DVD – Special Peripherals.

Unit – III PC Hardware Overview 9

Introduction – Hardware BIOS DOS Interaction – The PC family – PC hardware – Inside the
System Box – Motherboard Logic – Memory Space – Peripheral Interfaces and Controllers –
Keyboard Interface – CRT Display interface – FDC – HDC.

Unit – IV Installation and Preventive Maintenance 9

Introduction – system configuration – pre installation planning – Installation practice – routine

checks – PC Assembling and integration – BIOS setup – Engineering versions and compatibility
– preventive maintenance – DOS – Virus – Data Recovery.

Unit – V Troubleshooting 9

Introduction – computer faults – Nature of faults – Types of faults – Diagnostic programs and
tools – Microprocessor and Firmware – Programmable LSI’s – Bus Faults – Faults Elimination
process – Systematic Troubleshooting – Symptoms observation and analysis – fault diagnosis –
fault rectification – Troubleshooting levels – FDD, HDD, CD ROM Problems.
Total : 45
Text Book:

1. B. Govindarajalu, “IBM PC Clones Hardware, Troubleshooting and Maintenance”, 2/E,

TMH, 2002. [

References:

1. Peter Abel, Niyaz Nizamuddin, “IMB PC Assembly Language and Programming”,

Pearson Education, 2007
2. Scott Mueller, “Repairing PC's”, PHI,1992
080230019 SOFTWARE ENGINEERING
L T P M C
3 0 0 100 3
UNIT I Introduction to Software Engineering 9

Introduction to Software Engineering - A systems Approach- An Engineering Approach-

Members of the Development Team- How Has Software Engineering changed?- Information
Systems Example- Real- Time Example

Modeling the process and Life cycle

The meaning of process –Software process Models- Tools and Techniques for Process
Modeling- Practical process modeling- Information system Example- Real- Time Example

Unit II 9
Planning and Managing the project
Tracking progress-project personnel-Effort Estimation-Risk Management-The project Plan-
Process Models and Project Management-Information System Example- Real Time Example

Capturing the Requirements

The Requirements Process- Requirements Elicitation-Types of Requirements-Characteristic of
Requirements- Modeling Notations- Requirements and Specification Languages-Prototyping
Requirements-requirements Documentation-Validation and Verification- Measuring
Requirements –choosing a specification Technique.

Unit III 9
Designing the System
Introduction to Design- decomposition and Modularity-Architectural styles and Strategies-
Issues in Design Creation-Characteristics of Good Design-Techniques of Improving Design-
Design Evaluation and Validation-Documenting the Design-Information system Example-Real-
Time Example

Considering objects
What is OO-the OO Development process –use cases- Representing OO:An Example using
UML-OO System Desing-OO Program Desingn-OO Measurement-Information systems
Example-Real-Time Example

Unit IV 9

Writing the programs

Programming standards and procedures-Programming Guidelines-Documentation-The
Programming process-Information systems Example-Real-Time Example

Testing the programs

Software faults and failures-Testing Issues-unit Testing Integration Testing-Testing Object-
Oriented Systems-Test Planning-Automated Testing Tools-When to stop Testing-Information’s
Systems Example-Real-Time Example
Unit V 9

Testing the Systems

Principles of system testing -function testing-performance Testing-Reliability, Availability and
Maintainability-Acceptance Testing-Installation Testing-Automated system Testing-Test
Documentation-Testing safety-Critical systems-Information systems Example.

Maintaining the system

The changing system-The nature of maintenance-Maintenance Problems-Measuring
Maintenance characteristics-Maintenance Techniques and Tools-Software Rejuvention-
Information Systems Example-Real-Time Example.
Total : 45

Text Book:
1. Software Engineering Theory and Practice, Shari Lwarence Pfleeger, Joanne
M.Atlee, Third Edition, Pearson Education, 2006
2. Object-Oriented Software Engineering Using UML, Patterns, and Java,Bernd
Bruegge,Allen H.Dutoit, Second Editon, Pearson Edition, 2006
3. Roger S. Pressman, Software Engineering- A Practitioners Approach, McGraw-Hill
International Edition, Seventh Edition, 2009
080230020 FORMAL LANGUAGES AND AUTOMATA THEORY
L T P M C
3 1 0 100 4
UNIT I 9

Mathematical preliminaries and notations – Central concepts of automata theory – Finite

automata - Deterministic Finite Automata - Nondeterministic Finite Automata – Equivalence of
DFA and NFA – Finite Automata with Epsilon transitions - Application of FA.

UNIT II 9

Regular languages: Regular Expressions – Finite Automata and Regular Expressions –

Applications of Regular Expressions - Regular Grammars.

UNIT III 9

Properties of regular languages: Pumping lemma for regular languages – Closure properties of
regular languages – Decision properties of Regular languages - Equivalence and Minimization
of Finite Automata.

UNIT IV 9

Context Free languages: Context Free Grammars – Parse Trees - Ambiguity in Grammars and
languages – Applications of Context Free Grammars - Pushdown automata (PDA) – Languages
of a PDA - Equivalence of PDA’s and CFG’s

UNIT V 9

Properties of Context Free Languages: Normal Forms(CNF,GNF) for Context Free Grammars -
Pumping lemma for CFL’s - Closure properties of CFL – Decision properties of CFL’s.
Total : 45

Text Book:

1. John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, “Introduction to Automata Theory,

Languages and Computation”, 3/E, Pearson Education, 2009.
2. Peter Linz, “An Introduction to formal Languages and Automata”, 4/ E, Jones &
Bartlett Pub, 2006.
References:
1. Kamala Krithivasan, Rama R, “Introduction to Formal Languages, Automata
Theory and Computation”, Pearson, 2009
2. Dr. B. N. Srinivasa Murthy, “Formal Languages and Automata Theory”, Sanguine
Publishers, 2006.
080230021 JAVA PROGRAMMING
L T P M C
3 0 0 100 3
UNIT I 8

A look at procedure oriented programming – Object oriented programming paradigm – Basic

concepts of object oriented programming – Benefits of OOP –What is java? - Simple java
program- Java vs. C++-Tokens – Keywords – Identifiers and constants –Data types – Type
Conversions and Casting - Arrays-Operators - Control statements in java. Class fundamentals –
Declaring Objects- Assigning Object Reference Variables – introducing methods- constructors –
this keyword- garbage Collection – finalize () method – overloading methods- objects as
parameters- returning objects- access control – static- final keyword- Nested classes – Inner
classes- classes with command line arguments

UNIT II 8

Basics- Super keyword- Multilevel Hierarchy- Invoking Constructors- Method overriding Abstract
Classes – Using Final with Inheritance- Packages- Access Protection – Importing a Packages-
Interfaces-Special String Operations – Character Extraction – String Comparison – Modifying a
String –String Buffer.

UNIT III 9
Exception Types – Uncaught Exceptions – Using Try Catch – Multiple Catch – Nested Try –
throw- throws- finally – Built in Exceptions- Using Exceptions- Thread Model – Character
Streams- Stream I/O- Serialization- Files

UNIT IV 10

Applet Architecture – Skeleton- Simple Applet Display Methods- HTML APPLET tag – Passing
Parameters to the Applet- AudioClip and AppletStub Interface - Delegation Event Model – Event
Classes. Collection Interfaces – Collection Classes – Using Iterator – Maps- Comparators-
Legacy Classes and Interfaces

UNIT V 10

String Tokenizer – BitSet – Calendar – Gregorian – TimeZone – Locale – Random- Currency-

Case studies – Real time application development- Debugging the application – Testing the
application.
TOTAL = 45
Text Book:

1. D.Norton and H. Schildt, “Java 2 the complete Reference Fifth edition”, TMH, 2002 (Re
print 2009)
References:
1. By Kathy Sierra, Bert Bates, “Head First Java”, Second Edition, O'Reilly Media,
2005
2. M.Deitel and Deitel, “Java How To Program” 7/e, Prentice Hall Publications.
3. Paul Deitel , Harvey M Deitel, Java for Programmers, Pearson, 2010.
4. Elliote Rusty Harold, “Java Network Programming” Third Edition, O’Reilly
Publishers.
5. “Java Cook Book”, Second Edition O’Reily Media 2002.
080230022 COMPUTER NETWORKS
L T P M C
3 0 0 100 3
Unit I 8

Uses of Computer Networks, Components, and Direction of Data flow, Networks Components
and Categories, types of Connections, Topologies, and Reference models: OSI and TCP/IP.
Multiple Access: Random Access, Controlled Access. LAN: Token Ring, FDDI, Ethernet- Fast
Ethernet, Gigabit Ethernet, Wireless LANs: IEEE 802.11 a/b/g/n

Unit II 8

Data Link Layer: Error Detection and Correction (Parity – LRC – CRC – Hamming code), Flow
Control and Error control protocols (stop and wait – go back-N ARQ – selective repeat ARQ-
sliding window), HDLC, Bridges: Spanning tree .

Unit III 9

Network Layer: IP addressing methods – Subnetting, Routing Algorithms: Shortest path

Algorithm, Flooding, Flow based routing, Distance vector routing, Link state routing, Hierarchical
routing.

Unit IV 10

Transport Layer: Duties of transport layer, Multiplexing and Demultiplexing, Sockets, UDP,
TCP. Congestion Control Techniques: Leaky bucket algorithm, Token bucket algorithm.
Congestion prevention Policies: Traffic shaping, Choke packets, Load Shedding, Jitter Control.
Application Layer: DNS, SMTP, FTP, HTTP.

Unit V 10

Introduction: Storage Area Network, Peer to Peer network, Overlay network, Wireless network:
Adhoc, Sensor network, optical Network.
Total: 45

Text Book:
1. Behrouz A. Forouzan, “Data Communications and Networks”, 4/E, Tata McGraw Hill
Publication, 2006.
2.
References:
1. William Stallings ,”Data & Computer Communications”, Sixth Edition,
Pearson Education Asia, 2002.
2. Andrew. S. Tanenbaum, “Computer Networks”, Forth edition,
Pearson Education, 2002.
3. Larry L. Peterson and Bruce S. Davie ,” Computer Networks: A systems
approach” , Third Edition, Morgan Kaufmann Publishers, 2003.
080230023 SOFTWARE ENGINEERING LAB
L T P M C
0 0 3 100 2

Solving Simple problems using CASE tools for Planning, cost estimation, Modeling the
requirements and configuration management
1. Payroll system (pay slip generation, detection and pay master report generation)
2. On line shopping ( Web based)
3. Banking system (with debit and credit ledger report creation)
4. Text editor
5. Online voting system
6. Library automation system (Flash message generation of new arrivals for all the users
via sms / mail alerts)

080230024 JAVA PROGRAMMING LAB

L T P M C
0 0 3 100 2
Solving Simple problems using,
1. Abstract classes
2. Inheritance
3. Interfaces
4. Event handling using applets
5. Threads(single and multiple)
6. Swings
7. File handling and I/O handling
8. Database applications (JDBC)

080230025 COMPUTER NETWORKS LAB

L T P M C
0 0 3 100 2
Implementing the following programs
1. Network topology configuration with hubs/ switches
2. Socket programming
3. Data grams
4. TCP
5. SMTP
6. FTP
7. Implementation of any two congestion control algorithms
8. Study of various IP Address classes practically(IPv4 , IPv6 dual stack configuration)