Date post: | 05-Feb-2018 |
Category: |
Documents |
Upload: | vuongkhuong |
View: | 219 times |
Download: | 0 times |
1
Revised scheme and syllabus
of Master of Computer
Applications
(MCA)
3 YEARS PROGRAMME
CREDIT BASED SYSTEM
(70:30) (wef session 2011-12)
Department
of
Computer Sc. & Engineering
GJUS&T HISAR
2
SCHEME OF EXAMINATION
M C A (Credit System)
Semester I
Semester -II
Paper No Nomenclature of Paper Duration of
Exam
Total Credits
CSL-621 Data Structure Using C 3 hours 4
CSL-622 Computer Networks 3 hours 4
CSL-623 System Simulation 3 hours 4
CSL-624 Computer Oriented
Optimization Techniques
3 hours 4
CSL-625 Object-oriented Systems and
C++
3 hours 4
CSP-621 Software Laboratory –III Data structure implemented in C/C++
(Based on CSL-621)
3 hours 2
CSP-622 Software Laboratory –IV
Programming in C++
(Based on CSL-625)
3 hours 2
CSP-623 Seminar 1
Total 25
Paper No Nomenclature of Paper Duration of
Exam
Total Credits
CSL-611 Computer Fundamentals and
Problem Solving through C
3 hours 4
CSL-612 Computer Organization 3 hours 4
CSL-613 Discrete Mathematical
Structures
3 hours 4
CSL-614 Software Engineering 3 hours 4
CSL-615 Computer Oriented Numerical
and Statistical Methods using C
3 hours 4
CSP-611 Software Laboratory –I
Programming in C
(Based on CSL-611)
3 hours 2
CSP-612 Software Laboratory –II Numerical and Statistical Methods
implementation in C
(Based on CSL-615)
3 hours 2
CSP-613 Seminar 1
Total 25
3
Semester -III
Paper No Nomenclature of Paper Duration of
Exam
Total Credits
CSL-631 Data Base Systems 3 hours 4
CSL-632 Visual Programming using
VB
3 hours 4
CSL-633 Artificial Intelligence 3 hours 4
CSL-634 Operating Systems 3 hours 4
CSL-635 Window Programming and
Visual C++
3 hours 4
CSP-631 Software Laboratory –V Oracle and SQL Programming.
(Based on CSL-631)
3 hours 2
CSP-632 Software Laboratory –VI
Programming in VB &
Window programming in
Visual C++
(Based on CSL-632 and
CSL-635)
3 hours 2
CSP-633 Seminar 1
Total 25
4
Semester IV
List of Elective Papers
Programme Elective- I
i. System Programming
ii. Advanced Database Systems
iii. High Speed Networks
iv. Theory of Computation
v. Object-oriented Modeling
vi. Computer Architecture and Parallel Processing
Programme Elective – II
i. Microprocessor and Interfaces
ii. Software Project Management
iii. Management Information Systems
iv. Principles of Programming Languages
v. Embedded Systems
Paper No Nomenclature of Paper Duration of
Exam
Total Credits
CSL-641 Computer Graphics and
Multimedia
3 hours 4
CSL-642 Data Warehousing and Data
Mining
3 hours 4
CSL-643 Linux and Shell Programming 3 hours 4
CSL-644 Programme Elective I 3 hours 4
CSL-645 Programme Elective II 3 hours 4
CSP-641 Software Laboratory –VII
Graphics Programming in C/C++
(Based on 641)
3 hours 2
CSP-642 Software Laboratory –VIII
LINUX & Shell Programming
(Based on CSL-643)
3 hours 2
CSP-643 Seminar 1
Total 25
5
Semester V
List of Electives –III
Programme Elective -III
i. .NET using C#
ii. Compiler Construction
iii. Neural Network
iv. Security of Information System
v. Digital Image Processing
Semester VI
Paper No Nomenclature of Paper Credits
CSD-601 Major Project 14
To be carried out in industry/company under the supervision of official of industry/company
where he/she is doing the project. Evaluation and viva-voce is to be done jointly by the two
examiners.
Note:
1) One credit in theory paper is equivalent to one hour classroom teaching per week.
2) One credit in practical/lab course is equivalent to 2 hours practical/lab work per week
3) A teacher will conduct practical class in a group of 15-20 students.
Paper No Nomenclature of Paper Duration of
Exam
Total Credits
CSL-651 Java Programming
and Internet Applications
3 hours 4
CSL-652 Software Testing and Quality
Assurance
3 hours 4
CSL-653 Web Engineering 3 hours 4
CSL-654 Progarmme Elective III 3 hours 4
CSP-651 Software Laboratory –IX
Java Programming
(Based on CSL-651 & CSL-652)
3 hours 2
CSP-652 Software Laboratory –X
HTML/ CGI using PERL / JSP/
XML (Based on CSL-653)
3 hours 2
CSP-653 Seminar 1
Total 21
Grand total of Credits (from semester I to VI) 135
6
CSL-611 COMPUTER FUNDAMENTALS & PROBLEM SOLVING THROUGH C
Note: Total 8 questions are to be set by the examiner/teacher
covering the entire syllabus uniformly. A candidate is required
to attempt any five questions. All questions shall carry equal
marks.
Total Credits: 4
Time: 3 Hours
L T P (Examination)
4 - -
SYLLABUS
Computer Fundamentals: Computer components, characteristics &
classification of computers, hardware & software, peripheral
devices.
Algorithmic Development: Techniques of problem solving,
Flowcharting, decision table, structured programming concepts,
Modular Programming, Algorithms for searching, sorting and merging.
Programming methodologies: top-down and bottom-up programming.
Elements of C: C character set, identifiers and keywords, Data
types: declaration and definition.
Operators: Arithmetic, relational, logical, bitwise, unary,
assignment and conditional operators and their hierarchy &
associatively.
Data input/output.
Control statements: Sequencing, Selection: if and switch
statement; alternation, Repetition: for, while, and do-while loop;
break, continue, goto.
Functions: Definition, prototype, passing parameters, recursion.
Data Structures: arrays, struct, union, string, data files.
Pointers : Declaration, operations on pointers, array of
pointers, pointers to arrays.
References:
Computer Programming and Problem Solving Through C by Dharminder
Kumar, Varun Kumar, Excel books, 2005, New Delhi.
Jeri R. Hanly & Elliot P. Koffman, Problem Solving and Program
Design in C, 3rd Ed., Addison Wesley, 2000.
AK Sharma, Fundamental of Computer & Programming with C, Dhanpat
Rai Publications.
Yashwant Kanetker, Let us C, BPB Publications.
Gottfried, Programming with C, Tata McGraw Hill.
7
CSL-612 Computer Organization
Note: Total 8 questions are to be set by the examiner/teacher
covering the entire syllabus uniformly. A candidate is required
to attempt any five questions. All questions shall carry equal
marks.
Total Credits: 4 Time: 3 Hours
L T P (Examination)
4 - -
SYLLABUS
Information Representation : Number systems, BCD codes,
character codes, error detecting and correcting codes,
fixed-point and floating point representation of information.
Binary arithmetic operations, Booths multiplication.
Binary Logic : Boolean algebra, boolean functions, truth
tables, canonical and standard forms, simplification of
boolean functions, digital logic gates.
Combinational Logic : Design procedure, adders,
subtractors, encoders, decoders, multiplexers, de-multiplexers
and comparators.
Sequential Logic : Flip-flops, shift registers and counters.
Memory System : Memory parameters, semiconductor RAMs,
ROMs, magnetic and optical storage devices.
CPU organization : Processor organization, Machine
instructions, instruction cycles, instruction formats and
addressing modes, microprogramming concepts, micro-program
sequencer.
I/O Organization : I/O interface, interrupt structure,
transfer of information between CPU/memory and I/O devices,
and IOPs.
References :
Mano, M. Morris Digital Logic and Computer Design, Prentice
Hall of India Pvt. Ltd., 2000.
Rajaraman, V., Radhakrishanan,T., An Introduction To Digital
Computer Design,Prentice Hall of India Pvt. Ltd., 4th Ed.
Hayes, J.P., Computer Architecture and Organization, McGraw
Hill, 1998, Third Ed.
Heuring, V.P., Jordan, H.F., Computer Systems Design and
Architecture, Addison Wesley, 2000.
8
CSL-613 DISCRETE MATHEMATICAL STRUCTURES
Note: Total 8 questions are to be set by the examiner/teacher
covering the entire syllabus uniformly. A candidate is required
to attempt any five questions. All questions shall carry equal
marks.
Total Credits: 4 Time: 3 Hours
L T P (Examination)
4 - -
SYLLABUS
GROUP AND SUBGROUPS: Group axioms, Permutation Groups,
Subgroups, Cosets, Normal subgroups, Semi-groups, FREE
Semi-groups, Applications, (modular arithmetic, error
correcting codes, grammars, language, Finite State Machine).
Graphs: Directed and undirected graphs, chains, Circuits,
paths, Cycles, connectivity, Adjacency and incedence matrices,
Minima's path Application(Flow charts and state
transition graphs, algorithms for determining cycle and
minimal paths, polish notation and trees, flows in networks).
Lattices and Boolean Algebra: Relations to partial
ordering, Lattices, Hasse diagram, Axiomatic definition of
Boolean algebra as algebraic structures with two operations
basic results truth values and truth tables. The algebra of
propositional function. The Boolean algebra of truth
values, Applications (Switching circuits, Gate circuits).
Finite Fields: Definition Representation, Structure, Integral
domain Irreducible polynomial, Polynomial roots, Splitting
field.
REFERENCES:
Alan Doerr, Kenneth Levaseur, APPLIED DISCRETE STRUCTURES
FOR COMPUTER SCIENCE, Galgotia Publications Pvt. Ltd.
Scymour Lipschutz, Marc Lars Lipson, DISCRETE MATHEMATICS,
McGRAW-HILL international editions, Schaum's Series.
Bernard Kolman,Robert C.Busby,DISCRETE MATHEMATICAL
STRUCTURES FOR COMPUTER SCIENCE, Prentice-Hall of India Pvt.
Ltd.
Kenneth G.Rosen: DISCRETE MATHEMATICS and ITS APPLICATIONS,
McGRAW-HILL INTERNATIONAL EDITIONS, Mathematics series.
9
CSL-614 SOFTWARE ENGINEERING
Note: Total 8 questions are to be set by the examiner/teacher
covering the entire syllabus uniformly. A candidate is required
to attempt any five questions. All questions shall carry equal
marks.
Total Credits: 4 Time: 3 Hours
L T P (Examination)
4 - -
SYLLABUS
Software and software engineering - Software
characteristics, software crisis, software engineering
paradigms.
Planning a software project - Software cost estimation,
project scheduling, personnel planning, team structure.
Software configuration management, quality assurance,
project monitoring, risk management.
Software requirement analysis - structured analysis,
object oriented analysis and data modeling, software
requirement specification, validation.
Design and implementation of software - software
design fundamentals, design methodology (structured design
and object oriented design), design verification, monitoring
and control, coding.
Software reliability - metric and specification, fault
avoidance and tolerance, exception handling, defensive
programming.
Testing - Testing fundamentals, white box and black box
testing, software testing strategies: unit testing,
integration testing, Validation testing, System testing,
debugging.
Software maintenance - maintenance
characteristics, maintainability, maintenance tasks,
maintenance side effects. CASE tools.
References :
Pressman S. Roger, Software Engineering, Tata McGraw-Hill.
Jalote Pankaj, An integrated Approach to
Software, Engineering, Narosa Publishing House
Sommerville Ian, Software Engineering, 5th ed., Addison
Wesley-2000
Fairley Richard, Software Engineering Concepts, Tata McGraw
Hill
10
CSL-615 COMPUTER ORIENTED NUMERICAL AND STATISTICAL METHODS
USING C
Note: Total 8 questions are to be set by the examiner/teacher
covering the entire syllabus uniformly. A candidate is required
to attempt any five questions. All questions shall carry equal
marks.
Total Credits: 4 Time: 3 Hours
L T P (Examination)
4 - -
SYLLABUS
Computer Arithmetic : Floating point representation of
numbers, arithmetic operations with normalized floating point
numbers and their consequences. Error in number representation
- pitfalls in computing.
Iterative Methods: Bisection, False position, Newton-Raphson
methods, Discussion of convergences, Polynomial evaluation,
Solving polynomial equations (Bairstow's Method).
Solving of Simultaneous Linear Equations and ordinary
Differential Equations: Gauss elimination method, Ill-
conditioned equations, Gauss-Seidal iterative method, Taylors
series and Euler methods, Runge-kutta methods, Predictor
corrector methods.
Numerical Differentiation and Integration :
Differentiation formulae based on polynomial fit, Pitfalls in
differentiation, Trapezoidal, Simpson's rules and Gaussian
Quadrature.
Interpolation and Approximation : Polynomial
interpolation, Difference tables, Inverse interpolation,
Polynomial fitting and other curve fitting. Approximation of
functions by Taylor series and Chebyshev polynomials.
Statistical methods: Sample distributions, Test of
Significance, n2, t and F test.
Analysis of Variance : Definition, Assumptions, Cochran's
Theorem, One-way classification, ANOVA Table, Two-
way classification (with one observation per cell).
Time Series Analysis : Components and Analysis of Time
Series, Measurement of Trend, Seasonal fluctuations and Cyclic
movement.
References :
Gupta S.P. and Kapoor, V.K., Fundamentals of Applied station
statistics, Sultan Chand & Sons, 1996.
Gupta S.P. and Kapoor, V.K., Fundamentals of Mathematical
statistics, Sultan Chand and Sons, 1995.
Rajaraman V., Computer Oriented Numerical Methods, Prentice
Hall, India.
Graybill, Introduction to Statistics, McGraw.
Anderson, Statistical Modelling, McGraw.
11
CSL-621 DATA STRUCTURES USING C
Note: Total 8 questions are to be set by the examiner/teacher
covering the entire syllabus uniformly. A candidate is required
to attempt any five questions. All questions shall carry equal
marks.
Total Credits: 4 Time: 3 Hours
L T P (Examination)
4 - -
SYLLABUS
Introduction to Data Structures, Primitive and Composite,
Arrays, Matrices, Sparse Matrices, String
representation and manipulation, Stack, Queue, Dequeue,
Linked lists, Trees, Binary trees, Threaded Binary tree,
Balanced tree, Different tree traversal algorithms,
Representation of Graphs and Applications, various searching
and sorting techniques, Hashing, Dynamic Memory Management.
References:
Yedidyah Langsam, Moshe J Augernstein and Aarson
M.Tanenbaum, Data Structures using C and C ++, PHI, New
Delhi (1997)
Trembley, J.P. and Sorenson P.G.An Introduction to
Data Structures with Applications, McGraw-Hill
International Student Edition, New York(1984
Seymour Lischutz, Data Structures, McGraw-Hill Book
Company, Schaum's Outline Series, New York(1986).
12
CSL-622 COMPUTER NETWORKS
Note: Total 8 questions are to be set by the examiner/teacher
covering the entire syllabus uniformly. A candidate is required
to attempt any five questions. All questions shall carry equal
marks.
Total Credits: 4 Time: 3 Hours
L T P (Examination)
4 - -
SYLLABUS
Network Concepts : Goals and applications of Computer
Networks; Topologies; Categories of Networks - LAN,
MAN, WAN, Inter-networks; point-to-point and
broadcast networks; Introduction to SMDS, X.25 Networks,
ISDN, frame relay and ATM networks.
Network architecture : Concept of protocols & services; OSI
model and functions of its layers; TCP/IP reference model.
Data communication concepts : Components of a data
communication system; transmission modes; transmission
media - guided and wireless media; introduction to switching
(circuit, message and packet) and multiplexing (frequency
division and time division); concept of Modems.
Framing and Error control : Framing techniques; Error
control- error detection & correction.
Data Link Control : Acknowledgments; Elementary data-
link protocols, Automatic Repeat Request; Sliding Window
protocols.
Medium Access Control and LANs : Multiple Access protocols of
MAC sublayer - ALOHA, 1-persistent, p-persistent and non-
persistent CSMA, CSMA/CD, Collision free protocols,
Limited contention protocols, Wavelength Division Multiple
Access, MACA, GSM, CDPD, CDMA; IEEE Standard 802 for LANs and
MANs- Ethernet, token bus, token ring, DQDB, Logical Link
Control.
Routing : Deterministic and Adaptive routing; Centralized
and distributed routing; shortest-path; flooding; flow
based; optimal; distance vector, link-state, hierarchical;
routing for mobile hosts; broadcast and multicast routing;
Congestion control : Principles of congestion control;
Traffic shaping; choke packets; load shedding; RSVP.
TCP/IP: Elements of Transport Protocols; transmission control
protocol(TCP);user datagram protocol(UDP); Internet
protocol(IP).
References:
Computer Networks - Andrew s. Tanenbaum, PHI.
Data Communications, Computer Networks and Open Systems,
fourth edition-Fred Halsall, Addison Wesley.
Introduction to Data communications and
Networking- Behrouz, Forouzan, Tata Mc-Graw Hill.
Data and Computer Communications, fifth edition-William
Stallings, PHI.
13
CSL-623: SYSTEM SIMULATION
Note: Total 8 questions are to be set by the examiner/teacher
covering the entire syllabus uniformly. A candidate is required
to attempt any five questions. All questions shall carry equal
marks.
Total Credits: 4 Time: 3 Hours
L T P (Examination)
4 - -
SYLLABUS
INTRODUCTION: Concept of System, stochastic
activities, continuous and discrete systems, system modeling,
principals used in modeling.
SIMULATION OF SYSTEM : Concepts of simulation of
continuous system with the help of examples; use of
integration formulas; concepts of discrete system
simulation with the help of examples. Generation of
random numbers, Generation of non-uniformly distributed
random numbers.
SIMULATION OF QUEUING SYSTEMS: Basic concepts of queuing
theory, Simulation of single - server, two-server and
general queuing systems.
SIMULATION IN INVENTORY CONTROL AND FORECASTING: Elements
of inventory theory, inventory models, Generation of Poison
and Erlang variates, forecasting and aggression analysis.
DESIGN AND EVALUATION OF SIMULATION EXPERIMENTS:
Experiment layout and Validation.
SIMULATION LANGUAGES : Continuous and discrete
simulation languages, Black-Structured continuous simulation
languages, Expression based languages, Discrete system
simulation languages: GPSS, SIMCRIPT, SIMULA, Factors in
selection of discrete system simulation languages.
References:
Gordon G. :"System Simulation" , Prentice-Hall of India Pvt.
Ltd. New Delhi-1993
Narsingh Deo : "System Simulation with Digital Computer",
PHI, New Delhi, 1993
Payne, James A. : Introduction to Simulation: Programming
Techniques and Methods of Analysis. Mcgraw-Hill
International Editions, Computer Science Series, New
York(1998).
14
CSL-624: COMPUTER ORIENTED OPTIMIZATION TECHNIQUES
Note: Total 8 questions are to be set by the examiner/teacher
covering the entire syllabus uniformly. A candidate is required
to attempt any five questions. All questions shall carry equal
marks.
Total Credits: 4 Time: 3 Hours
L T P (Examination)
4 - -
SYLLABUS
Introduction : The Historical development, Nature, Meaning
and Management Application of Operations research. Modelling,
It's Principal and Approximation of O.R.Models, Main
characteristic and phases, General Methods of solving
models, Scientific Methods, Scope, Rule on Decision
Making and development of Operation Research in India.
Linear Programming : Formulation, Graphical solution,
standard and matrix forms of linear programming problems,
Simplex method and its flow chart, Two phase Simplex method,
Degeneracy.
Dualily : Introduction, Definition, General Rule for
converting any primar into its Dual, Dual Simplex method and
its flow chart.
Integer Programming: Importance and Applications, Gomorg's all
integer programming problem technique, Branch and Bound Method.
Queuing Models : Introduction, Applications,
Characteristic Waiting and Ideal time costs, Transient and
Steady states, Kendall's Notations, M/M/1, M/M/C, M/Ek/1
and Deterministic Models. (No Mathematical derivations
included).
PERT and CPM : Basic steps in PERT and CPM, Forward and
Backward computation, Representation in Tabular form, Slack
and Critical path, Difference between CPM and PERT, Float.
References :
Gupta P.K., Hira and D.S., Operation Research, Sultan Chand
& Sons, New Delhi, 1994.
Kanti Swarup, Gupta P.K. & Man Mohan, Operation Research,
Sultan Chand & sons, New Delhi, 1990.
Mittal, K.V., Optimization Methods in Operations Research
and System Analysis, New Age International (P) Ltd.,
New Delhi, 1992.
Rao S.S., Optimization Theory and Applications,Wiley
Eastern Ltd. New Delhi, 1991.
Sharma, S.D., Operations Research, Kedar Nath and Ram Nath,
Meerut, 1996.
Taha, H.A., Operation Research - An Introduction,
McMillan Publishing Co, New York, 1986.
Bazara, Operation Research & Networking, Wiley.
Avieral, Optimization Techniques.
15
CSL-625: OBJECT ORIENTED SYSTEMS AND C++
Note: Total 8 questions are to be set by the examiner/teacher
covering the entire syllabus uniformly. A candidate is required
to attempt any five questions. All questions shall carry equal
marks.
Total Credits: 4 Time: 3 Hours
L T P (Examination)
4 - -
SYLLABUS
Object-Oriented Concepts: Data abstraction, encapsulation,
Classes and objects, modularity, hierarchy, typing,
concurrency, persistence.
Object-Oriented Methodology: Advantages and disadvantages of
OO methodologies. Modeling, Domain analysis. OMT Methodology-
Object Model, links and associations, multiplicity, link
attributes, role names, ordering qualification, aggregation,
generalization and inheritance, abstract class, meta data,
object diagram. Dynamic Model-events, states, scenarios,
event traces, state diagram. Functional Model-data flow
diagrams. Analysis, System design and Object design.
Programming in C++: Data Types, struct vs classes, static
data & member function, constant parameters & member functions,
friend functions & friend classes, role of constructors &
destructors, dynamic objects, operator overloading,
function overloading, inheritance, virtual functions,
abstract class, virtual class, template functions & template
classes, exception handling, file stream classes, ASCII &
Binary files, sequential & random access to a file.
References :
Rumbaugh, J. et. al., Object-Oriented Modelling and Design,
Prentice Hall of India, 1998
Booch, Grady, Object Oriented Analysis & Design, Addison
Wesley, 1994
Stroustrup, B., The C++ Programming Language, Addison-
Wesley,1993
Lippman, C++ Primer, 4/e, Addison-Wesley
Balaguruswami, E., Object Oriented Programmming In C++, Tata
McGraw-Hill,1998
Schildt, Herbert, C++ : The Complete Reference, 2/e, Tata
McGraw-Hill,1998
16
CSL-631: DATABASE SYSTEMS
Note: Total 8 questions are to be set by the examiner/teacher
covering the entire syllabus uniformly. A candidate is required
to attempt any five questions. All questions shall carry equal
marks.
Total Credits: 4 Time: 3 Hours
L T P (Examination)
4 - -
SYLLABUS
Basic Concepts: A Historical perspective, File Systems vs.
DBMS, Characteristics of the Data Base Approach, Abstraction
and Data Integration, Database users, Advantages and
Disadvantages of a DBMS, Implication of Data Base approach.
Data Base Systems Concepts and Architecture: Data Models,
Schemas and Instances, DBMS architecture and Data Independence,
Data base languages & Interfaces, DBMS functions and component
modules.
Entity Relationship Model : Entity Types, Entity Sets,
Attributes & Keys, Relationships, Relationship Types, Roles
and Structural Constraints, Design issues, weak entity
types, E-R Diagrams. Design of an E-R Database Schema,
Reduction of an E-R Schema to Tables, The Unified Modeling
Language (UML).
Relational Data Model : Relational model concepts,
Integrity constraints over Relations, Relational Algebra
- Basic Operations.
SQL : Data Definition, Constraints, & Schema Changes in
SQL, Insert, Delete & update statements in SQL, view in
SQL, Specifying Constraints and Indexes in SQL, Queries in SQL.
A Relational Data Base Management System : ORACLE - A
Historical perspective, Basic structure, Data base
Structure and its manipulation in ORACLE, Storage
Organisation in ORACLE Programming ORACLE Applications.
Conventional Data Models : An overview of Network
and Hierarchical Data Models.
Relational Data Base Design : Functional
Dependencies, Decomposition, Desirable properties of
decomposition, Normal forms based on primary keys (1 NF, 2 NF,
4 NF and BC NF).
Practical Data Base Design : Role of Information systems
in Organizations, Database design process, physical database
design in Relational Databases.
Transaction Processing Concepts : Introduction to
Transaction Processing, Transaction & System Concepts,
Properties of Transaction, Schedules and Recoverability,
Serializability of Schedules.
Concurrency Control Techniques : Locking Techniques, Time
stamp ordering, Multi-version Techniques, Optimistic
Techniques, Granularity of Data Items.
17
Recovery Techniques : Recovery concepts, Recovery Techniques
in centralized DBMS.
Data Base Security : Introduction to Database Security issues.
References :
Elmasri & Navathe: Fundamentals of Database systems, 3rd
Edition, Addison Wesley, New Delhi.
Korth & Silberschatz : Database System Concept, 4th
Edition, McGraw Hill International Edition.
Raghu Ramakrishnan & Johannes Gehrke: Database Management
Systems, 2nd edition, Mcgraw Hill International Edition.
C.J.Date : An Introduction to Data bases Systems 7th
Edition, Addison Wesley, New Delhi.
Bipin C.Desai : An Introduction to Database System, Galgotia
Publication, New Delhi
Abbey, Abramson & Corey : Oracle 8i-A Beginner's Guide Tata
McGraw Hill Publishing Company Ltd.
Ivan Bayross : SQL, PL/SQL-The Program Language of ORACLE,
BPB Publication, New Delhi.
18
CSL-632: VISUAL PROGRAMMING USING VISUAL BASIC
Note: Total 8 questions are to be set by the examiner/teacher
covering the entire syllabus uniformly. A candidate is required
to attempt any five questions. All questions shall carry equal
marks.
Total Credits: 4 Time: 3 Hours
L T P (Examination)
4 - -
SYLLABUS
Concepts of Object based Event Oriented Languages,
Visual Architecture : Method, Statement, Properties and
Event; Basic concept of Visual Program Design and comparison
with Non-Visuals.
The VB Integrated Development Environment and its elements :
Menu bar, tool bars, project explorer, tool box, properties
window, form designer, form layout, etc.
The VB language and its elements : Variables, constants,
arrays, collections, subroutines, functions, arguments, and
control structures.
Designing a VB application : Working with VB forms,
form properties, adding, deleting, and managing forms at run
time, coding event procedures, implementing drag and drop
operations, menu designing, adding menu interface to forms,
attaching code to events, dynamic menu appearance.
Coding a VB application : Implementing user interface
controls, common controls and their properties, dynamic
controls, custom controls, control arrays, using variable,
subroutines, function and control structures, accessing data
through code and data controls, using DLLs in VB
applications, building ActiveX clients, activeX servers,
ActiveX controls, ActiveX documents, and web-enabled
applications, Multiple Document Interface, Graphics
Programming.
Database programming(DAODC,ADODC) and Object Oriented
programming with VB.
References :
Visual Basic - 6 by Howard Hawee PHI
Teach yourself Visual Basic by Warner TMH
Mastering VB-6 by Evangelos Petroutsos TMH
Programming in VB-6 by J C Bradley TMH
VB-6 The Complete Reference by Jerke TMH
Visual Basic by Gery Corner.
19
CSL-633: ARTIFICIAL INTELLIGENCE
Note: Total 8 questions are to be set by the examiner/teacher
covering the entire syllabus uniformly. A candidate is required
to attempt any five questions. All questions shall carry equal
marks.
Total Credits: 4 Time: 3 Hours
L T P (Examination)
4 - -
SYLLABUS
Introduction: Background and history, Overview of AI
applications areas.
The predicate calculus: Syntax and semantic for
propostional logic and FOPL, Clausal form, inference rules,
resolution and unification.
Knowledge representation: Network representation-
Associative network & conceptual graphs, Structured
representation- Frames & Scripts.
Search strategies: Strategies for state space search-data
driven and goal driven search; Search algorithms-
uninformed search (depth first, breadth first, depth
first with iterative deepening) and informed search (Hill
climbing, best first, A* algorithm, mini-max etc.),
computational complexity, Properties of search algorithms-
Admissibility, Monotonicity, Optimality, Dominance, etc.
Production system: Types of production system, Control of
search in production system.
Rule based expert systems: Architecture, development,
managing uncertainty in expert systems(Bayesian
probability theory, Stanford certainty factor algebra,
Nonmonotonic logic and reasoning with beliefs, Fuzzy logic,
Dempter/Shaffer and other approaches to uncertainty.
Knowledge acquisition: Types of learning, learning
automata, genetic algorithms, intelligent editors, learning by
induction.
Programming with Prolog.
References :
George F. Luger, William A. Stubblefield Artificial
Intelligence, The Benjamin/Cummings Publishing Company, Inc.
Dan W. Patterson Introduction to Artificial Intelligence and
Expert system PHI.
Eugene Charniak, Drew McDermott Introduction to Artificial
Intelligence Addison Wesley-2000.
Nils J. Nilsson Principles of Artificial Intelligence Narosa
publishing house.
Jackson Peter, Introduction to Expert systems, 3rd ed.,
(Addison Wesley -2000).
20
CSL-634: OPERATING SYSTEMS
Note: Total 8 questions are to be set by the examiner/teacher
covering the entire syllabus uniformly. A candidate is required
to attempt any five questions. All questions shall carry equal
marks.
Total Credits: 4 Time: 3 Hours
L T P (Examination)
4 - -
SYLLABUS
Introductory Concepts: Operating system functions and
characteristics, historical evolution of operating systems,
Real time systems, Distributed systems, Methodologies for
implementation of O/S service system calls, system programs,
Interrupt mechanisms.
File Systems: Functions of the system, File access and
allocation methods, Directory Systems: Structured
Organizations, directory and file protection mechanisms,
implementation issues: hierarchy of file and device management.
CPU Scheduling: Levels of Scheduling, Comparative study of
scheduling algorithms, Multiple processor scheduling.
Storage Management: Storage allocation methods: Single
contiguous allocation, Multiple contiguous allocation, Paging;
Segmentation combination of Paging and Segmentation, Virtual
memory concepts, Demand Paging, Page replacement Algorithms,
Thrashing.
Hardware Management: Hardware Organisation, Device scheduling
policies.
Deadlocks: Deadlock characterization, Deadlock prevention and
avoidance, Deadlock detection and recovery, practical
considerations.
Concurrent Processes: Critical section problem, Semaphores,
Classical process co-ordination problems and their solutions,
Interprocess Communications.
Protection: Goals of protection, mechanism & policies
implementation dynamic protection structures, revocation
protection schemes in UNIX / MULTICS.
Case Studies: Comparative study of DOS, WINDOW, UNIX & LINUX
system.
References :
Peterson, J.L.& Silberschatz, A., Operating System Concept,
Addison Wesley, reading.
Brinch, Hansen, Operating System Principles, Prentice Hall
of India
Haberman, A.N., Introducing to Operating System Design
Galgotia Publication, New Delhi
Tanenbaum, A.S., Operating System
Hansen P.B., Architecture Concurrent Programs,PHI
Shaw, A.C., Logic design of Operating Systems, PHI
Deitel, H.M., Operating System, John Wiley/Addison Wesley.
21
CSL-635: WINDOWS PROGRAMMING & VISUAL C++
Note: Total 8 questions are to be set by the examiner/teacher
covering the entire syllabus uniformly. A candidate is required
to attempt any five questions. All questions shall carry equal
marks.
Total Credits: 4 Time: 3 Hours
L T P (Examination)
4 - -
SYLLABUS
Windows basic concepts, window API, DEF files, creating
windows, message, x-windows, Mouse and keyboard.
Introduction to resources, designing and creating menus, pop-up
menus, user defined resources.
Bitmaps and dialogues; windows animation; Font basics;
window controls; Font display; static controls, edit
controls, list boxes, psychic windows.
Overview and structure of widows programming,
coding conventions; Displaying text, mouse, graphics device
interfaces.
Programming using visual C++.
References:
Windows Programming by Charles Petzol.
Windows Programming by Jim Conger.
Visual C++ by Yashwant Kanetkar.
22
CSL-641: COMPUTER GRAPHICS AND MULTIMEDIA
Note: Total 8 questions are to be set by the examiner/teacher
covering the entire syllabus uniformly. A candidate is required
to attempt any five questions. All questions shall carry equal
marks.
Total Credits: 4 Time: 3 Hours
L T P (Examination)
4 - -
SYLLABUS
Introduction : Survey of computer Graphics and its
applications; Interactive and passive graphics; Introduction to
GKS primitives; display processors;
Graphic Devices : Display systems-refresh CRTs, raster scan
and random scan monitors, Grey shades, Interlacing, beam
penetration shadow mask monitors, look up tables, plasma
panel, LED and LCD monitors, VGA and SVGA resolutions; Hard
copy Devices-printers, plotters; Interactive Input Devices-
mouse, digitizing tablet, light pen, touch panels, image
scanners, voice systems, joy stick, track ball.
Drawing Geometry : Coordinate system; resolution; use
of homogeneous coordinate system; scan conversion:
symmetrical DDA, simple DDA, Bresenhams line drawing
algorithm, Circle drawing using DDA and polar coordinates,
Bresenhams circle drawing algorithm, generation of
ellipse.
2-D Transformations : Translation; rotation; scaling;
mirror reflection; shearing; zooming; panning; input
techniques-pointing, positioning, rubber band methods
and dragging; tweening.
Graphic operations : Clipping-line clipping using
Sutherland-Cohen and midpoint sub-division algorithm,
polygon clipping; window and viewport; windowing
transformation; Filling-stack based fill algorithm, scan-line
seed fill algorithm;
3-D Graphics : 3D modelling of objects; 3D display
techniques; coordinate system; 3D transformation matrices for
translation, scaling and rotation; parallel projection;
perspective projection; Hidden-surface removal - Z-buffer,back
face, scan-line, depth-sorting, area subdivision; Shading -
modelling light intensities, gouraud shading, phong shading.
Multimedia: Concepts of Hypertext/Hypermedia; multimedia
applications; multimedia authoring; multimedia hardware;
images; bitmaps; windows paint brush.
References :
Computer Graphics - Donald Hearn, M.Pauline Baker, PHI
Computer Graphics-Pradeep K.Bhatia, IK International
Principles of Interactive Computer Graphics - Newman & Sproull,
McGraw Hill
Multimedia Systems - John F. Koegel Buford, Addison Wesley
Computer Graphics Principles & Practice - Foley etc. Addison Wesley
Procedural elements of Computer Graphics – Rogers McGraw Hill
Fundamentals of Computer Graphics and Multimedia - D.P. Mukherjee,
PHI
23
CSL-642: DATA WAREHOUSING AND DATA MINING
Note: Examiner will be required to set eight questions in all. Student
will be required to attempt FIVE questions in all. All questions shall
carry equal marks..
TOTAL CREDITS: 4 TIME : 3 HOURS
L T P (Examination)
4 - -
Syllabus
Introduction: The Evolution of Data Warehousing (The Historical Context), The
Data Warehouse - A Brief History, Characteristics, Operational Database Systems
and Data Warehouse (OLTP & OLAP), Today’s Development Environment, Data Marts,
Metadata.
Multidimensional Data Models: Types of Data and their Uses, from Tables and
Spreadsheets to Data Cubes, Identifying Facts and Dimensions, Designing Fact
Tables, Designing Dimension Tables, Data Warehouse Schemas, OLAP Operations.
Principles Of Data Warehousing (Architecture And Design Techniques):
System Processes, Data Warehousing Components, Architecture for a Data
Warehouse, Three-tier Data Warehouse Architecture, Steps for the Design and
Construction of Data Warehouses.
Implementation: Methods for the Implementation of Data Warehouse Systems.
Data Mining: Introduction: Motivation, Importance, Knowledge Discovery
Process, KDD and Data Mining, Data Mining vs. Query Tools, Kind of Data,
Functionalities, Interesting Patterns, Classification of Data Mining Systems,
Major issues, From Data Warehousing to Data Mining.
Data Preparation: Preprocess, Data Cleaning, Data Integration and
Transformation, Data Reduction.
Data Mining Primitives, Languages, and System Architectures.
Concept Description: An Overview of Descriptive Data Mining, Predictive
Data Mining, Methods for Concept Description.
Mining Association Rules: Association Rule Mining, Market Basket Analysis,
Types of Association Rules, Methods for Mining Association Rules in
Transaction Databases, Relational Databases and Data Warehouses.
Classification and Prediction: Methods for Data Classification and
Prediction.
Cluster Analysis Introduction: Types of data in Cluster Analysis, A
categorization of major Clustering Methods, Density-based methods, Grid-based
methods, Model-based clustering methods, Outlier Analysis.
Reference Books:
1. J Hanes, M. Kamber, “Data Mining Concepts and Techniques”, Morgan Kaufmann Publishers, 2002.
2. Glenn J. Myatt, “Making Sense of Data”, Wiley 2007. 3. Adriaans, “Data Mining”, Pearson Education. 4. Paolo Giudici, “Applied Data Mining – Statistical Methods for Business and
Industry”, Wiley 2003.
5. Berson, , Smith , “Data Warehousing Data Mining and OLAP”, TATA McGraw
Hill.
24
CSL-643: LINUX & SHELL PROGRAMMING
Note: Total 8 questions are to be set by the examiner/teacher
covering the entire syllabus uniformly. A candidate is required
to attempt any five questions. All questions shall carry equal
marks.
Total Credits: 4 Time: 3 Hours
L T P (Examination)
4 - -
SYLLABUS
Linux Startup
User accounts, accessing linux - starting and shutting
processes, Logging in and Logging out, Command line, simple
commands.
Shell Programming
Unix file system: Linux/Unix files, inodes and structure and
file system related commands, Shell as command processor,
shell variables, creating command substitution, scripts,
functions, conditionals, loops, customizing environment.
Regular Expressions and Filters
Introducing regular expressions patterns, syntax,
character classes, quantifiers, introduction to egrep, sed,
programming with awk and perl.
The C Environment
The C compiler, vi editor, compiler options, managing
projects, memory management, use of makefiles, dependency
calculations, memory management - dynamic and static memory,
building and using static and dynamic libraries, using ldd,
soname, dynamic loader, debugging with gdb.
Processes in Linux
Processes, starting and stopping processes,
initialization Processes, rc and init files, job control -
at, batch, cron, time, network files, security,
privileges, authentication, Password administration,
archiving, Signals and signal handlers, Linux I/O system.
References:
John Goerzen: Linux Programming Bible, IDG Books, New
Delhi, 2000.
Sumitabha Das: Your Unix - The Ultimate Guide, TMH, 2000.
Aho, Hopcroft and Ullman: The Design and Analysis of
Computer Algorithms, Addison Wesley.
25
CSL-644: SYSTEM PROGRAMMING
(Programme Elective-I 4th Semester)
Note: Total 8 questions are to be set by the examiner/teacher
covering the entire syllabus uniformly. A candidate is required
to attempt any five questions. All questions shall carry equal
marks.
Total Credits: 4 Time: 3 Hours
L T P (Examination)
4 - -
SYLLABUS
Introduction to System Software : Definition, Components
of System Software, evolution of System Software.
Assemblers : Elements of Assembly language programming,
overview of assembly process, design options- one pass
assembler & multi pass assembler.
Macroprocessors: Basic functions, Design options-Recursive
macro expansion, General purpose macro processors, Macro
processing within language translators.
Compilers : Overview of Compilation process, Programming
Language Grammar, Scanning, Parsing, Storage allocation,
Compilation of expressions, Compilation of Control
Structures, Code optimization, Design options-
Compiler-Compilers, P-code compilers, Interpreters.
Loaders & Linkage Editors : Loading, Linking &
Relocation, Program relocatibility, Overview of Linkage
editing, linking for program overlays.
Software Tools : Spectrum of Software tools, text
editors, Program generators, debug monitors, Programming
environments.
References :
Beck L. Leland, System Software, 3rd ed. (Addison Wesley -
2000)
Donovan J. John, System Programming, (Tata McGraw Hill)
Dhamdhere D.M, System programming and operating system,
(Tata Mc-Graw-Hill)
26
CSL-644: ADVANCED DATABASE SYSTEMS
(Programme Elective-I 4th Semester)
Note: Total 8 questions are to be set by the examiner/teacher
covering the entire syllabus uniformly. A candidate is required
to attempt any five questions. All questions shall carry equal
marks.
Total Credits: 4 Time: 3 Hours
L T P
4 - -
SYLLABUS
Extended E-R Model : Subclasses, Superclasses and
Inheritance, Specialization and Generalization, Constraints
and Characteristics of Specialization and Generalization.
Object-Oriented Data Model : Object Identity, Object
Structure, and Type Constructors, Encapsulation of Operations,
Methods and Persistence, Type Hierarchies and Inheritance,
Complex Objects, Polymorphism, Multiple Inheritence, Versions
and Configurations.
Object Relational Databases : Basic Concepts of Object-
Relational Systems, Object-Relational features of Oracle, An
Overview of SQL3, Object-Relational support in SQL3, Nested
Relational Data Model.
Further Normalization : Higher Normal Forms,
Multivalued Dependencies and Fourth Normal Form, Join
Dependencies and Fifth Normal Forms, Domain-Key Normal Form.
Database System Architectures : Centralized Systems,
Client-Server Systems, Server System Architecture, Parallel
Systems, Distributed Systems.
Distributed Databases and Client-Server Architecture
: Distributed Database Concepts, Data Fragmentation,
Replication and Allocation Techniques for Distributed Database
Design, Types of Distributed Database Systems, Overview of
Concurrency Control and recovery in Distributed Databases.
An Overview of Client-Server Architecture, Distributed
Databases in Oracle.
Web Interfaces to Databases : Web Fundamentals, Databases and
the Web, Web Servers and Sessions, Providing access to
Database on WWW. The Oracle Webserver.
Performance Tuning, Performance Benchmarks.
Enhanced Data Models for Advanced Applications : An overview
of Active Databases, Spatial Databases, Deductive Databases
and Multimedia Databases.
References :
Elmasri & Navathe: Fundamentals of Database systems, 3rd
Edition, Addison Wesley, New Delhi.
Korth & Silberschatz : Database System Concept, 4th Edition
McGraw Hill International Edition.
Raghu Ramakrishnan & Johannes Gehrke: Database Management
Systems, 2nd Edition, Mcgraw Hill International Edition.
C.J.Date : An Introduction to Data bases Systems 7th
Edition, Addison Wesley, New Delhi.
Bipin C.Desai : An Introduction to Database System, Galgotia
Publication, New Delhi
Abbey, Abramson & Corey : Oracle 8i-A Beginner's Guide Tata
McGraw Hill Publishing Company Ltd.
Ivan Bayross : SQL, PL/SQL-The Program Language of ORACLE,
BPB Publication, New Delhi.
27
CSL-644: HIGH SPEED NETWORKS
(Programme Elective-I 4th Semester)
Note: Total 8 questions are to be set by the examiner/teacher
covering the entire syllabus uniformly. A candidate is required
to attempt any five questions. All questions shall carry equal
marks.
Total Credits: 4 Time: 3 Hours
L T P
4 - -
SYLLABUS
HIGH SPEED LAN
Gigabit Ethernet: Overview of fast Ethernet, Gigabit
Ethernet – overview, specifications, layered protocol
architecture, network design using Gigabit Ethernet,
applications, 10GB Ethernet – overview, layered protocol
architecture, applications.
Wireless Networks: Existing and emerging standards,
Wireless LAN(802.11), Broadband Wireless(802.16),
Bluetooth(802.15) their layered protocol architecture and
security. Mobile Networks – GSM, CDMA and GPRS
Fibre Channel : Fibre channel physical characteristics –
topologies & ports, layered protocol architecture, class of
service, technology comparison, SAN overview and
architecture.
HIGH SPEED WAN
Frame Relay : Protocol architecture, frame format, routing.
ISDN & B-ISDN : Channels, interfaces, addressing, protocol architecture,
services.
ATM : Virtual circuits, cell switching, reference model, traffic
management.
INTERNET SUITE OF PROTOCOLS
Internet Layer : IPV4 and IPV6, IP addressing, ARP, IP routing(OSPF &
BGP), internet multicasting, mobile IP.
Transport Layer : UDP/TCP protocols & architecture, TCP connection
management, wireless TCP.
Application Layer : DNS, FTP, Voice over IP, audio & video compression.
References:
High Speed Networks - William Stallings, Pearsons
Publication.
Computer Networks and Internets - Douglas E.Comer, Addison
Wesley.
An Engineering Approach to Computer Networking - S.Keshav,
Addison Wesley.
High Speed Network – Tere Parnel, TMH Publications.
28
CSL-644: OBJECT ORIENTED MODELING
(Programme Elective –I)
Note: Note: Total 8 questions are to be set by the
examiner/teacher covering the entire syllabus uniformly. A
candidate is required to attempt any five questions. All
questions shall carry equal marks.
TOTAL CREDITS : 4 TIME : 3 HOURS
L T P (Examination)
4 -- --
Syllabus
UML: Principles of modeling, UML Things – Structural, Behavioral,
Grouping, Annotational. Relationships in UML – Dependency,
Association, Generalization, Realization. Diagrams in UML – Class
diagram, Object diagram, Use-Case diagram, Sequence diagram,
Collaboration diagram, Statechart diagram, Activity diagram,
Component diagram, Deployment diagram. UML Semantic Rules – Names,
Scope, Visibility, Integrity, Execution. Mechanisms in the UML –
Specifications, Adornments, Common Divisions, Extensibility
Mechanisms.
Object-Orientation: Object, Class, Abstraction, Encapsulation,
Modularity, Hierarchy, Typing, Concurrency, Persistence of objects.
Purpose of modeling, Object Modeling Technique (OMT) methodology,
Object Model – Links and Associations, Link attributes & Link
class, Multiplicity, Role names, Ordering, Qualification,
Aggregation, Generalization & Inheritance, Abstract class,
Metadata, Constraints. Constructing object model.
Dynamic Modeling: Event, State, Activity, Action, Conditions,
Scenario, Event Trace diagram, Statechart, Nested state diagrams,
event generalization, concurrency, entry & exit actions, internal
actions, synchronization of concurrent activities.
Functional Modeling: Data Flow Diagram (DFD), nested DFD, control
flows. Adding operations, Relationships between object model,
dynamic model and functional model.
System Design: Breaking a system into subsystem, identifying
concurrency, allocating subsystems to processors and tasks,
management of data stores, handling global resources, choosing
software control implementation, handling boundary conditions,
setting trade-off priorities.
Object Design: Combining object, dynamic and functional models,
Designing algorithms, design optimization, implementation of
control, adjustment of inheritance, design of associations, object
presentation, physical packaging, object-oriented style guidelines
– reusability, extensibility, robustness, programming-in-the-large.
Reference Books:
1. The Unified Modeling Language User Guide, Grady Booch, James Rumbaugh, Ivar Jacobson, Pearson education, 2007
2. Object-Oriented Modeling and Design with UML, M. Blaha, J. Rumbaugh, Pearson Education-2007
3. Object-Oriented Modeling and Design, J. Rumbaugh, M. Blaha, W. Premerlani, F. Eddy, W. Lorensen, Prentice Hall of India-
1998
4. Object-Oriented Analysis & Design with the Unified Process, Satzinger, Jackson, Burd, Thomson-2007
5. Object Oriented Analysis & Design, Grady Booch, Addison
Wesley-1994
29
CSL-644: Theory of Computation
(Programme Elective-I 4th Semester)
Note: Total 8 questions are to be set by the examiner/teacher covering
the entire syllabus uniformly. A candidate is required to attempt any
five questions. All questions shall carry equal marks.
TOTAL CREDITS: 4 TIME : 3 HOURS
L T P (EXAMINATION)
4
Syllabus(Examination)
Theory of Computation: Formal Language, Need for formal computational models,
Non-computational problems, diagonal argument and Russel’s paradox.
Deterministic Finite Automaton (DFA), Non-deterministic Finite Automaton
(NFA), Regular Languages and regular sets, Equivalence of DFA and NFA,
Kleen's characterization theory for sets accepted by finite automata,
Minimizing the number of states of a DFA, Non-regular languages and pumping
lemma.
Pushdown Automaton (PDA), Deterministic Pushdown Automaton (DPDA), Non-
equivalence of PDA and DPDA.
Context Free Grammars: Greibach Normal Form (GNF) and Chomsky Normal Form
(CNF), Ambiguity, Parse Tree Representation of Derivations, Equivalence of
PDA’s and CFG’s, Parsing techniques for parsing of general CFG’s-Early’s,
Cook-Kassami-Younger (CKY), and Tomita’s parsing.
Linear Bounded Automata (LBA): Power of LBA, Closure properties.
Turing Machine (TM), One tape, multitape, the notion of time and space
complexity in terms of TM, construction of TM for simple problems,
Computational complexity.
Chomsky Hierarchy of languages: Recursive and recursive-enumerable languages.
Reference Books:
Lewis, H.R. & Papadimitrious, C.H. Elements of the theory of computation. PHI
Salomma, A.K. Formal languages, Academic press.
Hopcroft, J. E. & Ullman, J. D. Formal languages and their relation
to Automata Addison-Wasley
E. V. Krishnamurthy, Introductory theory of computer science East-West press
Pvt. Ltd.
Zoha Mauna, Mathematical theory of computation, Wiley inter-science.
John Minsky, Theory of computation, PHI.
Greenberg M., Introduction to Automata Theory, Addison Wesley.
30
CSL-644: Computer Architecture And Parallel Processing (Programme Elective-I 4th Semester)
Note: Total 8 questions are to be set by the examiner/teacher covering
the entire syllabus uniformly. A candidate is required to attempt any
five questions. All questions shall carry equal marks.
TOTAL CREDITS : 4 TIME : 3 HOURS
L T P
4 -- --
Syllabus Fundamentals : Computational model. Evolution of
computer architecture, process, thread, concurrent and parallel
execution, types and levels of parallelism, classifications
of parallel architectures. Relationships between languages
and parallel architectures.
Instruction-Level-Parallel Processors : Dependencies
between instruction. Principles of Pipelining. Pipelined
instruction processing. Synchronous & asynchronous pipeline.
Linear Pipeline-clocking & timing control, speedup, efficiency
& throughput. Non linear pipeline- reservation table, latency
analysis, collision free scheduling, internal data
forwarding. Superscalar pipeline design- structure, data
dependencies, pipeline stalling, in-order issue, out of
order issue. VLIW architecture. Branch handling- delayed
branching, branch processing, multiway branching,
guarded execution. Code sceduling- basic block
scheduling, loop scheduling, global scheduling.
Memory Hierarchy Technology : inclusion, coherence and
locality, virtual memory models, TLB, paging and
segmentation, memory replacement policies, cache addressing
models, cache performance issues, interleaved memory
organization.
Shared-Memory MIMD architectures : Dynamic
interconnection networks- shared path, switching networks-
crossbar & multistage networks. Cache coherence problem,
Hardware based cache coherence protocol-Snoopy cache
protocol, directory scheme, scalable coherent interface,
hierarchical cache coherence protocol. UMA, NUMA, CC-NUMA and
COMA multiprocessors.
References :
Sima, D. et al., Advanced Computer Architecture, Addison
Wesley, 2000
Hwang, Kai, Advanced Computer Architecture, McGraw Hill,
International Ed.
Hwang Kai, Briggs Faye A., Computer Architecture and
Parallel Processing, McGraw Hill, International Ed.
Kain, Richard Y., Advanced Computer Architecture, PHI, 1999
31
L-645: MICROPROCESSORS AND INTERFACES
(Programme Elective-II 4th Semester)
Note: Total 8 questions are to be set by the examiner/teacher covering
the entire syllabus uniformly. A candidate is required to attempt any
five questions. All questions shall carry equal marks.
Total Credits: 4 Time: 3 Hours
L T P (Examination)
4 - -
SYLLABUS
Introduction to Microprocessor and Microcomputer :
Historical background, modern microprocessors and
microcomputers, architecture of pentium processor, real and
protected modes of operations, addressing modes and
instruction set of pentium processor, concept of RISC and CISC
microprocessors.
Memory Interface : Memory devices, address decoding, 8/16/32/64
- bit memory interfaces.
Input-Output Interfaces : Introduction to I/O interfaces,
I/O mapped I/O and memory mapped I/O, basic input interface and
basic output interface, I/O port address decoding, 8/16/32 -
bit wide I/O ports, 82C55 PPI.
Interrupt Structure : Basic interrupt processing,
interrupt instructions of pentium, operations of real and
protected mode interrupts, 8259 PIC and its programming,
expanding interrupt structure by cascading 8259's.
Direct Memory Access : DMA data transfer and basic
DMA operations, 8237 DMA controller, its programming.
Bus Interface : The 8/16 - bit ISA bus and its interfacing
with input & output ports, EISA 32 - bit bus and its
interfacing, VESA and VL busses, PCI and PCMCIA busses.
REFERENCES :
The Intel Microprocessors : Architecture, Programming, and
Interface. By Berry B. Brey (PHI).
Microcomputer Systems : Architecture, Programming, and
Design. By Liu and Gibson (PHI).
Microprocessors By DV Hall.
32
CSL-645: SOFTWARE PROJECT MANAGEMENT
(Programme Elective-II 4th Semester)
Note: Total 8 questions are to be set by the examiner/teacher
covering the entire syllabus uniformly. A candidate is required
to attempt any five questions. All questions shall carry equal
marks.
Total Credits: 4 Time: 3 Hours
L T P (Examination)
4 - -
SYLLABUS
Conventional Software Management. Evolution of software
economics. Improving software economics : reducing product
size, software processes, team effectiveness, automation
through software environments. Principles of modern software
management.
A software management process framework : Life cycle phases
- inception, elaboration, construction and training
phase. Artifacts of the process - the artifact sets,
management artifacts, engineering artifacts, pragmatics
artifacts. Model based software architectures. Workflows
of the process. Checkpoints of the process.
Software management disciplines : Iterative process
planning. Project organizations and responsibilities. Process
automation. Project control and process instrumentation -
core metrics, management indicators, life cycle
expectations. Process discriminants.
References :
Software Project management, Walker Royce, Addison Wesley,
1998.
Project management 2/e, Maylor.
Managing the Software Process, Humphrey.
Managing Global Software Projects, Ramesh, THM, 2001.
33
CSL-645: MANAGEMENT INFORMATION SYSTEMS
(Programme Elective-II 4th Semester)
Note: Total 8 questions are to be set by the examiner/teacher
covering the entire syllabus uniformly. A candidate is required
to attempt any five questions. All questions shall carry equal
marks.
Total Credits: 4 Time: 3 Hours
L T P (Examination)
4 - -
SYLLABUS
Background Meaning, Nature, Need, Role, Importance, Evolution of
management through information system; Relatedness of MIS with
management process. Management functions and decision making.
Concept of balance MIS effectiveness and efficiency criteria.
Development of Management Information System: Introduction,
Information system planning, Motivational forces behind development
of information system, Principles for information system
development, SDLC for MIS development process.
Development of MIS: Methodology and Tools techniques for
systematic identification, implementation, evaluation, and
maintenance of MIS.
Control and Security Issues in Management Information Systems:
Control, Why need to Control MIS, Types of Control, Audit in MIS,
Security Hazards, Security Techniques.
Case studies: To introduce business problems and to discuss various
stages for understanding the systems development process.
References:
Management Information Systems: A Computer oriented approach for
business applications by Dharminder Kumar, Sangeeta Gupta, Excel
books, 2006, New Delhi.
James A.O'Brien, Management Information Systems.
34
CSL-645: PRINCIPLES OF PROGRAMMING LANGUAGES (Programme Elective-I 4th Semester)
Note: Total 8 questions are to be set by the examiner/teacher covering
the entire syllabus uniformly. A candidate is required to attempt any
five questions. All questions shall carry equal marks.
TOTAL CREDITS: 4 TIME : 3 HOURS
L T P
4 -- --
Syllabus Preliminaries - language paradigms, language criteria, language design trade-offs, influences on language design,
bindings, type checking, and scopes, variables and data types: primitive data types, variables, structured data
types. Abstraction: data abstraction, control abstraction, procedural abstraction.
Formal languages and automata - The Chomsky hierarchy of formal languages, regular grammars, regular
expressions, finite automata, Context-free grammars: pushdown automata, ambiguous grammars.
Imperative programming - structured programming, procedure activations: parameter passing methods, scope
rules, and activation records.
Object oriented programming - messages, methods and encapsulation, classes and polymorphism,
inheritance and object orientation, design issues for object oriented languages.
Functional programming - Features of functional languages, implementing functional languages, applications of
functional languages.
Logic programming - Formal logical systems, implementations and applications.
Languages for databases - manipulating relational databases using SQL.
Language constructs for parallel processing - the paradigm, multiple processes, synchronization of cooperating
processes.
Reference Books:
1. Pratt E. Terrence & Zelkowitz V. Marvin, Programming Languages – Design & Implementation, Prentice
Hall of India.
2. Appleby Doris & VandeKopple J. Julius, Programming languages-Paradigm and practice 2nd ed.
(Tata McGraw Hill - 1999)
3. Sebesta W. Robert, Concepts of programming languages 4th ed.,(Addison Wesley - 2000)
4. Sethi Ravi, Programming languages 2nd ed. (Addison Wesley - 2000)
35
CSL-645: EMBEDDED SYSTEMS
(Programme Elective-II 4th Semester)
Note: Total 8 questions are to be set by the examiner/teacher covering
the entire syllabus uniformly. A candidate is required to attempt any
five questions. All questions shall carry equal marks.
TOTAL CREDITS : 4 TIME : 3 HOURS
L T P
4 -- --
Syllabus Introduction to Embedded Systems : Definition of Embedded Systems, Difference between General Purpose
Computers & Embedded Systems, Categories of Embedded Systems, Requirements of Embedded Systems, Trends
in Embedded Systems: Processors, Memory, RTOS, Embedded OS, Programming Languages, Development Tools.
Digital Signal Processing : Review of DSP concepts, DSP processors, DSP Architecture, Modulation techniques
Embedded Hardware : Princeton (Von Neumann) VS Harvard Architecture, CISC VS RISC, Microcoded VS Hard
Wired Design, Processor Internal Architecture, Memory Organization, ISA (Instruction Set Architecture), Interrupts
& Interrupt Handling, Peripheral for Processors like ADC, DAC, RTC, LCD, LED, Switches, etc, Advanced
Processors like ARM, i960 etc.
Embedded Software : Development Tools for Embedded Software, Assemblers, Compilers, linkers, Profilers etc.,
Coding Strategies for obtaining Optimized Time & Space requirements, Simulators & Emulators, Debugging
Embedded Software, Testing Embedded Software, Device Drivers.
RTOS : Real Time OS Kernel Architecture, Embedded Operating Systems, Mobile Operating Systems
Development for embedded Systems : Embedded system development process, Determine the requirements, Design
system architecture, Choosing the OS, Choosing processor, Choosing development Platform, Choosing
Programming Language, Coding Issues, Code optimization, Efficient Input –output, Testing & Debugging, Verify
software on Host & embedded system
Reference Books :
Dreamtech Software Team, "Programming for Embedded Systems: Cracking the Codes"
Daniel Wesley lewis, "Fundamentals of Embedded Software: Where C & Assembly Meet"
Jack Ganssle “ The art of designing Embedded systems”, Newnes, 1999
David E Simon, “ An embedded Software Primer”, Pearson Education Asia, 2001.
36
CSL-651: JAVA PROGRAMMING AND INTERNET APPLICATIONS
Note: Total 8 questions are to be set by the examiner/teacher
covering the entire syllabus uniformly. A candidate is required
to attempt any five questions. All questions shall carry equal
marks.
Total Credits: 4 Time: 3 Hours
L T P (Examination)
4 - -
SYLLABUS
Internet Applications : Introduction to internet; E-
Mail- Architecture & services, user agent, message format &
transfer, SMTP; World Wide Web(WWW) - Domain Name System, The
Client side, The Server side, Creating and locating
information on the web, search engines, URL's, HTTP, FTP,
Telnet; Web Browsers, Chat & Bulletin Board, USENET & NNTP
(Network News Transfer Protocol).
JAVA and The Internet : The JAVA programming language and
its characteristics; Java run- time environment; Java compiler;
Java developers kit; running Java applications and Java
applets.
JAVA programming : Elements of Java: Data types, scalar
data types, operators & expressions, control structures.
Class, objects & methods, constructors, finalizer, visibility
controls, array, string & vectors, inheritance,
interfaces, packages multithreading, applet programming.
Exception Handling- defining and throwing exceptions,
creating your own exceptions.
Input/Output: streams, byte and character stream, the
class Printstream, data streams, StringTokenizer class,
stream tokenizers.
Delegation Event Model. AWT classes, AWT controls,
Layout managers & menues.
References :
Computer Networks and Internets, second edition - Douglas E.
Comer, Addison-Wesley, 2000
Programming the Internet with Java, revised edition-
Darrel Ince & Adam Freeman, Addison-wesley,2000
Programming with Java - E.Balaguruswami, Second Edition,
TMH-1998.
The Complete Refernce Java 2, Fourth edition -
Herbert Schildt (TMH),2001
A Programmer's Guide to Java Certification, Mughal
K.A., Rasmussen R.W., Addison-Wesley,2000
37
CSL-652: Software Testing and Quality Assurance
Note: Total 8 questions are to be set by the examiner/teacher
covering the entire syllabus uniformly. A candidate is required
to attempt any five questions. All questions shall carry equal
marks.
TOTAL CREDITS : 4 TIME : 3 HOURS
L T P (EXAMINATION)
4 -- --
Syllabus Introduction: What is software testing and why it is so hard?, Error, Fault, Failure, Incident, Test Cases, Testing
Process and its Methodology, Limitations of Testing.
Software Testing Strategies: Unit, Integration, System, Alpha and Beta Testing, Load and Stress Testing, Ticking
Box Testing, Configuration and Compatibility Testing, Regression Testing.
Functional Testing: Boundary Value Analysis, Equivalence Class Testing, Decision Table Based Testing, Cause
Effect Graphing Technique.
Structural Testing: Path testing, DD-Paths, Cyclomatic Complexity, Graph Metrics, Data Flow Testing, Mutation
testing.
Reducing the number of test cases: Prioritization guidelines, Priority category, Scheme, Risk Analysis, Regression
Testing, Slice based testing
Object Oriented Testing: Issues in Object Oriented Testing, Class Testing, GUI Testing, Object Oriented
Integration and System Testing.
Testing Tools: Static Testing Tools, Dynamic Testing Tools, Characteristics of Modern Tools.
Software Testing: Meaning, scope and ; Functional and structural testing, Ticking Box testing; mutation
testing, software testing strategies, alpha, Beta testing etc. Object Oriented Testing: Class Testing, GUI Testing,
Object Oriented Integration and System Testing.
Software Quality concepts: Meaning and scope, software quality factors, software quality metrics, relationship
between quality factors and quality metrics, quality management system,
Concepts of Quality Control, Quality Assurance, Quality Management - Total Quality Management; Cost of
Quality; QC tools, Business Process Re-engineering - Zero Defect, Six Sigma, Quality Function Deployment,
Benchmarking, Statistical process control.
Software measurement: Fundamentals of measurement, Measurements in Software Engineering, Measurement of
internal product attributes - size and structure, External product attributes - measurement of quality, Software quality
metrics - Software Process, Project and Product Metrics, metrics for software maintenance.
Quality assurance models: ISO-9000 Series and SEI-CMM standards of software quality assurance. People
Capability Maturity Model, Capability Maturity Model Integration, Malcolm Baldrige Award,FCMM..
Software Quality Assurance related topics
Software Process - Definition and implementation; internal Auditing and Assessments; Software testing - Concepts,
Tools, software reviews, formal technical reviews, Inspections & Walkthroughs; correctness proof, statistical quality
assurance, clean room software engineering.
REFERENCE BOOKS:
1. Roger S. Pressman, “Software Engineering – A Practitioner’s Approach”, Fifth Edition, McGraw-Hill
International Edition, New Delhi, 2001.
2. Boris Beizer, “Black-Box Testing – Techniques for Functional Testing of Software and Systems”, John
Wiley & Sons Inc., New York, 1995.
3. Boris Beizer, “Software System Testing and Quality Assurance”, Van Nostrand Reinhold, New York,
1984. 4. Boris Beizer, “Software Testing Techniques”, Second Volume, Second Edition, Van Nostrand Reinhold,
New York, 1990.
5. Aditya P Mathur, “Fundamentals of Software Testing”, Pearson Education
38
CSL-653: WEB ENGINEERING
Note: Total 8 questions are to be set by the examiner/teacher covering the
entire syllabus uniformly. A candidate is required to attempt any five
questions. All questions shall carry equal marks.
Total Credits: 4 Time: 3 Hours
L T P (Examination)
4 - -
SYLLABUS
Information Architecture The Role of Information Architect,
Collaboration and Communication, Organizing information,
Organizational challenges, Organizing Web Sites and Intranets, Creating
Cohesive Organization Systems, Designing Navigation Systems, Types of
navigation Systems, Integrated Navigation Elements, Remote Navigation
Elements, Designing Elegant Navigation Systems, Searching your Web Site,
Designing the Search Interface, Indexing the Right Stuff, To Search or Not To
Search, Grouping Content, Conceptual Design; High-Level Architecture
Blueprints, Architectural Page Mockups, Design Sketches.
Dynamic HTML and Web Designing HTML Basic Concepts, Good Web Design,
Process of Web Publishing, Phases of Web Site development,
Structure of HTML documents, HTML Elements - Core attributes, Language
attributes, Core Events, Block Level Events. Text Level Events, Linking
Basics, Linking in HTML, Images and Anchors, Anchor Attributes, Image
Maps, Semantic Linking Meta Information, Image Preliminaries, Image
Download issues, Images as Buttons, Introduction to Layout: Backgrounds,
Colors and Text, Fonts, Layout with Tables, Advanced Layout : Frames and
layers, HTML and other media types. Audio Support in Browsers, Video
Support, Other binary Formats. Style Sheets, Positioning with Style
sheets. Basic Interactivity, and HTML: FORMS, Forms Control, New and
emerging Form Elements.
CGI using PERL Introduction to CGI, Alternative Technologies, The Hypertext
Transport Protocol, URLs, HTTP, Browser Requests, Server Responses,
Proxies, Content Negotiation, the Common Gateway Interface, The CGI
Environment, Environment Variables. CGI Output, Forms and CGI, Sending Data
to the Server, Form Tags, Decoding Form Input, Architectural Guidelines,
Coding Guidelines, Efficiency and Optimization.
Java Server Pages Basics, Integrating Scripts in JSPs, JSP Objects and
Components, configuring and troubleshooting, JSP: Request and response
objects, Retrieving the Contents of a an HTML form, Retrieving a Query
String, Working with Beans. Cookies, Creating and Reading Cookies. Using
Application Objects and Events.
XML Relationship between HTML, SGML, and XML, Basic XML, Valid Documents.
Ways to use XML, XML for Data Files, Embedding XML into HTML documents,
Converting XML to HTML for DISPLAY, Displaying XML using CSS and XSL,
Rewriting HTML as XML, The future of XML.
References:
Thomas A Powell, HTML-The Complete Reference,Tata McGraw Hill.
Scott Guelich, Shishir Gundavaram, Gunther Birzniek; CGI Programming
with Perl 2/e. O'Reilly.
Doug Tidwell, James Snell, Pavel Kulchenko; Programming Web Services with
SOAP, O'Reilly.
Pardi, XML in Action, Web Technology, PHI.
Yong, XML Step by Step, PHI.
Aaron Weiss, Rebecca Taply, Kim Daniels, Stuven Mulder, Jeff Kaneshki, Web
Authoring Desk Reference, Techmedia Publications.
39
CSL-654: .NET USING C#
(Programme Elective-III)
Note: Total 8 questions are to be set by the examiner/teacher covering the
entire syllabus uniformly. A candidate is required to attempt any five
questions. All questions shall carry equal marks.
Total Credits: 4 Time: 3 Hours
L T P (Examination)
4 - -
Syllabus
.NET Framework: Introduction to Three-Tier Architecture, Overview of Distributed Computing, Origin of NET
Technology, overview of .NET Framework , The .NET Framework Class Library , NET Programming Languages,
Role of MSIL and Metadata, NET types and NET Namespaces.
Understanding Common Language Runtime (CLR) – The Common Type Specification (CTS) – The Common
Language Specifications (CLS) – Assemblies - .NET Base Classes – CLR Debugger.
Visual Studio NET :Familiarization with visual studio .NET IDE , Design Window, Code Window, Server ,
Explorer, Toolbox, Docking Windows, Properties Explorer, Solution Explorer, Object Browser, Dynamic Help,
Task List Explorer, Features of VS.NET, Creating a Project, Add Reference, Build the Project, Debugging a
Project. Developing C# Applications Using Visual Studio NET.
Evolution of C#: Overview of C#, C# and .NET, similarities & differences from JAVA, Structure of C# program.
Language features: Type system.
C#: Introduction Data Types, Identifiers, variables & constants, C# statements, Data Type – Operators – Flow
Control and Iteration ,Object-Oriented Programming in C# - Encapsulation, Inheritance , and Polymorphism, Object
and Classes, Basics of C# Classes , Arrays and Strings ,Boxing and Unboxing, – Exception Handling and Error
Handling in C#, Garbage Collection, Input and Output(Directories ,Files, and Streams).Properties and Indexers,
Delegates and their usefulness and Events, Attributes, Reflection – Interoperability – System Collections,
versioning. I/O in C# and Windows Applications.
Introduction to VB.NET: Event Driven Programming, The Just-In-Time Compiler, VB.NET Development
Environment Creating Applications, Building Projects, Using simple components, Running VB.NET
applications
Mastering VB Language: Data, Operators, Conditionals and Loops, Procedures, Error Handling, Classes and
Objects.
Windows Applications in VB .NET: Windows Forms, Text Boxes, Buttons, Labels, Check Boxes, and Radio
Buttons.,List Boxes, Combo Boxes. Picture Boxes, Scrollbars, Splitters, Timer, Menus, Built-in Dialogs,
Image List, Tree Views, List Views, Toolbars, Status Bar and Progress bars.
Object Oriented Programming in VB .NET: Class and Object, Properties, methods and events, Constructors and
Destructors, Method overloading, Inheritance, Access modifiers: Public, Private, Protected, Friend, Overloading and
Overriding, Interfaces, Polymorphism
File handling: File handling using FileStream, Stream Writer, StreamReader, BinaryReader, BinaryWriter classes,
File and Directory Classes.
Architecture of ADO.NET : Connected and Disconnected Database, Create Connection using ADO.NET Object
Model, Connection Class, Command Class, DataAdapter Class, Dataset Class. Display data on data bound Controls
and Data Grid.
Database Accessing on web applications: Data Binding concept with web, creating data grid, Binding standard web
server controls. Display data on web form using Data bound controls.
Databases in VB .NET and C#: Database Connections, Data adapters, and datasets, Data Reader, Connection to
database with server explorer ,Multiple Table Connection ,Data binding with controls like Text Boxes, List Boxes,
Data grid etc.,Navigating data source ,Data Grid View, Data form wizard ,Data validation
Connection Objects, Command Objects, Data Adapters, Dataset Class
40
ASP.NET :Overview of ASP.NET framework, Understanding ASP.NET Controls, Applications Web servers,
installation of IIS.
Web forms, web form controls -server controls, client controls, web forms & HTML, Adding controls to a web form
,Buttons, Text Box , Labels, Checkbox, Radio Buttons, List Box, etc.Running a web Application, creating a
multiform web project.
Form: Validation: Client side validation, server Side validation, Validation Controls : Required Field Comparison
Range. Calendar control, Ad rotator Control, Internet Explorer Control. State management- View state, Session
state, Application state,
XML :Writing datasets to XML, Reading datasets with XML. Web services: Introduction, Remote method call
using XML, SOAP, web service description language, building & consuming a web service, Web Application
deployment.
Reference Books :
1.Francesco Balena,” Programming Microsoft Visual Basic.NET “
2. Jefrey R. Shapiro,”The Complete Reference -Visual Basic .NET “
3 steven holzner ,”VB.NET Black Book”,dreamtech
4. “C# programming”, wrox publication
5. Black,”C# programming “ , Matt telles
6. Shirish Chavan, “Visual Basic.Net”, Pearson Education
7. Stephen C. Perry.Atul Kahate “Essential of .NET and Rlated Techonologies”, Pearson
Education
41
CSL-654: COMPILER CONSTRUCTION
(Programme Elective III 5th Semester)
Note: Total 8 questions are to be set by the examiner/teacher
covering the entire syllabus uniformly. A candidate is required
to attempt any five questions. All questions shall carry equal
marks.
Total Credits: 4 Time: 3 Hours
L T P (Examination)
4 - -
SYLLABUS
Introduction to Compilation: Compilers and phases of
compilation, analysis-synthesis model of translation,
compiler construction tools.
Lexical Analysis : Process of lexical analysis, finite
state automata, DFA and NFA, recognition of regular
expressions, LEX.
Syntax Analysis : Process of syntax analysis, types of
grammar, top-down and bottom-up parsing techniques, parser
generator.
Intermediate Code Generation : Intermediate languages,
generating intermediate code for declarative statement,
assignment statement, boolean expression, and case statement.
Code Optimization : Introduction to code optimization,
potential cases of code optimization, optimization of basic
blocks, loops in flow graphs, code improving transformation.
Code Generation : Issues in the design of a code generator,
the target machine, dynamic storage management, translating
basic blocks, a simple code generator,peephole optimization,
directed acyclic graphs and basic blocks, code generation
from directed acyclic graphs.
Overview of syntax directed translation scheme.
REFERENCES :
Compilers : Principles, Techniques & Tools, By Aho, Ullman,
& Sethi (Addison Wesley)
Principles of Compiler Design, By Aho & Ullman (Narosa
Publications)
Practice & Principles of Compiler Building with C, By Henk
Alblas et al. (PHI)
Principles of Compiler Design, By Trembley & Sorenson
(McGraw Hill)
42
CSL-654: NEURAL NETWORKS
(Programme Elective III 5th Semester)
Note: Total 8 questions are to be set by the examiner/teacher
covering the entire syllabus uniformly. A candidate is required
to attempt any five questions. All questions shall carry equal
marks.
Total Credits: 4 Time: 3 Hours
L T P Examination
4 - -
SYLLABUS
Fundamental of Neural Networks
Overview of Biological neurons, neuron concept, single
layer neural network, notation and representation of
neural networks, training of ANNs.
Single Layer Neural network
Representation of preceptron and issues, perceptron learning
and training, classification, Linear seperability,
structure of Hopfield nets, training, application and
stability.
Backpropagation
Backpropagation training algorithm, application of
back propagation, advance algorithms.
Counter propagation networks
Kohonen network, Grossberg layer, application of
counter propagation, Image classification.
Multilayer Neural Networks
BAM structure retrieving a stored association,encoding
the association, memory capacity, ART architecture,ART
classification operation,cognitron and neocognitron.
References:
Jock. M.Juroda, "Artificial Neural Systems".
Kevin Gurney,"Introduction to Neural Networks: (UCL Press).
Philip D. Wasserman,Neural Computing and Practice, ANZA
Research Inc.
43
CSL-654: SECURITY OF INFORMATION SYSTEMS
(Programme Elective III 5th Semester)
Note: Total 8 questions are to be set by the examiner/teacher
covering the entire syllabus uniformly. A candidate is required
to attempt any five questions. All questions shall carry equal
marks.
Total Credits: 4 Time: 3 Hours
L T P (Examination)
4 - -
SYLLABUS
Overview of Information Security : Basic Concepts, Cryptosystems,
Cryptoanalysis, Ciphers & Cipher modes.
Symmetric Key Cryptography : DES, AES.
Asymmetric Key Cryptography : RSA algorithm, Key management protocols,
Diffie Hellman Algorithm
Digital Signature : Digital Signatures, Public Key Infrastructure
Program Security : Security problems in Coding, Malicious Logic,
Protection.
Database Security : Access Controls, Security & Integrity Threats, Defence
Mechanisms.
.Net Security : User based security, Code access security, form
authentication.
LAN Security : Threats, Authentication & access control, Secured
communication Mechanisms (IPSec, Kerberos, Biometric, PKI), Secured Design
for LAN.
Email & Transaction Security Mechanisms : Privacy Enhanced Mail(PEM),
S/MIME, SET protocol, Client-Server Security on web.
Wi-Fi & IEEE 802.11 Security : Protocol architecture, WEP, Access controls
References:
"Security in Computing (Second Edition)", Charles P. Pfleeger, 1996,
Prentic-Hall International, Inc.,
"Applied Cryptography Protocols, Algorithms, and Source Code in C (Second
edition)", Bruce Schneier, 1995, John
"Security Technologies for the World Wide Web", Rolf Oppliger, Artech House,
Inc.
"Digital Certificates Applied Internet Security", Jalal Feghhi, Jalli Feghhi and
Peter Williams, Addison Wesley Longman,
44
CSL-654: DIGITAL IMAGE PROCESSING
(Programme Elective III 5th Semester)
Note: Total 8 questions are to be set by the examiner/teacher
covering the entire syllabus uniformly. A candidate is required
to attempt any five questions. All questions shall carry equal
marks.
Total Credits: 4 Time: 3 Hours
L T P (Examination)
4 - -
Syllabus
Digital Image Fundamental: Introduction, Origin, Areas of Image Processing, Steps in Digital Image
Processing, Component of Image Processing System, Element of Visual perception, Light &
Electromagnetic spectrum, Image sensing and acquisition, Sampling & Quantization, Neighboring Pixel
Morphological image Processing : Morphological Algorithms- Boundary Extraction, Region Filling, Extraction of
Connected Components, Convex Hull, Thinning, Thickening, Skeleton, Pruning, Extension to Gray Scale Images-
Dilation, Erosion, Application of Gray Scale Morphology
Image Enhancement, Restoration and Wavelets : Image Enhancement : Spatial Filtering, Fourier Transform &
Frequency Domain, Homomorphic Filtering, Restoration : A Model of image Degradation/ Restoration Process ,
Color Image Processing : Color Processing : Color fundamentals, Color Model- RGB, CMY, CMYK, HSI, Color
Transfomation and Segmentation, Wavelets : Mutiresolution Image Processing, Wavelet Transformation in one &
two dimensions, Fast Wavelet Transform, Wavelet packet.
Image Compression & Segmentation : Image Compression- Models,Error free compression, Lossy Compression,
Image Compression Standards.
Image Segmentation – Detection-Point, Line, Edge, Edge Linking & Boundary Detection- Local processing, Global
Processing vis the Hough Transform and Graph Theoretic Technique. Thresholding, Region Base Segmentation,
Segmntation by Morphological Watersheds
Representation, Descripition & Object Recognition : Description : Component of Decription, Boundary ,
Regional Descriptors and Relational Descriptors , Object Recognition : Pattern and Pattern Classes, Recognition
based on Decision Theoretic Methods, Structural Methods
Reference Books
1. Rafael C. Gonzalez , “ Digital Image Processing “ , Prentice Hall
2 William K Pratt, “Digital Image Processing “ John Willey (2001)
3. Millman Sonka, Vaclav hlavac, ” Image Processing Analysis and Machine Vision” Thompson Press.
4. A.K. Jain, “Fundamentals of Digital Image Processing”, Prentice Hall of India
5..Chanda Dutta Magundar , “Digital Image Processing and Applications” , Prentice Hall of India
45
Revised Scheme (IIIrd Semester) of M.Tech.(CSE)
(wef session 2010-11)
SEMESTER –III
Paper Nomenclature of Paper Total Credits
CSD-731 Dissertation and Seminar –I 5
Programme Elective-II 3
Programme Elective-III 3
Open Elective –I 4
Presentation and Communication Skills -
(On qualifying basis only non-credit course)
Total: 15
CSD-731 (Dissertation and Seminar –I):
To be evaluated by committee constituted by Chairman, CSE.
List of Elective for programme elective –II & III (III Semester)
CSL-731 Mobile and Wireless Communication
CSL-732 Performance Modeling
CSL-733 Securities of Information Systems
CSL-734 Data Mining Concepts and Techniques
CSL-735 Research Methodologies
List of Elective for open elective –I (III Semester)
To be offered by other M.Tech. departments of university
46
CSL-734: Data Mining Concepts and Techniques
MTech CSE Programme Elective-II/III
Note: Total eight questions are to be set by the examiner/teacher covering the entire syllabus
uniformly. A candidate is required to attempt any five questions. All questions shall carry equal
marks.
Total Credits: 3
L T P
3 - -
SYLLABUS
Introduction to data mining and its importance, data mining functionalities, Data warehouse,
multidimensional data model, data warehouse architecture.
Data Pre-processing: Data cleaning, Data integration and transformations, data reduction,
Dicretization and concept hierarchy generation, feature selection.
Association rule mining, apriori algorithm and finding frequent item sets, mining multilevel
association rules. Association mining to correlation analysis, Mining fuzzy association rules.
Classification and prediction, Quantifying interestingness of rules: subjective and objective
interestingness, classification by decision tree induction, Baysian classification, Classification by
back propagation, case based reasoning, rough set approach.
Clustering Methods: hierarchical models, k-means algorithm and density based methods, Outlier
and exception discovery. Introduction to data streams.
Evolutionary Algorithms in data mining: Encoding, Fitness functions and GA operators.
Introduction data mining tools.
References:
1. Data mining Concepts and Techniques, Han, J and Kamber, M., Morgan Kaufman, IInd
Ed., USA, 2006.
2. Pujari, A. K. Data Mining Techniques, 1st Edition, Universities Press (India) Limited,
(2001).