ANNA UNIVERSITY TIRUNELVELI
M.Sc. COMPUTER TECHNOLOGY (5 YEARS)
CURRICULUM
I SEMESTER
Theory
Code No. Course Title L T P M
XCS 111 English I
4 0 0 100
XCS 112 Trigonometry, Algebra and Calculus
3 1 0 100
XCS 113 Applied Physics
4 0 0 100
XCS 114 Digital Principles
4 0 0 100
XCS 115 Problem Solving Techniques
3 1 0 100
Practicals
XCS 116 Devices Lab
0 0 3 100
XCS 117 Digital Lab
0 0 3 100
XCS 118 Computer Practice
1 0 3 100
II SEMESTER
Theory
XCS 121 English II
4 0 0 100
XCS 122 Analytical Geometry and Real and Complex Analysis
3 1 0 100
XCS 123 Chemistry
4 0 0 100
XCS 124 Computer Architecture I
4 0 0 100
XCS 125 Programming in C
3 1 0 100
XCS 126 COBOL and Data Processing
3 1 0 100
Practicals
XCS 127 C Programming Lab
0 0 3 100
XCS 128 COBOL Lab
0 0 3 100
III SEMESTER
Theory
Code No. Course Title L T P M
XCS 231 Partial Differential Equations and Integral Transforms
3 1 0 100
XCS 232 Numerical Methods
3 1 0 100
XCS 233 Data Structures
3 1 0 100
XCS 234 Microprocessors
4 0 0 100
XCS 235 Database Management Systems
4 0 0 100
Practicals
XCS 236 Assembly Language Programming Lab
0 0 3 100
XCS 237 Data Structures Lab
0 0 3 100
XCS 238 RDBMS Lab
0 0 3 100
IV SEMESTER
Theory
XCS 241 Discrete Mathematics
3 1 0 100
XCS 242 Computer Architecture II
4 0 0 100
XCS 243 Operating System
4 0 0 100
XCS 244 Principles of Data Communication
4 0 0 100
XCS 245 System Software
4 0 0 100
XCS 246 Object Oriented Programming and C++
3 1 0 100
Practicals
XCS 247 System Software Lab
0 0 3 100
XCS 248 C ++ Lab
0 0 3 100
V SEMESTER
Theory
XCS 351 Operations Research
3 1 0 100
XCS 352 Theory of Computation
3 1 0 100
XCS 353 Computer Networks
4 0 0 100
XCS 354 Computer Graphics
3 1 0 100
XCS 355 Design and Analysis of Algorithms
3 1 0 100
Practicals
Code No. Course Title L T P M
XCS 356 Algorithms Lab
0 0 3 100
XCS 357 Graphics Lab
0 0 3 100
XCS 358 Unix Lab
0 0 3 100
VI SEMESTER
Theory
XCS 361 Software Engineering
4 0 0 100
XCS 362 Compiler Design
4 0 0 100
XCS 363 Artificial Intelligence
4 0 0 100
XCS 364 Internet Programming
3 1 0 100
Elective I 4 0 0 100
Elective II 4 0 0 100
Practicals
XCS 365 Internet Programming Lab
0 0 3 100
XCS 366 Software Lab I
0 0 3 100
VII SEMESTER
Theory
XCS 471 Principles of Management
4 0 0 100
XCS 472 Modelling and Simulation
4 0 0 100
XCS 473 Object Oriented Analysis and Design
4 0 0 100
XCS 474 Visual Programming
3 1 0 100
Elective III 4 0 0 100
Elective IV 4 0 0 100
Practicals
XCS 475 CASE Tools and UML Lab
0 0 3 100
XCS 476 Visual Programming Lab
0 0 3 100
VIII SEMESTER
Theory
Code No. Course Title L T P M
XCS 481 Multimedia Systems
4 0 0 100
XCS 482 Web Technology
4 0 0 100
XCS 483 Network Protocols
4 0 0 100
Elective V 4 0 0 100
Elective VI 4 0 0 100
Elective VII 4 0 0 100
Practicals
XCS 484 Multimedia Lab
0 0 3 100
XCS 485 Software Lab II
0 0 3 100
IX SEMESTER
Theory
XCS 591 Distributed Operating Systems
4 0 0 100
XCS 592 Software Project Management
4 0 0 100
XCS 593 Network Security
4 0 0 100
Elective VIII 4 0 0 100
Elective IX 4 0 0 100
Elective X 4 0 0 100
Practical
XCS 594 Software Lab III
0 0 3 100
X SEMESTER
Practical
XCS 510 Project Work
0 0 32 400
Total Marks 7500
LIST OF ELECTIVES
Code No. Course Title
L T P M
XCS 001 Parallel and Distributed Architecture
3 0 0 100
XCS 002 Computer Peripherals and Interfacing
3 0 0 100
XCS 003 Embedded Systems
3 0 0 100
XCS 004 Microprocessor Based System Design
3 0 0 100
XCS 005 Expert Systems
3 0 0 100
XCS 006 Neural Networks
3 0 0 100
XCS 007 Natural Language Processing
3 0 0 100
XCS 008 Fuzzy Systems
3 0 0 100
XCS 009 Genetic Algorithms
3 0 0 100
XCS 010 Advanced Database Management Systems
3 0 0 100
XCS 011 Data Mining and Data Warehousing
3 0 0 100
XCS 012 Database Administration
3 0 0 100
XCS 013 Decision Support System
3 0 0 100
XCS 014 Image Processing
3 0 0 100
XCS 015 Pattern Recognition
3 0 0 100
XCS 016 Computer Vision
3 0 0 100
XCS 017 Wireless Technology
3 0 0 100
XCS 018 Network Administration
3 0 0 100
XCS 019 Extreme Programming
3 0 0 100
XCS 020 Cryptography
3 0 0 100
XCS 021 Software Quality Assurance
3 0 0 100
XCS 022 Personal Software Process and Team Software Process
3 0 0 100
XCS 111 ENGLISH I L T P M
4 0 0 100
1. RHETORICAL FUNCTIONS
Definition, Description, Process Description, Comparison, Classification, Stating Problems and Proposing Solutions, Making Lists, Narrating Events, Asking Questions and Answering. 8
2. WRITING
Paragraph Writing, Coherence and Cohesion, Use of Headings, Letter Writing (Personal Letters, Official Letters, Letters to the Editor), Essay Writing, Note – Making, Use of Symbols and Icons, Abbreviations, Non – verbal Devices, (Flowcharts, Fishbone Diagrams, Tables), Units of Measurements. 15
3. READING
Texts on the topics given below.
I. The Use of Language, Media
II. Nature, Its Treasures, Sources of Power
III. Threatened Environment- Solutions
IV. Genetic Research - GM Food
V. Modern High Tech Tools – Computers, Cyber Space. 10
4. SPEAKING AND LISTENING SKILLS PRACTICE
Questions for Oral Discussion, Role Play Exercises, Word Stress and
Pronunciation. 7
4. VOCABULARY
Synonyms, Antonyms, Superordinates, Hyponyms, Compound Nouns, Prepositional Phrases, Prefixes and Suffixes, Use of Reference Words, Sequential Expressions, Discourse Markers, Idioms and Phrases. 10
5. GRAMMAR
Nouns, Pronouns, Adverbs, Adjectives, Comparative Adjectives, Prepositions, Gerunds, Modal Verbs, Relative Pronouns, Clauses and Phrases, Voice, Sentence Patterns, Simple Present Tense, Present Continuous Tense, Simple Past and Past Continuous Tenses, Formation of Questions, Present Participle, Past Participle – Punctuation. 10
Total L : 60
TEXT BOOK
1. V.Chellammal, Learning to Communicate, Kamakhya Publications, Coimbatore, 2002.
REFERENCES
1. Lakshminarayanan, K.R. English For Technical Communication Vol. 1&2, Chennai: Scitech Publications (India) Pvt. Ltd., 2002
2. Farhathullah, T.M. English Practice Book For Technical Communication, Chennai: RBA Publications, 2002
3. Balasubramanian, M.& G.Anbalagan. English for Engineering Students, Kumbakonam R.M.S.: Anuradha Agencies Reprint 2001.
XCS 112 TRIGONOMETRY, ALGEBRA AND CALCULUS L T P M
3 1 0 100
1. COMPLEX NUMBERS
Complex Numbers – Geometric Representation – DeMoivre’s theorem and its Applications – Exponential and circular functions – Hyperbolic functions - Inverse hyperbolic functions – Logarithmic functions. 9
2. MATRICES
Rank of a matrix – Consistency of linear system of equations – Eigenvalues and Eigenvectors – Cayley-Hamilton theorem and its verification – Reduction to diagonal form – Reduction of quadratic form to Canonical form. 9
3. FUNCTIONS OF SEVERAL VARIABLES
Functions of two or more variables – partial derivatives – Euler’s theorem – Total derivative-change of variables – Jacobians – Taylor’s Theorem - Maxima and Minima of functions of two Variables. 9
4. INTEGRAL CALCULUS
Reduction formulae – Definite integrals – Areas of Cartesian curves – Lengths of curves – volumes of Revolution – Surface areas of revolution. 9
5. ORDINARY DIFFERENTIAL EQUATION
Linear Differential equations of second order with constant coefficients - method of solution of Linear differential equations – complimentary function – particular integral – simultaneous linear equations with constant coefficients of first order - Cauchy linear equation of homogeneous type – Legendre’s linear equation. 9 L : 45, T : 15, Total 60
TEXT BOOKS
1. Veerarajan.T., Engineering Mathematics, Tata McGraw Hill Pub. Co. Ltd., New Delhi 1999.
2. Grewal, B.S. and Grewal, T.S. Higher Engineering Mathematics, Khanna Publications, Delhi, 36th Edition, 2001.
REFERENCE
1. Kandasamy.P., Thilagavathy.K. and Gunavathy.K. – Engineering Mathematics, Volume – I, S.Chand & Co., New Delhi, 2001.
XCS 113 APPLIED PHYSICS L T P M
4 0 0 100
1. PROPERTIES OF MATTER
Elasticity – stress – strain diagram – factors affecting elasticity – Twisting couple on a wire-shafts – Torsion pendulum – Depression of a cantilever – Uniform and Non Uniform bending-I shape girders- production and measurement of high vacuum – Rotary pump-Diffusion pump- Pirani Gauge-Penning Gauge-Viscosity- Oswald Viscometer – Comparison of viscosity. 12
2. ACOUSTICS
Acoustics of buildings – Absorption coefficient-Intensity – Loudness – Reverberation time-Sabines’s formula – Noise pollution – Noise control in a machine – Ultrasonics – Production – Magnetostriction and piezoelectric methods – Applications of ultrasonics in Engineering and Medicine. 12
3. HEAT AND THERMODYNAMICS
Thermal conductivity – Forbe’s and lee’s disc methods – Radial flow of heat-Thermal conductivity of rubber and glass-Thermal insulation in buildings-Laws of thermodynamics – Carno’t cycle as heat engine and refrigerator – Carnot’s theorem – Idel Otto and diesel engines – Concept of entropy – Entropy temperature diagram of carnot’s cycle. 12
4. OPTICS
Photometry – Lummer Brodhum photometer – Flicker photometer – Antireflection coating – Air wedge – Testing of flat surfaces – Michelson’s Interferometer and its applications – Photoelasticity and its applications – Sextant – Metallurgical microscopes – Scanning electron microscopes. 12
5. LASER AND FIBRE OPTICS
Principle and lasers – laser characteristics – Ruby-NdYAG, He-Ne, Co2 and semiconductor lasers – propagation of light through optical fiber-types of optical fiber – applications of optical fibers as optical waveguides and sensors. 12
Total L : 60
TEXT BOOKS
1. Arumugam, M. “Engineering Physics”, Anuradha Agencies, 2003.
REFERENCES
1. Resnik R. and Halliday D. “Physics”, Wiley Eastern, 1986.
2. Nelkon. M. and Parker. P, “Advanced level Physics”, Arnald- Heinemann, 1986
3. Vasudeva. A.S., “Modern Engineering Physics”, S.Chand and Co, 1998.
4. Gaur, R.K. and Gupta, S.L., “Engineering Physics”, Dhanpat Rai and Sons, 1988
5. Mathur. D.S., “Elements of Properties of Matter”, S. Chand and Co., 1989.
XCS 114 DIGITAL PRINCIPLES L T P M
4 0 0 100
UNIT I
Binary Systems : Digital Systems, Binary Numbers, Number Base Conversions, Octal and Hexadecimal Numbers, Complements, Signed Binary Numbers, Binary Codes, Binary Storage and Registers, Binary Logic
Boolean Algebra and Logic Gates : Basic Theorems and Properties of Boolean Algebra, Boolean Functions, Canonical and Standard Forms, Digital Logic Gates. 12
UNIT II
Minimization : Map Method, Four Variable, Five Variable MAP, Product of Sum Minimization, Don’t Care Conditions, NAND, NOR Implementation, Introduction to HDL.
Combinational Logic : Combinational Circuits, Analysis and Design Procedure, Binary Adder, Subtractor, Decimal Adder, Binary Multiplier, Magnitude Comparator, Decoders, Encoders, Multiplexes, HDL for combinational Circuits. 12
UNIT III
Synchronous Sequential Logic : Sequential Circuits - Latches, Flip-Flops, Analysis of Clocked Sequential Circuits, HDL for Sequential Circuits, State Reduction and Assignment Design Procedure. 12
UNIT IV
Registers and Counters : Registers, Shift Registers, Ripple Counters, Synchronous Counters, Other Counters, HDL for Registers and Counter. 12
UNIT V
Asynchronous Sequential Circuit : Introduction, Analysis Procedure, Circuits with Latches, Design Procedure, Reduction of State and Flow Tables, Race – Free State Assignment Hazards, Design Example. 12
Total L : 60
TEXT BOOK
1. M.Morrismano, “Digital Design”, 3rd edition, Pearson Education, Delhi, 2002.
REFERENCES
1. M.Morris Mano, “Digital Logic and Computer Design”, Prentice Hall of India,
New Delhi 2002.
2. M.Morri Mano, “Logic and Computer Design Fundamentals”, Pearson Education, Delhi, 2002.
XCS 115 PROBLEM SOLVING TECHNIQUES L T P M
3 1 0 100
1. INTRODUCTION
Problem solving aspect – Top –down design – Implementation of algorithms – Program verification – Efficiency –Analysis of Algorithms – Fundamental Algorithms – swapping – counting – Factorial Reversing the digits – Base conversion Algorithms. 9
2. FACTORING METHODS AND ARRAY TECHNIQUES
Finding Squart Root – LCM – GCD Generation of Prime Numbers – Random Numbers and Fibonacci Numbers – Array Techniques – Historgramming – Minimum and Maximum numbers – Duplication Removal – Partitioning – Kth smallest Element. 9
3. MERGING, SORTING AND SEARCHING
Two- way Merge Sort – Selection Sort – Excharge Sort – Insertion Sort – Diminishing Increment Sort – Partition Sort – Binary Search – Hash Search – Text Processing – Keyword Searching in text – Text Line Editing – Linear and Sub linear Pattern Search. 9
4. DYNAMIC DATA STRUCTURE ALGORITHMS
Stack Operations – Queue Operations – Linked List – Insertion Deletion and Search Operation – Binary Tree – Insertion, Deletion and Search. 9
5. RECURSIVE ALGORITHMS
Binary Tree Traversal – Recursive Quick Sort – Towers of Hanoi Problem. 9
L : 45, T : 15, Total 60
TEXT BOOK
1. Dromey R.G, “How to Solve it by Computer” Prentice Hall of India, Delhi, 1999.
REFERENCES
1. Aho A.V. J.E. Hopcroft and J.D. Ullman, “The Design and Analysis of Computer Algorithms”, Pearson Education, Delhi, 2001.
2. Sara Baase and Allen Van Gelder, “Computer Algorithms – Introduction to Design and Analysis” Pearson Education, Delhi, 2002.
XCS 116 DEVICES LAB L T P M
0 0 3 100
Semiconductor devices such as PN diode, Zener diode, BJT, SCR, UJT, FET etc, - Characteristic, Parameters and typical applications, Common Transducer Characteristics and application.
Total P : 45
XCS 117 DIGITAL LAB L T P M
0 0 3 100
1. Binary and BCD counter using 7493
2. Verification of NAND, NOR, XOR, AND, OR Gate Logic
3. Parity Generator
4. Encoder / Coder
5. Multiplexes / Demultiplexes
6. Adder / Subtractor
7. Code Converters
8. Comparators
9. Up / Down 4 bit Binary Counter
10. Up / Down 4 bit Decimal Counter
11. Shift Register
12. Ring Counter
XCS 118 COMPUTER PRACTICE L T P M
1 0 3 100
1. FUNDAMENTALS OF COMPUTERS AND OPERATING SYSTEMS.
Evolution of computers – Organization of Modern Digital Computers – Single user Operating System – Multitasking OS – GUI.
2. OFFICE AUTOMATION
a. Word Processing
b. Data Base Management System
c. Spread Sheet Package
d. Presentation Software.
L : 15 P : 45 Total : 60
XCS 121 ENGLISH II L T P M
4 0 0 100
1. RHETORICAL FUNCTIONS
Description, Stating Purposes and Uses, Giving Instructions, Making Recommendations, Bringing out Causal Relations, Writing Checklists. 8
2. WRITING
Writing Reports and Memos, Paragraph Writing, Coherence and Cohesion, Summary Writing, Rearranging Jumbled - up sentences, Letter Writing (Personal Letters, Official Letters), Writing Job Applications, Bio – data, Writing Biographies - Use of Titles, Non – verbal Devices, (Bar chart, Tables and Pie Chart). 15
3. READING
Texts on the topics given below.
Architecture
Advertisements and Media
Technological Innovations
Travel and Tourism
Industry and Management 10
4. SPEAKING AND LISTENING SKILLS PRACTICE
Group Discussion, Reporting, Role Play Exercises, Word Stress and Pronunciation. 7
4. VOCABULARY
Technical Words, Reporting Verbs, Idioms and Phrases. 10
5. GRAMMAR
Infinitives, ‘If’ clauses, Future Tense, Use of Pronouns and Prepositions, Direct and Indirect Speeches, Simple Past and Simple Past Perfect Tense, Word Formation, Prefixes and Suffixes. 10
Total L : 60
TEXT BOOK
1. V.Chellammal, Learning to Communicate, Kamakhya Publications, Coimbatore, 2002.
REFERENCES
1. Lakshminarayanan, K.R. English For Technical Communication Vol. 1&2, Chennai: Scitech Publications (India) Pvt. Ltd., 2002
2. Farhathullah, T.M. English Practice Book For Technical Communication, Chennai: RBA Publications, 2002
3. Balasubramanian, M.& G.Anbalagan. English for Engineering Students, Kumbakonam R.M.S.: Anuradha Agencies Reprint 2001.
XCS 122 ANALYTICAL GEOMETRY AND REAL AND COMPLEX ANALYSIS L T P M
3 1 0 100
1. MULTIPLE INTEGRALS
Double integrals – change of order of integration – Area enclosed by plane curves – Triple integrals – Volume of solids. 9
2. VECTOR CALCULUS
Scalar and vector point functions – vector operator del, gradient, Divergence and curl, line integral – surface integrals – Verification of Gamss divergence – Green’s and Stokes theorems. 9
3. THREE DIMENSIONAL GEOMETRY
Equation of a plane – Equation of a straight line – coplanar lines – shortest distance between two lines – Sphere – Equation of the tangent plane. 9
4. ANALYTIC FUNCTION
Function of a complex variable – Analytic functions – Cauchy – Riemann equations –
Harmonic functions. 9
5. COMPLEX INTEGRATION
Cauchy’s integral theorem – Cauchy integral formula – Taylor’s and laurant’s theorem (statement only) – singularities – Cauchy’s residue theorem – integration a round a unit circle – Integration a round a semicircle (no poles on real axis). 9
L : 45, T : 15, Total 60
TEXT BOOKS
1. Grewal, B.S and Grewal, T.S., Higher Engineering Mathematics, 36th Edition, Khanna Publication, Delhi, 2001.
2. Veerarajan.T. Engineering Mathematics (First year & Semester III), Tata McGraw Hill Publication company Ltd., New Delhi, 1999.
REFERENCE
1. Kandasamy, P. Thilagavathy, K. and Gunavathy, K. Engineering Mathematics, Vol. I and II, S.Chand and Company, New Delhi, 2001.
XCS 123 CHEMISTRY L T P M
4 0 0 100
1.
SPECTROSCOPY
General features – interaction of electromagnetic radiation with matter – regions of electromagnetic spectrum – absorption and emission of radiation – Instruments for optical spectrometry – components – sources – wavelength selectors – monochromators – gratings- radiation detectors and transducers – photomultiplier tubes – silicon photodiodes – CTD detectors – heat detectors – signal processors and readouts – Instrument designs and types – single and double beam instruments – FT spectroscopy - X-ray diffraction – principles. 12
2. POLYMERS IN ELECTRONICS
Introduction – Liquid crystalline, conducting, piezo and pyro electric polymers. Nano materials, lithographic materials, packing materials and encapsulants – applications in electrical and electronic industries – polymer composites. 12
3. SPECIALITY MATERIALS
Dielectrics, insulating materials, soldering materials, magnetic materials, metals and semi conductors – properties – applications in microelectronics. 12
4. FABRICATION OF IC
IC fabrication – oxidation, diffusion, implantation and thin film processes – photolithography and etching – NMOS, PMOS, CMOS, Ga-AS technologies – printed circuit boards. 12
5. BATTERIES
Primary and secondary batteries – battery characteristics – specifications – evaluation of performance – components – lead-acid, alkaline storage batteries (Ni-cd) – Fuel cells - Photovoltaic cells – solar cells – UPS. 12
Total L : 60
TEXT BOOK
1. M.N.Wang, “Polymers for electronic and photonic applications”, John Wiley, New York, 1994.
REFERENCES
1. “Polymers in microelectronics” – D.S. Soane and Z. Martynanko (Eds), Elsevier, Amstrdam, 1989.
2. D.A. Skoog, D.M. West and F.J. Holler, “Fundamentals of Analytical Chemistry”, 7th Edition, Harcourt Asia Pte. Ltd., 2001.
3. S.M. Sze, VLSI Technology 1992.
4. H.C.Gatos, “The surface chemistry of metals and semiconductors”, John Wiley &
5. Sons, New York 1988.
6. Derek Pletcher and Frank C. Walsh. “Industrial electrochemistry”, 2nd Edition,
7. Blackie Acadamic and Professional, 1987.
XCS 124 COMPUTER ARCHITECTURE I L T P M
4 0 0 100
UNIT I
Basic Structure of computers – Functional Units – Bus Structures – Performance – Evolution - Machine Instructions and programs – Memory operations – Instruction and instruction sequencing – addressing modes – Basic I/O operations – stacks and queues – subroutines – Encoding of Machine instructions. 12
UNIT II
Arithmetic – Design of fast adders – Binary Multiplication – Division – Floating point numbers and operations. 12
UNIT III
Processing unit – Fundamental concepts – Execution of a complete instruction – Multiple bus organization – Hardwired control - - Microprogrammed control – pipelining – Basic concepts – Hazards – Inference on instruction sets. Data path and control considerations – Performance issues. 12
UNIT IV
Memory System – RAM and ROM – Cache memories – Performance considerations – Virtual memories - secondary storage devices – Associative memories. 12
UNIT V
Input / Output organization – Accessing I/O devices – Interrupts – DMA – Buses – Interface circuits – standard I/O Interfaces.
Case study of one RISC and one CISC Processor. 12
Total L : 60
TEXT BOOK
1. Carl Hamacher, Zvonko Uranesic, Safvat Zaby, “Computer Organisation”, 5th edition, McGraw Hill, 2002.
REFERENCES
1. John P Hayes, “Computer Architecture and Organisation”, 3rd edition, McGraw Hill, 1998.
2. David A Patterson and John L. Hennessy, “ Computer Organisation and Design The Hardware / Software Interface”, 2nd edition, Harcourt Asia, Morgan Kaufmann, 2000.
XCS 125 PROGRAMMING IN C L T P M
3 1 0 100
UNIT I
Algorithms, Flow Charts, High Level Language for Computers, Writing of Simple Programs. 9
UNIT II
Overview of C, Constants, Variables, Datatypes, Operators and Expressions. 9
UNIT III
Managing Input – Output Operators, Decision Making and Branching – Looping, Arrays. 9
UNIT IV
Handling of Character Strings, User Defined Functions, Structures and Unions, Pointers. 9
UNIT V
File Management in C, Dynamic Memory allocation and Link List, Preprocessor. 9
L : 45, T : 15, Total 60
TEXT BOOKS
1. V.Rajaraman “Computer Programming in C” Prentice Hall of India, New Delhi, 2001
2. E.Balguruswamy “Programming IN ANSI-C”, 2nd Edition, Tata McGraw Hill Publication Company, New Delhi, 2002
REFERENCES
1. Kamthane, “Programming with ANSI and Turbo C, Pearson Education, Delhi, 2002.
2. Al Kelley, Iya Pohl.; “A Book on C”, Pearson Education, Delhi, 2001.
3. Gottfried, B.S., “Schaum’s Outline of Theory and Problems of Programming in C”, Tata McGraw Hill, Delhi, 1995.
4. Kerninghan, B.W. and Ritchi, D.M., The C Programming Prentice Hall of India, Delhi, 1998.
XCS 126 COBOL AND DATA PROCESSING L T P M
3 1 0 100
1. FUNDAMENTALS OF COBOL
Introduction – Coding Form – Characteristic – Words – Data Names – Literals – Parts of a COBOL Program – Data Structures – Data Levels – Picture Clause – VALUE and USAGE class – Filler – Basic Input / Output Statements – ACCEPT – DISPLAY – Arithmetic and Data Manipulation – ADD – SUBTRACT – MULTIPLY – DIVIDE – COMPUTE – MOVE statements – REMAMES – Condition Names – String, Unstring and Inspect Statements. 9
2. BRANCHING, LOOPING AND TABLE HANDLING
IF…ELSE Statement – Nested IF…ELSE, GO TO Statement – PERFORM Statement – EXIT Statement – ALTER Statement – Occurs Clause – Table Handling – REDEFINES Clause – SEARCH Statement – SET Verb – Subroutines – Linkage Section – COBOL 85 Features. 9
3. FILE PROCESSING
Sequential Files – File – Control Paragraph – FD Entry – Creation and Updation of Sequential Files – SORT / MERGE – Indexed Sequential Files – Creation- Updation – Relative Files – Creation and Manipulation. 9
4. INTRODUCTION TO DATA PROCESSING
Data Processing Cycle – Data Organisation – Electronic Computers – Input and Output Devices – File Organisation – Flow Charts – Designing Good Programs – Modular Programming – Top – Down Approach – Structured Programming – Coding Style – Efficiency – Testing. 9
5. CASE STUDIES
Sorting, Searching, Merging, Indexing, Master and Transaction Files – Payroll – Accounts – Inventory – Customer Mailing List – Report Writing – Screen Handling. 9
L : 45, T : 15, Total 60
TEXT BOOK
1. E.Balagursamy, “COBOL Programming – A Self- Study Text”, Macmillan Series in Computer Science, 1997.
REFERENCES
1. M.K.Roy and D.Ghosh Dastidar, “COBOL Programming”, Second Edition, Tata McGraw Hill, Delhi, 1998.
2. A.S.Philipakis and L.J.Kazmier, “Structured COBOL”, Tata McGraw Hill Publishing Company Limited, Delhi, 1993.
XCS 127 C PROGRAMMING LAB L T P M
0 0 3 100
Implementation of
1. Input / output function
2. Control Functions
3. Functions
4. Arrays
5. Pointers
6. Structures and Unions
7. Files
using case studies on : Roots of a quadratic equation, Measures of location – Matrix Operations – Evaluation of trigonometric functions – Pay roll problems. String operations like substring, concatenation, finding a string from a given paragraph, finding the number of words in a paragraph.
Total P : 45
XCS 128 COBOL LAB L T P M
0 0 3 100
1. Program for Control Structures IF..ELSE, GO TO, PERFORM.
2. Program for Arithmetic Verbs and Picture Clause.
3. Sequential File Updation.
4. Sorting and Merging.
5. Indexed Sequential File Updation.
6. Relative File Updation.
7. Table Handling.
8. Table Searching.
9. Subroutines.
10. Report Writing.
11. Case Studies – Payroll, Student Information System, Income Tax Computations.
XCS 231 PARTIAL DIFFERENTIAL EQUATIONS AND INTEGRAL TRANSFORMS L T P M
3 1 0 100
1. PARTIAL DIFFERENTIAL EQUATION
Formation of Partial differential equations – Lagrange’s linear equation of first order Non linear equation of the first order – Homogeneous linear second order equations with constant coefficients. 9
2. FOURIER SERIES
Dirichlet’s conditions – General Fourier series – Half range series – Parseval’s formula. 9
3. FOURIER TRANSFORM
Fourier integral theorem (statement only) – Fourier Transform – Fourier sine and cosine Transforms - properties – Transforms of simple functions – Parseval’s theorem. 9
4. LAPLACE TRANSFORM
Transform of elementary functions – Periodic functions – Transform of derivatives – Inverse transform – Evaluation of Integrals by Laplace transform – convolution theorem. 9
5. Z- TRANSFORM
z – Transform, some standard z – transforms – properties – Initial and final value theorem – convolution theorem – inverse z-transforms. 9
L : 45, T : 15, Total 60
TEXT BOOKS
1. Veerarajan.T. Engineering Mathematics (for Semester IV), Tata McGraw Hill Publication company Ltd., New Delhi, 2001.
2. Grewal, B.S and Grewal, J.S., Higher Engineering Mathematics, Khanna Publishers, Delhi, 36th Edition, 2001.
REFERENCE
1. Kandasamy, P. Thilagavathy, K. and Gunavathy, K. Engineering Mathematics, Vol. III, S.Chand and Company Ltd., New Delhi, 2002.
XCS 232 NUMERICAL METHODS L T P M
3 1 0 100
1. SOLUTIONS OF NONLINEAR EQUATIONS
Method of Bisection – Method of False Position – Fixed point iterative Method - Newton’s Method. 9
2. SOLUTIONS OF SIMULTANEOUS LINEAR EQUATIONS
Gauss Method – Gauss Jordan Method – Triangularisation method – Jacobi Method – Gauss – Seidel Method. 9
3. INTERPOLATION
Newton’s divided difference method – Lagrange’s method – Newton – Gregory forward interpolation formula – Newton – Gregory backward interpolation formula – Stirling’s formula. 9
4. NUMERICAL DIFFERENTIATION AND INTEGRATION
Numerical differentiation using Newton’s divided, forward and backward interpolation polynomials – Numerical Integration by Trapezoidal rule, Simpson’s 1/3 and 3/8 rules. 9
5. NUMERICAL SOLUTION OF ORDINARY DIFFERENTIAL EQUATIONS
Taylor’s Series Method – Euler’s method – Runge-Kutta method of fourth order – Solution of boundary value problems using finite difference methods. 9
L : 45, T : 15, Total 60
TEXT BOOK
1. Balagurusamy, E., Numerical Methods, Tata McGraw Hill Publications Company, New Delhi, 1999.
REFERENCES
1. Kandasamy, P. Thilagavathy, K. and Gunavathy, K., Numerical Methods, (Revised Edition), S. Chand and Company, New Delhi, 2003.
2. Sastry, S.S. Introductory Methods of Numerical Analysis, Third Edition, Printice Hall of India Pvt. Ltd., New Delhi, 1999.
XCS 233 DATA STRUCTURES L T P M
3 1 0 100
UNIT I
Introduction – Structure and Problem Solving – Storage of Information – Linear Data Structures and their sequential storage representation – concepts and Terminology – Storage structure for arrays – Structures and Arrays of Structures – Stacks – Application of Stacks. 9
UNIT II
Queues – Simulation – Priority Queues Linear Data Structures and their linked storage representation – Pointers and Linked Allocation – Linked Linear Lists – Applications of Linked Linear Lists – Polynomial Manipulation. 9
UNIT III
Nonlinear Data Structures – Trees – Definition Operations on Binary Trees – Linked Storage representation for Binary Trees – Applications of Trees – Manipulation of Arithmetic Expressions – Symbol Talk construction. 9
UNIT IV
Graphs and their representation – Matrix representation – List structures – Breadth First Search – Depth First Search spanning Trees – Application of Graphs – PERT and Related Techniques. 9
UNIT V
Dynamic storage Management – Fixed Block Storage Allocation – First –fit Storage Allocation – Buddy System – File Structures – External Storage Devices – Sequential Files – Structure – Processing Indexed Sequential Files – Structure – Processing Direct Files – Structure Processing. 9
L : 45, T : 15, Total 60
TEXT BOOK
1. Tremblay, J.P. and Sorenson, P.G., “An Introduction to Data Structures with Applications”, II edition, Tata McGraw Hill Publication Company Ltd., New Delhi, 2002.
2. E. Balagurusamy, “C and Data Structures”, Tata McGraw Hill Pub. Co., New Delhi, 2002.
REFERENCES
1. A.V. Aho, J.E. Hopcroft and J.D. Ullman “Data Structures and Algorithms” Pearson Education Delhi, 2002
2. Nicklaus Wirth, “Algorithms and Data Structures – Programmes” Prentice Hall of India Pvt. Ltd., New Delhi, 2002
3. Y.Langesam, M.J. Augenstein and A.M. Tenenbaum “Data Structures using C and C++” II edition, Pearson Education, New Delhi, 2002
XCS 234 MICROPROCESSORS L T P M
4 0 0 100
UNIT I
Introduction – Comparison of Micro Computers, Mini Computers and Large Computers – The 8085 microprocessor – Architecture – Example of an 8085 based Microcomputer – Memory Interfacing. 12
UNIT II
The 8085 Programming Model – Instruction Classification – Formats – Instruction Set – Assembly Language Programming – Example Programs. 12
UNIT III
Interfacing Input/Output Devices. Interrupts – 8085 interrupts – Interrupt Controller – DMA Transfer – DMA Controller. 12
UNIT IV
Programmable Interface Devices – 8255 DPI, 8279 Keyboard - Display Controller – Serial Input/Output and Data Communication – 8251 USART – 8253 Timer. 12
UNIT V
Applications – ADC/DAC Interface – Traffic Light Controller – Interfacing Keyboard and Server – Segment Displays – Bidirectional Transfer between two microcomputers – Introduction to higher level processor and micro controllers. 12
Total L : 60
TEXT BOOK
1. Ramesh S.Gaonkar, “Microprocessor Architecture, Programming and Applications with the 8085”, 4th Edition, Penram International Publishing (India) Pvt. Ltd., 1999.
REFERENCES
1. Douglas V. Hall “Microprocessors and Interfacing”, Tata McGraw Hill, Delhi, 1999.
2. Gilmore, “Microprocessor – Principles & Applications”, 2nd Edition, Tata McGraw Hill, Delhi, 1997.
XCS 235 DATABASE MANAGEMENT SYSTEMS L T P M
4 0 0 100
1. INTRODUCTION
File systems versus Database systems – Data Models – DBMS Architecture – Data Independence – Data Modeling using Entity – Relationship Model – Enhanced E-R Modeling. 10
2. STORAGE STRUCTURES
Secondary storage Devices – RAID Technology – File operations – Hashing Techniques – Indexing – Single level and Multi-level Indexes – B+ tree – Indexes on Multiple Keys. 10
3. RELATIONAL MODEL
Relational Model Concepts – Relational Algebra – SQL – Basic Queries – Complex SQL Queries – Views – Constraints – Relational Calculus – Tuple Relational Calculus – Domain Relational Calculus – overview of commercial RDBMSs – Database Design – Functional Dependencies – Normal Forms – 1NF – 2NF-3NF-BCNF – 4NF-5NF – Database Tuning. 15
4. QUERY AND TRANSACTION PROCESSING
Algorithms for Executing Query Operations – using Hermistics in Query operations – Cost Estimation – Semantic Query Optimization – Transaction Processing – Properties of Transactions - Serializability – Transaction support in SQL. 15
5. CONCURRENCY, RECOVERY AND SECURITY
Locking Techniques – Time Stamp ordering – Validation Techniques – Granularity of Data Items – Recovery concepts – Shadow paging – Log Based Recovery – Database Security Issues – Access control – Statistical Database Security. 10
Total L : 60
TEXT BOOK
1. Ramez Elamassri and Shankant B-Navathe, “Fundamentals of Database Systems”, Third Edition, Pearson Education Delhi, 2002.
REFERENCES
1. Abraham Silberschatz, Henry F.Korth and S.Sundarshan “Database System Concepts”, Fourth Edition, McGraw Hill, 2002.
2. C.J. Date, “An Introduction to Database Systems”, Seventh Edition, Pearson Education Delhi, 2002.
XCS 236 ASSEMBLY LANGUAGE PROGRAMMING LAB L T P M
0 0 3 100
1. Study of Assembler (Turbo) and Assembles directives.
2. Study of INT 21H Functions for input and output.
3. Multiplication, Addition and Subtraction.
4. Packing and unpacking of BCD digits.
5. Conversion from BCD to ASCII and vice versa.
6. Delay loop implementation.
7. Arranging numbers in ascending / descending order.
8. MACROS – Examples.
9. Implementation of string Functions.
10. Displaying the contents of the memory locations.
Total P : 45
XCS 237 DATA STRUCTURES LAB L T P M
0 0 3 100
Arrays and Structures in C, Infix, Postfix, Prefix expressions using stack, Recursion, Linked list, Circular linked list, Queues as circular list, Operation on binary trees – Insort, Quicksort, Heapsort, Shell sort, Sequential search and binary search.
Total P : 45
XCS 238 RDBMS LAB L T P M
0 0 3 100
1. Data Definition, Manipulation of base Tables and views.
2. High level programming language extensions.
3. Front and tools.
4. Forms – Triggers – Menu Design.
5. Reports.
6. Database Design and implementation.
Total P : 45
XCS 241 DISCRETE MATHEMATICS L T P M
3 1 0 100
1. MATHEMATICAL LOGIC
Statements – connectives – Truth Tables- Equivalence and Implication - normal form – Inference theory for statement calculus – predicate statements – Inference Theory for predicate calculus – Mathematical Induction. 9
2. RELATIONS AND FUNCTIONS
Equivalence relation – Function – Composition – Identity and Inverse. 9
3. GROUPS
Definition and Examples – Subgroups – Homomorphism – Cosets and Lagrange’s theorem – Normal subgroups – Group Codes. 9
4. RINGS AND FIELDS
Basic definition and concepts – Rings - Fields - Polynomial Rings – Field extension. 9
5. BOOLEAN ALGEBRA
Posets – Lattices – special Lattices – Boolean Algebra. 9
L : 45, T : 15, Total 60
TEXT BOOKS
1. Trembly, J.P. and Manohar, R. Discrete Mathematical structures in the application to computer science, Tata Mc Graw Hill, New Delhi (for Logic, Groups and Boolean Algebra), 1997.
2. Alan Dorr, Applied Discrete Structures for Computer Science, Galkotia Publication (for Relation and Functions), 1998.
REFERENCES
1. Lipschutz, S. and Lipson, M. Discrete Mathematics, Schaum’s outlines, Tata McGraw Hill Publication Company Ltd., New Delhi, 2002.
2. Grimaldi, R.P. Discrete and Combinational Mathematics, Fourth Edition, Pearson Education, New Delhi, 2002.
XCS 242 COMPUTER ARCHITECTURE II L T P M
4 0 0 100
UNIT I
Fundamentals of Computer Design – RISC vs CISC – Performance related issues – Performance Parameters – Measuring Performance. Instruction Set Architecture – Design Issues. 12
UNIT II
Instruction Pipelining – Hazards and Remedies – Instruction Set Design & Pipelining. Instruction Level Parallelism – Concepts. 12
UNIT III
Dynamic Scheduling – Dynamic Hardware Branch Prediction – Super scalar, VLIW and Vector Processors – Performance issues. 12
UNIT IV
Multiprocessor Architectures – Centralized Shared Memory Architectures, Distributed Shared Memory Architectures – Synchronization – Memory Organisation and Cache Coherence Issues. 12
UNIT V
Interconnection Networks – Examples – Internetworking. Case Studies of Typical Architectures. 12
Total L : 60
TEXT BOOK
1. Joha L. Hennessy and David A.Patterson, “Computer Architecture : A Quantitative Approach”, 2nd Edition, Harcourt Asia, Morgan Kaufmann, 2000.
REFERENCES
1. K.Hwang, “Advanced Computer Architecture – Parallelism, Scalability & Programmability”, McGraw Hill, 1993.
2. Richard Y.Kain, “ Advanced Computer Architecture, A System Design Approach”, Prentice Hall of India, 1999.
XCS 243 OPERATING SYSTEM L T P M
4 0 0 100
UNIT I
Introduction – Main frame systems – Desktop Systems – Multiprocessor – Distributed – Clustered – Real - Time-Hand held – Feature Migration – Computing Environments.
Processes Concepts – Scheduling – Operations – Cooperating Processes - Interprocess Communication. 12
UNIT II
Threads – Overview – Multithreading Models – Issues CPU Scheduling – Basic Concepts – Scheduling Criteria – Scheduling algorithms – Multiprocessor Scheduling – Real -Time Scheduling Process synchronization Background – The critical section Problem – Synchronization Hardware – Semaphores – Classical Problems of Synchronization – Critical Regions – Monitors. 12
UNIT III
Deadlocks – System Model – Characterization – Methods for handling deadlocks – Deadlock Prevention – Avoidance – Detection – Recovery from deadlocks – Memory Management – Background – Swapping – Contiguous Memory allocation – Paging – Segmentation. 12
UNIT IV
Virtual Memory – Background – Demand Paging – Page replacement – Allocation of frames – Thrashing – File System Interface – Concept – Access Methods – Directory Structure. 12
UNIT V
File System Implementation – Structure Implementation – Directory Implementation – Allocation Methods – Free – Space Management – I/O Systems- Overview – I/O Hardware Mass–storage Structure – Disk Structure – Disk Scheduling – Disk Management. 12
Total L : 60
TEXT BOOK
1. Abraham Silberschatz, Peter BaerGalvin and Greg Gagne, Operating System Concepts, Sixth Edition, John Wiley and Sons, Singapore, 2002.
REFERENCES
1. H.M. Deitel, “Operating Systems” Second Edition, Pearson Education Delhi, 2002.
2. A.S. Tanenbaum and A.S. Woodhull “Operating Systems, Design and Implementation”, Second Edition Pearson Education Delhi, 2002.
XCS 244 PRINCIPLES OF DATA COMMUNICATION L T P M
4 0 0 100
1. BASICS OF COMMUNICATION
Basics of AM, FM and PM Block Diagram, Concepts of AM, FM modulators and demodulators - Pulse modulation systems - Pulse amplitude modulation - Sampling, Quantisation, Quantisation error. 12
2. INFORMATION THEORY & CODING
Discrete Messages - Concepts of entropy and information rate - Shannon’s theorem - channel capacity - Orthogonal signals and their use - Introduction to coding - Coding and Decoding - Algebraic codes, burst error correction codes - Convolution coding and decoding . 12
3. DATA TRANSMISSION CONCEPTS
Concepts and Terminology- Analog and Digital transmission, Transmission impairments - Transmission media - Synchronous/Asynchronous transmission - Line Configurations - interfacing. 12
4. DATA ENCODING
Digital data Digital signals - Variations of NRZ and biphase - Digital data Analog signals - ASK, FSK, PSK, QPSK - Analog Data Digital signals - PCM, DM. 12
5. DATA LINK CONTROL
Flow control, Error control - HDLC, Multiplexing. 12
Total L : 60
TEXT BOOKS
1. Taub and Schilling, “Principles of Communication Systems”, Tata Mc Graw Hill, 2002.
2. William Stallings, “Data and Computer Communications”, Sixth Edition, Pearson Education, Delhi, 2002.
REFERENCE
1. Prakash C. Gupta, “Data Communications”, Prentice Hall of India, Delhi, 2002.
XCS 245 SYSTEM SOFTWARE L T P M
4 0 0 100
UNIT I
Language Processors – Introduction – Language Processing Activities – Fundamentals of Language Processing – fundamentals of Language Specification – Language Processor Development Tools - Data Structures for Language Processing – Search Data Structures – Allocation Data Structures. 12
UNIT II
Scanning and Parsing – Scanning – Parsing – Assemblers – Elements of Assembly Language Programming – A simple Assembly Scheme – Pass Structure of Assemblers – Design of a Two Pass Assembler – A single Pass Assembler for IBM PC. 15
UNIT III
Macros and Macro Processors – Macro Definition and Call – Macro Expansion – Nested Macro Calls – Advanced Macro Facilities – Design of a Macro Preprocessor. 9
UNIT IV
Compilers and Interpreters – Aspects of Compilation – Memory Allocation – Compilation of Expressions – Compilation of Control Structures – Code Optimization – Interpreters. 12
UNIT V
Linkers – Relocation and Linking Concepts – Design of a Linker –Self – Relocating Programs – A Linker for MSDOS – Linking for Overlay – Loaders.
Software Tools – Software Tools for Programme Development – Editors – Debug Monitors – Programming Environments – User Interfaces. 12
Total L : 60
TEXT BOOK
1. D.M. Dhamdhere, “Systems Programming and Operating Systems”, Second Revised Edition, Tata McGraw –Hill Publishing Company Limited, New Delhi, 2002.
REFERENCES
1. John J. Donovan, “Systems Programming” Tata McGraw-Hill Publishing Company Limited, New Delhi, 2002.
2. L.Beek, “System Software, An Introduction to System Programming”, Addison Wesley, 2002.
XCS 246 OBJECT ORIENTED PROGRAMMING AND C++ L T P M
3 1 0 100
UNIT I
Principles of Object Oriented Programming, Simple C++ Program, Tokens, Expressions, Control Structures. 9
UNIT II
Functions in C++, Classes and Objects. 9
UNIT III
Constructors and Destructors, Operators Overloading and Type Conversion. 9
UNIT IV
Inheritance, Extending Classes, Pointers, Virtual Functions and Polymorphism. 9
UNIT V
Managing Console Input / Output Operations, Working with Files. 9
L : 45, T : 15, Total 60
TEXT BOOK
1. E. Balagusamy, “Object Oriented Programming with C++”, 2nd edition, Tata McGraw Hill Publishing Co., New Delhi, 2001.
REFERENCES
1. Kamthane, A.N., “Object Oriented Programming with ANSI and Turbo C++,
Pearson Education, Delhi, 2003.
2. Bjorne Stroustrup, “The C++ Programming Language”, Pearson Education, Delhi, 1999.
3. S.B.Lippmann, “The C++ Primer”, Pearson Education, Delhi, 1999.
4. Rober Lafore, “Object Oriented Programming in Microsoft C++”, Galgotia
Publications 1999.
XCS 247
SYSTEM SOFTWARE LAB L T P M
0 0 3 100
1. Creation of symbol table.
2. Searching the table of Symbols.
3. Implementation of an assembler.
4. Linking assembly language with C.
5. Developing a simple text editor.
6. Developing a simple graphical editor.
7. Package development.
XCS 248 C++ LAB L T P M
0 0 3 100
1. Simple Programs in C++
2. Create a Complex Number Class with all possible Operators
3. Create a Vector Class
4. Create a String Class
5. Create a Time Class
6. Create a Date Class
7. Create a Matrix Class
8. Create an Employee Class with Derived Classes
9. Create Lists
10. File Handling
11. Operator Overloading
XCS 351 OPERATIONS RESEARCH L T P M
3 1 0 100
1. LINEAR PROGRAMMING
Graphical Solution – Simplex Method – Artificial Starting Solution – Primal – Dual Relationships. 9
2. APPLICATION OF LINEAR PROGRAMMING
Transportation Model – Assignment Model – Tran shipment Models. 9
3. NETWORK MODELS
Shortest Route Problem – Critical Path Computation – PERT Networks. 9
4. INVENTORY MODELS
Deterministic Inventory Models – Static and Dynamic EOQ Models – Continuous review Probabilistic EOQ Model – s-S Policy for single Period Model. 12
5. QUEUING SYSTEMS
Poisson Process – Pure Birth and Death Models – Single and Multi Server Markovian Queueing Models – Steady state solutions. 12
Total L : 60
TEXT BOOK
1. Taha H.A., “Operations Research an Introduction”, Prentice Hall of India, Delhi, 2002.
REFERENCES
1. J.K. Sharma, “Operations Research – Theory and Application”, Macmillan, 2003.
2. Hillier, L.S. and G. J. liebaman, Introduction to Operations Research, McGraw Hill, Singapore, 2001.
XCS 352 THEORY OF COMPUTATION L T P M
3 1 0 100
1. LANGUAGE AND FINITE AUTOMATA
Alphabets and Languages – Finite representation of Languages – Deterministic and Nondeterministic finite automata – Finite automata and regular expressions – Languages that are and are not regular. 9
2. CONTEXT – FREE LANGUAGES
Context free grammars – parse trees – Pushdown automata – Pushdown automata and context free grammars – Languages that are and are not context – free. 9
3. TURING MACHINES
The definition of a Turing Machine – Computing with Turing Machines – Extensions of the Turing Machine – Random access Turing machines – Nondeterministic Turing machines – Grammars. 9
4. UNDECIDABILITY
Universal Turing Machines – The halting Problem – Undecidable problems about Turing machines – Unsolvable problems about grammars. 9
5. COMPLEXITY AND NP-COMPLETENESS
The Class –P- The class NP 9 L : 45, T : 15, Total 60
TEXT BOOK
1. Lewis, H.R. and Papadimitrou, C.H, “Elements of the Theory of Computation”,
Pearson Education, Delhi, Second Edition, 1998.
REFERENCES
1. Martin. J, “Introduction to Languages and Theory of Computation”, McGraw Hill Company, 3rd International Edition, 2003.
2. Hopcraft, J.E. Motrani, R and Ullman, J.D, “Introduction to Automata Theory Languages and Computation”, second edition, Pearson education, Delhi,2002.
3. Mishra, K.L.P and Chandrasekaran, “Theory of Computer Science”, 2nd Edition, Printice Hall of India, New Delhi, 2001.
XCS 353 COMPUTER NETWORKS L T P M
4 0 0 100
UNIT I
Foundation – Requirements – Network Architecture – Direct Link Networks – Hardware building Blocks – Encoding – Framing – Error Detection – Reliable Transmission. 12
UNIT II
Direct Link Networks – Ethernet (802.3) – Token Rinks (802.5, FODI) – Packet Switching – switching and Forwarding – Bridges and LAN Switches – Cell Switching (ATM). 12
UNIT III
Internet Working – Simple Internet Working (IP) – Routing. 12
UNIT IV
Internetworking – Global Internet – Multicast 12
UNIT V
End –to-End Protocols – Simple Demultiplexer (UDP) – Reliable Byte Stream (TCP) 12
Total L : 60
TEXT BOOK
1. Bruce S. Davie and Larry L. Peterson, “Computer Networks”, 2nd Edition,
Harcourt Asia Pvt Ltd, Morgan Kaufmann, 1999.
REFERENCES
1. William Stallings, “Data and Computer Communications”, Sixth Edition, Prentice Hall of India, Delhi, 2002.
2. Andrew S.Tanenbaum, “Computer Networks”, Fourth Edition, Prentice Hall of India, Delhi, 2002.
XCS 354 COMPUTER GRAPHICS L T P M
3 1 0 100
1. OVERVIEW OF COMPUTER GRAPHICS SYSTEM
Over View of Computer Graphics System – Video display devices – Raster Scan and random scan system – Input devices – Hard copy devices. 9
2. OUTPUT PRIMITIVES AND ATTRIBUTES
Drawing line, circle and ellipse generating algorithms – Scan line algorithm – Character generation – attributes of lines, curves and characters – Antialiasing. 9
3. TWO DIMENSIONAL GRAPHICS TRANSFORMATIONS AND VIEWING
Two-dimensional Geometric Transformations – Windowing and Clipping – Clipping of lines and clipping of polygons. 9
4. THREE DIMENSIONAL GRAPHICS AND VIEWING
Three-dimensional concepts – Object representations- Polygon table, Quadric surfaces, Splines, Bezier curves and surfaces – Geometric and Modeling transformations – Viewing - Parallel and perspective projections. 9
5. REMOVAL OF HIDDEN SURFACES
Visible Surface Detection Methods – Computer Animation. 9
L : 45, T : 15, Total 60
TEXT BOOK
1. Hearn, D. and Pauline Baker,M., Computer Graphics (C-Version),2nd Edition, Pearson Education, Delhi (1997).
REFERENCES
1. Neuman, W.M., and Sproull, R.F., Principles of Interactive Computer Graphics, Mc Graw Hill Book Co., 1979.
2. Roger, D.F., Procedural elements for Computer Graphics, Mc Graw Hill Book Co., 1985.
3. Asthana, R.G.S and Sinha, N.K., Computer Graphics, New Age Int. Pub. (P) Ltd., Publishers, 1996.
4. Floey, J.D., Van Dam, A, Feiner, S.K. and Hughes, J.F, Computer Graphics, Pearson Education, New Delhi, 2001.
XCS 355 DESIGN AND ANALYSIS OF ALGORITHMS L T P M
3 1 0 100
UNIT I
Introduction – Algorithm – Specification – Performance Analysis – Divide – And Conquer – General Method – Binary Search – Finding the Maximum and Minimum – Merge Sort – Quick Sort. 9
UNIT II
The Greedy Method – General Method – Knapsack Problem – Tree Vertex Splitting Dynamic Programming – General Method – Multistage Graphs – All pairs shortest paths – Single – Source Shortest paths – The travelling salesperson problem – Flow shop scheduling. 9
UNIT III
Basic Traversal and Search Techniques – Binary Trees – Graphs – Connected Components and Spanning Trees – Biconnected Components. 9
UNIT IV
Backtracking – General Method – 8 Queens Problem – Graph Coloring
Branch and Bound – Method – 0/1 Knapsack Problem 9
UNIT V
NP-Hard and NP-Complete Problem – Basic Concepts – Cooke’s Theorem – NP-Hard Problems – Clique Decision Problem - Job Shop Scheduling – Code generation with Common Subexpressions – Approximation Algorithms – Introduction – Absolute Approximations – E-Approximations . 9
L : 45, T : 15, Total 60
TEXT BOOK
1. Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, “Computer Algorithms”, Galgotia Publications Pvt. Ltd., 2002
REFERENCES
1. Sara Baase and Allen Van Gelde “Computer Algorithms, Introduction to Design and Analysis”, III edition, Pearson Education Delhi, 2002.
2. Aho, Hoporoft and Ullman “The Design and Analysis of Computer Algorithm” Pearson Education Delhi, 2001.
XCS 356 ALGORITHMS LAB L T P M
0 0 3 100
Implementation of following problems using C
1. Binary Search Algorithm
2. Finding Maximum and Minimum of a given list
3. Mergesort
4. Quicksort using divide-and-conquer algorithm
5. Shortest path algorithms (any 2 algorithms)
6. Traversals and Searching in Graphs
7. Minimal Spanning Tree Algorithm
8. Knapsack problem
Total P : 45
XCS 357 GRAPHICS LAB L T P M
0 0 3 100
1. Displaying a point on the screen.
2. Drawing lines and polygons.
3. Drawing curves (circle, ellipse, etc.).
4. Implementation of two-dimensional transformations.
5. Three-dimensional drawing with projections – Generation of Quadric Surfaces, Generation of Bezier surfaces, Implementation of three-dimensional transformations.
6. Applications: Computer Animation Problems.
Total P : 45
XCS 358 UNIX LAB L T P M
0 0 3 100
1. Inter Process Communication (IPC) using Message Queue.
2. IPC using pipes.
3. Implementation of wait and signal using counting semaphores.
4. Implementation of wait and signal using binary semaphores.
5. Atomic counter update problem.
6. Counting Semaphores at the user level using binary semaphores.
7. Signaling Processes.
8. Deadlock detection (for process passing messages).
9. Process Scheduling FCFS.
10. Process Scheduling : Least Frequently Used.
Total P : 45
XCS 361 SOFTWARE ENGINEERING L T P M
4 0 0 100
UNIT I
Introduction – The Software problem – Software Engineering Problem – Software Engineering Approach – Summary – Software Processes – Characteristics of a Software Process – Software Development Process – Project Management Process – Software Configuration Management Process – Process Management Process – Summary. 12
UNIT II
Software Requirements Analysis and Specification – Software Requirements – Problem Analysis – Requirements Specification – Validation – Metrics – Summary. 12
UNIT III
Planning a Software Project – Cost Estimation – Project Scheduling – Staffing and Personnel Planning – Software configuration Management Plans – Quality Assurance Plans – Project Monitoring Plans – Risk Management – Summary. 12
UNIT IV
Function-oriented Design – Design Principles – Module-Level Concepts – Design Notation and Specification – Structured Design – Methodology – Verification – Metrics – Summary. Detailed Design – Module specifications – Detailed Design – Verification – Metrics – Summary. 12
UNIT V
Coding – Programming Practice – Top-down and Bottom-up - structured programming – Information Hiding – Programming style – Internal Documentation Verification – Code Reading – Static Analysis – Symbolic Execution – Code Inspection or Reviews – Unit Testing – Metrics – Summary Testing – Fundamentals – Functional Testing versus structural Testing – Metrics – Reliability Estimation – Basic concepts and Definitions – Summary. 12
Total L : 60
TEXT BOOK
1. Pankaj Jalote, “An Integrated Approach to Software Engineering”, Narosa Publishing House, Delhi, 2000.
REFERENCES
1. Pressman R.S., “Software Engineering”, Tata McGraw Hill, 2000.
2. Sommerville, “Software Engineering”, Pearson Education, Delhi, 2000.
XCS 362 COMPILER DESIGN L T P M
4 0 0 100
UNIT I
Introduction to Compiling – Compilers – Analysis of the Source Program – The Phases of a Compiler – Cousins of a Compiler – The grouping of Phases – Compiler Construction Tools – Lexical Analysis – Role – Input Buffering – Specification of Tokens – Recognition – Finite Automata – Regular expression to an NFA. 12
UNIT II
Syntax Analysis – Role – Context – Free Grammars – Writing a Grammar – Top down parsing – Bottom –up parsing – Operator precedence parsing. 12
UNIT III
Run-Time environments – Source language issues – Storage organization – Storage – Allocation Strategies – Access to non local names – Parameter passing – Symbol Tables. 12
UNIT IV
Intermediate Code Generation – Intermediate Languages – Declaration – Assignment Statements – Boolean Expression – Case Statements – Back Patching - Procedure Calls. 12
UNIT V
Code Generation – Issues – Run-Time Storage Management – Basic blocks and flow graphs - Next – use information - A simple code generator – Register allocation and assignment. Code optimization – Introduction – The Principal Sources of Optimization – Optimization of basic blocks – Loops in Flow Graphs. 12
Total L : 60
TEXT BOOK
1. A.V.Aho, R.Sethi, J.D.Ullman, “Compilers – Principles, Techniques and Tools” Pearson Education Delhi, 2002.
REFERENCES
1. Allen Holub.I, “Compiler Design in C” Prentice Hall of India, Delhi, 2002.
2. D.M.Dhamdhere, “Systems Programming and Operating Systems”, Tata McGraw Hill Company, Delhi, 2002.
XCS 363 ARTIFICIAL INTELLIGENCE L T P M
4 0 0 100
1. INTRODUCTION
Artificial Intelligence Definition – Importance of Artificial Intelligence – Knowledge based Systems – Knowledge Representation – State space search – Production systems – Artificial Intelligence Programming Language – PROLOG – Heuristic search - Depth First Breadth first – Hill climbing – 4th algorithms – Game Playing. 12
2. KNOWLEDGE REPRESENTATION
Prepositional Logic – Clause form – Predicate logic – Resolution – Inference Rules – Unification – Semantic networks – frames – conceptual dependency – Scripts – Representing Knowledge using rules. 12
3. SYMBOLIC REASONING AND UNCERTAINTY
Non monotanic Reasoning – Truth maintenance systems – closed world assumption – modal and temporal Logics – Bayes Theorem - certainty factors – Baycsian networks – Dempster – Shafer Theory – Fuzzy logic. 12
4. NATURAL LANGUAGE PROCESSING AND DISTRIBUTED ARTIFICIAL INTELLIGENCE
Overview of Linguistics – grammars and Languages – Basic parsing techniques – semantic Analysis and representation structures – Natural language generation – natural language systems – Distributed Reasoning systems – Intelligent agents. 12
5. EXPERT SYSTEMS
Architecture – Non production systems Architectures – Knowledge acquisition and validation – Knowledge system building tools – Types of Learning – General Learning model – Learning by induction – Generalization and specialization – Inductive bias – Explanation based Learning. 12
Total L : 60
TEXT BOOKS
1. Dan W. Patterson, “Introduction to Artificial Intelligence and Expert Systems”, Prentice Hall of India, Delhi, 2001.
2. Elaine Rich and Kevin Knight, “Artificial Intelligence” Tata McGraw Hill Pub. Co., Delhi, 2001.
REFERENCE
1. George F Luger, “Artificial Intelligence, structures and strategies for complex problem solving”, Pearson Education Delhi, 2001
XCS 364 INTERNET PROGRAMMING L T P M
3 1 0 100
1. INTRODUCTION
Java Features – comparison of Java with C and C++ - Java and Internet – Java Environment – Java Program structure – Java Tokens – Implementing a Java Program – Java Virtual Machine – Constants – Variables – Data Types – Scope of Variables – Type casting – Operators and expressions – Decision Making, Branching and Looping. 9
2. CLASSES AND ARRAYS
Defining a class – Constructors – Methods – overloading – static Members – Nesting of Methods – Overriding methods – Final Classes – Abstract Class – Visibility control – Arrays – creating an array – Two Dimensional arrays – Strings – String Arrays – String Methods – String Buffer Class – Vectors – Wrapper Classes. 9
3. INHERITANCE, INTERFACES AND PACKAGES
Defining a subclass – Subclass constructor – Multilevel inheritance – Hierarchical Inheritance – Defining Interfaces – Extending Interfaces – Implementing Interfaces – Java APF Packages – creating a package – Accessing and Using a package – Adding a class to a package – Hiding Classes. 9
4. MULTITHREADING EXCEPTION HANDLING AND FILES CREATING THREADS
Extending the Thread class – Thread Life cycle – Thread Exception – Thread priority – Synchronization – Runnable Interface – Exceptions – Throwing own Exceptions – Concepts of streams – stream classes – Byte Stream Classes – Character stream Classes – Using Streams – Using file Class –Other Stream Classes. 9
5. APPLET PROGRAMMING
Difference between Application and Applets – Applet Life cycle – creating an Executable Applet – Designing a Web Page – Adding Applet to HTML File – Passing Parameters to Applets. 9
L : 45, T : 15, Total 60
TEXT BOOK
1. E. Balagurusamy, “Programming with Java – A primer”, Second Edition, Tata
McGraw Hill Publishing Company, Delhi, 2002.
REFERENCE
1. Herbert Schildt, “The complete Reference – Java 2”, Fifth Edition, Tata McGraw Hill Publishing Company, Delhi, 2002.
XCS 365 INTERNET PROGRAMMING LAB L T P M
0 0 3 100
(2 Experiments under each of the following)
1. Client side / Server side scripting programs for the Web Pages.
2. Experiments with Active / JAVA server pages.
3. Socket Programming.
4. JAVA Servlets.
5. On-line Transactions – Database connectivity.
Total P : 45
XCS 366 SOFTWARE LAB I L T P M
0 0 3 100
1. Preparation of Project Management Plan.
2. Using any of the CASE tools, Practice requirement analysis and specification for different firms.
3. Case study of cost estimation models.
4. Practice object oriented design principles for implementation.
5. Practice function oriented design.
6. Practice creating software documentation for all the phases of software development life cycle with respect to any real time application.
7. Simulate a tools for path testing principles.
8. Simulate a tools for testing based on control structures.
9. Simulate a tools that reflects black box testing concepts.l
Total P : 45
XCS 471 PRINCIPLES OF MANAGEMENT L T P M
4 0 0 100
1. THE BASICS OF MANAGEMENT THEORY AND PRACTICE
Definition – Relevance – Various approaches – Classical and Modern – Functions of a Manager – Business Environment – Management Ethics and Value System. 12
2. PLANNING
Definition – Steps in planning – importance – Types of plan – Nature of objectives – forecasting – Decision making under certainty, uncertainty and risk. 12
3. ORGANISING
Definition – Nature of organising – Departmentation – Line / Staff Authority – Centralisation Vs Decentralisation staffing – Definition – Process – Performance Appraisal. 12
4. LEADING
Definition – Leadership models – Motivation – theories of motivation – Communication process – Types – Models – Barriers – Effective Communication. 12
5. CONTROLLING
Definition – Importance – Budgetary and Non-budgetary controlling models – Management by objectives – Management by exception – Control techniques and Information technology. 12
Total L : 60
TEXT BOOKS
1. Koontz Harold and Weihrich Heinz, Essentials of Management – McGraw Hill, Fifth Edition, 1990.
2. Tripathi, Principles of Management, McGraw Hill, Second Edition, 1991.
REFERENCES
1. Burton Gene and Thakur Manab, Management Theory – Principles and Practice, 1996.
2. Chandra Bose, Principles of Management and Administration, Prentice Hall, 2001.
3. Robbins, Management, Seventh Edition, Pearson Education, Delhi, 2002.
XCS 472 MODELLING AND SIMULATION L T P M
4 0 0 100
1. INTRODUCTION
Advantages and Disadvantages, Systems - Components of a system - Types of System -Model of a System - Simulation examples. 12
2. MODELS IN SIMULATION
Statistical Models – Distrete Distributions – Continuous Distributions – Empirical Distributions, Poisson Process, Queueing models – characteristics, Queueing notations, Simulation Techniques, Monte – Carlo Simulation. 12
3. RANDOM NUMBERS
Properties of Random numbers, generation of random numbers, Techniques for generating random numbers, tests for random numbers, 2 test, Runs test, Poker test, Kolmogrov Simrnov test, Random – Variate generation – Inverse transform method, Exponential Random Variates, uniform random variates, Poisson Random variates, Binomial Random Variates, Normal Random Variates. 12
4. SIMULATION LANGUAGES
Comparison and selection of simulation languages, study of any one simulation language (Simulation using C++, GPSS, Arena). 12
5. ANALYSIS OF SIMULATION DATA
Input Modeling – Data Collection, identifying distribution with data, parameter estimation, Goodness-Fit test, selecting input models without data, Multivariate and Time series input models. Verification and Validation of Input Models – Model Building, Verification and Validation. Output Analysis for a Single system - Types of Simulation and Model Stochastic Nature of output Data. 12
Total L : 60
TEXT BOOK
1. Jerry Banks, John S. Carson, Barry L. Nelson, David M.Nicol, Discrete – Event System Simulation Prentice Hall of India, Delhi, 2002.
REFERENCES
1. Geoffrey Gordon, System Simulation, Prentice Hall of India, Delhi, 2002
2. Shannon, System Simulation, The art and Science, Prentice Hall of India, Delhi, 1975.
3. Thomas J. Sehriber, Simulation using GPSS, John Wiley, Singapore, 1991.
XCS 473 OBJECT ORIENTED ANALYSIS AND DESIGN L T P M
4 0 0 100
1. OBJECT BASIS
Object Oriented Philosophy – Object – Object State, behaviors and methods. Encapsulation and information hiding Class Relationship among classes polymorphism, aggregation, object containment, meta classes. 12
2. OBJECT ORIENTED METHODOLOGIES
Rumbaugh object Model, Booch methodology Jacobson methodology, patterns, frame works and unified approach. 12
3. OBJECT ORIENTED ANALYSIS
Business object analysis use case driven approach – use case model. Object analysis – CRC cards – Noun phrase approach Identifying object relationships and methods. 12
4. OBJECT ORIENTED DESIGN
On design process – Design axioms – design patterns – designing classes. Case study. 12
5. UML AND PROGRAMMING
Introduction to unified modeling language – UML diagrams – class diagrams and use case diagrams – State and dynamic models. Case study to inventory, sales and banking. 12
Total L : 60
TEXT BOOK
1. Ali Bahrami, “Object Oriented Systems Development” Irwin-McGraw Hill, New Delhi, International editions, 1999.
REFERENCES
1. Martin Fowler, Kendall Scott, “UML Distilled-Applying the standard Object Modeling Language”, Addition Wesley 1977.
2. Gredy Booch, “Object Oriented Analysis and Design with applications”, II edition, Addition Wesley, 1994.
XCS 474 VISUAL PROGRAMMING L T P M
3 1 0 100
UNIT I
Introduction to Widows Programming – Event Driven Programming – Data Types – Resources – Window Message – Device Context – Document Interfaces – Dynamic Linking Libraries – Software Development Kit (SDK) Tools – Context Help. 9
UNIT II
Visual Basic Programming – Forum Design – VBX Controls – Properties – Event Procedures – Menus and Toolsbars – Using Dialog Boxes – Working with Control Arrays – Active X Controls – Multiple Documents Interface (MDI) – File System Controls – Data Control – Database Applications. 9
UNIT III
Visual C++ Programming – Frame Work Classes – VC++ Components – Resources – Event Handling – Message Dispatch System – Model and Modeless Dialogs – Important VBX Controls – Document view Architecture – Serialization – Multiple Document Interface – Splitter Windows – Coordination Between Controls. 9
UNIT IV
Database Connectivity – Min Database Applications – Embedding Controls in View – Creating user defined DLL’s – Dialog Based Applications – Dynamic Data Transfer Functions – Data Base Management with ODBC – Communicating with other applications – Object Linking and Embedding. 9
UNIT V
Basics of GUI Design – Visual Interface Design – File System – Storage and Retrieval System – Simultaneous Multi Platform Development. 9
L : 45, T : 15, Total 60
TEXT BOOKS
1. Petzold, “Windows Programming”, Microsoft Press, 1995.
2. Marion Cottingham, “Visual Basic”, Peachpit Press, 1999.
3. Kate Gregory, “Using Visual C++”, Prentice Hall of India Pvt. Ltd. 199.
REFERENCES
1. Pappar and Murray, “Visual C++ : The Complete Reference”, Tata McGraw Hill, 2000.
2. Brian Siler and Jeff Spotts, “Using Visual Basic 6”, Prentice Hall India, 2002.
XCS 475 CASE TOOLS AND UML LAB L T P M
0 0 3 100
1. Familiarization of features of any one of the standard UML case tool.
2. Capturing key functional requirements as Use cases and class diagram for online ticket / hotel reservation systems, student information system, sales and marketing system, banking system and inventory tracking system.
3. Interacting diagrams, state chart diagrams etc for systems in 2.
4. Implementation using any one of object oriented languages like Java, C++ for systems in 2.
5. Component diagrams, deployment diagrams for system in 2.
6. Unit test case, integration test case for systems in 2.
Total P : 45
XCS 476 VISUAL PROGRAMMIN LAB L T P M
0 0 3 100
1. Building Simple Applications.
2. Working with Intrinsic Control and ActiveX Controls.
3. Application with multiple forms.
4. Application with Dialogs.
5. Application with Menus.
6. Application with Data Controls.
7. Application using Common Dialogs.
8. Drag and Drop Events.
9. Database Management.
10. Creating ActiveX Controls.
Total P : 45
XCS 481 MULTIMEDIA SYSTEMS L T P M
4 0 0 100
UNIT I
Overview – Multimedia and Personalized computing – emerging applications – convergence of computers. Communication and entertainment products – perspective and chanllenges – Architecture and issues for distributed multimedia systems – synchronization and QOS – Standards and framework. 12
UNIT II
Digital Audio representation and processing – representation, Transmission and processing of saved – audio signal processing – digital music making – Brief survey of speech recognition and generation Video Technology – raster scanning – colour fundamentals and Video performance measurements – Artifacts – Video equipment – TV standards. 12
UNIT III
Digital Video and image compression – introduction – video compression techniques – JPEG – H.261 – MPEG – DVI Technology –Time Based media representation and delivery – models of time – Time and multimedia requirements – support. 12
UNIT IV
O.S. support for continuous media applications – limitations in workstation O.S. – New OS support – experiments using real time mach – middle ware system services architecture – media stream protocol. 12
UNIT V
Multimedia Devices, Presentations services and the user interface – multimedia services and window system, client, device control – Tool kits – Multimedia file systems and information models – File system support – data models – multimedia presentation and authoring – current state of the industry – Design paradigms and user interfaces. 12
Total L : 60
TEXT BOOK
1. John F. Koegel Bufend , “Multimedia systems”, Pearson Education, Delhi, 2002
REFERENCES
1. Vaughan. T, “Multimedia making it work”, Fifth edition, Tata McGraw Hill, 2001.
2. K.R. Rao, Zoron S. Bojkovil, Dragarad A. Milovanovic, “Multimedia Communication Systems”, Printice Hall of India, Delhi, 2002.
XCS 482 WEB TECHNOLOGY L T P M
4 0 0 100
UNIT I
Internetworking concepts – Devices – Repeaters – Bridges – Routers – Gatways – Internet topology Internal Architecture of an ISP – IP Address – Basics of TCP – Features of TECP – UDP – DNS – Email – FTP – HTTP – TELNET. 12
UNIT II
Electronic commerce and Web technology – Aspects – Types – E-procurement models – Solutions – Supply chain management – Customer Relationship Management – Features Required for enabling e-commerce – Web page – Tiers – Concepts of a Tier – Static Web pages – Dynamic Web pages – DHTML – CGI – Basics of ASP technology – Active Web pages. 12
UNIT III
User Sessions, Transaction Management and Security issues – Sessions and session Management – Maintaining state information – Transaction Processing monitors – object Request Brokers – Component transaction – monitor – Enterprise Java Bears – Security – Basic concepts – cryptography – Digital signature – Digital certificates – Security Socket Layer (SSL) – Credit card Processing Models – Secure Electronic Transaction – 3D Secure Protocol – Electronic money. 12
UNIT IV
Electronic Data Interchange, XML and WAP – Overview of EDI – Data Exchange Standards – EDI Architecture – EDI and the Internet – Basics of XML – XML Parsers – Need for a standard – Limitations of Mobile Devices – WAP Architecture – WAP stack. 12
UNIT V
Online Applications and Emerging technologies - Online Shopping – Online databases – Monitoring user events – Need for .NET - Overview of .NET Framework – Web services. 12
Total L : 60
TEXT BOOK
1. Achyat.S.Godbole and Atul Kahate, “Web Technologies”, Tata McGraw Hill Pub. Co., Delhi, 2003.
REFERENCES
1. Ellote Rusty Harold, “Java Network Programming”, O’Reilly Publications, 1997.
2. Jason Hunter, William Crawford, “Java Servlet Programming”, O’Reilly Publications, 1998.
XCS 483 NETWORK PROTOCOLS L T P M
4 0 0 100
UNIT I
Internet Protocol : Routing IP Datagrams – Error and Control Messages (ICMP), Reliable Stream Transport Service (TCP) : TCP State Machine, Response to congestion – congestion, Tail Drop and TCP – Random Early Discard, Routing : Exterior Gateway Protocols and Autonomous Systems (BGP) 12
UNIT II
Internet Multicasting – Mobile IP – Bootstrap And Auto configuration (BOOTP, DHCP). 12
UNIT III
The Domain Name System (DNS) – Applications : Remote Login (TELNET, Rlogin) – File Transfer and Access (FTP, TFTP, NFS). 12
UNIT IV
Applications : Electronic Mail (SMTP, POP, IMAP, MIME) – World Wide Web (HTTP) – Voice and Video over IP (RTP). 12
UNIT V
Applications : Internet Management (SNMP) – Internet Security and Firewall Design (Ipsec) – The Future of TCP / IP (IPV6). 12
Total L : 60
TEXT BOOK
1. Douglas E.Comer, “Internetworking with TCP / IP – Principles, Protocols and Architectures, Fourth Edition, Prentice – Hall of India, Delhi, 2002.
REFERENCES
1. Uyless Black, ‘Computer Networks – Protocols, Standards and Interfaces”, Second Edition, Prentice – Hall of India, Delhi, 2002.
2. Udupa, “Network Management System essentials”, McGraw Hill, 1999.
XCS 484 MULTIMEDIA LAB L T P M
0 0 3 100
1. Use of Authoring Tools (Eg. Macromedia Tool).
2. Basic HTML programming.
3. Web page design.
Total P : 45
XCS 485 SOFTWARE LAB II L T P M
0 0 3 100
1. Simulate a process maturity model for a function ie., test the function at various loads.
2. Implement some of the software quality assurance factors.
3. Practice software configuration management principles.
4. Implement a tool for data gathering.
5. Develop a tool for process analysis and modelling.
6. Simulate a model that takes care of personnel training in software industry.
7. Implement a capability maturity model for any of the software firm.
8. Simulate the defect prevent model.
9. Case Study – Software standards for different phases of software development life cycle.
Total P : 45
XCS 591 DISTRIBUTED OPERATING SYSTEMS L T P M
4 0 0 100
UNIT I
Fundamentals – evolution – System Models – Distributed operating System – Issues – Distributed Computing environment Message passing – Introduction – Features – Issues – Synchronization – Buffering – Message – Encoding – Decoding – Process addressing – Failure Handling. 12
UNIT II
Remote Procedure calls – Introduction – Model – Transparency – Implementation – Stub Generation – Messages – Marshaling Arguments and results –server Management – Parameter passing Semantics - Call Semantics – Communication Protocols – Complicated RPC’s – Client – Server Binding – Exception handling – Security Distributed shared Memory – Introduction – Architecture – Issues – Granularity Structure – Consistency Models – Replacement Strategy – Thrashing. 12
UNIT III
Synchronization – Introduction – Clock Synchronization – Event ordering – Mutual Exclusion – Deadlock – Election Algorithms. 10
UNIT IV
Resource Management – Introduction – Features – Task Assignment approach – Load-Balancing Approach - Load -Sharing Approach Process Management – Introduction – Process Migration – Threads. 14
UNIT V
Distributed File Systems – Introduction – Features – File Models – Accessing Models – Sharing Semantics – Caching Schemes – File Replication – Fault Tolerance – Atomic Transactions – Design Principles Naming – Introduction – Features – Terminologies – Concepts. 12
Total L : 60
TEXT BOOK
1. Pradeep K. Sinha, “Distributed Operating Systems, Concepts and Design” Prentice Hall of India, New Delhi, 2001.
REFERENCES
1. Andrew S. Tanenbaum “Distributed Operating Systems”, Pearson Education, Delhi, 2002.
2. Mukesh Singhal and Nirajan G.Shivaratri “Advanced Concepts in Operating Systems”, Tata McGraw Hill Publishing Company, New Delhi, 2001.
XCS 592 SOFTWARE PROJECT MANAGEMENT L T P M
4 0 0 100
UNIT I
Introduction – Product Life – Project life cycle models - water fall model – Prototyping model – RAD model – Spiral Model – Process Models – Matrics. 12
UNIT II
Software Configuration Management – Definitions and terminology – processes and activities – Configuration audit – Matrics – Software Quality assurance – definitions – quality control and assurance – SQA Tools – Organisation of Structures - Risk Management – Risk Identification, quantification Monitoring – Mitigation. 12
UNIT III
Project initiation – Project Planning and tracking – what, cost, when and how – organisational processes – assigning resources – project tracking – project closure – when and how. 12
UNIT IV
Software requirements gathering – steps to be followed – skills sets required – challenges – matrics – Estimation 3 phases of estimation – formal models for size estimation – translating size estimate to effort schedule estimate, matrics – Design and Development phases – reusability, Technology choices, Standards, Portability user interface – testability – diagonosability etc. 12
UNIT V
Project Management in testing phase – in the maintenance phase – Impact on internet on project Management. 12
Total L : 60
TEXT BOOK
1. Gopalaswamy Ramesh, “Managing Globle Software Projects” Tata McGraw Hill
Publishing Company, New Delhi, 2002
REFERENCE
1. Bob Hughes and Mike Cotterell “Software Project Management”2nd edition, Tata
McGraw Hill Publishing Company, New Delhi, 2002.
XCS 593 NETWORK SECURITY L T P M
4 0 0 100
UNIT I
Introduction – Primer on a Networking – Active and Passive Attacks – Layers and Cryptography – authorization – Viruses, worms. The Multi level Model of Security – Cryptography – Breaking an Encryption Scheme – Types of Cryptographic functions – secret key Cryptography – Public key Cryptography – Hash algorithms.
Secret key cryptography – Data encryption standard – International Data Encryption Algorithm (IDEA) Modes 4 Operations – Encrypting a Large message – Electronic code book, cipher block chaining, OFB, CFB, CTR – Generating MACs – Multiple Encryption DES. 12
UNIT II
Introduction to public key algorithms – Model of arithmetic – Modular addition, Multiplication, Exponentiation. RSA – RSA Algorithm – RSA Security – Efficiency of RSA – Public Key cryptography Standard (PKCS) - Digital Signature Standard – DSS Algorithm – Working of Verification procedure – Security and DSS – DSS controversy – Zero Knowledge proof systems. 12
UNIT III
Authentication – Overview of authentication systems – password based authentication – Add nets based authentication – cryptographic authentication protocols – who is seeing authenticate – passwords as cryptographic keys – Eaves dropping and server database reading – Trusted intermediaries – Session key establishment.
Authentication of people – passwords – online – off line password of using – Eavesdropping – passwords and careless users – Initial Password distribution – Authentication tokens. 12
UNIT IV
Standards and IP security – Introduction to Kerberos – Tickets and Ticket granting tickets. Configuration - logging into the network – replicated KDCs.
Overview of IP security – security associations – security association database - security policy database, AH and ESP – Tunnel Transport mode why protect - IP Header IPV4 and IPV6, NAT, Firewalls, IPV4, IPV6 Authentication Header – ESP - reason for having Authentication Header. 12
UNIT V
Network Security Application – Email Security – distribution lists – store and forward – security services for email – establishing keys privacy – authentication of the source – massage Integrity – Non-Repudiation – Proof of submission – Proof of delivery. Message flow confidentially – Anonymity – Names and Addresses.
Firewalls – packet filters – application level gateway – encrypted tunnels – comparisons why firewalls don’t work – denial of service attacks. Web security – Introduction – URLs/URIs – HTTP – HTTP digest authentication. Cookies – other web security problems. 12
Total L : 60
TEXT BOOK
1. Charlie Kaufman, Radia Perlman and Mike Speciner “Network Security : Private
Communication in a Public Work”, Second Edition, Pearson Education, 2002.
REFERENCES
1. William Stallings, “Network Security : Essentials Applications and Standards”, Pearson Education, 2002.
2. Hans, “Information and Communication Security”, Springer Verlag, 1998.
3. Derek Atkins, “Internet Security”, Tech media, 1998.
XCS 594 SOFTWARE LAB III L T P M
0 0 3 100
1. Implement all the phases of software developments life cycle using any of the commercially.
2. Implement reusability features.
3. Design and develop application object oriented models.
4. Practice component object model.
5. Implement a tool for knowledge based software engineering.
6. Practice the concepts and principles of data engineering.
7. Develop a tool that implements reverse engineering.
8. Practice the reengineering concepts and principles.
Total P : 45
PRACTICAL
XCS 510 PROJECT WORK L T P M
0 0 32 400
LIST OF ELECTIVES
XCS 001 PARALLEL AND DISTRIBUTED ARCHITECTURE L T P M
3 0 0 100
1. PARALLEL ARCHITECTURE
Pipelining, Vector processors, array processors, multiprocessor architectures, data flow architectures, systolic architectures – Basic concepts – examples. 15
2. INTERCONNECTION NETWORKS
Single stage, Multistage interconnection networks, cube, mesh, shuffle exchange, pyramid butterfly networks. 5
3. PARELLEL ALGORITHMS AND LANGUAGES
Design of Parallel algorithms, sorting, FFT, dictionary operation, graph algorithms, Parallel languages – features, constructs. 10
4. DISTRIBUTED SYSTEMS
Models, Hardware concepts, communication, synchronization mechanism, case study : MPI and PVM. 10
5. DISTRIBUTED FILE SYSTEMS
Design, Implementation, Trends in distributed file systems. 5
Total P : 45
TEXT BOOKS
1. Hwang.K, Briggs F.A., “Computer Architecture and Parallel Processing, Tata McGraw Hill.
2. Quinn, M.J., “Designing efficient algorithms for parallel computers”, McGraw Hill, 1995.
REFERENCES
1. Hwang.K., “Advanced Computer Architecture : Parallelism, Scalability, Programmability”, Tata McGraw Hill, 1993.
2. Tanenbaum A.S., “Modern Operating Systems”, Prentice Hall of India, Delhi, 1999.
3. Culler.D.E., “Parallel Computer Architecture, A Hardware Software approach”, Harcourt Asia Pvt Ltd., 1999.
XCS 002 COMPUTER PERIHERALS AND INTERFACING L T P M
1 0 3 100
1. BIOS AND MEMORY MODELS
Monitor routines – Design of BIOS in DOS – Concept of small, large and huge memory models, Interfacing SRAMS and DRAMS to PC, Co-processors and their interfaces to CPU. 9
2. BUS STANDARDS
Introduction to bus standards – ISA, EISA and PCI, ARINC, 1553 bus architectures – 12C bus – IEEE 488 schemes for controls. 9
3. KEYBOARDS, VIDEO DISPLAY UNIT AND STORAGE DEVICES
Interfacing keyboard – VDU – Hard disk – Floppy disk – CD ROM SCSI drives – Application specific ICs and their interface to motherboard – Types of graphic adapters – MGA, VGA, EGA and SVGA. 9
4. DEVICE DRIVERS AND TSR
Types of device drivers – Drivers for peripherals – line printers – modems – fax, etc., TSR programs in C language and Assembly, Applications to TSR. 9
5. ADD – ONs.
Graphic display adapter cards – A/D and D/A cards – interfacing DSP processor to PC-bus – data loggers – Design of IEEE – 488 bus and LAN interface cards. 9
Total L : 45
TEXT BOOKS
1. Govindarajalu, IBM PC and Clones, Tata McGraw Hill, New Delhi. 1992.
2. Hall.D.V., ”Microprocessor and interfacing”, Tata McGraw Hill, 1992.
REFERENCES
1. RAS.J., TSRs, BPB Publications, New Delhi.
2. Millar.A.R., “Assembly Language Techniques for IBM-PC., BPB Publishers, New Delhi.
3. Norton.P, “Inside IBM PC, V Edition, Prentice Hall India, 1994.
4. Gandhi.M. et al, “Advanced DOS”, Vijay Mukhi’s ‘C’ Odyssey series – BPB Publishers, 1992.
5. DOS – IBM Manuals.
6. INTEL Microprocessors and Peripherals Handbooks.
XCS 003 EMBEDDED SYSTEMS L T P M
3 0 0 100
1. INTRODUCTION
Embedded computing – characteristics of embedded computing applications – embedded system design challenges – constraint-driven design – hardware - software co-design. 9
2. REAL TIME OPERATING SYSTEMS
Basic principles – system calls and tasks – inter-task communication – operating system structures – Distributed Operating Systems - network types – communication – RPC – Client - server model – Task scheduling – event detection and interrupt processing – synchronization – High level languages for real time system development. 9
3. EMBEDDED COMPUTING PLATFORM
CPU Architecture – memory devices – I/O devices – component interfacing – designing with microprocessors – development and debugging – design example – design patterns – dataflow graphs – assembly and linking – basic compilation techniques – analysis and optimisation. 9
4. DISTRIBUTED EMBEDDED SYSTEMS
Communication buses - Shared memory communication – accelerated design –networks for embedded systems – networks based design – Internet enabled systems. 9
5. EMBEDDED SYSTEM DESIGN TECHNIQUES
Design methodologies and tools – design flows – designing hardware and software components - requirement analysis and specification – system analysis and architecture design – concurrent engineering – structural and behavioural description - case studies. 9
Total L : 45
TEXT BOOKS
1. Wayne Wolf, “Computers as Components: Principles of Embedded Computer Systems Design”, Morgan Kaufman Publishers, 2000.
2. Charles Crowley, “Operating System – A design oriented approach” McGraw Hill 1997.
REFERENCES
1. Jean J.Labrosse, “Embedded system Building blocks: complete and ready-to-use modules in C”, CMP Books, 1999.
2. Arnold S. Berger, “Embedded Systems Design: An Introduction to Processes, Tools and Techniques” , CMP Books, 2001.
3. Herma K., “Real Time systems – Design for distributed Embedded Applications”, Kluwer Academic, 1997.
XCS 004 MICROPROCESSOR BASED SYSTEM DESIGN L T P M
3 0 0 100
UNIT I
Intel 8086 Architecture – Addressing modes – Instruction set – Bus cycle and Timing – Interrupt handling – memory and I/o interfacing – Assembly Language Programming.
UNIT II
68000 organisation – Instruction set – Bus structure and timing – Execution handling – memory and I/I interfacing – Assembly Language Programming.
UNIT III
Multiprocessor configuration – Co-processor, closely coupied and loosely coupled configurations – 8087 Numeric data processor architecture.
UNIT IV
6888 Floating point co-processor – Architecture – Introduction to 80386, 80486, Pentium and 68020.
UNIT V
Memory Management – Virtual memory – Cache memory.
Total L : 45
TEXT BOOKS
1. Liu and Glenn A.Gibson, “ Micro Computer System” The 8086 Family Architecture, Programming and Design, Prentice India Ltd, New Delhi, 1986.
2. Michael A.Miller, “The 6800 Microprocessor Architecture, Programming and Applications”, Universal Book Stall, New Delhi, 1989.
REFERENCES
1. Mohammad Rafiquzzaman, “Microprocessors and Microcomputer based system design”, Universal Book Stall, New Delhi, 1990.
2. Douglas V. Hall “Microprocessors and Interfacing – Programming and Hardware”, McGraw Hill, 1986.
3. Intel Peripheral design manual.
4. Intel Components Data Book, Vol I and Vol II.
5. Cramer, William, D., Lance A.Leventhal, Hawkins, Doug, Kame Leny, “68000 Assembly Language Programming”, Osbome, McGraw Hill, California, 1987.
XCS 005 EXPERT SYSTEMS L T P M
3 0 0 100
1. INTRODUCTION TO EXPERT SYSTEMS
Introduction – Advantages – General Concept of Expert Systems – Characteristics – Development – Applications – Elements of an Expert system – Production systems – Procedural paradigms – Non-procedural paradigms – Artificial neural systems. 9
2. REPRESENTATION OF KNOWLEDGE AND METHODS OF INFERENCE
(i) Representation of knowledge
Meaning of knowledge – productions – semantic nets – Prolog & semantic - schemata – Framer – logic & sets – prepositional logic – First order predicate logic – Universal Existential quantifier – Quantifiers & sets – limitations of Predicate logic.
(ii) Methods of Inference
Introduction – Trees, lattices and Graphs – State & Problem spaces – And-or Trees & Goals – Deductive Logics syllogisms – Rules of Inference – Limitations of prepositional logic – logic systems – Resolution – Resolutions systems and deduction – shallow and casual reasoning – Forward and Backward chaining – meta knowledge. 9
3. REASONING UNDER UNCERTAINTY
Uncertainty – Types of error – classical probability – Experimental and subjective probabilities – compound and conditional probabilities – Hypothetical Reasoning and Backward Induction – Temporal Reasoning and markor chains – The odds of belief – sufficiency and necessity – uncertainty in Inference chains – combination of evidence – Inference nets – The propagation of probabilities. 9
4. DESIGN OF EXPERT SYSTEMS
Selecting the Appropriate problem – stages in the development of an Expert System – Errors in Development stages – software engineering and Expert Systems – Expert System life cycle – A detailed Life cycle model. 9
5. EXPERT SYSTEM DESIGN EXAMPLES
Certainty Factors – Decision Traces – Backward chaining – A monitoring problem – Case studies MYCIN – Prospector. 9
Total L : 45
TEXT BOOK
1. Giarratano and Riley “Expert Systems - Principles and programming”, Thompson Asia Pvt.Ltd., 2002.
REFERENCES
1. Donald A Waterman, “Expert Systems”, Pearson Education, 2001.
2. Dan W. Patterson, “Introduction to Artificial Intelligence and Expert Systems, Prentice Hall of India, 2001.
XCS 006 NEURAL NETWORKS L T P M
3 0 0 100
UNIT I
Introduction : and computers, the structures of the brain, learning in machines, the differences.
Pattern Recognition : Introduction, pattern recognition in perspective, pattern recognition – a definition, feature vectors and feature space, discriminant functions, classification techniques, linear classifiers, statistical techniques, pattern recognition – a summary.
UNIT II
The Basic Neuron : Introduction – Modeling the single neuron, learning in simple neurons, the perception – a vertical perspective, the perception learning rule, proof, limitations of perceptions.
The Multilayer Perception : Introduction, altering the perception model, the new model, the new learning rule, the multi layer perception algorithm, the XOP problem reverted, visualizing network behavior, multi layer perceptions as classifiers, generalization, fault tolerance, learning difficulties, radial basis functions, applications.
UNIT III
Kohenen Self-Organizing Networks : Introduction, the Kohenen algorithm, weight training, neighborhoods, reducing the neighborhood, learning vector quantisation, the phoetic typer writer.
UNIT IV
Hopfield Networks : The Hopefield model, the energy landscope, the Boltzman machine, constraint satisfaction.
Adaptive Resonance Memory : Adaptive resonance theory, architecture and operation, ART algorithm, training the ART network, clarification, conclusion, summary of ART.
UNIT V
Associative Memory : Standard Computer memory, implementing associative memory, implementation in RAMs, FAMs and n-tupling, willshaw’s associative networks.
Total L : 45
TEXT BOOK
1. P.D.Washerman, “Neural Computing : Theory & Practice”, Vax Northland Reinhold, 1989.
REFERENCES
1. R.Beale and T.Jackson, “Neural Computing : An Introduction”, Adam Hilger, 1990.
2. Pas Y.H. “Adaptive Pattern Recognition and Neural Networks”, Addison Wesley, 1989.
XCS 007 NATURAL LANGUAGE PROCESSING L T P M
3 0 0 100
1. INTRODUCTION
Objectives of computational linguistics – Problems in processing natural language – Type of knowledge needed in processing natural language – Features of Indian language. 8
2. SYNTAX ANALYSIS
Role of syntax analysis – Phrase structure languages – Context – Free parsers – Transformational analyzers – Augmented context – Free parsers – Paninian grammer – Government and Binding – Other phrase structure grammers. 10
3. SEMANTIC ANALYSIS
Formal languages for meaning representation – Translation to logic form – Semantic constraints – Conceptual analyzers – Analyzing sentence fragments – Using logical form. 10
4. DISCOURSE ANALYSIS
Information structuring - Text grammar – Organizing world knowledge frames – Analyzing narrative – Analyzing dialog. 7
5. LANGUAGE GENERATION
Text – Generation – Discourse Strategies and Generation – Current trends incomputational linguistics – the Indian scene : Anusaraka as a case study. 10
Total L : 45
TEXT BOOKS
1. James Allen, “Natural Language Understanding”, Menio Park, Calif, Benjamin Cummings, 1987.
2. Akshar Barathi, Vineet Chaitanya and Rajeev Sangal, “Natural Language Processing-A Paninian Perspective”, Prentice Hall of India, 1995.
REFERENCES
1. Ralph Grishman, “Computational Linguistics – an Introduction”, Cambridge University Press, 1986.
2. Winograd, “Language as a Cognitive Process : Syntax”, Addison Wesley Publications, 1983.
3. Popov, “Talking with Computers in Natural Language Understanding”, Menlo park, Calif, Benjamin Cummings, 1987.
XCS 008 FUZZY SYSTEMS L T P M
3 0 0 100
1. FUZZY THERMINOLOGY
Notion of membership, Concept of a fuzzy subset, Dominance relation, Simple operations on fuzzy subsets, Properties, Product and algebraic sum of two fuzzy subsets. 9
2. FUZZY GRAPHS AND FUZZY RELATIONS
Fuzzy graphs, Fuzzy relations, Composition of fuzzy relations, Properties of fuzzy binary relations, Transitive closure of a fuzzy binary relation. 9
3. FUZZY LOGIC AND FUZZY VARIABLE
Fuzzy preorder, Similitude, Anti-symmetry, Fuzzy order relation, Characteristic function of a fuzzy subset, Fuzzy variables, Polynomial forms, Analysis of a function of fuzzy variables, Logical structure of a function of fuzzy variables. 9
4. PROPOSITIONS
Composition of intervals, Synthesis of a function of fuzzy variables, Networks of fuzzy elements. 9
5. APPLICATIONS
Fuzzy linear programming, Fuzzy symmetric linear programming, Fuzzy approach to the transportation problem. 9
Total L : 45
TEXT BOOKS
1. Kaufmann, A, “Introduction to the Theory of Fuzz Subsets”, Vol. I, Fundamental Theoretical Elements, Academic Press,New york, 1975.
2. Zimmermann, H.J., “Fuzzy Set Theory and its Applicatons”, Second Edition, Allied Publishers Ltd., 1991.
REFERENCES
1. G.Bojadzier and M. Bojadzier, “Fuzzy Sets, Fuzzy Logic, Applications, Volume 5,
Advance in Fuzzy Systems, Application and Theory”, World Scientific, 1996.
XCS 009 GENETIC ALGORITHMS L T P M
3 0 0 100
1. OVERVIEW OF GENETIC ALGORITHMS
The appeal of evolution – Search spaces and fitness landscapes – Elements of genetic algorithms – Genetic algorithms and traditional search methods – A simple genetic algorithm – Applications and working of genetic algorithms. 8
2. IMPLEMENTING A GENETIC ALGORITHM
Usage of a genetic algorithm – Encoding a problem for a genetic algorithm – Adapting the encoding – Selection methods – Genetic operators – Parameters for genetic algorithms. 10
3. GENETIC ALGORITHMS IN PROBLEM SOLVING
Evolving cellular automata – Data analysis and prediction – Evolving Neural Networks. 9
4. GENETIC ALGORITHMS IN SCIENTIFIC MODELS
Modeling interactions between learning and evolution – Modeling Ecosystems – Measuring Evolutionary activity. 9
5. THEORETICAL FOUNDATIONS OF GENETIC ALGORITHMS
Schemes and the two-armed Bandit problem – Exact mathematical models of simple genetic algorithms – Statistical mechanics approaches. 9
Total L : 45
TEXT BOOK
1. Mitchell.M., “An Introduction to Genetic Algorithms”, Prentice Hall of India,
1998.
REFERENCE
1. Goldberg.D.E., “Genetic Algorithms in Search, Optimization and Machine Learning”, Addision Wesley. 1989.
XCS 010 ADVANCED DATABASE MANAGEMENT SYSTEMS L T P M
3 0 0 100
UNIT I
Introduction -Relational Database Concepts – Query Processing – Query Optimization – Transaction Concepts - Properties of Transactions – Serializability – Concurrency Control – Lock Based Protocols – Time Stamp Based Protocols – Recovery Systems – Log Based Recovery – Advanced Recovery Techniques.
UNIT II
Distributed And Parallel Databases - Homogeneous and Hetrogeneous Databases – Distributed Data Storage – Distributed Transactions – Commit Protocols – Concurrency Control – Distributed Query Processing – Parallel Databases – I/O Parallelism – Inter Query and Intra Query Parallelism – Inter and Intera Operation Parallelism – Design of Parallel Systems.
UNIT III
Object-Based Databases And XML - Object Oriented Databases – Complex Data Types – 00 Data Model – 00 Languages – Persistence – Object Relational Databases – Nested Relations – Inheritance – Reference Types – Querying with Complex Types – Functions and Procedures – XML – Structure of XML - Data XML Document Schema – Querying and Transformation – Application Program Interface – Storage of XML Data – XML applications.
UNIT IV
Administration advanced Querying and retrieval - Performance Turing – performance Benchmarks – Decision support Systems – Data Analysis and OLAP – Data Mining – Data Warehousing – Information Retrieval Systems.
UNIT V
Special Purpose Databases - Temporal Databases – Deductive Databases – Mobile Databases – Multimedia Databases – Spatial Databases – Active Databases.
Total L : 45
TEXT BOOK
1. Abraham Silberschatz, Henry F.Korth and S.Sudarshan, “Database System Concepts”, Fourth Edition, McGraw Hill, 2002.
REFERENCES
1. Raghu Ramakrishnan and Johannes Gehrke, “Database Management Systems”,
McGraw Hill, 2000.
2. Ramez Elmasri and Shamkant B.Navathe, “Fundamentals of Database Systems”,
Pearson Education, Delhi, 2002.
XCS 011 DATA MINING AND WAREHOUSING L T P M
3 0 0 100
1. DATA MININING - INTRODUCTION
Data mining – introduction – information and production factor – Data mining Vs query tools – Data mining in marketing – Self learning computer systems – Concept learning – Data learning – Data mining and the data warehouses. 9
2. KNOWLEDGE DISCOVERY PROCESS
Knowledge discovery process – Data selection – Cleaning – Enrichment – Coding – Preliminary analysis of the data set using traditional query tools – Visualization techniques – OLAP tools – Decision trees – Association rules – Neutral networks – Genetics algorithms – KDD (Knowledge Discover in Databases) environment. 9
3. DATAWAREHOUSE - ARCHITECTURE
Data warehouse architecture – System process – Process architecture – Design – Database schema – Partitioning strategy – Aggregations – Data marting – Meta data – System and data warehouse process managers. 9
4. HARDWARE AND OPERATIONAL DESIGN
Hardware and operational design of data warehouse – Hardware architecture – Physical layout – Security – Backup and recovery – Service level agreement – Operating the data warehouse. 9
5. PLANNING, TUNING AND TESTING
Capacity planning – Tuning the data warehouse – Testing the data warehouse – Data warehouse features. 9
Total P : 45
TEXT BOOKS
1. Arun K. Pujari, “Data mining Techniques”, University Press, 2002.
2. Amitesh Sinha, “Data Warehousing”, Thomson Delmar Learning, 2002.
REFERENCES
1. Pieter Adriaans and Dolf Zantinge, “Data Mining”, Addison Wesley, 1996.
2. Sam Anahory and Dennis Murray, “Data Warehousing in the real world”, Addison Wesley, 1996.
XCS 012 DATABASE ADMINISTRATION L T P M
3 0 0 100
1. INTRODUCTION
Database system Applications – View of data – Data models – Database languages – Database uses and database administrators – Transaction management – Database system structure – Application Architecture – History of Database systems – oracle query processing and optimization – concurrency control & Recovery – Replication, Distribution and External Data – Database Administration Tools. 9
2. THE HITCHHIKER’S GUIDE TO DATABASE ADMINISTRATION
Creating a database – using the oracle enterprise manager – starting and stopping the Database – Sizing and managing memory Areas – Allocating and managing space for the objects: implications of the storage clause – Table segments – Index segments – Rollback segments and system – managed undo-temporary segments – Free space-sizing data objects – Creating and managing Rollback segments : Activating Rollback segments – Determine the maximum size of a Rollback segment – Monitoring an Undo Table space – Assign Transactions to specific – Rollback segments – performing Backups – Export and import offline backups – online backups – Recovery manager. 9
3. ORACLE OPTIMIZER
Definition – operations that Access Tables – operations that use Indexes – manipulate data sets. Ordering Rows – Grouping rows – Operations using Row Num – Union, MINUS & INTERSECT – Selecting Rows of update – Selecting from views – selecting from sub queries – Additional Turning Issues - Join Operation – Join of more than two tables – Merge Join – NESTED Loops – HASH JOIN – Procuring outer JOIN Displaying the Execution path – Filtering Rows – Queries. 9
4. ORACLE 9I AS
Communication services – contact management service – Business Logic services – presentation services – Business intelligent services – portal services – Developer’s Tool kits – caching services – oracle database cache – oracle web cache – oracle 9i As click stream Analysis – System services – oracle Enterprise Manager – Oracle advanced security – Database services – starting, stopping and Restarting i As. 9
5. ORACLE 9I DATA DICTIONARY
Constraints and comments – User constraints – Exception – Table comments – Column comments – Indexes & cluster columns – Abstract data type – ORDBMS – Related structure – Database links and materialized view – Triggers – Procedures, functions and packages – Dimensions – space allocation and usage – segments and extents – partition and sub partition – Free space – users and privileges – Table privileges – system privileges – Roles – DBA – Only views – oracle lable security – National language supports (NLS) views – Heterogeneous services. 9
Total L : 45
TEXT BOOK
1. Loney, K. and Koch, G., Oracle 9i, The complete reference by oracle press and Tata McGraw Hill, 2002.
REFERENCES
1. Database system concepts – silber schatz, Korth, sudarshan, 4th Edition, McGraw Hill Publishing Ltd., 2002.
2. Database Management Systems, Ramakrishnan & Gehrke, McGraw Hill Publishing Ltd., 2003.
XCS 013 DECISION SUPPORT SYSTEM L T P M
3 0 0 100
UNIT I
Concepts in general management – information systems – decision support systems. 9
UNIT II
Database Management systems – Model Base Management Systems. 9
UNIT III
Dialogue management subsystem – hardware and software technologies for DOS. 9
UNIT IV
Artificial intelligence expert systems applied to DOS – Internet : the future of computing. 9
UNIT V
Electronic data interchange – computer networks – example of a DSS software – interactive financial planning system (IFPS). 9
Total L : 45
TEXT BOOK
1. Janakiraman V.S. and Sarukesi, Decision Support System, Prentice Hall of India, New
Delhi, 1999.
XCS 014
IMAGE PROCESSING L T P M
3 0 0 100
UNIT I
Introduction – Problems and applications – Two dimensional systems and mathematical preliminaries Linear systems and shift invariance – Fourier transform – Properties – Fourier series – Matrix theory results – Block matrices and kronecker products. 9
UNIT II
Image perception – light, luminance, brightness and contrast – MTF of visual systems – Monochrome vision models – Image fidelity criteria – color representation.
Digital image sampling and quantization – 2D sampling theory – Image reconstruction from samples, Band limited images, sampling theorem, Nuquist rate, Abasing and filled over frequencies – Image quantization – Optimum mean square quantizer. 9
UNIT III
Image enhancement – point operations – contrast structuring, clipping and thresholding etc – Histogram modeling – Spairal operations – special averaging and low pass filtering, Directorial smoothing, median filtering, Replication, Linear interpolation, Magnification and interpolation (Zooming) – false color and pseudo color. 9
UNIT IV
Image restoration – Image observation models – Inverse and wiener filtering – Least square filters – Image analysis – Edge detection – Boundary extraction – Boundary representation – Region representation – Image segmentation – Classification techniques – Image understandings. 9
UNIT V
Image data compression – Pirel coding – PCM, Entrophy coding, Runlength, Bitplane extraction – Predictive techniques – Delta modulation line by line DCPM etc – Interface – Coding of two tone images. 9
Total L : 45
TEXT BOOK
1. Anil K.Jain – Fundamentals of digital image processing – Prentice Hall information and System Science series, 1989.
REFERENCES
1. Pratt W.K. – Digital Image Processing, 2nd Edition, John Wiley & Sons, 1991.
2. Rosenfied A. & Kak, A.C. Digital Picture Processing, Vol. I & II, academic press 1982.
3. Nick Efford – Digital Image Processing: A Practical introduction using Java – Addison Wesley / Benjamin Cummings, 2000.
XCS 015 PATTERN RECOGNITION L T P M
3 0 0 100
1. INTRODUCTION
Pattern and feature – Training and learning in pattern recognition system – Pattern recognition approaches – Statistical pattern recognition – Syntactic pattern recognition – Neural pattern recognition – Reasoning driven pattern recognition – Discriminant functions – Linear and Fisher’s discriminant functions. 7
2. STATISTICAL PATTERN RECOGNITION
Gaussian model – Supervised learning – Parametric estimation – Maximum likelikhood estimation – Bayesian parameters estimation – Perceptron algorithm – LMSE algorithm – Problem with Bayes approach – Pattern classification by distance functions – Maximum distance pattern classifier. 10
3. CLUSTER ANALYSIS
Unsupervised learning – Clustering for unsupervised learning and classification – C- means algorithm – Hierarchical clustering procedure – Graph theoretic approach to pattern clustering – Validity of clustering solutions. 8
4. SYNTACTIC PATTERN RECOGNITION
Elements of formal grammer – String generation as pattern description – Recognition of syntactic description – Parsing – Stochastic grammer and applications – Graph based structural representation. 8
5. FEATURE EXTENTION AND RECENT ADVANCES
Entropy minimization – Karhunen – Loeve transformation – Neural network structures for pattern recognition – Unsupervised learning – Self organizing networks – Fuzzy pattern classifiers – Genetic algorithms – Application to pattern recognition. 12
Total L : 45
TEXT BOOKS
1. Richard. E.G., Johnsonbaugh and Jost.S. “Pattern Recognition and Image Analysis”, Prentice Hall of India, New Delhi, 1999.
2. Duda R.O. and Hart P.E., “Pattern Classification and Scene Analysis”, Wiley, New York, 1973.
3. Morton Nadler and Eric Smith P.,”Pattern Recognition Engineering”, John Willey and Sons, New York, 1993.
4. Tou and Gonzalez R.,” Pattern Recognition Principles”, Addision Wesley, 1974.
REFERENCES
1. Rober J. Schalkoff, “Pattern Recognition – Statistical, Structural and Neural Approaches”, John Wiley & Sons Inc, New York, 1992.
2. Melanie Mitchell, “An Introduction to Genetic Alogrithms”, Prentice Hall of India, New Delhi, 1988.
XCS 016 COMPUTER VISION L T P M
3 0 0 100
1. DIGITAL IMAGE PROCESSING FUNDAMENTALS
Digital image representation – An image model – Digital image processing transforms – Overview of L-Transforms and Fourier Transforms. 8
2. IMAGE PROCESSING & SEGMENTATION
Image enhancement and image restoration – Histogram modification techniques – Image smoothening – Image sharpening – Algebraic approach to restoration – Constrained and unconstrained restorations – Image encoding – Image segmentation and description – Point and region dependent techniques. 14
3. BOUNDARY DETECTION
Edge finding – Surface orientation – Optical flow – Design – Growing. 5
4. IMAGE REPRESENTATION
Texture – Texture as pattern recognition problem – Two and Three dimensional geometric structures – Boundary representations – Regions representation – Shape properties – Knowledge representation and use. 10
5. MATCHING AND INFERENCE
Semantic nets – Matching – Inference – Computer reasoning – Production systems – Active knowledge – Goal achievement. 8
Total L : 45
TEXT BOOK
1. Rosenfeld A and Kak A.C., “Digital Picture Processing”, Academic Press, 1982.
2. Ballard B and Brown B, “Computer Vision”, Prentice Hall of India, Delhi, 1982.
REFERENCES
1. Winston.P.H.(Ed.), “The Psychology of Computer Vision”, McGraw Hill, 1975.
2. Yoshiaki Shirai, “Three Dimensional Computer Visison”, Springer – Verlag, New York, 1987.
XCS 017 WIRELESS TECHNOLOGY L T P M
3 0 0 100
UNIT I
Characteristics of the Wireless Medium – Introduction – Radio Propagation Mechanisms – Path Loss Modeling and Signal Coverage – Channel Measurement and Modeling Techniques – Simulation of the radio Channel – What is db.
Applied Wireless Transmission Techniques. Short distance Base Band – UWB Pulse – carrier modulated – Digital Cellular Transmissions – Spread spectrum Transmissions.
High speed modems for spread spectrum Technology coding Techniques for wireless Transmissions.
UNIT II
Wireless Medium Access Alternatives – Fixed Assignment Access for Voice- Oriented Networks. Random access for data oriented Networks - Integration of Voice and Data Traffic.
Introduction to Wireless Networks – Wireless Network Topologies – Cellular Topology - Cell fundamentals - Capacity expansion techniques – Network Planning for CDMA Systems.
UNIT III
Mobility Management – Radio Resources and Power Management – Security in Wireless Networks GSM and TDMA Technology - Introduction to GSM – Mechanisms to support a mobile environment – communications in the infrastructure.
UNIT IV
CDMA technology – Reference Architecture – IMT 2000 - Mobile Data Networks – Data oriented CDPD Network – GPRS and Higher data rates - SMS in GSM – Mobile Application Protocols.
UNIT V
IEEE 802.11 WLAN – Physical layer – MAC sub layer – MAC Management Sub layer - Adhoc Networking – IEEE 802.15 – Home RF – Bluetooth – Wireless Geo location – Wireless Geo location System Architecture.
Total L : 45
TEXT BOOK
1. Kaveh Pahlavan and Prashant Krishnamurthy “Principles of Wireless Networks”, Pearson Education, Delhi, 2002.
REFERENCES
1. Theodore S.Rappaport, “Wireless Communications : Principles and Practice”, Pearson Education, Delhi, 2002.
2. William Stallings, “Wireless Communications and Networks”, Pearson Education, Delhi, 2002.
3. Martyn Mallick, “Mobile and Wireless Design Essentials”, Wiley, 2003.
4. Kamilia Feher, “Wireless Digital Communications”, Prentice Hall of India, Delhi, 2002.
XCS 018 NETWORK ADMINISTRATION L T P M
3 0 0 100
UNIT I
Network services – Names and Addresses – The Host Table – DNS – Mail services – File and Print servers – configuration servers – Getting started – connected and Non-connected Networks – Basic information – planning Routing – Planning Naming Service – Other services – Informing the Users – Basic Configuration - Kernel – configuration – Using Dynamically Loadable Modules – Recompiling the Kernel – Linux Kernel configuration – Startup Files – The Internet Daemon – The Extended Internet Daemon. 9
UNIT II
Configuring the Interface – The ifconfig command – TCP / IP over a Serial Line – Installing PPP - Configuring Routing – common routing configuration – The minimal routing table – Building a static routing table – configuring DNS – BIND : Unix name service – configuring the Resolver – configuring named – using ns lookup 9
UNIT III
Local Network Services – the Network File system – Sharing Unix printers – using samba to share resources with windows – Network Information Service – DHCP – Managing Distributed servers – Post office servers – send mail – sendmail’s function – running sendmail as a Daemon – Sendmail Aliases – Modifying a sendmail.cf File – Testing sendmail.cf 9
UNIT IV
Configuring Apache – Installing Apache software – configuring the Apache server – understanding an Httpd. Conf File – Web server security - Managing your web server – Network Security – Security planning – user Authentication – Application security – Security Monitoring – Access control – Encryption – Firewalls. 9
UNIT V
Trouble shooting TCP / IP Applications a problem – Diagnostic Tools – Testing Basic connectivity – Troubleshooting Network Access – Checking Routing – Checking Name Service – Analyzing Protocol problems – Protocol case study - Applications : Internet Management – Introduction – The level of Management Protocols – Architectural Model – Protocal Framework – Examples of MIB variables – The structure of Management Information – Formal Definitions using ASN 1 – Structure and Representation of MIB object names – Simple Network Management Protocol – SNMP message format – Example encoded SNMP message – New features in SNMPv3. 9
Total L : 45
TEXT BOOKS
1. Craig Hunt, “TCP / IP Network Administration, 3rd Edition, O’Reilly Networking, 2002.
2. Douglas E Comer, “Internetworking with TCP / IP – Principles, Protocols and Architectures”, Fourth Edition, Prentice – Hall of India Pvt. Ltd., 2002.
REFERENCES
1. Steven Graham, Steve Shah, “LINUX Administration A beginner’s Guide”, 3rd Edition, McGraw Hill, 2002.
2. Nicholas Wells, “Guide to Linux Installation and administration”, Vikas Publishing house, 2000.
3. Red Hat, “Official Red Hat Linux 8 Administrator’s Guide”, Wiley – Dreamtech India Pvt. Ltd, 2002.
4. Steve Maxwell, “UNIX system Administration, A beginner’s Guide”, Tata McGraw Hill Edition, 2002.
XCS 019 EXTREME PROGRAMMING L T P M
3 0 0 100
UNIT I
Introducing C# - Understanding .Net: The C# environment – Overview of C# - Literals, Variables and Data Types – Operators and Expressions. 9
UNIT II
Decision Making, Branching and Looping – if, if…else, switch, …? : operators, while, do, for, foreach and jump in loops, Methods in C# - declaring methods, the main method, invoking methods, nesting methods, method parameters, pass by value and pass by reference, output parameters, Variable argument lists – Overloading methods. 9
UNIT III
Arrays – Creating an array, Variable size arrays, Array list class – Manipulating Strings – Structures, Nested Structures – Enumerations, Initialization, base types and type conversion. 9
UNIT IV
Classes and Objects – Definition, Creating objects, Constructors and destructors, Nesting, Overloaded constructors, Inheritance and Polymorphism – classical, multilevel, hierarchical inheritances, Subclass, Subclass constructors, Overriding methods, Abstract Classes and Methods, Interfaces, Interfaces and Inheritance – Operator Overloading. 9
UNIT V
Delegates – Declaration Methods, Initialization and Invocation, Multicast delegates, I/O operations – Console Input/Output, Formatting, Errors and Exceptions, Type of Errors – Exceptions – Exception for debugging. 9
Total L : 45
TEXT BOOK
1. E. Balagurusamy, Programming in C#, Tata Mc-Graw Hill Publishing Company,
New Delhi, 2002.
REFERENCES
1. Selvi, T. A Text book on C# : A Systematic approach to object oriented programming, Pearson Education, Delhi, 2003.
2. Lippman, C# Primer, 3rd Edition, Pearson Education, Delhi, 2002.
3. Liberty, J. Programming C#, Second Edition, O’Reilly & Associates Inc., California, 2002.
4. Albahari, B. Prayton, P. and Marill, B. C# Essentials, O’Reilly & Associates Inc., California, 2002.
XCS 020 CRYPTOGRAPHY L T P M
3 0 0 100
1. CONVENTIONAL ENCYRTION
Conventional encryption model – DES – RC 5 – Introduction to AE 5 – Random number generation. 9
2. NUMBER THEORY AND PUBLIC KEY CRYPTOGRAPHY
Modular arithmetic – Euler’s theorem – Euclid’s algorithm – Chinese remainder theorem – Primality and factorization – Discrete logarithms – RSA algorithm – Difie heimann key exchange. 9
3. MESSAGE AUTHORISATION AND HASH FUNCTIONS
Hash functions – Authentication requirements – authentication function – Message Authentication codes – Secure Hash Algorithms. 9
4. DIGITAL SIGNATURE AND AUTHENTICATION PROTOCOLS
Digital Signature – Authentication Protocols – Digital Signature Standard. 9
5. NETWORK SECURITY
Prettry good privacy – S/MIME-IP Security Overview – Web Security. 9
Total L : 45
TEXT BOOK
1. Stallings, W., “Cryptography and Network Security Principles and Practice”, Pearson Education, Delhi, 2003.
REFERENCE
1. E. Biham and A. Shamir, “Differential Crypt analysis of the data encryption standard”, Springer Veriag, 1993.
2. D. Denning, “Cryptography and data security”, Addition Wesley, 1982.
3. N. Kobliz, A course in Number Theory and Cryptography, Springer Veriag, 1994.
XCS 021 SOFTWARE QUALITY ASSURANCE L T P M
3 0 0 100
UNIT I
Introduction to software quality – Software modeling – Scope of the software quality program – Establishing quality goals – Purpose, quality of goals – SQA planning software – Productivity and documentation. 9
UNIT II
Software quality assurance plan – Purpose and Scope, Software quality assurance management – Organization – Quality tasks – Responsibilities – Documentation. 9
UNIT III
Standards, Practices, Conventions and Metrics, Reviews and Audits – Management, Technical review – Software inspection process – Walk through process – Audit process – Test processes – ISO, cmm compatibility – Problem reporting and corrective action. 9
UNIT IV
Tools, Techniques and methodologies, Code control, Media control, Supplier control, Records collection, Maintenance and retention, Training and risk management. 9
UNIT V
ISO 9000 model, cmm model, Comparisons, ISO 9000 weaknesses, cmm weaknesses, SPICE – Software process improvement and capability determination. 9
Total L : 45
TEXT BOOK
1. Mordechai Ben – Meachem and Garry S.Marliss, “Software Quality – Producing Practical, Consistent Software”, International Thompson Computer Press, 1997.
REFERENCES
1. Watt. S. Humphrey, “Managing Software Process”, Addison – Wesley, 1998.
2. Philip.B.Crosby, “Quality is Free : The Art of making quality certain”, Mass Market, 1992.
XCS 022 PERSONAL SOFTWARE PROCESS AND TEAM SOFTWARE PROCESS L T P M
3 0 0 100
1. INTRODUCTION
Software Engineering – Time management – Tracking Time – Period and Product Planning – Product Planning – Product size – Managing you time – Managing Commitments – Managing schedules. 9
2. PLANNING
The project plan – The software development process – Defects – Finding defects – The code review checklist – Design defects – Product quality – Process quality. 9
3. TSP STRTEGY
Team software process overview – The logic of the team software process – Launching a team project – The development strategy – The development plan – Defining the requirements. 9
4. PRODUCT IMPLEMENTATION
Designing with teams – Product implementation – Integration and system testing – The postmortem. 9
5. TEAM MANAGEMENT
The team leader role – Development manager role – The planning manager role – The quality – Process manager role – The support manager role. 9
Total L : 45
TEXT BOOKS
1. Watt S Humphrey, “Introduction of Personal Software Process”, Addison Wesley, 2000.
2. Watt S Humphrey, “Introduction to team software process”, Addison Wesley, 2000.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment