Course title: Data Communication & Computer

Network(DCCN)

Syllabus
Module I
Data Communications and Networking Overview
A Communications Model, Data Communications, Data Communication
Networking, The Need
for Protocol Architecture, A Simple Protocol Architecture, OSI, The TCP/IP
Protocol
Transmission, Transmission Impairments, Channel Capacity. (8L)
Architecture,
Module II Data TransmissionConcepts and Terminology, Analog and
Digital Data Media and Signal Encoding Techniques: Guided
Transmission
Transmission Media, Wireless
Transmission, Wireless Propagation, Line - of- Sight Transmission.Digital Data
Digital Signals,
Digital Data Analog Signals, Analog Data Digital Signals, Analog Data Analog
Signals. (8L)
Module III
Digital Data Communication Techniques and Data Link Control:
Asynchronous and
Synchronous Transmission, Types of Errors, Error Detection, Error
Correction, Line
Configurations, Interfacing, Flow Control, Error Control, High- Level Data Link
Control (HDLC).
Frame(8L)
Relay. (8L)
Module
Module IV V
Multiplexing,
AsynchronousCircuit TransferSwitching
Model and Packet Switching Multiplexing
Frequency Division Multiplexing,
Protocol Architecture, ATM Logical Synchronous
Connections,Time
ATMDivision Multiplexing,of
Cells, Transmission
Statistical Time
ATM Cells, ATM
Division Multiplexing,
Service Categories, ATMSwitching Networks,
Adap tation Layer. Circuit - Switching Networks,
Circuit
Routing - Switching
in Switched Networks
Concepts,
Routing inControl
Circuit Signaling, Soft
- Switching switch Architecture,
Networks, Routing in Packet
Packet--Switching
Switching
Algorithms. (8L)
Principles,
Networks, X.25,
Leastand
- Cost
Text Book:
Stallings W., Data and Computer Communications, 10 thEdn., Pearson
Education, PHI,
New Delhi, 2014.(T1)
Reference Book:
Forouzan B. A., Data Communications and Networking, 5 thEdn. TMH,
New Delhi,
2017.(R1)
 Course title: Formal language and
Automata Theory

Syllabus
Module I
Introduction to Automata : (mathematical model of digital devices,
including real computer),
State Transition Graph, Finite Automaton (FA) and its types, Deterministic
Finite Automaton
(DFA), Non-
Output, deterministic
Applications of FA.Finite Automaton (NDFA), Complement, Union,
(10L)
Intersection of FA’s ,
Co nversion Strategy from NDFA to DFA , Minimization of FA, Finite
Automaton
Module II with
Regular Expressions(RE): Introduction , R.E.’s and basic operations,
Algebraic laws on Regular
Expression, Finite and Infinite Languages, Equivalence of finite
Automaton and regular
expressions, Constructing
Regular Expression. (6L)NDFA from Regular Expression , Pumping
Lemma for Regular
Language, Closure properties of Regular Languages, Non- regular
languages,
Mod ule III Applications of
Grammar: Introduction, Formal Definition of Grammar, The Chomsky
Hierarchy of Grammar,
Designing Regular grammar from DFA, Context Free Grammar, Closure
properties
Context Freeof Language,
Context Applications of CFGs. (8L)
Free Languages,
Module IV , CFG and Normal form: Chomsky Normal Form, Greibach
Normal
Push Form,Automation
Down Non- (PDA): Introduction, Definition of PDA, Types of
Pushdown Automata
(DPDA and NPDA), Converting CFG to PDA, Derivation (Parsing),
Parsing Techniques,
Ambiguous and Unambiguous Grammar, Demerits of Ambiguous Grammar.
(8L)
Module V
Turing Machine(TM): Single Tape TM, Variations of TM, Halting Problem,
P, NP, NP
Turing - C and NP - Hard. (8L)
Machine
and Languages, Enumerable Languages, Decidable, Recognizable and
Undecidable languages,
Text Book:
Solvable and Unsolvable problems, Post Correspondence Problems(PCP),
Hopcroft J.E., Motwani R. and Ullman J.D, Introduction to Automata
Classes of Problems:
Theory, Languages and
Computations, Second Edition, Pearson Education, 2008. (T1)
Reference Books:
Mishra K.L.P. andChandrasekaran N. , Theory of Computer Science:
Automata,
Languages and Computation, 3 rd Edition, PHI.(R1)
Martin John C., Introduction to Languages and the Theory of
Computation, 3 rd Edition,
TataMcGraw Hill Publishing Company, New Delhi, 2007. (R2)
Lewis Harry R. and Papadimitriou Christos H., Elements of the theory
of Computation,
2 nd Edition, Prentice- Hall of India Pvt. Ltd. (R3)
 Course title: Data Mining Concepts
and Technique

Syllabus
Module I
Data Mining: Introduction, Relational Databases, Data Warehouses,
Transactional databases,
Advanced database Systems and Application, Data Mining Functionalities,
Classification of Data
Mining Systems, Major Issues in Data Mining.
Discretization
Data Processing:andData
Concept Hierarchy
Cleaning, DataGeneration.
Integration and (6L)
Transformation, Data
Reduction, Data
ModuleII
Dat a Warehouse: Introduction, A Multidimensional data Model, Data
Warehouse Architecture,
Data Warehouse
Mining.Data CubeImplementation,
Computation andDataDataCube Technology, From
Generalization. (8L) Data
Warehousing to Data
Module III
Mining Associat ion Rules in Large Databases: Association Rule Mining,
Single – Dimensional
Boolean Association Rules, Multilevel Association Rules from Transaction
Databases, Analysis,
Correlation Multi Constraint – Based Association Mining. (10L)
Dimensional Association Rules from Relational Databases, From
Association
Module IV Mining to
Classification and Prediction: Classification & Prediction, Issues Regarding
Classification &
Prediction, Classification by decision Tree Induction, Bayesian
Classification,Methods,
Classification Classification by
Prediction, Classification Accuracy. (8L)
Back propagation, Classification based on concepts & Association
Rule
Module Analysis,
V Other
Cluster Analysis: Introduction , Types of Data in Cluster Analysis, A Catego
rization of Major
Clustering Methods, Partitioning Method - k - Medoids Algorithm, CLARANS,
Hierarchical
WaveCluster. Outlier Analysis.(8L)
Methods - BIRCH, ROCK Density- Based Methods - DBSCAN, Grid - Based
Methods – STING,
Text book:
Han Jiawei &Kamber Micheline - Data Mining Concepts & Techniques,
2 nd Edition,
Publisher Harcout India. Private Limited.(T1)
Reference books:
Gupta G.K., Introduction to Data Mining with case Studies, PHI, New
Delhi, 2006.(R1)
Berson A. & Smith S. J., Data Warehousing Data Mining, COLAP, TMH,
New Delhi,
2004.(R2)
Dunham H.M. & Sridhar S., Data Mining, Pearson Education, New
Delhi, 2006.(R3)
 Course title: Software
Engineering
Syllabus
Module I
Introduction
Some Definitions, FAQs about software engineering, the evolving role of
software, Software
processManagement
model, models, Waterfall model,
activities, the prototyping
Project planning andmodel, spiral
Project model, RAD
Scheduling.
and
(8L) Incremental
Module II
Software Requirements
Functional and non- functional requirements, User requirements, System
requirements, the
software requirements document. IEEE standard of SRS, Quality of good
SRS.
Requirementvalidation,
Requirements Engineering Process:management.
Requirement Feasibility study,
(8L)Requirements
elicitation and analysis,

Module III
Design Engineering
Design Process and Design Quality, Design Concepts, Design Models,
Object oriented
UML: Class Design,
diagram, Sequence diagram, Collaboration diagram. (8L)

Module IV
Verification and Validation
Verification and Validation Planning, S/W inspection, static analysis.
Software Testing
Testing functions, Test care design, White Box testing, Black box
testing, Unit testing,
Integration Testing, System testing, Reliability.
Module V
Process metrics, Software Measurement, Software Project Estimation,
Decomposition
Techniques, Empirical
Quality control, Estimation Models,
S /W Maintenance Quality(8L)
in detail. assurance and standards,
Quality planning,

Text Book:
Sommerville, Software Engineering, 7 th Edition, Pearson Education
Publication. (T1)
Reference Books:
Pressman R. S.,Software Engineering: A Practiioners Approach, 5 th Edition.,
TMA, New
Delhi.(R1)
Mall Rajib, Fundamental of Software Engineering, 4 th Edition, PHI Learning
Private
Limited.(R2)
Peters J. F. &Pedrycz W., Software Engineering, John Wiley & Sons, Inc. 2000.
(R3)
Behforooz A. & Hudson F.J., Software Engineering Fundamentals, Oxford
Page 166 Univ.
Press, New York, of 439
B
E
 System
programming