Top Banner
8/12/2019 Syllabus IT 2010.Doc http://slidepdf.com/reader/full/syllabus-it-2010doc 1/64 Integral University STUDY & EVALUATION SCHEME B.Tech. CSE/IT   Year  3 rd , Semester  V S. No Course Code  Subject Periods Evaluation Scheme Subject Total Sessional Exam Exam ESE L T P CT TA Total Theory Subjects 1. HU-501 Principles of Management & Engineering Economics 3 1 0 30 20 50 100 150 2. CS-501 Database management System 3 1 0 30 20 50 100 150 3. CS-502 Design and analysis of algorithms 3 1 0 30 20 50 100 150 4. CS-503 Software Engineering 3 1 0 30 20 50 100 150 5. CS-504 Computer Networks 3 1 0 30 20 50 100 150 6. CS-505 Theory of Automata and formal languages 2 1 0 15 10 25 75 100 Practicals/Training/Project 7. CS-551 Database management System Lab 0 0 3 10 10 20 30 50 8. CS-552 Design and analysis of algorithms Lab 0 0 3 10 10 20 30 50 9. CS-553 Software Engineering Lab 0 0 3 10 10 20 30 50 10. CS-554 Computer Networks Lab 0 0 2 10 10 20 30 50 11. GP-501 General Proficiency - - - - - 50 - 50 Total 17 06 11 205 150 405 695 1100
64

Syllabus IT 2010.Doc

Jun 03, 2018

Download

Documents

zaidone123
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Page 1: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 1/64

Integral UniversitySTUDY & EVALUATION SCHEME

B.Tech. CSE/IT

   Year  3rd, Semester  V

S. No CourseCode

  Subject

Periods Evaluation Scheme

Subject

Total

Sessional Exam

ExamESEL T P CT TA Total

Theory Subjects

1. HU-501 Principles ofManagement &Engineering Economics

3 1 0 30 20 50 100 150

2. CS-501 Database managementSystem

3 1 0 30 20 50 100 150

3. CS-502 Design and analysis ofalgorithms

3 1 0 30 20 50 100 150

4. CS-503 Software Engineering 3 1 0 30 20 50 100 150

5. CS-504 Computer Networks 3 1 0 30 20 50 100 150

6. CS-505 Theory of Automata and

formal languages

2 1 0 15 10 25 75 100

Practicals/Training/Project

7. CS-551 Database managementSystem Lab

0 0 3 10 10 20 30 50

8. CS-552 Design and analysis ofalgorithms Lab

0 0 3 10 10 20 30 50

9. CS-553 Software EngineeringLab

0 0 3 10 10 20 30 50

10. CS-554 Computer Networks Lab 0 0 2 10 10 20 30 50

11. GP-501 General Proficiency - - - - - 50 - 50

Total 17 06 11 205 150 405 695 1100

Page 2: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 2/64

Integral UniversitySTUDY & EVALUATION SCHEMEB.Tech Information Technology

   Year  3rd, Semester  VI

SNo CourseCode

  Subject

Periods Evaluation Scheme

Subject

Total

Sessional Exam

ExamESE

L T P CT TA Total

Theory Subjects

1. CS-601 Computer Graphics& Animation

3 1 0 30 20 50 100 150

2. IT-601 Information System 3 1 0 30 20 50 100 150

3. IT-602 Web Technology 3 1 0 30 20 50 100 150

4. CS-604 Microprocessor andits Applications

3 1 0 30 20 50 100 150

5. Elective-1 3 1 0 30 20 50 100 150

6. CS-605 Software Project& Quality

Management

2 1 0 15 10 25 75 100

Practicals/Training/Project

7. CS-651 Computer GraphicsLab

0 0 3 10 10 20 30 50

8. IT-652 Java ProgrammingLab

0 0 3 10 10 20 30 50

9. IT-651 Mini Project Lab(Information system)

0 0 3 10 10 20 30 50

10. CS-654 Microprocessor Lab 0 0 2 10 10 20 30 50

11. GP-601 General Proficiency 50 50

Total 17 06 11 205 150 405 695 1100

Page 3: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 3/64

Integral UniversitySTUDY & EVALUATION SCHEMEB.Tech Information Technology

   Year  4th, Semester  VII

S. No CourseCode

  Subject

Periods Evaluation Scheme

Subject

TotalSessional Exam Exam

ESEL T P CT TA Total

Theory Subjects

1. CS-701 Artificial

Intelligence

3 1 0 30 20 50 100 150

2. CS-702 DistributedSystems

3 1 0 30 20 50 100 150

3. CS-703 Cryptographyand NetworkSecurity

3 1 0 30 20 50 100 150

4. IT-701 E-Commerce 2 1 0 15 10 25 75 100

5. IT-702 E R P 3 1 0 30 20 50 100 150

6. Open Elective 3 1 0 30 20 50 100 150

Practicals/Training/Project

7. CS-751 ArtificialIntelligence Lab

0 0 3 10 10 20 30 50

8. CS-752 DistributedSystems lab

0 0 3 10 10 20 30 50

9. IT-754 Project 0 0 3 - - 50 - 50

10. IT-755 Colloquium 0 0 3 - - 50 - 50

11. GP-701 GeneralProficiency

50 - 50

Total 17 06 12 185 130 465 635 1100

Page 4: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 4/64

Integral UniversitySTUDY & EVALUATION SCHEMEB.Tech Information Technology

   Year  4th, Semester  VIII

 

S. No CourseCode

  Subject

Periods Evaluation Scheme

Subject

TotalSessional Exam Exam

ESE

L T P CT TATotal

Theory Subjects

1. IT-801 Data Warehousing &Data Mining

2 1 0 15 10 25 75 100

2. IT-802 Internet Technologiesand Cyber Laws

3 1 0 30 20 50 100 150

3. Elective 2 3 1 0 30 20 50 100 150

4. Elective 3 3 1 0 30 20 50 100 150

5. Elective 4 3 1 0 30 20 50 100 150

Practicals/Training/Project

5. CS-852 Advanced TechnologyLab.

- - 3 10 10 20 30 50

6. IT-853 Project - - 12 - - 100 150 250

7. CS-854 Industrial Interaction - - - - - 50 - 50

 8. GP-801 General Proficiency - - - - - 50 - 50

Total 14 5 15 145 100 445 655 1100

Page 5: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 5/64

Integral UniversitySTUDY & EVALUATION SCHEMEB.Tech Information Technology

List of Electives

Elective-1:-

1.  Advance Concepts in Database systems-CS 0512. Bioinformatics-IT 0233. Storage Technology and Management- CS 0134. Compiler Design - CS-603

 Elective-2:-

1. Data Compression-CS 0212. Advance concepts of TCP/IP-CS 0333. Fuzzy Logic & Neural Network-CS 801

Elective-3:-

1. Component Based Development-IT 0312. Real Time Systems-CS 0433. Multimedia System-IT 032

Elective-4:-

1. Digital Image Processing-CS 7042. GIS Terminology and its Applications CS-0533. Mobile Computing-CS 031

Page 6: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 6/64

Integral UniversitySTUDY & EVALUATION SCHEMEB.Tech Information Technology

OPEN ELECTIVES

  Offered by IT Branch:-

1. IT in Business- OEIT- 012. Internet Technologies and Cyber Laws IT-802

 

Page 7: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 7/64

PRINCIPLE OF MANAGEMENT AND ENGINEERING ECONOMICS

HU - 501

L T P

3 1 0UNIT 1

 Nature and Significance of Economics. Meaning of Science. Engineering and

Technology and their Relationship with Economic Development.

UNIT 2

The Concept of Demand and Supply. Elasticity of Demand and Supply, IndifferenceCurve Analysis, Price Effect. Income Effect and Substitution Effect.

UNIT 3

Functions of Money, Value of Money, Inflation and Measures to Control it, Brief

Idea of Functions of Banking System viz Commercial and Central Banking, BusinessFluctuations.

UNIT 4

Definition, Nature and Significance of Management, Evaluation of Management Thought,

Contributions of Max Weber. Taylor and Fayol.

UNIT 5

Factors of Individual Behaviour, Perception. Learning and Personality DevelopmentInterpersonal Relationship and Group Behaviour.

REFERENCES1. Dewett, K.K. / Modern Economic Theory / S. Chand2. Luthers Fred / Organizaional Behaviour

3. Prasd 1. M. / Principles of Management

4. A. W. Stonier & D. C. Horgne / A textbook of Economics Theory / OxfordPublishing House Pvt. Ltd.

Page 8: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 8/64

DATABASE MANAGEMENT SYSTEM

CS-501

L T P

3 1 0

UNIT 1Introduction:  An Overview of Database Management System, Database System Vs

File System, Database System Concepts and Architecture, Data Models Schema and

Instances, Data Independence and Data Base Language and Interfaces, Data Definitions

Language, DML, Overall Database Structure.

Data Modeling Using the Entity Relationship Model:

ER Model Concepts, Notation for ER Diagram, Mapping Constraints, Keys, Concepts of

Super Key, Candidate Key, Primary Key, Generalization, Aggregation, Reduction of anER Diagrams to Tables, Extended ER Model, Relationships of Higher Degree.

UNIT 2

Relational Data Model and Language:  Relational Data Model Concepts, IntegrityConstraints: Entity Integrity, Referential Integrity, Keys Constraints, Domain Constraints,

Relational Algebra, Relational Calculus, Tuple and Domain Calculus,

Introduction to SQL: Characteristics of SQL. Advantage of SQL. SQL Data Types and

Literals. Types of SQL Commands. SQL Operators and Their Procedure. Tables, Viewsand Indexes. Queries and Sub Queries. Aggregate Functions. Insert, Update and Delete

Operations. Joins, Unions, Intersection, Minus, Cursors in SQL.

UNIT 3

Data Base Design & Normalization:

Functional Dependencies, Normal Forms, First, Second, Third Normal Forms, BCNF,

Inclusion Dependences, Loss Less Join Decompositions, Normalization using FD, MVD,and JDs, Alternative Approaches to Database Design.

Storage and File Structure, Overview of Physical Storage Media, File Organization,

Organization of Records in File, Data Dictionary Storage.

UNIT 4

Indexing & Hashing: Basic Concepts, B+ Tree Index Files, B- Tree Index Files, StaticHashing, Dynamic Hashing.

Transaction Processing Concepts:  Transaction System, Testing of Serializability,

Serializability of Schedules, Conflict & View Serializable Schedule, Recoverability,Recovery from Transaction Failures, Log Based Recovery, Checkpoints, Deadlock

Handling.

UNIT 5

Concurrency Control Techniques: Concurrency Control, Locking Techniques for

Concurrency Control, Time Stamping Protocols for Concurrency Control, Validation

Based Protocol, Multiple Granularity, Multi Version Schemes, Recovery with ConcurrentTransaction.

Page 9: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 9/64

 

REFERENCES

1. Korth, Silbertz, Sudarshan, "Data base concepts", McGraw-Hili2. Elmasari, Navathe, "Fundamentals of Database Systems", Addison Wesley

3. Date C.J., "An Introduction to Database Systems", Addison Wesley

Page 10: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 10/64

DESIGN AND ANALYSIS OF ALGORITHMS

  CS-502 L T P

3 1 0

UNIT 1Introduction:  Algorithms, Analysis of Algorithms, Growth of Functions: Asymptotic

 Notations, Standard Notations and Common Functions; Recurrence Methods:

Substitutions Method, Iteration Method, Master Method, Proof of Master’s Theorem;

Designing of Algorithms- Divide & Conquer: Binary Search, Finding Maximum &Minimum; Sorting and Order Statistics: Heap Sort, Quick Sort, Sorting in Linear Time,

Medians and Order Statistics.

UNIT 2

Advanced Data Structure:  Red-Black Trees, Augmenting Data Structure, Binomial

Heaps, Fibonacci Heaps, Data Structure for Disjoint Sets.

UNIT 3

Advanced Design and Analysis Techniques: Greedy Algorithms: Knapsack Problem,Job Sequencing with Deadline, Minimum Cost Spanning Trees Algorithm, Optimal

Storage on Tapes; Dynamic Programming: Multistage Graph, Single Source Shortest

Path, 0/1 Knapsack, Reliability Design, Traveling Salesperson Problem, Flow ShopScheduling.

UNIT 4

Amortized Analysis, Back Tracking, Branch & Bound: Least Cost Search, Control

Abstraction, Bounding, FIFO Branch and Bound, LC Branch and Bound, 0/1 Knapsack

Problem Solution.

UNIT 5

Selected Topics:  Randomized Algorithms, String Matching, Matrix Operation:Strassen’s Algorithm, Algebraic Number System and Boolean Matrix Multiplication,

Solving System of Linear Equations; NP Completeness.

REFERENCES

1. Coremen, Rivest, Lisserson, “Algorithms”, PHI.

2. Horwitz & Sahani, Fundamental of Computer Algorithm, Galgotia.

3. Michael T. Goodrich and Roberto Tamassia, Algorithm Design: Foundation,

Analysis and Internet Examples, John Wiley Publications.

Page 11: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 11/64

SOFTWARE ENGINEERING

CS-503

  L T P

3 1 0

UNIT 1Introduction to Software Engineering:  Types of Software, Software Characteristics,

Quality of a Good Software, Software Myths, Software Components, Software Crisis,

Software Engineering: Definition, Challenges, Software Engineering Processes,

Similarity and Differences from Convential Engineering Processes.

Software Development Life Cycle Models:  Build and Fix Models, Waterfall

Model, Prototyping Model, RAD Model Iterative Enhancement Model, Evolutionary

Development Model and Spiral Model, WINWIN Spiral Model, Fourth GenerationTechniques.

UNIT 2

Planning a Software:  Process Planning, Effort Estimation:Uncertainities in EffortEstimation, Building Effort Estimation Models, A Bottom-Up Estimation Approach,

COCOMO Model, Project Scheduling & Staffing: Overall Scheduling, DetailedScheduling, Team Structure, Software Configuration Management(SCM): - Baselines,

Version Control, Change Control & Configuration Audit, Risk Management: Reactive

and Proactive Risk Strategies, Software Risks, Risk Analysis, Identification, Projection,Assessment, Monitoring and Managing the Risk, RMMM Plan.

UNIT 3

Software Requirements Analysis and Specification: Software Requirements: Need forSRS, Requirement Process, Problem Analysis: Informal Approach, Data Flow Modeling,

Object Oriented Modeling, Prototyping, Requirements Specifications: Characteristics

of an SRS, Components of SRS, Specification Language, Structure of RequirementDocument, IEEE Standards for SRS, Validation, Metrics.

Designing and Coding: Designing: Function Oriented Design: Design Principles:

Problem Partitioning and Hierarchy, Abstraction, Modularity, Top Down and Bottom-UpStrategies, Module Level Concepts: Coupling, Cohesion; Structure Design Methodology,

Verification, Introduction to Object Oriented Design & User Interface Design, Software

Measurement Metrics: Various Size Oriented Measures- Halestead’s Software Science,Function Point (FP) Based Measures, Cyclomatic Complexity Measures: Control Flow

Graphs.

UNIT 4

Coding:  Programming Principles and Guidelines: Common Coding Errors, Structured

Programming, Information Hiding, Programming Practices, Coding Standards,

Coding Process, Refactoring, Verification: Code Inspection, Static Analysis, ProvingCorrectness, Combining Different Techniques, Metrics.

Page 12: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 12/64

Testing and Maintenance:

Testing Fundamentals:  Error Fault and Failure, Test Oracles, Test Cases and

Test Criteria, Test Case Execution and Analysis, Unit Testing, Integration Testing,Acceptance Testing, Regression Testing, Testing for Functionality and Testing for

Performance. Testing Strategies: Top Down and Bottom up Integration; Testing

Techniques: White Box, Black Box Testing, Alpha and Beta Testing, and Maintenance.

UNIT 5

Computer Aided Software Engineering (CASE): CASE Tools, Scope, Benefits of

CASE Tool, support in Software Life Cycle, Architecture of CASE Environment, Typesof CASE Tools, Software Reliability and Quality Management: -Software Quality

Management: Quality Concepts, Software Quality Assurance, Software Reviews, Formal

Technical Reviews, and Statistical Quality Assurance. Software Reliability, ISO 9000Quality Standards, CMM Levels.

REFERENCES1. Software Engineering: A Practitioner's Approach by Roger S. Pressman,

McGraw-Hill International edition.2. An Integrated Approach to Software Engineering, by Pankaj Jalote, Narosa

Publishing House.

3. Software Engineering by K.K. Agarwal.4. Software Engineering by Ian Sommerville, Addison-Wesley.

5. Fundamentals of Software Engineering by Rajib Mall, PHI.

Page 13: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 13/64

COMPUTER NETWORKS

CS- 504

  L T P

3 1 0

UNIT 1

Introduction Concepts: Goals and Applications of Networks, Network Structure and

Architecture, The OSI Reference Model, Services, Network Topology Design- Delay

Analysis, Back Bone Design, Ocal Access Network Design. Physical Layer TransmissionMedia, Switching Methods ISDN, Terminal Handling.

UNIT 2

Medium Access Sub Layer: Channel Allocations, LAN Protocols- ALOHA Protocols-

Overview of IEEE Standards- FDDI, Data Link Layer- Elementary Data Link Protocol,

Sliding Window Protocols, Error Handling.

UNIT 3

 Network Layer: Point to Point Networks. Routing: Routing Algorithms. CongestionControl: Chock Packet, Load Shading, Leaky Bucket Algorithm, Token Bucket

Algorithm.

Internetworking: Overview, TCP/IP Model. Network Layer: IP Protocol, IP Addresses.

UNIT 4

Transport Layer: Duties, Connection Management, TPDU. Session Layer: Session and

Transport Interaction, Synchronization Points, Session Protocol Data Unit.Presentation Unit: Translation, Encryption/ Decryption, Authentication, Data

Compression.

UNIT 5

Application Layer: Message Handling System( MHS), File Transfer, Access and

Management (FTAM), Electronic Mail, DMS, Virtual Terminal, Directory Services,WWW, Common management Information Protocol( CMIP).

REFERENCES:

1. Forouzen,”Data Communication and Networking”,TMH

2. A.S.Tanenbaum,”Computer Networks”,3rd Edition,Prentice Hall India,1997.3. W.Stallings,”Data and Computer Communication”,Macmillan Press,1989.

Page 14: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 14/64

THEORY OF AUTOMATA & FORMAL LANGUAGES

CS-505

  L T P

2 1 0

UNIT 1

Introduction: Strings, Alphabets and Languages, Kleene Closure, Arithmetic Expressions,Finite Automata, Transition Graphs, Generalized Transition Graphs, Regular-

Expression, NFA & DFA, Construction of DFA from NFA & Optimization, Two Way

Finite Automata, Finite Automata with Output: Moore Machine, Mealy Machine &

Equivalence of Moore and Mealy Machine; Applications and Limitations of FiniteAutomata.

UNIT 2

Chomsky Hierarchy: Introduction to Chomsky Hierarchy, Regular Grammars,

Unrestricted Grammars, Context Sensitive Language, Relation between Classes of

Languages. Properties of Regular Sets: Pumping Lemma, Closure Properties, Decision

Algorithm, Context Free Grammar: Ambiguity, Derivation Trees, Simplification ofContext Free Grammar, Normal Forms for CFGs;

UNIT 3

Properties of CFLS: Pumping Lemma, Closure Properties and Decision Algorithms for

CFL; Ambiguous to Unambiguous CFG; Decidability of CFGs.Push Down Automata: Description and Definition, Working of PDA, Acceptance of a

String by PDA, Relationships between PDA and Context Free Grammar, Introduction to

Auxiliary PDA and Two Stack PDA.

UNIT 4

Turing Machines: The Turing Machine Model, Definition and Representation, Language

acceptance by TM, TM & Type- 0 Grammar, Halting Problem of TM, Modificationsin TM, Universal TM, Properties of Recursive and Recursively Enumerable Languages,

Unsolvable Decision Problem, Post Correspondence Problem,

REFERENCES

1. Hopcroft and Ullman, "Introduction to Automata Theory Languages and

Computation",Addison Wesley.2. Mishra & Chandrasekhar, "Theory of Computer Sciences", PHI.

3. Martin, "Introduction to Languages & Theory of Computation", TMH.

4. E V Krishanmoorthy, "Theory of Computer Science", East West Publishing.5. Korral, "Theory of Computer Sciences".

6. Kohan, "Theory of Computer Sciences”, John Wiley.

7. Avi Kohavi, "Switching & Finite Automata Theory", TMH.

Page 15: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 15/64

COMPUTER GRAPHICS & ANIMATION

CS 601

  L T P

3 1 0

UNIT 1Introduction: Representing Pictures, Pixels and Frame Buffers, Vector and Character

Generation. Graphics Primitives: Display Devices, Primitive Devices, Display File

Structure, Display Control Text. Line Drawing Algorithms: Digital Differential Analyzer,

Bresenham’s Algorithms. Circle Generation: Bresenham’s, Mid Point Algorithm.

UNIT 2

Polygon: Polygon Representation, Entering Polygons, Filling Polygons: Flood FillAlgorithm, Boundary-Fill Algorithm and Scan-line Polygon Filling Algorithm.

Segments: Segments Table, Creating Deleting and Renaming Segments, Visibility, Image

Transformations.

UNIT 3

Two Dimensional Transformations: Representation of Points, HomogeneousCoordinates. Transformation: Translation, Rotation, Scaling, Reflection, Shearing.

Windowing : Introduction, Viewing Transformation- Window to Viewport Coordinate

Transformation Multiple Windowing. Clipping: Line Clipping- Cohen-Sutherland,Midpoint Subdivision, Cyrus-Beck Algorithm, Polygon Clipping-Sutherland-Hodgman.

UNIT 4

Three Dimensional Transformation: 3-D Geometry Primitives, Transformations:Translation, Rotation, Scaling, Reflection, Shearing. Projection: Orthographic,

Axonometric, Oblique, Perspective.

UNIT 5

Hidden Line and Surface: Back Face Removal Algorithms, Hidden Line Methods:

Floating Horizon, Z-Buffer, Painter’s Algorithm, Warnock’s Algorithm. Introductionto Curve Generation, Bezier, Hermite and B-spline Algorithms and their Comparisons.

Surface Rendering: Simple Illumination Model, Phong & Gourad Shading.

Animation: Introduction, Design of Animation Sequences, Keyframe System,Parameterized System, Morphing, Motion Specification.

REFERENCES : 1. Rogers, "Procedural Elements of Computer Graphics", McGraw Hill.

2. Rogar and Adams, "Mathematical Elements of Computer Graphics", McGraw Hill .

3. Newman and Sproul, "Principle of Interactive Computer Graphics", Mc G raw Hill.

4. Steven Harrington, "Computer Graphics", A programming Approach 2nd Edition.5. Hearn & Baker, “Computer Graphics.

Page 16: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 16/64

INFORMATION SYSTEM

IT-601

L T P

  3 1 0

UNIT 1Foundation of Information Systems: Introduction to Information System in Business,

Fundamentals of Information Systems, Types of Information Systems, Solving Business

Problems with Information Systems, Effectiveness and Efficiency Criteria.

UNIT 2

System Development: System Analysis and Design functions, CASE Tools, Project

Feasibility, Information Requirement and Decision Analysis, Preparing System Proposal,Input/Output design, Procedures & Control Design, Testing and Quality Assurance,

Implementation, Evaluation and Maintenance, Hardware and Software selection.

UNIT 3Business Application of Information Systems: Internet and Electronic Commerce,

Intranet, Extranet and Enterprise Solutions, Information Systems for BusinessOperations, Information Systems for Strategic Advantages.

UNIT 4

Managing Information Technology: Enterprise and Global Management, Security &

Ethical Challenges, Planning & Implementing Changes.

UNIT 5

Advanced Concepts in Information System: Enterprise Resource Planning, Supply Chain

Management, CRM, and Procurement Management.

REFERENCES:

1. O. Brian, “Introduction to Information System”, TMH.2. O. Brain, “Management Information System”. TMH.

3. Steven Alter, “Information System: A Management Perspective”, Addison

Wesley.4. Bansal, “Information System Analysis and Design”, New Age.

5. Murdick, “Information System for Modern Management”, PHI.

Page 17: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 17/64

WEB TECHNOLOGY

IT-602

L T P

 3 1 0

UNIT 1

Introduction: History of Web. Growth of the Web, Internet and www, HTML Basicsand Tags, Web Applications, Creating Websites for Individual and Corporate World,

Introduction to Cyber Laws of India. International Cyber Laws. Web Development

Strategies: Web Projects, Writing Web Project, Identification of Objects, Target Users,

Web Team, Planning & Process Development, Early Planning, Contents, Technical &Production Planning, Communication Issues, Browsers, URL, File on the Web,

Transmission, Compression. [10]

UNIT 2

Communication with Clients, Communication Breakdowns, Development of Multi-

Departmental & Large Scale Sites, Quality Assurance & Testing, Study of Technological

Advances and Impact of Web Teams. Design Strategies for E- commerce SiteDevelopments:- Basic Foundation in E-commerce System, Creating Forms. Managing

Data Base through Web, HTML, XML, and Scripting: Lists, Tables, Images, Forms,Frames, XML Schemes, Presenting XML Processes. Introduction to Java Script,

Dynamic HTML with Java Script. [8]

UNIT 3

Java Programming: Introduction, Operator, Control Statements, Arrays, Data type,

Variables, Methods and Classes, Multi threaded Programming, I/O. [8]

UNIT 4

Java Applets. Exception Handling, Java Library: String Handling, Input / Output

Exploring Java.io, Networking, Applets Classes, Event Handling, RMI. [8]

UNIT 5

Introduction to AWT, Working with Window, Graphics, AWT Controls, LayoutManager and Menus, Images, Additional Packages, Introduction to Java Beans, Java

Swing, Java Servlets; Javascript Basics, Image Menu, LJavatron Applets, Scrabblets,

JSP, Database Connectivity & Introduction to Struts Framework.[8]

REFERENCES:

1. Sharma & Sharma ,"Developing E-commerce sites",Addison Wesley

2. Burdman, "Collaborative Web Development," Addison Wesley

3. Joel Sklar,"Principle of\Veb Design," Vikas & Thomson Learning

4. Ramesh "Multimedia and vVeb Technology" Laxmi Publication5. Herbert Schildt,"The Complete Reference:Java",TMTT

Page 18: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 18/64

MICROPROCESSORS AND ITS APPLICATIONS

CS-604

L T P

 3 1 0

UNIT 1

Category of Memory, Microprocessor, Microcontroller, Microcomputer, Minicomputer,

Buses, machine Language, Assembly Language, High Level Language, Assembly

Language Program Development Tool.8085 Microprocessor: Architecture, Pin diagram, Instruction Type, Instruction Cycle,

Timing Diagram, Addressing Modes, Instruction Set.

UNIT 2

8086 Microprocessor: Architecture, Pin Diagram, Timing Diagram, Addressing Modes,

Instruction Set, Instruction Templates, Assembly Language Programming: Procedure,

Macros, Interrupt and Interrupt Service Routine.

UNIT 3

Interfacing with Peripheral Devices and Memory: Types of Transmission, 8257(DMA),

8255(PPI), Serial Data Transfer (USART 8251), Keyboard- Display Controller ( 8279),

Priority Interrupt Controller( 8259).

UNIT 4

Interfacing with Timers and its Applications: Programmable Interval Timer/Counter

(8253/8254): Introduction, Modes, Interfacing of 8253, Applications, ADC and DAC:Introduction, ADC Converters, Types of ADC, ADC IC (0808/0809), DAC and ADC,

Interfacing and Application.

UNIT 5

Advanced Microprocessors and Micro-Controller: Introduction to Intel 80186,

80286, 80386 and 80486 Microprocessor. Introduction to Embedded System andMicrocontrollers, 8051 Micro-controller: Introduction, Architecture, Instruction set.

REFERENCES:

1. R.S. Gaonkar: “ Microprocessor architecture, Programming and Applications

with

8085/8080”, Penram Publication.2. B.Ram : “ Fundamental of Microprocessor and Microcomputer”, Dhanpat Rai

Publication, 4th edition.

3. R. Singh and B.P. Singh: “ Microprocessor Interfacing and its application”, New

Age International Publishers, 2nd Edition.4. D.V. Hall: “ Microprocessor Interfacing”, TMH ( Revised 2nd Edition).

5. R. Singh and B.P. Singh: “ Advanced Microprocessor and Micro-controllers’,

 New Age International Publishers, 2nd Edition.

Page 19: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 19/64

Page 20: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 20/64

SOFTWARE PROJECT AND QUALITY MANAGEMENT

CS-605

  L T P

2 1 0

UNIT 1Overview of Software Project Planning Software Project, Categorization of Software

Project, Introduction to Stepwise Project Planning: Identify Project Scope and objectives,

Identify Project Infrastructure, Project Products and Activities, Activity risks, Resource

Allocation, Project Plan Execution.

UNIT 2

Project Evaluation: Strategic Program Management, Technical Assessment, Cost Benefit

Analysis, Cash Flow Forecasting, Cost-Benefit Evaluation Techniques: Net profit,

Payback Period, Return on Investment, Net Present Value, Internal Rate of Return, Risk

Evaluation, Selection of Technologies, overview of software development models.

UNIT 3 

Software Effort Estimation an Overview, Project Schedules, Network Planning Models,

Activity Duration Estimation, Risk Management: Identification, Analysis and Abatementof Risk, Resource Allocation: Nature of resources, Identifying Resource Requirements,

Scheduling Resources, Creating Critical Path, Counting the Cost, Cost Schedules

 

UNIT 4 

Monitoring and Control: Visualizing progress, Cost Monitoring, Prioritizing Monitoring,

Getting Project Back to Target, Change Control, Contract Management, Human ResourceManagement, Software Quality Definition, Software Quality Assurance, Quality

Assurance Plan, Quality Matrices, ISO Standards, CMM, Six Sigma Approach

REFERENCES

1. Software Project Management by Bob Hughes and Mike Cotterell, Third Edition,TMH.

2. Information Technology Project Management by Kathy Schwalbe, International

Student Edition, THOMSON Course Technology, 2003.3. Software Quality by Mordechai Ben-Menachem/Garry S Marliss. Thomson

Learning Publication

4. Software Project Management A Unified Framework by Walker Royce. Pearson

Education

Page 21: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 21/64

ADVANCE CONCEPTS IN DATABASE SYSTEM

CS-051

L T P

 3 1 0

UNIT 1Query Processing, Optimization & Database Tuning: Algorithms for executing Query

Operations, Heuristics for Query Optimizations, Estimations for Query Processing Cost,

Join Strategies for Parallel Processors, Database Workloads, Tuning Decisions, DBMS

Benchmarks, Clustering & Indexing, Multiple Attribute Search Keys, Query EvaluationPlans, Pipelined Evaluations, System Catalogue in RDBMS.

UNIT 2

Extended Relational Model & Object Oriented Database System: New Data Types, User

Defined Abstract Data Types, Structured Types, Object Identity, Containment, Class

Hierarchy, Logic Based Data Model, Datalog, Nested Relational Model and Expert

Database System.

UNIT 3

Distributed Database System: Structure of Distributed Database, Data Fragmentation,

Data Model, Query Processing, Semi Join, Parallel & Pipeline Join, Distributed Query

Processing in R* System, Concurrency Control in Distributed Database System,Recovery in Distributed Database System, Distributed Deadlock Detection and

Resolution, Commit Protocols.

UNIT 4

Database Security: Database Security, Access Control and Grant & Revoke on Views and

Integrity Constraints, Discretionary Access Control, Role of DBA, Security in Statistical

Databases.

UNIT 5

Enhanced Data Model for Advanced Applications: Database Operating System,Introduction to Temporal Database Concepts, Spatial and Multimedia Databases, Data

Mining, Active Database System, Deductive Databases, Database Machines, Web

Databases, Advanced Transaction Models, Issues in Real Time Database Design.

REFERENCES

1. Majumdar & Bhattacharya, "Database Management System", TMH.2. Korth, Silberchatz, Sudarshan, "Database Concepts", Addison Wesley.

3. Elmastri, Navathe, "Fundamentals of Database Systems", Addison Wesley.

4. Date C.J., "An Introduction to Database System", Addison Wesley.

5. Ramakrishnan, Hadzilacous, Goodman, "Concurrency Control & Recovery",Addiosn Wesley.

6. Ceri & Palgatti, "Distributed Databases", McGraw Hill.

 

Page 22: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 22/64

BIOINFORMATICS

IT-023

L T P

3 1 0

UNIT 1

Introduction, Large-Scale Molecular Biology Data Generation, Researchers Gain Access,The Quality of the Data. Private and Future Data Sources. Metadata: Summary and

Reference Systems, Finding New Types of Data Online, Likely Growth Areas.

Biological Bases for Bioinformatics: The Diversity of Life Forms, The Unifying Theme

[10]

UNIT 2

Nucleotide Sequence Data:  Genomic Sequencing, Expressed Sequence Tags, GeneExpression, Transcription Factor Binding Sites and Single Nucleotide Polymorphisms.

Computational Representations of Molecular Biological Data Storage Techniques:

Databases: Flat, Relational and Object Oriented, Controlled Vocabularies. General Data

Retrieval Techniques: Indices, Boolean Search, Fuzzy Search and Neighboring. [8]

 

UNIT 3

Biological Data Types and Their Special Requirements: Sequences, Macromolecular

Structures, Chemical Compounds, Genetic Variability, and Connections to Clinical Data.Representations of Patterns and Relationships: Alignments, Regular Expressions,

Hierarchies, and Graphical Models: Markov Chains and Bays Notes. [7]

UNIT 4

Protein Structure Prediction:  Secondary and Tertiary, Homology Modeling, ORF

Prediction, Gene Prediction, Microarray Data Analysis Visualization: Methods for

Presenting Large Quantities of Biological Data, Particularly Sequence Viewers, 3DStructure Viewers, Anatomical Visual at Ion and Database-Driven Web Sites. [8]

 

UNIT 5

Interoperability:  The Challenges of Data Exchange of Data and Integration: On

Topologies, Interchange Languages and Standardization Efforts. XML, UMLS, CORBA,

PERL, PYTHON and OMG/Life Sciences. [7]

REFERENCES:

1. Developing Bioinformatics Computer Skill-O Reilly, 1st  Indian Edition, SPD publication.

2. An Intro. To Genetic Analysis - Anthony J. F. Griffiths et al., 1st Ed.

3. Genomics Protocols-Michael Starkey and Ramnath Elaswarapu.

4. Bioinformatics-Methods and Protocols-Stephen Misner & Stephen Krawetz5. Lawrence Hunter-Artificial Intelligence & Molecular Biology, free on web

6. DNA & Protein Sequence Analysis- A Practical Approach, IRL Press at Ox

University Press.

Page 23: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 23/64

7. O’ 'Reilly; Developing Bioinformatics Computer Skill- 1st  Indian Edition, SPD

 publication

STORAGE TECHNOLOGY AND MANAGEMENT

OECS 013

  L T P  3 1 0

UNIT 1

Introduction to Storage Technology

Data proliferation and the varying value of data with time & usage, Sources of data and Statesof data creation, Data center requirements and evolution to accommodate storage Needs,

Overview of basic storage management skills and activities, the five pillars of Technology,

Overview of storage infrastructure components, Evolution of storage, Information LifecycleManagement concept, Data categorization within an enterprise, Storage and Regulations.

UNIT 2

Storage Systems ArchitectureIntelligent disk subsystems overview, Contrast of integrated vs. modular arrays, Component

architecture of intelligent disk subsystems, Disk physical structure Components, properties, performance, and specifications, Logical partitioning of disks, RAID & parity algorithms, hot

sparing, Physical vs. logical disk organization, protection, and back end management, Array

caching properties and algorithms, Front end Connectivity and queuing properties, Front endto host storage provisioning, mapping, and operation, Interaction of file systems with storage,

Storage system connectivity Protocols.

UNIT 3

Introduction to Networked Storage

JBOD, DAS, SAN, NAS, & CAS evolution, Direct Attached Storage (DAS)Environments:

elements, connectivity, & management, Storage Area Networks (SAN):Elements &connectivity, Fiber Channel principles, standards, & network management Principles,

SAN management principles, Network Attached Storage (NAS): elements, Connectivity

options, connectivity protocols (NFS, CIFS, ftp), & management principles, IP SANelements, standards (SCSI, FCIP, FCP), connectivity principles, security, and Management

 principles, Content Addressable Storage (CAS): elements, connectivity Options, standards,

and management principles, Hybrid Storage solutions overview Including technologies likevirtualization & appliances.

UNIT 4

introduction to Information Availability

Business Continuity and Disaster Recovery Basics, Local business continuity techniques,

Remote business continuity techniques, Disaster Recovery principles & techniques.

UNIT 5

Managing & Monitoring

Management philosophies (holistic vs. system & component), Industry managementStandards (SNMP, SMI-S, CIM), Standard framework applications, Key management Metrics

Page 24: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 24/64

(thresholds, availability, capacity, security, performance), Metric analysis Methodologies

& trend analysis, Reactive and pro-active management best practices, Provisioning &

configuration change planning, Problem reporting, prioritization, and Handling techniques,

Management tools overview.

REFERENCES1. Fiber Array Storage Technology A FAST Introduction by Barry Mellish; Jure  Arzensek; Christian Demmer; Noam Rosen Publisher: IBM Redbooks

2. Resilient Storage Networks: Designing Flexible Scalable Data Infrastructure byGreg Schulz, Greg Schulz, Greg Schulz Publisher: Elsevier Science & Technology

Books.

Page 25: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 25/64

COMPILER DESIGN

CS-603

L T P

  3 1 0

UNIT 1Introduction to Compiler, Phases and Passes, Bootstrapping, Finite State Machines and

Regular Expressions and their Applications to Lexical Analysis, Implementation of

Lexical Analyzers, Lexical-analyzer Generator, LEX-compiler, Formal Grammars and

their Application to Syntax Analysis, BNF Notation, Ambiguity, YACC.

The Syntactic Specification of Programming Languages:  Context Free Grammars,

Derivation and Parse Trees, Capabilities of CFG. [10]

UNIT 2

Basic Parsing Techniques: Parsers, Shift Reduce Parsing, Operator Precedence Parsing,

Top Down Parsing, Predictive Parsers, Automatic Construction of Efficient Parsers: LR

Parsers, the Canonical Collection of LR(0) Items, Constructing SLR Parsing Tables,Constructing Canonical LR Parsing Tables, Constructing LALR Parsing Tables, using

Ambiguous Grammars, an Automatic Parser Generator, Implementation of LR ParsingTables, Constructing LALR Sets of Items. [10]

UNIT 3

Syntax-Directed Translation: Syntax-Directed Translation Schemes, Implementation of

Syntax-Directed Translators, Intermediate Code, Postfix Notation, Parse Trees & Syntax

Trees, Three Address Code, Quadruple & Triples, Translation of Assignment Statements,

Boolean Expressions, Statements that Alter the Flow of Control, Postfix Translation,Translation with a Top Down Parser. More About Translation: Array References in

Arithmetic Expressions, Procedures Call, Declarations, Case Statements. [8]

UNIT 4

Symbol Tables:  Data Structure for Symbols Tables, Representing Scope Information.

Run-Time Administration:  Implementation of Simple Stack Allocation Scheme,Storage Allocation in Block Structured Language.

Error Detection & Recovery: Lexical Phase Errors, Syntactic Phase Errors Semantic

Errors. [8]

UNIT 5

Introduction to Code Optimization:  Loop Optimization, the DAG Representation ofBasic Blocks, Value Numbers and Algebraic Laws, Global Data-Flow Analysis.

Introduction to Code Generation. [8]

REFERENCES:

1. Aho, Sethi & Ullman, “Compiler Design”, Addision Wesley.

Page 26: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 26/64

ARTIFICIAL INTELLIGENCE

CS-701

L T P

 3 1 0

UNIT 1INTRODUCTION: Introduction to AI, History of AI, Current Trends in AI, Intelligent

Agents:- Agents and Environments, Good Behavior, Nature of Environments, Structure

of Agents, Problem Solving, Problem Solving Agents, Example Problems, Searching for

Solutions, Uniformed Search Strategies, Avoiding Repeated States, Searching withPartial Information. [8]

UNIT 2

SEARCHING TECHNIQUES: Informed Search and Exploration:- Informed (Heuristic)

Search Strategies, Heuristic Function, Local Search Algorithms and Optimization

Problems, Local Search in Continuous Spaces, Online Search Agents and Unknown

Environments; Introduction to Constraint Satisfaction Problems (CSP), AdversarialSearch:- Games, Optimal Decisions in Games, Alpha – Beta Pruning, Imperfect Real-

Time Decision, Games that Include an Element of Chance. [8]

UNIT 3

KNOWLEDGE AND REASONING:  Introduction to logical Agents, First OrderLogic:– Representation, Syntax and Semantics for First Order Logic, Using First Order

Logic, Inference in First Order Logic:– Prepositional Versus First Order Inference,

Unification and Lifting, Forward Chaining, Backward Chaining, Resolution; Knowledge

Representation:- Ontological Engineering, Categories and Objects, Actions, Simulationand Events. [8]

UNIT 4

LEARNING:  Learning from Observations:- Forms of Learning, Inductive Learning,

Learning Decision Trees, Knowledge in Learning:– Logical Formulation of Learning,

Explanation Based Learning, EM Algorithm, Instance Based Learning, Introduction to Neural Networks, Introduction to LISP and PROLOG, Facts, Rules and Queries of

PROLOG, Comparison of LISP and PROLOG, Implementation. [8]

UNIT 5

INTELLIGENT SYSTEMS: Expert System- Stages in the Development of an Expert

System, Difficulties in Developing Expert System, Application of Expert System.Other Intelligent Systems- Introduction to Genetic Algorithm and Evolutionary

Programming, Swarm Intelligent Systems. [8]

Page 27: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 27/64

REFERENCES:

1 Stuart Russell, Peter Norvig, “Artificial Intelligence – A Modern Approach”, 2nd

Edition, Pearson Education / Prentice Hall of India, 2004.\2 George F. Luger, “Artificial Intelligence-Structures and Strategies for Complex

Problem Solving”, Pearson Education / PHI, 2002.

3 Nils J. Nilsson, “Artificial Intelligence: A new Synthesis”, Harcourt Asia Pvt.Ltd., 2000.

4 N.P. Padhy, “Artificial Intelligence and Intelligence systems”, Oxford Press.

Page 28: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 28/64

DISTRIBUTED SYSTEMS

CS-702

L T P

 3 1 0

UNIT 1CHARACTERIZATION OF DISTRIBUTED SYSTEMS:  Introduction: Examples

of Distributed Systems, Resource Sharing and the Web Challenges. System Models

Architectural Models, Fundamental Models, Theoretical Foundation for Distributed

System: Limitation of Distributed System, Absence of Global Clock, Shared Memory,Logical Clocks, Lamports & Vectors Logical Clocks, Causal Ordering of Messages,

Global State, Termination Detection. Distributed Mutual Exclusion: Classification of

Distributed Mutual Exclusion, Requirement of Mutual Exclusion Theorem, Token Basedand Non Token Based Algorithms, Performance Metric for Distributed Mutual Exclusion

Algorithms.

UNIT 2DISTRIBUTED DEADLOCK DETECTION:  System Model, Resource vs

Communication Deadlocks, Deadlock Prevention, Avoidance, Detection & Resolution,Centralized Dead Lock Detection, Distributed Dead Lock Detection, Path Pushing

Algorithms, Edge Chasing Algorithms. Agreement Protocols: Introduction, System

Models, Classification of Agreement Problem, Byzantine Agreement Problem,Consensus Problem, Interactive Consistency Problem, Solution to Byzantine Agreement

Problem, Application of Agreement Problem, Atomic Commit in Distributed Database

System.

UNIT 3

DISTRIBUTED OBJECTS AND REMOTE INVOCATION:  Communication

Between Distributed Objects, Remote Procedure Call, Events and Notifications,Security:- Overview of Security Techniques, Cryptographic Algorithms, Cryptography

Pragmatics, Needham- Schroeder, Kerberos, SSL & Millicent, Replication: System

Model and Group Communication, Fault - Tolerant Services, Highly Available Services,Transactions with Replicated Data.

UNIT 4

TRANSACTIONS AND CONCURRENCY CONTROL:  Transactions, Nested

Transactions, Locks, Optimistic Concurrency Control, Timestamp Ordering, Comparison

of Methods for Concurrency Control. Distributed Transactions: Flat and NestedDistributed Transactions, Atomic Commit Protocols, Concurrency Control in Distributed

Transactions, Distributed Deadlocks, Transaction Recovery, Distributed File Systems:

File Service Architecture, Sun Network File System, The Andrew File System, Recent

Advances.

Page 29: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 29/64

UNIT 5

DISTRIBUTED ALGORITHMS: Introduction to Communication Protocols, Balanced

Sliding Window Protocol, Routing Algorithms, Destination Based Routing, APSPProblem, Deadlock Free Packet Switching, Wave & Traversal Algorithms, Election

Algorithm. CORBA Case Study: CORBA RMI, CORBA Services, Java RMI..

REFERENCES:

1. Couloris, Dollimore, Kindberg,” Distributed systems: Concepts and Design”.

Pearson Education Asia, 3ed.

2. Singhal and Shivratri,” Advanced Concepts in Operating Systems”, Mc GrawHill.

Page 30: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 30/64

CRYPTOGRAPHY AND NETWORK SECURITY

CS-703

L T P

 3 1 0

UNIT 1

Introduction to OSI Security Architecture: Security Attacks, Services and Mechanisms,Introduction to Cryptology. Conventional Encryption: Conventional Encryption

Model, Classical Encryption Techniques - Substitution Ciphers: Caesar Cipher,

Monoalphabetic Cipher, Playfair Cipher, Hill Cipher, Polyalphabetic Cipher, One-Time

Pad; Transpositions Ciphers: Rail Fence Technique; Rotor Machines, Cryptanalysis,Staganography; Modern Block Ciphers- Block Ciphers Principles: Stream & Block

Ciphers, Fiestal Cipher, Shannon's Theory of Confusion and Diffusion, Data Encryption

Standards (DES): DES Encryption and Decryption, Strength of DES, Differential &Linear Cryptanalysis of DES, Block Cipher Modes of Operation: ECB, CBC, CFB, OFB,

CTR.

UNIT 2Triple DES: Double DES, TDES with Two Keys, TDES with Three Keys; IDEA

Encryption & Decryption, Strength of IDEA.Confidentiality Using Conventional Encryption: Placement of Encryption Function,

Traffic Confidentiality, Key Distribution, Random Number Generation: Use of Random

 Numbers, Pseudo Random Number Generators, Cryptographically Generated Random Numbers, Blum Blum Shub Generator.

Introduction to Graph, Ring and Field, Prime and Relative Prime Numbers, Modular

Arithmetic, Fermat's & Euler's Theorem, Primality Testing, Euclid's Algorithm.

UNIT 3

Principles of Public Key Cryptosystems: Introduction, Application & Requirement; RSA

Algorithm: Computational Aspects, Security of RSA; Key Management, Diffie-HeilmanKey Exchange Algorithm, Introductory Idea of Elliptic Curve Cryptography.

Message Authentication & Hash Functions: Authentication Requirements, Authentication

Functions, Message Authentication Codes, Hash Functions: Requirement for a HashFunction, Simple Hash Functions, Birthday Attacks, Block Chaining Techniques;

Security of Hash Function & MACS, MD5 Message Digest Algorithm, Secure Hash

Algorithm (SHA-1)..

UNIT 4

Digital Signatures: Requirements, Direct & Arbitrated Digital Signature; AuthenticationProtocols: Mutual & One way Authentication; Digital Signature Standard (DSS): DSS

Approach, Digital Signature Algorithm.

 Network Security Application- Authentication Applications: Kerberos Version 4 &

Difference between Kerberos v4 & v5, Kerberos Realms; X.509 Authentication Service:Authentication Procedures, Directory Authentication Service; Electronic Mail Security

- Pretty Good Privacy (PGP): Operational Description, Cryptographic Keys, Key Rings,

Public Key Management; S / MIME.

Page 31: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 31/64

UNIT 5

IP Security: Architecture, Authentication Header, Encapsulating Security Payloads,

Combining Security Associations, Key Management; Web Security: Secure Socket Layer& Transport Layer Security, Secure Electronic Transaction (SET); System Security:

Intruders, Viruses and Related Threats: Malicious Programs, The Nature of Viruses,

Types of Viruses, Macro Viruses, Email Viruses; Firewall: Firewall Design Principles,Trusted Systems.

REFERENCES:

1. William Stallings, "Cryptography and Network Security: Principles and Practice"Prentice Hall, New Jersey.

2. Johannes. A. Buchmann, "Introduction to cryptography", Springer Verlag. Bruce

Schiener, "Applied Cryptography".

Page 32: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 32/64

E-COMMERCE

IT-701

L T P

  2 1 0

UNIT 1

Introduction: What is E-Commerce, Forces behind E -Commerce, E-Commerce IndustryFramework, Brief History of E-Commerce. Inter Organizational E-Commerce, Intra

Organizational E-Commerce, and Consumer to Business Electronic Commerce,

Architectural framework. Network Infrastructure For E-Commerce Network

Infrastructure for E-Commerce, Market forces behind I-way, Component of I Way,Access Equipment, Global Information Distribution Network, Broad band

Telecommunication.

UNIT 2

Mobile Commerce: Introduction to Mobile Commerce, Mobile Computing Application,

Wireless Application Protocols, W AP Technology, Mobile Information Devices. Virtual

Private Network (VPN) , M commerce VS E commerce, M commerce payment methodsand issues, M Commerce limitations

UNIT 3

Introduction to Web security, Firewalls & Transaction Security, Client Server Network,

Emerging Client Server Security Threats, Electronic Payments: Overview of Electronics payments, Emerging financial Instruments, Home Banking, Online Banking, digital

signatures and authentications,

UNIT 4

 Net Commerce: EDI, EDI Application in Business, Legal & ethical Issues in E-

Commerce, Identification and tracking tools of E Commerce, web based marketing,

Some sites of interests, E Commerce in India, Case Study of Online Banking.

REFERENCES:

1. Greenstein and Feinman "E-Commerce" TMH 2. Ravi Kalakota, Andrew

Whinston "Frontiers of Electronic Commerce" Addision Wesley

2. Denial Amor "The F-Business Revolution"3. Addision Wesley Sokol "From EDI to E-Commerce : A Business Initiative" TMH

DIWAN, Sharma "E-Commerce" Excel Asset

4. lnternational "Net Commerce" TMH5. Bajaj and Nag "E-Commerce : The Cutting Edge Business" TMH.

Page 33: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 33/64

E R P

IT 702

L T P

3 1 0

UNIT 1Introduction to ERP: Evolution of ERP, Reasons for the growth of ERP, Scenario andJustification of ERP in India, Evaluation of ERP, Various modules of ERP, Advantagesof ERP, An Overview of Enterprise: Integrated Management Information, BusinessModeling, ERP for Small Business. [8]

UNIT 2ERP and Related Technologies:  Business Process Reengineering (BPR), DataMining, Data Warehousing, OLAP, Management Information System (MIS), ExecutiveInformation System (EIS), Decision Support System (DSS) ERP Modules: Introduction,

Finance, Plant Maintenance, Quality Management, Materials Management, HumanResources. [8]

UNIT 3ERP Implementation Lifecycle: Issues in Implementing ERP packages, PreevaluationScreening, Package Evaluation, Project Planning Phase, Gap Analysis, Reengineering ,Configuration, Implementation, Team Training, Testing End- User Training Vendors,Consultants and Users: In-House Implementation -Pros and Cons, Vendors,Consultants, End- Users [8]

UNIT 4ERP Market Introduction: SAP AG , Baan Company, Oracle Corporation, PeoplesOft,JD Edwards World Solutions Company, System Software Associations (SSA) , QAD , AComparative Assessment and Selection of ERP Packages and Modules. [8]

UNIT 5Future Directions in ERP:  New Markets, New Channels, Faster ImplementationMethodologies, Business Models and BAPIs, Convergence on Windows NT,Application Platforms, New Business Segments, More Features, Web Enabling, MarketSnapshot. [8]

REFERENCES:

1. Enterprise Resource Planning, Alex Leon, Tata McGraw Hill.2. ERP - A Managerial Perspective, S.Sadagopan , Tata McGraw Hill.

Page 34: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 34/64

IT IN BUSINESS

OEIT 01

L T P

 3 1 0

UNIT 1Business Drivers, Necessary Perspectives of Business, Competitive Potential of IT.,

Strategy, Strategic Alignment, Strategic Management, Competitive Strategy. [9]

UNIT 2

Rethinking Business through IT, Developing a Competitive Strategy, Intra-organization

and Interorganizational Information Systems in Business, Business to Business Systems,

Electronic Commerce, Market Systems. [9]

UNIT 3

Corporate Strategy, Formation of a Corporate IT Strategy, Developing Information

Architecture, EDI. [8]

UNIT 4

Incorporating Business Innovation into Corporate IT Strategy, Globalization, Changing

Global IT Practices, International Business, Changing Trends of IT in International

Business. [8]

UNIT 5

The Impact and Value of Information Technology in Competitive Strategy.

Changing Focus of IT Strategy: Trends in 21st Century.Application of IT in Business: A Case Study in Indian Business Scenario. [8]

REFERENCES

1. Jack D. Calion, McGraw Hills Publications

2. Trapscott Don, McGraw Hills Publications3. Stevan Alter, PHI Publications

Page 35: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 35/64

INTERNET TECHNOLOGIES AND CYBER LAWS

IT-802

L T P

 3 1 0

UNIT 1

Concept of Networking: FDDI, Ethernet 802.11a; Wireless Network and Mobile IP:Infrastructure of Wireless Networks, Wireless LAN Technology. Mobile IP; WAN:

GSM, GPRS, CDMA; Wireless PAN: Bluetooth Technology, Enhancement of Bluetooth,

Types of WPAN, Zigbee, RAN & MANET. [8]

UNIT 2

Client Server Model & Socket Interface: Client Server Model, Connectionless Iterative

Server, Connection Oriented Concurrent Server, Concurrency, Processes, Sockets, ByteOrdering, Address Transformation, Socket System Calls.  Internet Security:  Network

Attacks, Needs of Intrusion Monitoring & Detection, Intrusion Detection.

Firewall: Introduction, Types of Firewall, Design and Implementation Issues, Working of

Firewall. [10]

UNIT 3

Fundamentals of Cyber Law: Jurisprudence of Cyber Law, Object and Scope of the IT

Act, Introduction to Indian Cyber Law, International Cyber Law, UNICITRAL Model

Law on Electronic Transactions, ISP Guideline, Governance and IT Act 2000.E-commerce- Issues of privacy, E- agreement and the web surfing, cyber patents- copy

right, Protection of Web content, software patent.

Digital Signatures - Technical issues, legal issues, Electronic Records, Digital Contracts,

Government Control over electronic transaction, strategy to combat cyber crime. [10]

UNIT 4

Certifying Authorities: Need of certifying authority and Power, Appointment, function ofcontroller, generation, Suspension and Revocation.

Intellectual Property Issues & Cyberspace - Indian Perspective: Overview of Intellectual

Property related Legislation in India, Copyright law & Cyberspace, Law relating toSemiconductor Layout & Design

Domain name Disputes and Trademark Law: Concept of Domain name, Trademark,

Jurisprudence, cyber squatting, reverse hijacking, Meta tags, framing [8]

UNIT 5 

The Cyber crime: Tampering computer documents, hacking with computer system,Obscene in electronic Document, offences: breach of confidentiality and privacy in

digital signature certification, Typology of Cyber Crimes, Cyber Crime & Evidence Act.

Cyber Crime in other countries, Cyber Crime Forensics, Case studies in Cyber Crime.

[8]

Page 36: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 36/64

REFERENCES

1. TCP/IP Illustrated Vol-1 and Vol-II by Richards Stevens

2. TCP/IP Protocol suite - Forouzan B.A. (TMH)3. Network Security Essentials (Application and Standard) – Williams Stallings

4. Unix Network Programming – Richards Stevens

5. Jonathan L. Zittrain, Internet Law: "Technological Complements to Copyright"(Foundation Press, 2005)

6. Cyber Law in India by Farooq Ahmad-Pioneer books.

7. Information technology Law and Practices by Vakul Sharma-University Law

Publishing Co.Pvt.Ltd.8. Handbook of Cyber & E-Commerce Laws by P.M.Bakshi & R.K.Suri –Bharat

Law House ,New Delhi.

9. Guide to Cyber Law by Rodney D Rider-Wadhwa and company Nagpur.10.The Information technology Act,2000-Bare Act-Professional Book Publisher-

 New Delhi

Page 37: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 37/64

DATA WAREHOUSING AND DATA MINING

IT-801

 

L T P

  2 1 0

UNIT 1Overview & Concepts- The Compelling Need for Data Warehousing: Introduction to

Data Warehousing, Failures of Past Decision Support System, Data Warehousing- The

Only Viable Solution., Architecture: Understanding Data Warehouse Architecture,

Architectural Framework, Data Warehouses and Data Marts; Overview of Components,

UNIT 2

Technical Architecture: Introduction to Principles of Dimensional Modeling; DataExtraction, Transformation, and Loading, Data Quality: Why is data Quality Critical? ,

Data Quality Challenges; OLAP in the Data Warehouse: Demand for Online Analytical

Processing, Major Features and Functions, OLAP Models.

UNIT 3

Data Mining: Introduction, Data Mining Functionalities, Classification of Data MiningSystem; Major Issues in Data Mining, Data Preprocessing: Preprocess, Descriptive Data

Summarization, Data Cleaning, Data Integration & Transformation, Data Reduction,

Mining Frequent Patterns, Association, and Correlations, Basic Concept, Efficient &Scalable Frequent Itemset Mining Methods, Mining Various Kinds of Association Rules.

UNIT 4

Classification & Prediction: Issues, Classification by Decision Tree Induction, BayesianClassification, Classification by Back Propagation, Associative Classification, nearest

neighbor classified , Prediction, Cluster Analysis: What is Cluster Analysis, Types,

Categorization of Major Clustering Methods, Partitioning Methods, HierarchicalMethods- cure and chameleon , Density-Based Methods: DBSCAN & OPTICS, Wave

Cluster, CLIQUE, Mining Stream: Mining Data Stream, Spatial Data Mining,

Text Mining, Mining the WWW,

 REFERENCES

1. “Data Warehousing Fundamental” by Paulraj Ponniah,John Wiley & Sons INC.2. Data Mining,Second Edition; Concepts & Techniques by Jiawei Han & Michline

Kamber.

3. Mallach,”Data Warehousing System”,McGraw Hill4. M.H.Dunham, “Data Mining:Introductory and Advanced Topics” Pearson

Education

Page 38: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 38/64

DATA COMPRESSION

CS-021

L T P

 3 1 0

UNIT 1Introduction:  Compression Techniques: Loss Less Compression, Lossy Compression,

Measures of Performance, Modeling and Coding. Mathematical Preliminaries for

Lossless Compression: A Brief Introduction to Information Theory:- Models: Physical

Models, Probability Models, Markov Models, Composite Source Model, Coding:-Uniquely Decodable Codes, Prefix Codes. [7]

 UNIT 2

  Huffman Coding: The Huffman Coding Algorithm: Minimum Variance Huffman

Codes. Adaptive Huffman Coding: Update Procedure, Encoding procedure, Decoding

Procedure, Golomb. Codes, Rice Codes, Tunstall codes. Application of Huffman Coding.

Lossless image compression, Text compression, Audio Compression. [7] 

UNIT 3

Arithmetic Coding:  Coding a Sequence, Generating a Binary Code, Comparison of

Binary and Huffman Coding, Applications:- Bi-Level Image Compression. The JBIG

Standard, JBIG2, Image Compression. Dictionary Techniques: Introduction, StaticDictionary :- Diagram Coding Adaptive Dictionary: The LZ77 Approach, The LZ78

Approach Applications. [8]

UNIT 4

Prediction with Partial Match (ppm) : The Basic Algorithm, The ESCAPE SYMBOL,

Length of Context, The Exclusion Principle, The Burrows - Wheeler Transform: Move-

to- Front Coding, CALlC, JPEG-LS, Multiresolution Approaches, Facsimile Encoding,Dynamic Markov Compression. [8]

UNIT 5

Mathematical Preliminaries for Lossy Coding: Distortion Criteria, Models. Scalar

Quantization: The Quantization Problem, Uniform Quantizer, Adaptive Quantization,

 Non Uniform Quantizaion.

Vector Quantization: Advantages of Vector Quantization Over Scalar Quantization,

The Linde - Buzo-Gray Algorithm, Tree Structured Vector Quantizers, Structured Vector

Quantizers. [12]

REFERENCES:

1. Introduction to Data Compression, Khalid Sayood, Morgan Kaufmann Publishers.

2. Data Compression: The Complete Reference, Third Edition by David Salomon,Springer, New york, 2004

Page 39: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 39/64

ADVANCED CONCEPTS OF TCP / IP

  CS-033

L T P

 3 1 0

UNIT 1

Introduction and Overview: The Motivation for Internetworking, The TCP/IP Internet.The Need to Understand Details, Complexity of Interactions Among Protocols, Use of

TCP/IP, Designing Applications for a Distributed Environment Standard and

 Nonstandard Application Protocols, Application Protocols and Software Complexity,

TCP/IP Protocol Suite, Addressing, TCP/IP Versions. [8]

UNIT 2

IP Addresses: Introduction: Address Space, Notation, Classful Addressing: RecognizingClasses, Netid and Hostid, Classes and Blocks, Network Addresses, Mask, Address

Depletion. Other Issues, Multihomed Devices, Location, Special Addresses, Private

Addresses, Unicast, Multicast and Broadcast, Addresses, Sub Netting, Super Netting,

Subnet Mask, Supernet Mask and Classless Addressing. [8]

UNIT 3

ARP and RARP: ARP Packet Format, Encapsulation, Operation, ARP Over ATM, Proxy

ARP, ARP Package, RARP-Packet Format, Encapsulation, Internet Control Message

Protocol( ICMP), Message Format, Checksum, ICMP Package, Internet GroupManagement Protocol (IGMP), IGMP Messages, IGMP Operation, Encapsulation, IGMP

Package, User Datagram Protocol(UDP), Process to Process Communication, Checksum,

UDP Operation, UDP Package. [8]

UNIT 4

Transmission Control Protocol (TCP): Process to Process Communication, TCP Services,

TCP Timers, Connection, TCP Operation, TELNET, Concept, Network VirtualTerminal(NVT), File Transfer Protocol(FTP), Trivial File Transfer Protocol (TFTP),

Messages, Connection, Data Transfer, Simple Mail Transfer Protocol (SMTP), User

Agent, Addresses, Mail Transfer Phases, Multipurpose Internet Mail Extensions(MIME), Mail Delivery, Mail Access Protocol.

[8]

UNIT 5

IP Over ATM, ATM WANs, Carrying a Datagram in Cells, Routing the Cells, Mobile IP,

Addressing, Agents, Data Transfer, Real-Time Traffic Over the Internet, Characteristics,Internet Security, Introduction, Privacy, Digital Signature, Firewalls, Private Networks,

Virtual Private Networks(VPN), Network Address Transmission(NAT), IP Next

Generation, IPv6 Addresses, IPv6 Packet Format. [8]

REFERENCES

1. “TCP / IP Protocol Suite”, ‘Behrouz A. Forouzan’, TMH

2. “Internetworking with TCP/ IP- vol-I”, ‘Douglas E. Comer’, Third Edition, PHI3. Internetworking with TCP/ IP- vol-II”, ‘Douglas E. Comer’, Third Edition, PHI

Page 40: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 40/64

4. Internetworking with TCP/ IP- vol-III”, ‘Douglas E. Comer’, Second Edition, PHI

Page 41: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 41/64

FUZZY LOGIC AND NEURAL NETWORKS

CS-801

L T P

 3 1 0

UNIT 1Introduction, History of Neural Networks, Structure and Function of a Single

 Neuron, Architectures and Their Applications, Supervised Learning: Single Layer

 Networks: Perceptrons, Linear Seperability, Perceptron Training Algorithms and Their

Modifications: Pocket Algorithm and Adaline.Supervised Learning: Multiplayer Networks: Multilevel Discrimination, Preliminaries,

and Backpropagation Algorithm, Setting the Parameters Values, Accelerating the

Learning Process. [8]

UNIT 2

Adaptive Multilayers Networks: Network Pruning Algorithms, Marchands Algorithm,

Upstart Algorithm, Cascade Correlation.Prediction Networks: Feed Forward Networks for Forecasting, Recurrent Networks

(Partially, Fully), Radial Basis Functions and Probabilistic Neural Networks. [8]

UNIT 3

Unsupervised Learning: Winner-Take-All Networks: Hamming Networks, Maxnet;Learning Vector Quantization, Counter Propagation Networks(Forward Only Counter

Propagation networks) , Adaptive Resonance Theory(ART1), K-Means Clustering

Algorithms, Kohonens Self Organization Maps, Principle Component Analysis.

  [8]

UNIT 4

Fuzzy Logic: Fuzzy Sets, Properties, Operation on Fuzzy Sets, Fuzzy Relations,

Operation on Fuzzy Relations, Fuzzy IF-THEN Rules, Variable Inference Techniques,Fuzzification and Defuzzification Methods, Fuzzy System Design. [8]

UNIT 5

Associative Models: Auto-Association, Hetro-Association, Hopefield Networks, Brain

State-In-A-Box Networks, and Boltzman Machines.

Optimization Methods: Optimization Using Hopefield Networks, Introduction toSimulated Annealing and Ant Colony Optimization and Evolutionary Computation,

Introduction to Hybrid Systems.

  [8]

Page 42: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 42/64

REFERENCES:

1. Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka, Elements of Artificial

 Neural Networks, MIT Press/Penram International.2. Simon Haykin, Neural Network a comprehensive Foundation, Macmillan

College, proc, Con, Inc.

3. Ross T.J., Fuzzy Logic with Engineering Applications, McGraw-Hill.4. Zurada J.M., Introduction to Artificial Neural Systems, Jaico Publishers.

5. Riza C. Berkiu and Trubatch, Fuzzy system Design Principles, Building Fuzzy IF-

THEN Rule Bases, IEEE Press.

6. Goldberg D.E., Genetic Algorithms in Search Optimization and MachineLearning, Addison Wesley.

7. Dorigo and Thomas Stützle, Ant Colony Optimization, MIT Press.

8. Intelligent Hybrid Systems, Suran Goonatilake and Sukhdev Khebbal (Eds.),Intelligent Hybrid Systems, John Wiley.

Page 43: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 43/64

COMPONENT BASED DEVELOPMENT

IT-031

L T P

 3 1 0

UNIT 1Introduction to Component Based Development, Industrialization of Software

Development, CBD Drivers and Benefits, Technology Evolution, Components and

 Network Computing.

UNIT 2

Fundamentals Basic Concepts of CBD, Scenarios of CBD, Evolution or Revolution?

Build, Find and Use Components and Objects.

UNIT 3

Models: Basic Concepts of Object Models Components and Interfaces, Working with

Interfaces, Component and Interface Modeling, Describing Classes, Patterns andFrameworks, Categorizing & Deploying Components.

UNIT 4

Introduction, Interface Definition Language, The CORBA 2 Standard, CORBA Services,

CORBA Facilities and CORBA Domains, Relationships with other Technologies, TheCORBA Migration Process, CORBA Migration Case Study.

UNIT 5

COM: Components, The Interface, Query interface, Reference Counting, DynamicLinking, Hresults, Guids, The Registry, The Class Factory, Component Reuse:

Containment and Aggregation, Client and Server Side Simplifications, Servers in Exes,

Dispatch Interfaces and Automation, Multiple Threads.

REFERENCES:

1.Clemens Szyperski, "Component Software - Beyond Object OrientedProgramming", Addison - Wesley, 1998.

2. Thomas J .Mowbray, William A. Ruh, "Inside CORBA Distributed Object

Standards and Applications", Addison - Wesley, 2001.3. Dale Rojerson, "Inside COM", Microsoft Press, 2001.

4. Andreas Vogel, Keith Duddy "Java Programming with CORBA" John Wiley &

Sons. 1998.5. Kuth Short, "Component Based Development and Object Modeling", Sterling

Software.

Page 44: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 44/64

REAL TIME SYSTEMS

CS-043

  L T P

 3 1 0

UNIT 1

Introduction- Introduction to Real Time Systems, Structure of Real Time System,Various Classification of Real Time Systems, Embedded System, Characterizing Real

Time System & Task, Various Issues in Real Time System. [6]

UNIT 2

Task Assignment & Scheduling- Classical Uniprocessor Scheduling Algo- Rate

Monotonic, EDF. Uniprocessor Scheduling of IRIS Tasks, Identical and Nononidentical

Linear & Concave Reward Function, 0/1 Reward Function. Task AssignmentAlgorithms- Utilization Balancing, A Next-Fit Algorithm for RM Scheduling, A Myopic

Offline Scheduling FAB Algorithm & Buddy Strategy. [10]

UNIT 3Real Time Database: Real Time vs. General purpose Database, Main Memory database,

Concurrency Control Issues , Real Time OS- Threads and Tasks, Kernel, Case Study ofQNX, VRTX, Vx Works.

[8]

UNIT 4

Fault Tolerance Techniques- Introduction Fault, Fault Detection and Error

Containment, Redundancy Data Diversity, Reversal Checks, Malicious & Integrated

Failure Handling. Clock Synchronization: Introduction Clocks, A Nonfault Tolerant

Synchronization Algorithms, Impact of Fault, Fault Tolerant Synchronization in H/W  

and S/W. [8]

UNIT 5

Real Time Communication- Introduction, N/W  Topologies, Protocols: Internet &

Resource Reservation Protocols, Real Time Protocol, Contention-Based Protocol.

  [8]

REFERENCE

1. C.M. Krishna & Shin, "Real Time Systems", Mc Graw Hill 1985.2. Jane W.S. LIU, "Real Time Systems", Pearson Education".

3. Levi & Agarwal, "Real Time System", McGraw Hill.

Page 45: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 45/64

MULTIMEDIA SYSTEM

IT-032

L T P

 3 1 0

UNIT 1

Introduction to Multimedia: Evolution of Multimedia and its Objects, Scope ofMultimedia in Business & Work, Production and Planning of Multimedia Applications.

Multimedia Hardware, Memory & Storage Devices, Communication Devices,

Multimedia Software, Presentation and Object Generation Tools, Video, Sound, Image

Capturing, Authoring Tools, Card & Page Based Authoring Tools. [10]

UNIT 2

Production and Planning of Multimedia Building Blocks: Text, Sound (MIDI), DigitalAudio, Audio File Formats, MIDI Under Windows Environment, Audio & Video

Capture. [7]

UNIT 3Macromedia Products: Basic Drawing Techniques, Advance Animation Techniques,

Creating Multi Layer Combining Interactivity and Multiple Scenes, CreatingTransparency Effects using Text in Flash, Flash Animation.

Multimedia and the Internet: The Internet and how it Works - Tools for the World Wide

Web - Designing for the World Wide Web. [8]

UNIT 4

Digital Audio Concepts, Sampling Variables, Loss Less Compression of Sound, Lossy

Compression & Silence Compression. [7]

UNIT 5

Multimedia Monitor Bitmaps, Vector Drawing, Lossy Graphic Compression, Image FileFormat, Animations Image Standards, JPEG Compression, Zig Zag Coding,

Video Representation: Colors, Video Compression, MPEG Standards, MHEG Standard,

Recent Development in Multimedia.Multimedia Application Planning, Costing, Proposal Preparation, and Financing-Case

Study of a Typical Industry. [8]

REFERENCES:

1. Andreas Halzinger, "Multimedia Basics", Vol-I to Vol-III, Firewall Media, New

Delhi.2. Tay Vaughan, "Multimedia Making It work", Tata McGraw Hill.

3. Buford, "Multimedia Systems", Addison Wesley.

4. Agarwal and Tiwari, "Multimedia Systems", Excel.

5. Rosch, "Multimedia Bible", Sams Publishing6. Sleinreitz, "Multimedia Systems", Addison Wesley

Page 46: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 46/64

DIGITAL IMAGE PROCESSING

CS-704

L T P

 2 1 0

UNIT-1

Introduction and Fundamentals: Motivation and Perspective, Applications, Components of Image Processing System,

Element of Visual Perception, A Simple Image Model, Sampling and Quantization.

  Image Enhancement in Frequency Domain: Fourier Transform and the Frequency

Domain, Basis of Filtering in Frequency Domain, Filters –Low-pass, High-pass;Correspondence between Filtering in Spatial and Frequency Domain; Smoothing

Frequency Domain Filters – Gaussian Low pass Filters; Sharpening Frequency Domain

Filters – Gaussian High pass Filters; Homomorphism Filtering.

UNIT-2

Image Enhancement in Spatial Domain:

Introduction; Basic Gray Level Functions – Piecewise-Linear TransformationFunctions: Contrast Stretching; Histogram Specification; Histogram Equalization; Local

Enhancement; Enhancement Using Arithmetic/Logic Operations – Image Subtraction,Image Averaging; Basics of Spatial Filtering; Smoothing - Mean filter, Ordered Statistic

Filter; Sharpening – The Laplacian.

UNIT-3

Image Restoration:

A Model of Restoration Process, Noise Models, Restoration in the presence of Noise

only-Spatial Filtering – Mean Filters: Arithmetic Mean filter, Geometric Mean Filter,Order Statistic Filters –Median Filter, Max and Min filters; Periodic Noise Reduction

 by Frequency Domain Filtering –Band pass Filters; Minimum Mean-square Error

Restoration. Morphological Image Processing: Introduction, Logic Operations involvingBinary Images, Dilation and Erosion, Opening and Closing, Morphological Algorithms

 – Boundary Extraction, Region Filling, Extraction of Connected Components, Convex

Hull, Thinning, Thickening

UNIT-4

Registration :Introduction, Geometric Transformation – Plane to Plane transformation,Mapping, Stereo Imaging –Algorithms to Establish Correspondence, Algorithms to

Recover Depth. Segmentation: Introduction, Region Extraction, Pixel-Based Approach,

Multi-level Threshold, Local Threshold, Region-based Approach, Edge and LineDetection: Edge Detection, Edge Operators, Pattern Fitting Approach, Edge Linking and

Edge Following, Edge Elements Extraction by Threshold, Edge Detector Performance,

Line Detection, Corner Detection.

Page 47: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 47/64

REFERENCES 

1. Digital Image Processing 2ndEdition, Rafael C. Gonzalvez and Richard E.

Woods. Published by: Pearson Education.2. Digital Image Processing and Computer Vision, R.J. Schalkoff. Published by:

John Wiley and Sons, NY.

3. Fundamentals of Digital Image Processing, A.K. Jain. Published by PrenticeHall, Upper Saddle River, NJ.

Page 48: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 48/64

GIS TERMINOLOGY AND ITS APPLICATIONS

CS-053

L T P

 3 1 0

UNIT 1

Introduction, GIS Definition and Terminology, GIS Categories, Components of GIS,Fundamentals Operations of GIS, A Theoretical Framework for GIS. [8]

UNIT 2

Types of Data Representation: Data Collection and Input Overview, Data Input and DataOutput, Keyboard Entry and Coordinate Geometry Procedure, Manual Digitizing,

Scanning, Raster GIS, Vector GIS, File Management, Spatial Data, Layer Based GIS,

Spatial Metadata, Feature Based GIS Mapping. [8]

UNIT 3

GIS Spatial Analysis: Computational Analysis Methods (CAM), Visual Analysis

Methods (VAM), Data Storage, Vector Data Storage. Attribute Data Storage, Raster DataStorage, Overview of Data Manipulation and Analysis. [8]

UNIT 4

Data Quality: Introduction, Components of Data Quality, Sources of Error, Overview of

GIS Analysis Functions, Data Layers, A Classification of GIS Analysis Functions,Implementing GIS. [8]

UNIT 5

GIS Applications: Application of GIS in Environment Monitoring, Natural HazardManagement, Natural Resource Management Urban Planning, Utility Management, Land

Information, Soil Loss Estimation, Transportation Engineering, Water Resources

Engineering. [8]

REFERENCES

1. Remote Sensing and Image Interpretation by T.M. Lilles and R.W. Kiefer.

2. Geographic Information Systems-A Management Perspective by Stan Aronoff,

WDL publication.3. Geographic Information Systems-David Martin.

4. Fundamentals of Spatial information System by Robert Laurini and Derek

Thompson, Academy Press.5. Burrough P A 2000 P A McDonnell (2000) Principles of Geographical

information systems, Landon: Oxford University Press.

6. Haywood. L, comelius. S and S. Carver(l988) A Introduction to Geographical

information systems, Addison Wiley Longmont. New York.

Page 49: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 49/64

MOBILE COMPUTING

CS-031

L T P

 3 1 0

UNIT 1

Issue in Mobile Computing, Digital Cellular Standard, IEEE 802.11, channelallocation in cellular system, GSM: air interface, channel structure, location

management, HLR VLR, hierarchical, Handoff, CDMA and GPRS.

[8]

UNIT 2

Mobile Computing Architecture: Peer to Peer architecture for mobile application, three

tier architecture, wireless networking, wireless LAN over MAC, wireless multipleAccess Protocol, TCP over wireless, WAP architecture, Protocol stack, application

environment. [8]

UNIT 3Mobility, Wireless Communication & Portability, Data Replication & Replication

Schemes, Adaptive Clustering for Mobile Wireless Network, Transaction Management,Mobile Transaction Processing, Mobile Database Research Directories, Security Fault

Tolerance for Mobile Network. [8]

UNIT 4

Emerging technology: Bluetooth, wireless broad band (Wi MAX), Internet Protocol

version6(IPV6), radio frequency identification, cellular digital packet data(CDPD)

standard, SMS: mobile computing over SMS, value added service through SMS.  [8]

UNIT 5

Adhoc Network, Routing Protocol, Global State Routing (GSR), Dynamic State Routing(DSR), Fisheye State Routing (FSR). Adhoc On-demand Distance Vector Routing

(AODV) , Destination Sequenced Distance Vector Routing (DSDV), temporary ordered

routing algorithm(TORA), QoS in ad hoc network application.[8]

REFERENCE

1. Asoke K Talukdar, mobile computing, TATA MC Graw HILL

2. J. schiller, mobile communication, Addison Wesley

3. Charles Perkins, ad hoc networks, Addision Wesley

Page 50: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 50/64

 DATABASE MANAGEMENT SYSTEMS LAB

  (CS-551)

L T P

0 0 3

 

1. Database design using E-R Model and Normalization.

2. Write the queries for DDL, DML & DCL.

3. Write Queries using Logical Operators (=, <, > etc.)

4. Write queries using SQL operators (BETWEEN…AND, IN(list), LIKE, ISNULL

and along with Negation expressions.)

5. Write SQL query using Character, Number, Date and Group Functions.

6. Write SQL Queries for Relational Algebra (UNION, INTERSECT and MINUSetc.)

7. Write queries for extracting data from more than one table (Equi-Join, Non-Equi

Join, Outer Join)

8. Write SQL Queries for Sub queries, Nested queries.

9. Concept of COMMIT, ROLLBACK and CHECK POINTS.

10. Creation of Views.

11. Write programs by the use of PL/SQL (Procedures and Functions.)

12. High-level language extension with Cursor and with Triggers.

13. Creation of Forms & Reports.

14. Design and Implementation of the Mini Project.

Page 51: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 51/64

DESIGN AND ANALYSIS OF ALGORITHM LAB

(CS-552)

L T P

3 1 3

1. Implement the algorithms for various sorting Techniques.

2. Implement the algorithms based on B-Tree and Red Black tree.

3. Implement algorithms based on Divide and Conquer, Dynamic programming,Greedy Method and Backtracking Techniques.

4. Implement algorithms based on Matrix Multiplications.

5. Implementation of Graph algorithms: Directed Graphs, Shortest paths &

Minimum spanning trees.

6. Implement algorithms for searching for a pattern in a text.

Page 52: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 52/64

SOFTWARE ENGINEERING LAB

(CS-553)

A) SECTION – A

1. Illustration of various activities using MS-Project 2000.

2. Perform Cost/Benefit Analysis using tools.

3. Design & Development of Test Cases.

4. Development of Software Tool for Halstead Analysis.

5. Program for Computing Cyclomatic Complexity.

B) SECTION – B

CASE TOOLS LAB

a) Program Analysis and Project Planning.

Through study of the problem-identify project scope, Objectives, Infrastructure.

 b) Software Requirement Analysis

Describe the individual phases/modules of the project, Identify deliverables.

c) Data Modeling

Use work products-Data dictionary, Use diagrams and activity diagrams, build

and test lass diagrams, Sequence diagrams and add interface to class diagrams.

d) Software Development and Debugging.

e) Software Testing

Prepare test plan, perform validation testing, Coverage analysis, memory eaks,

develop test case hierarchy, Site check & Site monitor.

Note : 1. All the programs of Section – A are to be written using C/C++ / Java.

2. All the exercises of Section – B are to be solved using latest CASE tools

like VISIO/RATIONAL ROSE or any other.

L T P

0 0 3

Page 53: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 53/64

Page 54: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 54/64

19. Simulation of network based on UDP (User Datagram Protocol) using netsim.

20.Simulation of network based on ATM (Asynchronous Transfer Mode) using

netsim.

(C) ‘C’ PROGRAMS

21. WAP to implement TOKEN RING protocol.

22. WAP to implement ALOHA protocol.

23. WAP to implement CSMA/CD protocol for a single channel.

24. WAP to implement CSMA/CD protocol for a double channel.25. Simulation of bit stuffing and Error Detection Mechanism (VRC, LRC)

Page 55: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 55/64

COMPUTER GRAPHICS LAB

CS 651

L T P

0 0 3

(1) DDA Line Drawing Algorithm

(2) Bresenham’s Line Drawing Algorithm

(3) Mid-Point Circle Drawing Algorithm

(4) Rotation of 2D(A) Line

(B) Triangle

(C) Rectangle

  (5) Translation of 2D

(A) Line(B) Triangle

(C) Rectangle

 (6) Scaling of 2D

(A) Line

(B) Triangle

(C) Rectangle 

(7) Cohen Sutherland Line Clipping Algorithm

(8) Projection

(A) Parallel

(B) Perspective

(9) Text Animation using Flash

 (10) Motion of Ball using Flash

  (11) Motion of a Ball along a specified path

  (12) Shape animation using Ball

  (13) Animation of object using Maya.

Page 56: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 56/64

 

JAVA PROGRAMMING LAB

(IT-652)

L T P0 0 3

1. Write programs to use primitive data type, Arrays, classes, interfaces.

2. Write programs to use String, String Buffer class and String Builder.

3. Implements the concepts of functions, function overloading, function

overriding.

4. Describe the I /O package & develop its application.

5. Write program based on Threads, Runnable Interface & use all its methods.

6. Create GUI application using AWT & Applet classes.

7. Design & develop the client-server application using NET package.

8. Implement database application using JDBC package.

9. Illustrate the use of RMI.

10. Describe & develop Java Servlet

11. Create application using Java Swing package.

12. Introduction to Java Server Pages

13. Introduction to Java Beans.

Page 57: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 57/64

Page 58: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 58/64

MICROPROCESSOR LAB

CS-654

L T P

0 0 2

LIST OF EXPERIMENTS

1. Programming with 8086 8 bit/ 16-bit multiplication/ division arithmetic operation.

2. Programming with 8086- code conversion, decimal arithmetic, bit manipulations.

3. Programming with 8086- arrays manipulation, search, find and replace, copy

operations, sorting.

4. Programming for parallel interfacing.

5. Programming for serial interfacing.

6. Programming for verification of interrupts.

7. Programming for interfacing with timer.

8. Other interfacing program based on availability of equipments.

9. Programming for Analog to Digital conversion (ADC) and (DAC)

10. Programming using Look up table (concept of look up table)

Page 59: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 59/64

ARTIFICIAL INTELLIGENCE LAB

CS-751

L T P

0 0 3

Implement the programs based on the following topics in C/C++/Java/Lisp/Prolog.

  1. Tower of Hanoi.

2. Uninformed Searches- Breadth First Search.

3 Depth first Search.

4. Iterative Deepening Search.

5. Depth Limited Search.

6. Informed Search- A* Algorithm.

7. Tic Tac Toe Problem.

8. 8 Puzzle Problem.

9. Hill Climbing.

10. Learning through Decision Trees.

11. Learning through Neural Networks.

Page 60: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 60/64

DISTRIBUTED SYSTEMS LAB

CS-752

L T P

0 0 3

1. Design and implementation API using JAVA application.

2. The design and implementation of a Task Bag server using CORBA or Java RMI.

3. Implementation of RMI using Java.

4. TSR Programming

5. Creation of socket based client and serve let.

6. Design and implementation of a sequence multicast protocol using Java.

7. Creation of an applet by using swings.

8. Prototype for stateless file server and its cache mechanism

Page 61: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 61/64

PROJECT

IT 754

L T P

0 0 3

Students are expected to identify the problem, which would be carried out as a project

work during whole year. Student must complete requirement & Specification, Feasibility

study, Analysis, Project Schedule, detailed design etc of the project and synopsis must be

approved by the department/project Guide. Students are encouraged to interact with local

Industry for project work. The Project with R & D nature will be appreciated.

Page 62: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 62/64

ADVANCED TECHNOLOGY LAB

CS-852

L T P

 0 0 3

Basic of the .Net framework: .Net architecture, managed code, assemblies, clr,

execution of assemblies code, il, jit, net framework class library, common type system,

common language specification, interoperability with unmanaged code.

Introduction to VB.Net and C#:

VB.Net :  Net features, Data Types C# : Data Types, Operators, Garbage Collection,Jagged Array, Collection (Array list, Hash table), Indexer(One Dimension) and property,

Delegates and events(Multicasting , Multicasting Event), Exception Handling, Window

forms.

ADO.Net & Object Oriented Concepts (Using VB.Net Or C#): Basic window control,Architecture of ADO.Net, Comparison with ADO, .Net Data provider, Data Adapter,

Data Set, Data Row, Data Column, Data Relation, command, Data Reader, Data GridConstructor, Destructor, Abstraction, interface, polymorphism (Over loading and over

ridding).

Practical

1. A program of binary operator Over loading

2. A program using delegation in which addition and subtraction of two integervalue possible

3. A program-using Interface.

4. A program to display the caption, height of command button into label.5. A window program for list box give the facility for adding, removing and clearing

the list with conformation and store the deleted file in another list box.

6. Creating a window form through which user can enter details of employee:empid, empname, basic salary, sex, date of birth, date of joining, Designation,

total income, total deduction and gross salary will be calculated automatically.

7. Also in above program all details of employee will be appear in Grid and

depending upon selection particular actual record will be appear in form.

ASP.Net : Anatomy of ASP.NET Page, Server Controls : label, dropdown list box,

validation controls, list box, text box, radio button, check box, State Management :session, caching, Authentication (window,.Net Passport, Forms Based), Authorization,

web services, Advance Grid Manipulation.

Page 63: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 63/64

Page 64: Syllabus IT 2010.Doc

8/12/2019 Syllabus IT 2010.Doc

http://slidepdf.com/reader/full/syllabus-it-2010doc 64/64

PROJECT

  IT 853 L T P

0 0 3

Students will complete the project identified in previous semester, coding,implementation etc of the project should be done in this semester. At the end of the

semester, student will submit detail project report and soft copy of project work which

will be evaluated by the expert from the University.