Proposed b Tech 3 4 Year5

8/6/2019 Proposed b Tech 3 4 Year5

1/52

G. B. Technical University,

Lucknow

SYLLABU

S

B.Tech THIRD and FOURTH

YEAR

( Semester V, VI, VII and

VIII)

Computer Science &

Engineering and

Information Technology

Effective from session 2010-11

1


2/52

B.Tech

Study and Evaluation Scheme


Computer Science & Engineering

Year-III, Semester V

SNo Subject Subject

Period

Evaluation Scheme Total

Code

Sessiona

l

Exam

CT TA Total

1 EHU-501 Engineerin g & 3-1-0 30 20 50 100 150

Managerial

Economics2 EC S-501 Operating System 3-1-0 30 20 50 100 150

3 EC S-502 Design and Analysis

of

3-1-0 30 20 50 100 150

Algorithm

s4 EC S-503 Object

Oriented

3-1-0 30 20 50 100 150

Technique

s5 EC S-504 Computer Graphics 2-1-0 15 10 25 50 75

6 EC S-505 Graph Theor y 2-1-0 15 10 25 50 75

Pra cticals / Training

/Projects

7 EC S-551 Operating System Lab* 0-0-2 - 25 25 25 50

8 EC S-552 Algorithms Lab* 0-0-2 - 25 25 25 50

9 EC S-553 Object

Oriented

0-0-2 - 25 25 25 50

Techniques

Lab*10 EC S-554 Computer Graphics 0-0-2 - 25 25 25 50

Lab*11 GP-501 General Proficiency - - - - -

50

*At least 10 problems are to be considered based on corresponding theory

course

.

2


3/52

B.Tech




Year-III, Semester VI

SNo Subject Subject

Period


Code

Sessiona

l

Exam

CT TA Total

1 EHU-601 Industrial Management 3-1-0 30 20 50 100 150

2 EC S-601 Computer Network 3-1-0 30 20 50 100 150

3 EC S-602 Software Engineering 3-1-0 30 20 50 100 150

4 EC S-603 Compiler Design 3-1-0 30 20 50 100 150

5 EC S-604 Web Technology 2-1-0 15 10 25 50 75

6 EIT-505 Information

Security

2-1-0 15 10 25 50 75

and Cyber LawsPra cticals / Training/Projects

7 EC S-651 Computer Network 0-0-2 - 25 25 25 50

Lab*

8 EC S-652 Web Technology based 0-0-2 - 25 25 25 50

Software

EngineeringLab*

9 EC S-653 Compiler Lab* 0-0-2 - 25 25 25 50

10 EC S-654 Seminar 0-0-2 - 50 50 - 50

11 GP-601 General Proficiency - - - - -

50

*At least 10 problems are to be considered based on corresponding theorycourse.

3


4/52

B.Tech



Computer Science & EngineeringYear-IV, Semester VII

SNo Subject Subject

Period


Code

Sessiona

l

Exam

CT TA Total

1 EOE-071- Open Elective-I 3-1-0 30 20 50 100 150

EOE-074

2 EC S-701 Distributed Systems 3-1-0 30 20 50 100 150

3 EC S-702 Digital

Image

3-1-0 30 20 50 100 150

Processin

g4 CS-Elective-I 3-1-0 30 20 50 100 150

5 CS-Elective-II 3-1-0 30 20 50 100 150


/Projects

6 EC S-751 DistributedSystems 0-0-2 - 25 25 25 50Lab*

7 EC S-752 Digital

Image

0-0-2 - 25 25 25 50

ProcessingLab*8 EC S-753 Project 0-0-4 - 50 50 - 50

9 EC S-754 Industrial

Training

0-0-2 - 50 50 - 50

Viva-

Voce10 GP-701 General Proficiency - - - - -

50

*At least 10 problems are to be considered based on corresponding theorycourse

.

4


5/52

B.Tech




Year-IV, Semester VIII

SNo Subject Code Subject

Period


Sessiona

l

Exam

CT TA Total

1 EOE-081- Open Elective-II 3-1-0 30 20 50 100 150EOE-084

2 EC S-801Artificial

3-1-0 30 20 50 100 150

Intelligence3 CS-Elective-III 3-1-0 30 20 50 100 150

4 CS-Elective-IV 3-1-0 30 20 50 100 150


/Projects

5 EC S-851

Artificial

0-0-2 - 25 25 25 50

IntelligenceLab*6 EC S-852 Project 0-0-12 - 100 100 200 300

7 GP-801 General Proficiency - - - - -50

Note

: th t h1. Practical Training done after 6 Semester would be evaluated in 7 semester through Report and Viva-voce.

2. Project has to be initiated in 7 semester beginning and completed by the end of 8 semester with properth t h

.report a nd demonstration

*At least 10 problems are to be considered based on corresponding theorycourse

.

5


6/52

List of Electives for B.Tech (Computer Science & Engineering)

CS-Elective-

IECS-071 Computational

GeometryECS-072 Computational Complexity

ECS-073 Parallel Algo

rithmsECS-074 Pattern

Recognition

CS-Elective-

IIECS-075 Data Mining & Data

WarehousingECS-076 Distributed

DatabaseEIT-073

BioinformaticsECS-077 Data Compression

EIT-074 IT in Forensic Science

CS-Elective-

IIIECS-081 Real Time

SystemECS-082 Software Project

ManagementECS-083 Embedded Systems

ECS-084 Cryptography & Network Security

CS-Elective-

IVECS-085 Neural

NetworksECS-086 Natural Lan gu age

ProcessingECS-087 Mobile Computing

*ECS-088 Soft Computing

* Note: ECS-

088

may be opted by only those students who didntopt

EOE-

041

as an open

elective

6


7/52

B.Tech




Year-III, Semester-V

SNo Subject Subject

Period


Code

Sessiona

l

Exam

CT TA Total

1 EHU-501 Engineering & 3-1-0 30 20 50 100 150

Managerial

Economics2 EC S-501 Operatin g System 3-1-0 30 20 50 100 150

3 EC S-502 Design and Analysis

of

3-1-0 30 20 50 100 150

Algorithm

s4 EIT-501 E-Commerce 3-1-0 30 20 50 100 150

5 EC S-504 Computer Graphics 2-1-0 15 10 25 50 75

6 EIT-505 InformationSecurity

2-1-0 15 10 25 50 75and Cyber LawsPra cticals / Training

/Projects

7 EIT-551 Operatin g System Lab* 0-0-2 - 25 25 25 50

8 EIT-552 Algorithms Lab* 0-0-2 - 25 25 25 50

9 EIT-553 Mini Project using

Web

0-0-2 - 25 25 25 50

Technology -1

10 EIT-554 Computer

Graphics

0-0-2 - 25 25 25 50

Lab*11 GP-501 General Proficiency - - - - -

50

* At least 10 problems are to be considered based on corresponding theory

course

.

7


8/52

B.Tech




Year-III, Semester-VI

SNo Subject Subject

Period


Code

Sessiona

l

Exam

CT TA Total

1 EHU-601 Industrial Management 3-1-0 30 20 50 100 150

2 EC S-601 Computer Network 3-1-0 30 20 50 100 150

3 EIT-601 Software

Project

3-1-0 30 20 50 100 150

Managemen

t4 IT-Elective-I 3-1-0 30 20 50 100 150

5 EIT-602 ER P 2-1-0 15 10 25 50 75

6 EC S-505 Graph Theory 2-1-0 15 10 25 50 75


/Projects

7 EIT-651 Computer Network 0-0-2 - 25 25 25 50

Lab*

8 EIT-652 Software

Project

0-0-2 - 25 25 25 50

Management Lab

*9 EIT-653 Mini Project using

Web

0-0-2 - 25 25 25 50

Technolo gy -2

10 EIT-654 Seminar 0-0-2 - 50 50 50

11 GP-601 General Proficiency - - - - -

50

t hNote :EIT-553 (Min i Project using web technology-1) started in 5 semester has to be continued and completed in

6 semester as EIT-653 (Mini Project using web techn ology-2)t h

*At least 10 problems are to be considered based on corresponding theory

course.

8


9/52

B.Tech



Information TechnologyYear-IV, Semester-VII

SNo Subject Subject

Period


Code

Sessiona

l

Exam

CT TA Total

1 EOE-071- Open Elective-I 3-1-0 30 20 50 100 150

EOE-074

2 EIT-701 Cryptography & 3-1-0 30 20 50 100 150

NetworkSecurity3 EC S-801 Artificial Intelligence 3-1-0 30 20 50 100

150

4 IT-Elective-II 3-1-0 30 20 50 100 150

5 IT-Elective-III 3-1-0 30 20 50 100 150


/Projects

6 EIT-751 Cryptography & 0-0-2 - 25 25 25 50Network

SecurityLab*

7 EIT-752 ArtificialIntelligence

0-0-2 - 25 25 25 50

Lab*

8 EIT-753 Project 0-0-4 - 50 50 - 50

9 EIT-754 IndustrialTraining

0-0-2 - 50 50 - 50

Viva-Voce10 GP-701 General Proficiency - - - - -

50

*At

least 10 problems are to be considered based on corresponding theorycourse.

9


10/52

B.Tech



Information TechnologyYear- IV, Semester-VIII

SNo Subject Code Subject

Period


Sessiona

l

Exam

CT TA Total

1 EOE-081- Open Elective-II 3-1-0 30 20 50 100 150

EOE-084

2 EC S-701 Distributed 3-1-0 30 20 50 100 150

System

s3 IT-Elective-IV 3-1-0 30 20 50 100 150

4 IT-Elective-V 3-1-0 30 20 50 100 150


/Projects

5 EIT-851Distributed

0-0-2 - 25 25 25 50

SystemsLab*6 EIT-852 Project 0-0-12 - 100 100 200 300

7 GP-801 General - - - - - 50

Proficienc

y

Note

: th t h1. Practical Training done after 6 Semester would be evaluated in 7 semester through Report and Viva-voce.

th t h2. Project has to be initiated in 7 semester beginning and completed by the end of 8 semester with proper

.report a nd demonstration

* At least 10 problems are to be considered based on corresponding theory

course

.

10


11/52

List of Electives for B.Tech ( Information Technology)

IT-Elective-

IEIT-061 Software Quality

EngineeringEIT-062 SoftwareTestingEIT-063 Software

Reliability

IT-Elective-

IIECS-071 Computational

GeometryECS-072 Computational Complexity

ECS-073 Parallel Algo

rithmsECS-074 Pattern

RecognitionEIT-071 DiscreteStructuresEIT-072 Theory of Automata and Formal Lan guages

IT-Elective-

IIIECS-075 Data Mining & Data

WarehousingECS-076 DistributedDatabaseEIT-073

BioinformaticsECS-077 Data Compression

EIT -074 IT in Forensic Science

IT-Elective-

IVECS-081 Real Time

SystemECS-083 Embedded Systems

EIT-081 Digital ImageProcessingEIT-082 Multimedia

Systems

IT-Elective-

VECS-085 Neural

NetworksECS-086 Natural Lan gu age

ProcessingECS-087 Mobile Computing

*ECS-088 Soft Computing

* Note: ECS-

088

may be opted by only those students who didnt

opt

EOE-

041

as an open

electiv

e

11


12/52

SYLLABU

S( Computer Science & Engineering and Information Technology)

ECS-501: Operating System

Unit I

Introduction : Operating system and functions, Classification of Operating systems-

Batch,Interactive, Time sharing, Real Time System, Multiprocessor Systems, Multiuser

Systems,Multiprocess Systems, Multithreaded Systems, Operating System Structure- Layered

structure,System Components, Operating System services, Reentrant Kernels, Monolithic and

MicrokernelSystems

.

Unit II

Concurrent Processes: Process Concept, Principle of Concurrency, Producer /

ConsumerProblem, Mutual Exclusion, Critical Section Problem, Dekkers solution, Petersons

solution,Semaphores, Test and Set operation; Classical Problem in C oncurrency- Dining

PhilosopherProblem, Sleeping Barber Problem; Inter Process Communication models and Schemes,

Processgeneration

.

Unit

IIICPU Scheduling: Scheduling Concepts, Performance Criteria, Process States, ProcessTransitionDiagram, Schedulers, Process Control Block (PCB), Process address space,

Processidentification information, Threads and their management, Scheduling

Algorithms,Multiprocessor Scheduling. Deadlock: System model, Deadlock characterization,

Prevention,Avoidance and detection, Recovery from deadlo

ck.

Unit IV

Memory Management: Basic bare machine, Resident monitor, Multiprogramming with

fixed partitions, Multiprogramming with variable partitions, Protection schemes,Paging,Segmentation, Paged segmentation, Virtual memory concepts, Demand paging, Performance

ofdemand paging, Page replacement algorithms, Thrashing, Cache memory organization,

Localityofreference.

Unit V

I/O Management and Disk Scheduling: I/O devices, and I/O subsystems, I/O buffering,

Diskstorage and disk scheduling, RAID. File System: File concept, File organization and

accessmechanism, File directories, and File sharing, File system implementation issues, File

system protection and

security.

References

: 1. Silberschatz, Galvin and Gagne, Operating Systems Concepts,Wiley2. Sibsankar Halder and Alex A Aravind, Operating Systems, PearsonEducation3. Harvey M Dietel, An Introduction to Operating System, Pearson

Education nd4. D M Dhamdhere, Operating Systems : A Concept based Approach,

2

Edition,

12


13/52

TMH

5. William Stallings, Operating Systems: Internals and Design Principles ,

6th Edition, Pearson

Education

ECS-502: Design and Analysis of Algorithms

Unit-

IIntroductio

n

: Algorithms, Analyzing algorithms, Complexity of algorithms, Growth

offunctions, Performance measurements, Sorting and order Statistics - Shell sort, Quick

sort,Merge sort, Heap sort, Comparison of sorting algorithms, Sorting in lineartime.Unit

-IIAdvanced Data

Structures: Red-Black trees, B trees, Binomial Heaps, Fibonacci

Heaps.Unit -

IIIDivide and Conquer with examples such as Sorting, Matrix Multiplication, Convex hull

andSearching.Greedy methods with examples such as Optimal Reliability Allocation, Knapsack,

MinimumSpanning trees Prims and Kruskals algorithms, Single source shortest paths - Dijkstras

andBellman Ford

algorithms.

Unit -

IVDynamic programming with examples such as Kanpsack, All pair shortest paths WarshalsandFloyds algorithms, Resource allocation

problem.Backtracking, Branch and Bound with ex amples such as Travelling Salesman

Problem,Graph Coloring, n-Queen Problem, Hamiltonian Cycles and Sum of

subsets.Unit -V

Selected

Topics:

Algebraic Computation, Fast

Fourier

Transform, String Matching, Theor y

of NP-completeness, Appro ximation algorithms and Randomized

algorithms.References

:1. Thomas H. Coreman, Charles E. Leiserson and Ronald L. Rivest, Introduction

to Algorithms, Printice Hall of

India.2. RCT Lee, SS Tseng, RC Chang and YT Tsai, Introduction to the Design and

Analysisof Algorithms, Mc Graw Hill,2005.3. E. Horowitz & S Sahni, "Fundamentals of Computer

Algorithms",4. Berman, Paul, Algorithms, CengageLearning.5. Aho, Hopcraft, Ullman, The Design and Analysis of Computer AlgorithmsPearsonEducation, 2008.

13


14/52

ECS-503: Object Oriented Techniques

UNIT I

Introduction: The meaning of Object Orientatio n, object identity, Encapsulation,

informationhiding, polymorphism, gen erosity, importance of modeling, principles of modeling,

objectoriented modeling, Introduction to UML, conceptual model of the UML,Architecture.

UNIT

IIBasic Structural Modeling: Classes, Relationships, common Mechanisms, and diagrams.

Class&Object Diagrams: Terms, concepts, modeling techniques for Class & Object

Diagrams.Collaboration Diagrams: Terms, Concepts, depicting a message, polymorphism in

collaborationDiagrams, iterated messages, use of self in messages. Sequence Diagrams: Terms,

concepts,depicting asynchronous messages with/without priority, callback mechanism,

broadcastmessages.

Basic Behavioral Modeling: Use cases, Use case Diagrams, Activity Diagrams, State

Machine ,Process and thread, Even t and signals, Time diagram, interaction diagram, Package

diagram.

Architectural Modeling: Component, Deployment, Component diagrams andDeploymentdiagrams

.

UNIT

IIIObject Oriented Analysis, Object oriented design, Object design, Combining three

models,Designing algorithms, design optimization, Implementation of control, Adjustment

ofinheritance, Object representation, Physical packaging, Documenting design

considerations.Structured analysis and structured design (SA/SD), Jackson Structured Development

(JSD).Mapping object oriented concepts using non-object oriented language, Translating classesintodata structures, Passing arguments to metho ds, Implementing inh eritance,

associationsencapsulation

.

Object oriented p rogramming style: reusability, extensibility, robustness, programming in

thelarge. Procedural v/s OOP, Object oriented language features. Abstraction and

Encapsulation.

UNIT IV

Introduction to Java, Histor y, Features, Object Oriented concept of Java, Classes andObjects,Inheritance, Packages, Interface , abstract method and classes, Polymorphism, Inner

classes,String Handling, I/O , Networking, Event Handling. Multi threading, Collection, Java

APIs,Java

Beans:

Application Builder tools, The bean developer kit(BDK), JAR files,

Introspection,Developing a simple bean, using Bound properties, The Java Beans API, Session Beans,

EntityBeans, Introduction to Enterprise Java beans

(EJB).UNIT V

JavaSwing:

Introduction to AWT, AWT v/s Swing, Creating a Swing Applet andApplication.Utility of Java as internet programming language, JDBC, The connectivity model,

JDBC/ODBCBridge, Introduction to

servlets.

14


15/52

References

:1. James Rumbaugh et. al, Object Oriented Modeling and Design,PHI2. Grady Booch, James R umbaugh, Ivar Jacobson, The Unified Modeling Language

UserGuide, Pearson

Education3. Naughton, Schildt, The Complete Reference JAVA2,

TMH4. Mark Priestley Practical Object-Oriented Design with UML,TMH5. Booch, Maksimchuk, Engle, Young, Conallen and Houstan, Object Oriented

Analysisand Design with Applications, Pearson

Education6. Pandey, Tiwari, Object Oriented Programming with JAVA , Acme

Learning

ECS-504: Computer Graphics

Unit I

Introduction and Line

Generation

:Types of computer graphics, Graphic Displays- R andom

scandisplays, Raster scan displays, Frame buffer and video controller, Points and lines, Linedrawingalgorithms, Circle generating algorithms, Mid point circle generating algorithm, and

parallelversion of these algorithms.

Unit II

Transformation

s

:Basic transformation, Matrix representations and homogenous

coordinates,Composite transformations, Reflections and

shearing.

Windowing and Clipping: Viewing pipeline, Viewing transformations, 2-D Clipping

algorithms-Line clipping algorithms such as Cohen Sutherland line clipping algorithm, Liang

Barskyalgorithm, Line clipping against non rectan gular clip windows; Polygon clipping

SutherlandHodgeman polygon clipping, Weiler and Atherton polygon clipping, Curve clipping,Textclipping.

Unit

IIIThree Dimensional: 3-D geometric primitives, 3-D Object representation, 3-D

Transformation,3-D viewing, projections, 3-D

Clipping.

Unit IV

Curves and

Surfaces

:Quadric surfaces, Spheres, Ellipsoid, Blobb y objects,

Introductoryconcepts of Spline, Bspline and Bezier curves andsurfaces.

Hidden Lines andSurfaces

:Back Face Detection algorithm, Depth buffer method, A-buffermethod, Scan line method, basic illumination models Ambient light, Diffuse

reflection,Specular reflection and Phong model, Combined approach, Warn model, IntensityAttenuation,Color consideration, Transparency and

Shadows.References

:1. Donald Hearn and M Pauline Baker, C omputer Graphics C Version, Pear son

Education2. Amrendra N Sinha and Arun D Udai, Computer Graphics,

TMH15


16/52

3. Donald Hearn and M Pauline Baker, Computer Graphics with OpenGL,

Pearsoneducatio

n4. Steven Harrington, C omputer Graphics: A Pro gramming App roach ,

TMH5. Rogers, Procedu ral Elements of Computer Graphics, McGrawHill

ECS-505: Graph Theory

Unit

-IGraphs, Sub graphs, some basic properties, various example of graphs & their sub graphs,

walks, path & circuits, connected graphs, disconnected graphs and component, euler graphs,

variousoperation on graphs, Hamiltonian paths and circuits, the traveling sales man

problem.

Unit-

IITrees and fundamental circuits, distance diameters, radius and pendent vertices, rootedandbinary trees, on counting trees, spanning trees, fu ndamental circuits, finding all spanning treesofa graph and a weighted graph, algorithms of primes, Kruskal and Dijkstra Algo

rithms.Unit

-IIICuts sets and cut vertices, some properties, all cut sets in a graph, fundamental circuits and

cutsets , connectivity and separability, n etwork

flows

Planer graphs, combinatorial and geometric dual: Kuratowski graphs, detection ofplanarity,geometric dual, Discussion on criterion of plan arity, thickness andcrossings.

Unit

-IVVector space of a graph and vectors, basis vector, cut set vector, circuit vector, circuit and cutsetsubspaces, Matrix representation of graph Basic concepts; Incidence matrix, Circuit

matrix,Path matrix, Cut-set matrix and Adjacency

matrix.

Coloring, covering and partitioning of a graph, chromatic number, chromatic

partitioning,chromatic polynomials, matching, covering, four color

problem

Discussion of Graph theoretic algorithm wherever

required.

Reference

s1. Deo, N, Graph theory with applications to Engineering and Computer Science,PHI2. Gary Chartrand and Ping Zhang, Introduction to Graph Theor y,

TMH3. Robin J. Wilson, Introduction to Graph Theory, Pearson

Education4. Harary, F, Graph Theory,

Narosa5. Bondy and Murthy: Graph theory and application. Addison

Wesley.6. V. Balakrishnan, Schaum's Outline of Graph Theory,

TMH7. Geir Agnarsson, Grap h Theory: Modeling, Applications and Algorithms, PearsonEducation

16


17/52

EIT-501: E-Commerce

Unit

I :Introduction: Definition of Electronic C ommerce, E-Commerce: technology and p

rospects,incentives for engaging in electronic commerce, needs of E-Commerce, advantages

anddisadvantages, framework, Impact of E-commerce on business, E-CommerceModels.

Unit

II: Network Infrastructure for E- C

ommerce:Internet and Intranet based E-commerce- Issues, problems and prospects, Network

Infrastructure, Network Access Equipments, Broadband telecommunication (ATM, ISDN, FRAME

RELAY).

Mobile Commerce: Introduction, Wireless Application Protocol, WAP technolo gy,

MobileInformationdevice.

Unit

IIIWeb Security: Security Issues on web, Importance of Firewall, components of

Firewall,Transaction security, Emerging client server, Security Threats, Network Security, Factors

toconsider in Firewall design, Limitation ofFirewalls.

Unit IV

Encryption: Encr yption techniques, Symmetric Encryption: Keys and data encr yptionstandard,Triple encryption, Secret key encr yption; Asymmetric encryption: public and private pair

keyencryption, Digital Signatures, Virtual Private

Network.

Unit V

Electronic Payments: Overview, The SET protocol, Payment Gateway, certificate,digitalTokens, Smart card, credit card, magnetic strip card, E-Checks, Credit/Debit card based

EPS,online Banking.

EDI Application in business, E- Commerce Law, Forms of Agreement, Govt. policies

andAgenda.

References

:1. Ravi Kalakota, Andrew Winston, Frontiers of Electronic Commerce, Addison-

Wesley.2. Pete Lohsin , John Vacca Electronic Commerce, New Age

International3. Goel, Ritendra E-commerce, New Age

International4. Laudon, E-Commerce: Business, Technology, Society, PearsonEducation5. Bajaj and Nag, E-Commerce the cutting edge of Business,TMH6. Turban, Electronic Commerce 2004: A Managerial Perspective, Pearson

EducationEIT-505 Information Security and Cyber Laws

UNIT-

IHistory of Information Systems and its Importance, basics, C hanging Nature of

InformationSystems, Need of Distributed Information Systems, Role of Internet and Web

Services,

Information System Threats and attacks, Classification of Threats and AssessingDamages

17


18/52

Security in Mobile and Wireless Computing- Security Challenges in Mobile

Devices,authentication Service Security, Security Implication for organizations, Lap tops

Security

Basic Principles of Information Security, Confidentiality, Integrity Availability and othertermsin Information Security, Information Classification and their

Roles.

UNIT-

II

Security Threats to E Commerce, Virtual Organization, Business Transactions on Web,

EGovernance and EDI, Concepts in Electronics payment systems, E Cash, Credit/Debit

Cards.

Physical Security- Needs, Disaster and Controls, Basic Tenets of Physical Security andPhysicalEntry Controls,

Access Control- Biometrics, Factors in Biometrics Systems, Benefits, Criteria for selectionof biometrics, Design Issu es in Biometric Systems, Interoperability Issues, Economic and

SocialAspects, Legal Challenges

UNIT-

IIIModel of Cr yptographic Systems, Issues in Documents Security, System of Keys, Public

KeyCryptography, Digital Signature, Requirement of Digital Signature System, Fin ger

Prints,Firewalls, Design and Implementation Issues,

Policies

Network Security- Basic C oncepts, Dimensions, Perimeter for Network Protection,NetworkAttacks, Need of Intrusion Monitoring and Detection, IntrusionDetection

Virtual Private Networks- Need, Use of Tunneling with VPN, Authentication

Mechanisms,Types of VPNs and their Usage, Secu rity Concerns inVPN

UNIT-

IVSecurity metrics- Classification and their

benefitsInformation Security & Law, IPR, Patent Law, Copyright Law, Legal Issues in Data

mIningSecurity, Building Security into Software Life

CycleEthics- Ethical Issues, Issues in Data and Software

PrivacyCyber Crime Typ es & overview of Cyber

CrimesReferences: 1. Godbole, Info rmation Systems Security,

Willey2. Merkov, Breithaupt, Information Security, Pearson

Education3. Yadav, Foundations of Information Technology, New Age,

Delhi4. Schou, Shoemaker, Information Assurance for the Enterprise, Tata McGraw

Hill5. Sood,Cyber Laws Simplified, Mc Graw

Hill6. Furnell, Computer Insecurity,Springer7. IT Act 2000

18


19/52

ECS-601: Computer Network

Unit

-IIntroduction Concepts: Goals and Applications of Networks, Network structure and

architecture,The OSI reference model, services, Network Topology Design - Delay Analysis, Back BoneDesign, Local Access Network Design, Physical Layer Transmission Media, Switching

methods,ISDN, Terminal

Handling.

Unit-

IIMedium Access sub layer: Medium Access sub layer - Channel Allocations, LAN protocols

-ALOHA protocols - Overview of IEEE standards - FDDI. Data Link Layer - Elementary

DataLink Protocols, Sliding Window protocols, Error

Handling.

Unit -

III Network Layer: Network Layer - Point - to Pont Networks, routing, Congestion

controlInternetworking -TCP / IP, IP pack et, IP address,IPv6.

Unit -

IVTransport Layer: Transport Layer - Design issues, connection management, session

Layer-Design issues, remote procedure call. Presentation Layer-Design issues, Data

compressiontechniques, cryptography - TCP - WindowManagement.

Unit-V

Application Layer: Application Layer: File Transfer, Access and Management, Electronic

mail,Virtual Terminals, Other application. Example Networks - Internet and PublicNetworks.

References

: 1. Forouzen, "Data Commu nication and Networking",

TMH2. A.S. Tanenbaum, Computer Networks, Pearson

Education3. W. Stallings, Data and Computer Communication, Macmillan

Press4. Anuranjan Misra, Computer Networks, AcmeLearning5. G. Shanmugarathinam, Essential of TCP/ IP, Firewall

Media

ECS-602: Software Engineering

Unit-I:

IntroductionIntroduction to Software Engineerin g, Software C omponents, Software Characteristics,SoftwareCrisis, Software Engineering Processes, Similarity and Differences from

ConventionalEngineering Processes, Software Quality Attributes. Software Development Life C ycle

(SDLC)Models: Water Fall Model, Prototype Model, Spiral Model, Evolutionary DevelopmentModels,Iterative Enhancement

Models.

19


20/52

Unit-II: Software Requirement Specif ications

(SRS)Requirement En gineering Process: Elicitation, Analysis, Documentation, Review

andManagement of User Needs, Feasibility Study, Information Modeling, Data Flow

Diagrams,Entity Relationship Diagrams, Decision Tables, SRS Document, IEEE Standards forSRS.Software Quality Assurance

(SQA):

Verificatio n and Validation, SQA Plans, SoftwareQualityFrameworks, ISO 9000 Models, SEI-CMM

Model.

Unit-III: Software

DesignBasic Concept of Software Design, Architectural Design, Low Level Design:

Modularization,Design Structure Charts, Pseudo Codes, Flow Charts, Coupling and Cohesion Measures,

DesignStrategies: Function Oriented Design, Object Oriented Design, Top-Down and Bottom-

UpDesign. Software Measurement and Metrics: Various Size Oriented Measures:

HalesteadsSoftware Science, Fun ction Point (FP) Based Measures, C yclomatic ComplexityMeasures:Control Flow Graphs.

Unit-IV: Software

TestingTesting Objectives, Unit Testing, Integration Testing, Acceptance Testing, Regression

Testing,Testing for Functionality and Testing for Performance, Top-Down and Bottom-UpTestingStrategies: Test Drivers and Test Stubs, Structural Testing (White Box Testing),

FunctionalTesting (Black Box Testing), Test Data Suit Preparation, Alpha and Beta Testing of

Products.Static Testing Strategies: Formal Technical Reviews (Peer Reviews), Walk Through,

CodeInspection, Compliance with Design and Coding

Standards.

Unit-V: Software Maintenance and Software Project

ManagementSoftware as an Evolutionary Entity, Need for Maintenance, Categories ofMaintenance:Preventive, Corrective and Perfective Maintenance, Cost of Maintenance, SoftwareRe-Engineering, Rev erse Engineering. Software Configuration Management Activities,

ChangeControl Process, Software Version Control, An Overview of CASE Tools. Estimation of

VariousParameters such as Cost, Efforts, Schedule/Duration, Constructive Cost Models(COCOMO),Resource Allocation Models, Software R isk Analysis and

Management.

References

:1. R. S. Pressman, Software Engineering: A Practitioners Approach, McGrawHill.2. Rajib Mall, Fundamentals of Software Engineering, PHI

Publication.3. K. K. Aggarwal and Yogesh Singh, Software En gineering, New AgeInternationalPublishers

.4. Pankaj Jalote, Software Engineerin g,Wiley5. Carlo Ghezzi, M. Jarayeri, D. Manodrioli, Fundamentals of Software Engineering,

PHIPublication.6. Ian Sommerville, Software Engineering, Addison

Wesley.7. Kassem Saleh,Software En gineering, Cen gage

Learning.8. Pfleeger, Software En gineering, Macmillan

Publication.

20


21/52

ECS-603: Compiler Design

Unit I

Intro duction to Compiler, Phases and passes, Bootstrapping, Finite state machines and

regularexpressions and their applications to lex ical analysis, Optimization of DFA-BasedPatternMatchers implementation of lexical analyzer s, lexical-analyzer generator, LEX-

compiler,Formal grammars and their application to syntax analysis, BNF notatio n, ambiguity,

YACC.The syn tactic specification of pro gramming languages: Context free grammars, derivation

and parse trees, capabilities of

CFG.

Unit II

Basic Parsin g Techniques: Parsers, Shift reduce parsing, operator pr ecedence parsing, top

down parsing, predictive parsers Automatic Construction of efficient Parsers: LR parsers,th ecanonical Collection of LR (0) items, constru cting SLR parsing tables, constructingCanonicalLR p arsing tables, Constructing LALR parsing tables, using ambiguous grammars, an

automatic parser gener ator, implementation o f LR parsingtables.

Unit

IIISyntax -directed Translation: Syntax-directed Translation schemes, Implementation of

Syntax-directed Translators, Intermediate code, postfix notation, Parse trees & syntax trees,

threeaddress code, quadruple & triples, translation of assignment statements, Booleanexpressions,statements that alter the flow of control, postfix translation, translation with a top downparser.More about translation: Array references in arith metic expressions, procedures call,declarationsand case

statements.

Unit IV

Symbol Tables: Data structure for symbols tables, representin g scope information . Run-

TimeAdministration: Implementation of simple stack allocation scheme, storage allocation in blo

ckstructured langu age. Error Detection & Recovery: Lexical Phase errors, syntactic phase

errorssemantic err

ors.

Unit V

Code Gener ation: DesignIssues

, the Target Lan guage. Addresses in the Target Code,BasicBlo cks and Flow Graphs, Optimization of Basic Blocks, Code

Generator.Code optimization: Machine-In dependentOptimizations,

Loo p optimization, DAG

representation of basic blocks, v alue numbers and algebraic laws, Global Data-Flow

analysis

References:

1. Aho, Sethi & Ullman, "Compilers: Principles, Techniq ues and Tools,

PearsonEducation

2. V Raghvan, Principles of Compiler Design,TMH3. Kenneth Louden, Compiler Construction, Cengage Learning.4.. Charles Fischer and Ricard LeBlanc, Craftin g a Compiler with C, Pearson

Education

21


22/52

ECS-604 Web Technology

Unit I:

IntroductionIntroduction to web, protocols governing the web, web development strategies, web

applications,web project, webteam .

Unit II: Web Page

DesigningHTML: list, table, images, frames, forms,

CSS;XML: DTD, XML schemes, presenting and using

XML

Unit III:

ScriptingJava script: Introduction, documents, forms, statements, functions,objects;Event and event handling; introduction to AJAX, VB Script,CGI

Unit IV: Server Site

ProgrammingIntroduction to active server pages (ASP), ASP.NET, java server pages (JSP), JSP

applicationdesign, tomcat server, JSP objects, declaring variables and methods, debuggin g, sharingdata between JSP pages, Session, introduction to

COM/DCOM.

Reference

s 1. Xavier, C, Web Technology and Design , New Age

International2. Deitel, Java for programmers, Pearson

Education3. Ivan Bayross, HTML, DHTML, Java Script, Perl & CGI, BPB

Publication.4. Ramesh Bangia, Internet and Web Design , New Age

International5. Jackson, Web Technologies PearsonEducation6. Patel and Barik, Introdu ction to Web Technology & Internet, Acme

Learning

EIT-601: Software Project Management

UNIT-I: Introduction and Software Project

PlanningFundamentals of Software Project Management (SPM), Need Identification, Vision and

Scopedocument, Project Management C ycle, SPM Objectives, Management Spectrum,SPMFramework, Software Project Planning, Planning Objectives, Project Plan, Types of projectplan,Structure of a Software Project Management Plan, Softwar e project estimation,Estimationmethods, Estimation models, Decision

process.

UNIT-II: Project Organization and

SchedulingProject Elements, Work Breakdown Structure (WBS), Types of WBS, Functions, Activities

andTasks, Project Life Cycle and Product Life Cycle, Ways to Organize Personnel, Project

schedule,Scheduling Objectives, Building the project schedule, Scheduling terminolog y andtechniques, Network Diagrams: PERT, CPM, Bar Charts: Milestone Charts, GanttCharts.

UNIT-III: Project Monitoring and

ControlDimensions of Project Monitoring & Control, Earned Value Analysis, Earned Value

Indicators:

22


23/52

Budgeted Cost for Work Scheduled (BCWS), Cost Variance (CV), Schedule Variance

(SV),Cost Performance Index (CPI), Schedule Performance Index (SPI), Interpretation of

EarnedValue Indicators, Error Tracking, Software Reviews, Types of Review: Inspections,

Deskchecks,Walkthroughs, Code Reviews, Pair Programming.

UNIT-IV: Software Quality Assurance and

TestingTesting Objectives, Testing Principles, Test Plans, Test Cases, Types of Testing, LevelsofTesting, Test Strategies, Program Correctness, Program Verification & validation,

TestingAutomation & Testing Tools, Concept of Software Quality, Software Quality

Attributes,Software Quality Metrics and Indicators, The SEI Cap ability Maturity Model CMM),

SQAActivities, Formal SQA Approaches: Proof of correctness, Statistical quality

assurance,Cleanroom

process.

UNIT-V: Project Management and Project Management

ToolsSoftware Configuration Management: Software C onfiguration Items and tasks, Baselines,

Planfor Change, Chan ge Control, Change Requests Management, Version Control,RiskManagement: Risks and risk types, Risk Breakdown Structure (RBS), Risk

ManagementProcess: Risk identification, Risk analysis, Risk planning, Risk monitoring, CostBenefitAnalysis, Software Project Management Tools: CASE Tools, Planning and Scheduling

Tools,MS-

Project.References

:1. M. Cotterell, Software Project Management, Tata McGraw-Hill

Publication.2. Royce, Software Project Management, PearsonEducation3. Kieron Conway, Software Project Management, DreamtechPress4. S. A. Kelkar, Software Project Management, PHIPublication.

EIT-602: ERP

UNIT -

IERP Introduction, Benefits, Origin, Evolution and

Structure

:Conceptual Model of ERP, The

Evolution of ERP, The Structure of ERP.

UNIT -

IIBusiness Process R eengineerin g, Data ware Housing, Data Mining, OnlineAnalyticProcessing(OLAP), Product Life Cycle Man agement(PLM),LAP, Supply chainManagement.

UNIT -IIIERP Marketplace and Marketplace

Dynamics

:Market Overview, Mark etplace Dynamics,

TheChanging ERP Market.

ERP- Functional Modules: Introduction, Functional Modules of ERP Software, Integration

ofERP, Supply chain and Customer RelationshipApplications.

23


24/52


25/52

of Distributed SharedMemory

.

UnitIV

Failure Recovery in Distributed

Systems:

Concepts in Backward and Forward recovery,Recoveryin Concurrent systems, Obtaining consistent Checkpoints, Recovery in Distributed

DatabaseSystems

.

Fault

Tolerance:

Issues in Fault Tolerance, Commit Protocols, Voting protocols, Dynamic

votingprotocols.

Unit V

Transactions and Concurrency

Control

: Transactions, Nested transactions,

Locks,

Optimisti

cConcurrency control, Timestamp ordering, Comparison of methods for concurrency

control.

Distributed

Transactions

: Flat and nested distributed transactions, Atomic

Commit

protocols,

Concurrency control in distributed transactions, Distributed deadlocks, Transactionrecovery.Replication: System model and group communication, Fault - tolerant services, highly

availableservices, Transactions with replicateddata.References

:1. Singhal & Shivaratri, "Advanced Concept in Operating Systems", McGraw

Hill2. Ramakrishna,Gehrke, Database Management Systems, Mc

Grawhill3. Coulouris, Dollimore, Kindberg, "Distributed System: Concepts and Design,

PearsonEducation

4. Tenanuanbaum, Steen, Distributed Systems,

PHI5. Gerald Tel, "Distributed Algorithms", Cambridge University

Press

ECS-702 DIGITAL IMAGE PROCESSING

UNIT-

IIntroduction and

FundamentalsMotivation and Perspective, Applications, Components of Image Processing System, Element

ofVisual Perception, A Simple Image Model, Sampling andQuantization.

Image Enhancement in Frequency

DomainFourier Transform and the Frequency Domain, Basis of Filtering in Frequency Domain, FiltersLow-pass, High-pass; Correspondence Between Filtering in Spatial and Frequency

Domain;Smoothing Frequency Domain Filters Gaussian Lowpass Filters; Sharpening Frequency

DomainFilters Gaussian Highpass Filters; HomomorphicFiltering.

UNIT-

IIImage Enhancement in Spatial

DomainIntroduction; Basic Gray Level Functions Piecewise-Linear Transformation Functions:

ContrastStretching; Histogram Specification; Histogram Equalization; Local Enhancement;

Enhancementusing Arithmetic/Logic Operations Image Subtraction, Image Averaging; Basics of

SpatialFiltering; Smoothing - Mean filter, Ordered Statistic Filter; Sharpening The

Laplacian.

25


26/52

UNIT-

IIIImage

RestorationA Model of Restoration Process, Noise Models, Restoration in the presence of Noise only-SpatialFiltering Mean Filters: Arithmetic Mean filter, Geometric Mean Filter, Order StatisticFilters Median Filter, Max and Min filters; Periodic Noise Reduction by Frequency Domain Filtering

Bandpass Filters; Minimum Mean-square ErrorRestoration.

UNIT-

IVMorphological Image

ProcessingIntroduction, Logic Operations involving Binary Images, Dilation and Erosion, Opening and

Closing,Morphological Algorithms Boundary Extraction, Region Filling, Extraction ofConnectedComponents, Convex Hull, Thinning, Thickening

UNIT-V

RegistrationIntroduction, Geometric Transformation Plane to Plane transformation, Mapping, Stereo Imaging

Algorithms to Establish Correspondence, Algorithms to RecoverDepth

Segmentatio

nIntroduction, Region Extraction, Pixel-Based Approach, Multi-level Thresholding,

LocalThresholding, Region-based Approach, Edge and Line Detection: Edge Detection, Edge

Operators,Pattern Fitting Approach, Edge Linking and Edge Following, Edge Elements Extraction

byThresholding, Edge Detector Performance, Line Detection, CornerDetection.

References

: nd1. Digital Image Processing

2

Edition, Rafael C. Gonzalvez and Richard E.

Woods.Published by: Pearson

Education.2. Digital Image Processing and Computer Vision, R.J. Schalkoff. Published by:JohnWiley and Sons, NY.

3. Fundamentals of Digital Image Processing, A.K. Jain. Published by Prentice

Hall,Upper Saddle River,

NJ.

EIT-701 Cryptography & Network Security

Unit-

IIntroduction to security attacks, services and mechanism, Classical encryptiontechniques-substitution ciphers and transposition ciphers, cryptanalysis, stegano

graphy,Stream and block

ciphers.

Modern Block Ciphers: Block ciph ers principles, Shannons theor y of confusion and

diffusion,fiestal structure, Data encryption standard(DES), Strength of DES, Idea ofdifferentialcryptanalysis, block cipher modes of operations, Triple

DES

26


27/52

Unit-

IIIntroduction to group, field, finite field of the form GF(p), modular arithmetic, prime and

relative prime numbers, Extended Euclidean

Algorithm,

Advanced Encryption Standard ( AES) encryption and decryption

Fermats and Eulers theorem, Primality testing, Chinese Remainder theorem,DiscreteLogarithmic

Problem,

Principals of public key crypto systems, RSA algorithm, security of

RSA

Unit-

IIIMessage Authentication Codes: Authentication requirements, authentication functions,messageauthentication code, hash functions, birthday attacks, security of hash functions, Securehashalgorithm

(SHA)

Digital Signatures: Digital Signatures, Elgamal Digital Signature Techniques, Digital

signaturestandards (DSS), proof of digital signaturealgorithm,

Unit-

IVKey Management and distribution: Symmetric key distribution, Diffie-Hellman Key

Exchange,Public key distribution, X.509 Certificates, Public key

Infrastructure.

Authentication Applications:

Kerberos

Electronic mail security: pretty good privacy (PGP),S/MIME.

Unit-V

IP Security: Architecture, Authentication header, Encapsulating security payloads,combiningsecurity associations, key

management.

Introduction to Secure Socket Layer, Secure electronic, transaction

(SET).

System Security: Introductory idea o f Intrusion, Intrusion detection, Viruses and r elatedthreats,firewall

s

References

: 1. William Stallings, Cryptograph y and Network Security: Principals and

Practice,Pearson

Education.2. Behrouz A. Frouzan: Cryptography and Network Security,TMH3. Bruce Schiener, Applied Cryptography. John Wiley &

Sons4. Bernard Men ezes, Network Security and Cryptography, Cengage

Learning.5. Atul Kahate, C ryptography and Network Security,

TMH

27


28/52

ECS-801: Artificial Intelligence

Unit-

IIntroductio

n

: Introduction to Artificial Intelligence, Foundations and History of

ArtificialIntelligence, Applications of Artificial Intelligence, Intelligent Agents, Structure ofIntelligentAgents. Computer vision, Natural Language

Possessing.

Unit-

II Introduction to

Search

: Searchin g for solutions, Uniformed search strategies, Informed

searchstrategies, Local search algo rithms and optimistic problems, Adversarial Search, Search

forgames, Alpha - Betapruning.Unit-

III Knowledge Representation &

Reasoning

: Propositional logic, Theory of first order

logic,Inference

in

First order logic, Forward & Backward chaining, Resolution,

Probabilisticreasoning, Utility theory, Hidden Markov Models (HMM), BayesianNetworks.Unit-

IVMachine

Learning

: Supervised and unsupervised learning, Decision trees, Statistical

learningmodels, Learning with complete data - Naive Bayes models, Learnin g with hidden data -

EMalgorithm, Reinforcemen t

learning,Unit-V

Pattern

Recognition

: Introduction, Design principles of pattern recognition system,

StatisticalPatter

n

recognition, Parameter estimation methods - Principle Component Analysis (PCA)

andLinear Discriminant Analysis (LDA), Classification Techniques Nearest Neighbor (NN)

Rule,Bayes Classifier, Support Vector Machine (SVM), K means clusterin

g.

References

:1. Stuart Russell, Peter Norvig, Artificial Intelligence A Modern Approach,

PearsonEducation2. Elaine Rich and Kevin Knight, Artificial Intelligence, McGraw-

Hill3. E Charniak and D McDermott, Introduction to Artificial Intelligence,

PearsonEducation4. Dan W. Patterson, Artificial Intelligence and Expert Systems, Prentice Hall of

India,

28


29/52

Syllabus of Elective Subjects

( Computer Science & Engineering and Information Technology)

EIT-061 Software Quality Engineering

UNIT-I:

IntroductionDefining Software Quality, Software Quality Attributes and Specification, Cost of

Quality,Defects, Faults, Failures, Defect Rate and Reliability, Defect Prevention, Reduction,

andContainment, Overview of Different Types of Software Review, Introduction toMeasurementand Inspection Process, Documents andMetrics.

UNIT-II: Software QualityMetricsProduct Quality Metrics: Defect Density, Customer Problems Metric, Customer

SatisfactionMetrics, Function Points, In-Process Quality Metrics: Defect Arrival Pattern, Phase-

BasedDefect Removal Pattern, Defect Removal Effectiveness, Metrics for Software

Maintenance:Backlog Management Index, Fix Response Time, Fix Quality, Software Quality

Indicators.

UNIT-III: Software Quality Management and

ModelsModeling Process, Software Reliability Models: The Rayleigh Model, ExponentialDistributionand Software Reliability Growth Models, Software Reliability Allocation Models, Criteria

forModel Evaluation, Software Quality Assessment Models: Hierarchical Model ofSoftwareQuality

Assessment.

UNIT-IV: Software Quality

AssuranceQuality Planning and C ontrol, Quality Improvement Process, Evolution of Software

QualityAssurance (SQA), Major SQA Activities, Major SQA Issues, Zero Defect Software,

SQATechniques, Statistical Quality Assurance, Total Quality Management, Quality StandardsandProcesses

.

UNIT-V: Software Verification, Validation &

Testing:Verification and Validation, Evolutionary Natur e of Verification and Validation,Impracticalityof Testing all Data and Paths, Proof of Correctness, Software Testing, Functional, Structural

andError-Oriented Analysis & Testing, Static and Dynamic Testing Tools, Characteristics

ofModern Testing

Tools.References

:1. Jeff Tian, Software Quality En gineering (SQE),

Wiley2. Stephen H. Kan, Metrics and Models in Software Quality Engineering, Addison-Wesley

29


30/52

EIT-062 Software Testing

Unit-I:

IntroductionFaults, Errors, and Failures, Basics of software testing, Testing objectives, Principles oftesting,Requirements, behavior and correctness, Testing and debugging, Test metrics and

measurements,Verification, Validation and Testing, Types of testing, Software Qu ality and

Reliability,Software defect

tracking.

Unit-II: White Box and Black Box

TestingWhite box testing, static testing, static analysis tools, Structural testing: Unit/Code

functionaltesting, Code coverage testing, Code complex ity testing, Black Box testing, Requirements

basedtesting, Boundary value analysis, Equivalence partitioning, state/graph based testing,Modelbased testing and model checking, Differences between white box and Black boxtesting.

Unit-III: Integration, System, and AcceptanceTestingTop down and Bottom up integration, Bi-directional integration, System integration,

ScenarioTesting, Defect Bash, Functional versus Non-functional testing, Design/Architecture

verification,Deployment testing, Beta testing, Scalability testing, Reliability testing, Stress

testing,Acceptance testing: Acceptance criteria, test cases selection and

execution,

Unit-IV: Test Selection & Minimization for Regression

TestingRegression testing, Regression test process, Initial Smoke or Sanity test, Selection ofregressiontests, Execution Trace, Dynamic Slicing, Test Minimization, Tools for regression testing, Ad

hocTesting: Pair testing, Exploratory testing, Iterative testing, Defectseeding.

Unit-V: Test Management and

AutomationTest Planning, Management, Execution and Reporting, Software Test Automation: Scope

ofautomation, Design & Architecture for automation, Generic requirements for test

toolframewo rk, Test tool selection, Testing in Object Oriented

Systems.

References

:1. S. Desikan and G. Ramesh, Software Testing: Principles and Practices,

PearsonEducation.

2. Aditya P. Mathur, Fundamentals of Software Testing, PearsonEducation.3. Naik and Tripathy, Software Testing and Quality Assurance,

Wiley4. K. K. Aggarwal and Yogesh Singh, Software Engineering, New AgeInternationalPublication

.

30


31/52

EIT-063 Software Reliability

UNIT-I:

IntroductionDefining Software Reliability, Software Reliability Attributes and Specification, Concept

ofDefects, Faults, Failures, Defect Rate and Reliability, Defect Prevention, Reduction,

andContainment, Overview of Different Types of Software Review, Introduction to

Measurementand Inspection Process, Documents and

Metrics.

UNIT-II: Software Reliability

MetricsCollection of fault and failure data, Measurement of internal and external product

attributes,Customer Problems Metric, Customer Satisfaction Metrics, In-Process Quality Metrics:

DefectArrival Pattern, Phase-Based Defect Removal Pattern, Defect Removal Effectiveness,

Metricsfor Software Maintenan ce, Software R eliability indicators, Software Reliability Metrics,StaticCode Metrics, DynamicMetrics.

UNIT-III: Software Reliability Assessment

ModelsBasics of Reliability Theory, Software Reliability Problem, Modeling Process,

SoftwareReliability Models, Parametric Reliability Growth Models, The Rayleigh Model,

ExponentialDistribution and Software Reliability Growth Models, Software Quality Assessment

Models:Hierarchical Model o f Software Quality

Assessment.

UNIT-IV: Software Reliability Allocation

ModelsSoftware Reliability Allocation Models, Criteria for Model Evaluation, Optimal

ReliabilityAllocation, Quality Plan ning and Control, Quality Improvement Process, Evolution of

SoftwareQuality Assurance (SQA), Major SQA Activities, Major SQA Issues, Zero Defect

Software.

UNIT-V: Software Reliability

TechniquesReliability Techniques: Trending Reliability Techniques, Predicting Reliability

Techniques,Error Seeding, Failure Rate, Curve Fittin g, Reliability Growth, Models and Tools: Stud y of

toolslike CASRE, SARA, SMERFS.

References

:1. John Musa, Software Reliability Engineering, McGraw-Hill2. Fenton, and Pfleeger, Software Metrics: A Rigorous and Practical

Approach,International Thomson Computer

Press3. Jeff Tian, Software Quality En gineering (SQE),

Wiley4. Stephen H. Kan, Metrics and Models in Software Quality Engineering, Addison-

Wesley

ECS-071 COMPUTATIONAL GEOMETRY

UNIT-

IConvex hulls: construction in 2d and 3d, lower bounds; Triangulations: polygon

triangulations,representations, point-set triangulations, planar gr

aphs

31


32/52

UNIT-

IIVoronoi diagrams: construction and applicat ions, variants; Delayney triangulations: divide-

and-conquer, flip and incremental algorithms, duality of Voronoi diagrams, min-max angle

properties

UNIT-

IIIGeometric searching: point-location, fractional cascadin g, linear programming with prune

andsearch, fin ger trees, concatenable queues, segment trees, interval trees; Visibility: algorithmsforweak and stron g visibility, visibility with reflections, art-gallery

problems

UNIT-

IVArrangements of lines: arrangements of hyper p lanes, zone theorems, many-faces

complexityand algorithms; Combinatorial geometry: Ham-sandwich

cuts.

UNIT-V

Sweep techniques: plane sweep for segment intersections, Fortune's sweep for

Voronoidiagrams, topological sweep for line arrangements; Randomization in computationalgeometry:algorithms, techniques for counting; Robust geometric computing, Applications

ofcomputationalgeometry;

References

:1. Computational Geometry: An Introduction by Franco P. Preparata and Michael

Ian Shamos; Springer

Verlag2. Mark de Berg , Marc van Kreveld , Mark Overmars , and OtfriedSchwarzkopf,Computational Geometry, Algorithms and Applications , Springer-

Verlag,3. Ketan Mulmuley, Computational Geometry: An Introduction ThroughRandomizedAlgorithms, Prentice-

Hall4. Joseph O'Rourke, Computational Geometry in C, Cambridge University

Press.

ECS-072 COMPUTATIONAL COMPLEXITY

UNIT-

IModels of Computation, resources (time and space), algorithms, computability,

complexity.

UNIT-

IIComplexity classes, P/NP/PSPAC E, reduction s, hardness, completeness, hierarchy,

relationships between complexityclasses.

UNIT-

IIIRandomized computation and complex ity; Logical characterizations,

incompleteness;Approximability

.

UNIT-

IV

32


33/52

Circuit complexity, lower bounds; Parallel computation and complexity; Counting

problems;Interactive

proofs.

UNIT-V

Probabilistically checkable proofs; Communication complexity; Quantumcomputation

References:

1. Christos H. Papadimitriou., Combinatorial Optimization: Algorithms and Complex ity

, Prentice-

Hall2. Sanjeev Arora and Boaz Bar ak , C omplexity Theory: A Modern Approach,

CambridgeUniversity

Press3. Steven Homer , Alan L. Selman , Computability and Complexity Theor y ,Springer

ECS-073 PARALLEL ALGORITHMS

Unit-

I:Sequential model, need of alternative model, p arallel computational models such as

PRAM,LMCC, Hypercube, Cube Connected Cycle, Butterfly, Perfect Shuffle Computers, Tree

model,Pyramid model, Fully Connected model, PRAM-CREW, EREW models, simulation ofonemodel from anotherone.

Unit-

II:Performance Measures of Parallel Algorithms, speed-up and efficiency of PA, Cost-

optimality,An example of illustrate Cost- optimal algorithms- such as summation, Min/Max on

variousmodels.

Unit-

III:Parallel Sorting Networks, Parallel Merging Algorithms on CREW/EREW/MCC,ParallelSorting Networks on CREW/EREW/MCC/, linear

array

Unit-

IV:Parallel Searching Algorithm, Kth element, Kth element in X+Y on PRAM, ParallelMatrixTransportation and Multiplication Algorithm on PRAM, MCC, Vector- Matrix

Multiplication,Solution of Linear Equation, Root finding.

Unit-

V:Graph Algorithms - Connected Graphs, search and traversal, Combinatorial

Algorithms-Permutation, Combinations,

Derrangements.

References

: 1. M.J. Quinn, Designing Efficient Algorithms for Parallel Computer,McGrawHill.2. S.G. Akl, Design and Analysis of Parallel

Algorithms3. S.G. Akl, Parallel Sorting Algorithm by Academic

Press

33


34/52

ECS-074 Pattern Recognition

Unit-

IIntroduction

:

Basics of pattern recognition, Design principles of pattern recognition

system,Learning and adaptation, Pattern recognition approaches, Mathematical foundations Linearalgebra, Probability Theory, Expectation, mean and covariance, Normal distribution,multivariatenormal densities, Chi squared

test.Unit-

II Statistical Patten

Recognition:

Bayesian Decision Theory, Classifiers, Normal density

anddiscriminant

functions,

Unit

III Parameter estimation

methods:

Maximum-Likelihood estimation, Bayesian

Parameterestimation

,

Dimension reduction methods - Principal Component Analysis (PCA), Fisher

Lineardiscriminant analysis, Expectation-maximization (EM), Hidden Markov Models

(HMM),Gaussian mixture

models.

Unit -

IVNonparametric

Techniques:

Density Estimation, Parzen Windows, K-Nearest

NeighborEstimation,

Nearest Neighbor Rule, Fuzzyclassification.

Unit - V

Unsupervised Learning &

Clustering:

Criterion functions for clustering, ClusteringTechniques:Iterative square - error partitional clustering K means, agglomerative hierarchical

clustering,Cluster

validation.

References

: nd1. Richard O. Duda, Peter E. Hart and David G. Stork, Pattern Classificatio n,2

Edition,

John Wiley, 2006.

2. C. M. Bishop, Pattern Recognition and Machine Learning, Sprin ger,

2009. th3. S. Theodoridis and K. Koutroumbas, Pattern Recognition,

4

Edition, Academic

Press,2009.

ECS-075 Data Mining & Data Warehousing

Unit-

IOverview, Motivation(for Data Mining),Data Mining-Definition & Functionalities,

DataProcessing, Form of Data Prepro cessing, Data Cleaning: Missing Values, Noisy Data,

(Binning,Clustering, Regression, Computer and Human inspection),Inconsistent Data, DataIntegrationand Transformation. Data Reduction:-Data Cube Aggregation, Dimensionality reduction,

Data

34


35/52

Compression, Numerosity Reduction, Clustering, Discretization and Concept

hierarchygeneration

Unit-

IIConcept Description:- Definition, Data Generalization, Analytical

Characterization,

Analysis

ofattribute relevance, Mining Class comparisio ns, Statistical measures in largeDatabases.Measuring C entral Tendency, Measuring Dispersion of Data, Gr aph Displays of BasicStatisticalclass Description, Mining Association Rules in Large Databases, Association rulemining,mining Single- Dimensional Boolean Association rules from Transactional Databases

AprioriAlgorithm, Mining Multilevel Association rules from Transaction Databases and Mining

Multi-Dimensional Association rules from Relational

Databases

Unit-

IIIClassification and

Predictions:What is Classification & Prediction, Issues regarding Classification and prediction,

Decisiontree, Bayesian Classification, Classification by Back propagation, Multilayer feed-

forward Neural Network, Back propagation Algorithm, Classification methods K-near est

neighborclassifiers, Genetic

Algorithm.Cluster

Analysis:Data types in cluster analysis, Categories of clustering methods, Partitioning

methods.Hierarchical Clustering- CURE and Chameleon, Density Based Method s-DBSC AN,

OPTICS,Grid Based Methods- STING, CLIQUE, Model Based Method Statistical Approach,Neural Network approach, Outlier

Analysis

Unit-

IVData Warehousing: Overview, Definition, Delivery Process, Difference

between

Databas

eSystem and Data War ehouse, Multi Dimensional Data Model, Data Cubes, Stars, Snow

Flakes,Fact Constellations, Concept hierarch y, Process Architecture, 3 Tier Architecture, DataMarting.

Unit-V

Aggregation, Historical information, Query Facility, OLAP function and Tools. OLAP

Servers,ROLAP, MOLAP, HOLAP, Data Mining interface, Security, Backup and Recovery,

TuningData Warehouse, Testing Data

Warehouse.

References

: 1. M.H.Dunham,Data Mining:Introductory and Advanced Topics

PearsonEducation

2. Jiawei Han, Micheline Kamber, Data Mining Concepts & Techniques

Elsevier3. Sam Anahor y, Dennis Murray,

Data Warehousing in the Real World :

A

Practical

Guidefor Building Decision Support Systems, Pearson

Education4. Mallach,Data Warehousing System,McGraw

Hill

35


36/52

ECS-076 Distributed Database

UNIT-

ITransaction and schedules, Concurrent Execution of transaction, Conflict and

ViewSerializability, Testing for Serializability, Concepts in Recoverable and Cascadelessschedules.

UNIT II

Lock based protocols, time stamp based protocols, Multiple Granularity and

MultiversionTechniques, Enfo rcing serializablity by Locks, Locking system with multiple lock

modes,architecture fo r Locking

scheduler

UNIT

IIIDistributed Transactions Management, Data Distribution, Fragmentation andReplicationTechniques, Distributed Commit, Distributed Locking schemes, Long durationtransactions,Moss Concurrency

protocol.UNIT IV

Issues of Recovery and atomicity in Distributed Databases, Traditional recovery techniques,

Log based recovery, Recovery with Concurrent Transactions, Recovery in Message passing

systems,Checkpoints, Algorithms for recovery line, Concepts in Orphan and Inconsistent

Messages.

UNIT V

Distributed Query Processing, Multiway Joins, Semi joins, Cost based query optimizationfordistributed database, Updating replicated data, protocols for Distributed Deadlock

Detection,Eager and Lazy ReplicationTechniques

Reference

s 1. Silberschatz, orth and Sudershan, Database System Concept, Mc Graw

Hill2. Ramakrishna and Gehrke, Database Management System, Mc Gr aw

Hill3. Garcia-Molina, Ullman,Widom, Database System Implementation Pearson

Education4. Ceei and Pelagatti,Distributed Database,TMH5. Singhal and Shivratri, Advance Concepts in Oper ating Systems MC Graw

Hill

ECS-077 Data Compression

Unit -

I:C ompression Techniques: Loss less compression, Lossy Compression, Measures of

prefonnance,Modeling and coding,

MathematicalPreliminaries

for Lossless compression: A

briefintroduction to information theory, Models: Physicalmodels,Probability models, Markov models, composite source model, Coding: uniquely

decodablecodes, Prefix

codes.

36


37/52

Unit

II:The Huffman coding algorithm: Minimum variance Huffman codes, Adaptive Huffman

coding:Update procedure, Encoding procedure, Decoding procedure. Golomb codes, R ice

codes,Tunstall codes, Applications of Hoffman coding: Loss less image compression,Textcompression, AudioCompression.

Unit-III:C oding a sequence, Generating a binary code, Comparison of Binar y and Huffmancding,Applications: Bi-level image compression-Th e JBIG standard, JBIG2, Imagecompression.Dictionary Techniques: Introduction, Static Dictionary: Diagram Coding, Adaptive

Dictionary.The LZ77 Approach, The LZ78 Approach, Applications: File Compression-UNIX

compress,Image Compression: The Graphics Interch ange Format (GIF), Compression over Modems:V.42 bits, Predictive Coding: Prediction with Partial match (ppm): The basic algorithm, TheESCAPESYMBOL, length of con text, The Exclusion Principle, The Burrows-Wheeler Transform:

Move-to-front coding, CALIC, JPEG-LS, Multi-resolution Approaches, Facsimile Encoding,

DynamicMarko yCompression.

Unit IV:Distortion criteria, Models, Scalar Ouantization: The Quantization problem, Uniform

Quantizer,Adaptive Quantization, Non uniform

Quantization.Unit-

V:Advantages of Vector Quantization

ove

r

Scalar Quantization, The Linde-Buzo-GrayAlgorithm,Tree structured Vector Quantizers.

StructuredVector

Quantizers

.

References

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

Publishers

EIT-071 Discrete Structures

Unit-

ISet Theory: Introduction, C ombination of sets, Multisets, Ordered pairs. Proofs of some

generalidentities on

sets.Relations: Definition, Operations on relations, Properties of relations, CompositeRelations,Equality of relations, Recursive definition of relation, Order of

relations.Functions: Definition, Classification of functions, Operations on functions, Recursively

definedfunctions. Growth of Functions. Natural Numbers: Introduction, Mathematical Induction, Variants of Induction, Induction

with Nonzero Base cases. Proof Methods, Proof b y counter example, Proof by

contradiction.

Unit-

IIAlgebraic Structures: Definition, Groups, Subgroups and ord er, Cyclic Groups,Cosets,Lagrange's theorem, Normal Subgroups, Permutation and Symmetric groups,

GroupHomomorphisms, Definition and elementary properties of Rings and Fields, Integers

Modulon.

37


38/52

Unit-

IIIPartial order sets: Definition, Partial order sets, Combination of partial order sets, Hasse

diagram.Lattices: Definition, Properties of lattices Bounded, Complemented, Modular andCompletelattice.Boolean Algebra: Introduction, Axioms and Theorems of Boolean algebra,

Algebraicmanipulation of Boolean expressions. Simplification of Boolean Functions, Karnaughmaps,Logic gates, Digital circuits and Boolean

algebra.

Unit-

IVPropositional Logic: Proposition, well formed formula, Truth tables, Tautology,

Satisfiability,Contradiction, Algebra of proposition, Theory of Inferen

cePredicate Logic: First order predicate, well formed formula of predicate, quantifiers,Inferencetheory o f predicatelogic.

Unit-V

Trees : Definition, Binary tree, Binary tree traversal, Binar y search

tree.Graphs: Definition and terminology, Representation of graphs, Multigraphs, Bipartitegraphs,Planar

graphs,Isomorphism and Homeomorphism of graphs, Euler and Hamiltonian paths, Graph

coloringRecurrence Relation & Generating function: Recursive definition of functions,

Recursivealgorithms, Method of solving

recurrences.Combinatorics: Introduction, Counting Techniques, Pigeonhole

Principle

References

: 1. Liu and Mohapatra, Elements of Distcrete Math ematics, McGrawHill2. Jean Paul Trembley, R Manohar, Discrete Mathematical Structures with Application

to Computer Science, McGraw-

Hill3. R.P. Grimaldi, Discrete and Combinatorial Mathematics, AddisonWesley,4. Kenneth H. Rosen, Discrete Mathematics and Its Applications, McGraw-

Hill,5. B. Kolman, R.C. Busby, and S.C. Ross, Discrete Mathematical Structures,

PHI

EIT-072 THEORY OF AUTOMATA AND FORMAL LANGUAGES

Unit I

Introduction; Alphabets, Strings and Lan guages; Automata and Grammars, Deterministic

finiteAutomata (DFA)-Formal Definition, Simplified notation: State transition graph, Transition

table, Language o f DFA, Nondeterministic finite Automata (NFA), NFA with epsilon transition,Lan gu age of NFA, Equi valence of NFA and DFA, Minimization of Finite Automata,

Distinguishing one string from other, Myhill-NerodeTheorem

Unit II

Regular expression (RE) , Definition, Operators of regular expression and their

precedence,Algebraic laws for Regular expressions, Kleens Theorem, R egular expression to FA, DFA

to38


39/52

Regular expression, Arden Theorem, Non Regular Languages, Pumping Lemma for

regularLan gu ages . Application of Pumping Lemma, Closure properties of Regu lar

Languages,Decision properti es of Regular Languages, FA with output: Moore and Mealy

machine,Equivalence of Moore and Mealy

Machine,Applications and Limitation of

FA.Unit

IIIContext free grammar (CFG) and Contex t Freee Languages (CFL): Definition,

Examples,Derivation , Derivation trees, Am biguity in Grammer, Inherent ambiguity, AmbiguoustoUnambiguous CFG, Useless sym bols, Simplification of CFGs, Normal forms for CFGs:CNFand GNF, Closure proper ties of CFLs, Decision Properties of CFLs: Emptiness, FinitenessandMemership, Pumping lemma for

CFLs,

Unit IV

Push Down Automata (PDA): Description and definition, Instantaneous

Description,Lan gu age of PDA, Acceptance by Final state, Acceptance by empty stack, DeterministicPDA,Equivalence of PDA and CFG, CFG to PDA and PDA to CFG, Two stack PDA

Unit V

Turing machines (TM): Basic model, definit ion and representatio n, Instantaneous

Description,Lan gu age acceptance by TM, Variants of Turing Machine, TM as

Computerof Integer functions, Universal TM, Chur chs Thesis, Recursive and recursively

enumerablelanguages, Halting problem, Introduction to Undecidability, Undecidable problems about

TMs.Post correspondence problem (PCP), Modified PCP,

Introductionto recursive functiontheory

References

: 1. Hopcroft, Ullman, Introduction to Automata Theory, Lan guages and

Computation,Pearson

Education2. K.L.P. Mishra and N.Chandrasekaran, Theory of Computer Science :

Automata,Lan gu ages and Computation,PHI3. Martin J. C., Introduction to Languages and Theory of Computations,

TMH4. Papadimitrou, C. and Lewis, C.L., Elements of the Theory of Computatio n,

PHI

EIT-073 Bioinformatics

Unit

I:Bioinformatics objectives and overviews, Interdisciplinary n ature o f Bioinformatics,Dataintegration, Data analysis, Major Bioinformatics d atabases and tools. Metadata:Summary

39


40/52

& reference systems, finding new type of data

online.

Molecular Biology and

Bioinformatics:

Systems approach in biology, C entral dogma

ofmolecular biology, problems in molecular approach and the bioinformatics approach, oerviewofthe bioinformaticsapplications.

UnitII:Basic chemistry of nucleic acids, Structure of DNA, Structure of RNA,

DNAReplication, -Transcription, -Translation, Gen es- the functional elements in

DNA,Analyzing DNA,DNA sequencing. Proteins: Amino acids, Protein structure,

Secondary,Tertiary and Quaternary structure, Protein folding and function, Nucleic acid-

Proteininteraction

.

Unit

III:

Perl Basics, Perl applications for bioinfor matics- Bioperl, Linu x OperatingSystem,mounting/unmounting files, tar, gzip / gunzip, telnet, ftp, developing applications on Linux

OS,Understanding and Using Biological Databases, Overview of Java, CORBA, XML,Webdeployment

concepts.

Unit

IV:Genome, Genomic sequencing, expressed sequence tags, gene expression,

transcriptionfactor binding sites and single nucleotide polymorphism. Computational

representationsof molecular biological data storage techniques: databases (flat, relational and object

oriented),and controlled vocabularies, general data retrieval techniques: indices,Booleansearch, fuzzy sear ch and neighboring, application to biological datawarehouses.

Unit V:

Macromolecular structures, chemical compounds, generic variability and its connectiontoclinical data. Representation of patterns and relationships: sequence alignment

algorithms,regular expressions, hierarchies and graphical models, Phylogenetics. B

LAST.

Reference

s1. D E Krane & M L R aymer, Fundamental concepts of Bioinformatics, PerasonEducation.2. Rastogi, Mendiratta, Rastogi, Bioinfo rmatics Methods & applications,

Genomics,Proteomics & Drug Discover y PHI, New

Delhi3. Shubha Gopal et.al. Bioinformatics: with fundamentals of genomics and proteomics,Mc Graw

Hill.4. OReilly, Developing Bio informatics computer skills,

CBS5. Forsdyke, Evolutionary Bioinformatics,Springer

40


41/52

EIT -074 IT in Forensic Science

UNIT I

Overview of Biometrics, Biometric Identification, Biometric Verification, Biometric

Enrollment,Biometric System

Security.Authentication and

Biometrics

: Secure Authentication Protocols, Access Control

SecurityServices, Matching Biometric Samples, Verification byhumans.

Common

biometrics:

Finger Print R ecognition, Face Recognition, Speaker Recognition,

IrisR ecognition, Hand Geometry, SignatureVerification

UNIT

IIIntroduction to Information

Hiding:

Technical Steganography, Linguistic

Steganography,C opy Right Enforcement, Wisdom fromCryptography

Principles of Steganography:

Framework for Secret Communication, SecurityofSteganograph y System, Information Hiding in Noisy Data , Adaptive versus non-

AdaptiveAlgorithms, Active and Malicious Attackers, Inf ormation hiding in Written

Text.

UNIT

IIIA Survey of Steganographic

Techniques:

Substitution systems and Bit Plane Tools,

TransformDomain Techniques: - Spread Spectrum and Information hiding, Statistical

Steganography,Distortion Techniques, Cover Generation

Techniques.

Steganalysis

:

Looking for Signatures: - Extracting hidden Information, DisablingHiddenInformation

.

UNIT IV

Watermarking and Copyright

Protection:

Basic Watermarking, Water markingApplications,R equirements and Algorithmic Design Issues, Evaluation and Benchmarking of

Watermarkingsystem

.

T ransform

Methods:

Fourier Transformation, Fast Fourier Tr ansformation, Discrete

CosineTransformation, Mellin- Fourier Transfo rmation, Wavelets, Split Images in Perceptual

Bands.Applications of Transformation in Steganography.

UNIT VComputer Forensics, Rules of evidence, Evidence dynamics, Evidence collection, Datarecovery,Preservation of digital evidence, surveillance tools for future warfar

e,

References

:1. Katzendbisser, Petitcolas, " Information Hiding Techniques for Stegano graphy andDigitalWatermarking", Artech

House.

41


42/52

2. Peter Wayner, "Disappearing Cryptograph y: Information Hiding, Steganograph y

andWatermarking 2/e",

Elsevier3. Bolle, Connell et. al., "Guide to Biometrics",

Springer4. John Vecca, Computer Forensics: Crime scene Investigation, Firewall

Media5. Christopher L.T. Brown, Computer Evidence: Collection and Preservation, Firewall

Media

ECS-081 Real Time System

UNIT-I:

IntroductionDefinition, Typical Real Time Applications: Digital Control, High Level Controls,

SignalProcessing etc., R elease Times, Deadlines, and Timing Constraints, Hard Real Time

Systemsand Soft Real Time Systems, Reference Models for Real Time Systems: Processors

andResources, Temporal Parameters of Real Time Workload, Periodic Task Model,

PrecedenceConstraints and DataDependency.UNIT-II: Real Time

SchedulingCommon Approaches to Real Time Scheduling: Clock Driven Approach,WeightedRound Robin Approach, Priority Driven Appro ach, Dynamic Versus Static Systems,

Optimalityof Eff ective-Deadline-First (EDF) and Least-Slack-Time-First (LST) Algorithms,

RateMonotonic Algorithm, Offline Versus Online Scheduling, Scheduling Aperiodic andSporadic jobs in Priority Driven and Clock Driven

Systems.

UNIT-III: Resources

SharingEffect of Resource Contention and Resource Access Control (RAC), Non-

preemptiveCritical Sections, Basic Priority-Inheritance and Priority-Ceiling Protocols, Stack BasedPriority-Ceiling Protocol, Use of Priority-Ceiling Protocol in Dynamic Priority Systems,

PreemptionCeiling Protocol, Access Control in Multiple-Unit Resources, C ontrolling Concurrent

Accessesto Data

Objects.

UNIT-IV: Real Time

Communication

Basic Concepts in Real time Communication, Soft and Hard RT Communicationsystems,Model of Real Time Communication, Priority-Based Service and Weighted Round-

RobinService Disciplines for Switched Networks, Medium Access Control Protocols for

Broadcast Networks, Internet and Resource ReservationProtocols

UNIT-V: Real Time Operating Systems and

DatabasesFeatures of RTOS, Time Services, UNIX as RTOS,

POSIXIssues, Charecteristic of Temporal data, Temporal Consistencey, ConcurrencyControl,Overview of Commercial Real Timedatabases

42


43/52

References

:1. Real Time Systems by Jane W. S. Liu, Pearson Education

Publication.2. Mall Rajib, Real Time Systems, Pearson

Education3. Albert M. K. Cheng , Real-Time Systems: Scheduling, Analysis, and

Verification,Wiley

.

ECS-082 Software Project Management

UNIT-I: Introduction and Software Project

PlanningFundamentals of Software Project Management (SPM), Need Identification, Vision and

Scopedocument, Project Management C ycle, SPM Objectives, Management Spectrum,

SPMFramework, Software Project Planning, Planning Objectives, Project Plan, Types of projectplan,Structure of a Software Project Management Plan, Softwar e project estimation,

Estimationmethods, Estimation models, Decisionprocess.

UNIT-II: Project Organization and

SchedulingProject Elements, Work Breakdown Structure (WBS), Types of WBS, Functions, Activities

andTasks, Project Life Cycle and Product Life Cycle, Ways to Organize Personnel, Project

schedule,Scheduling Objectives, Building the project schedule, Scheduling terminolog y and

techniques, Network Diagrams: PERT, CPM, Bar Charts: Milestone Charts, GanttCharts.

UNIT-III: Project Monitoring and

ControlDimensions of Project Monitoring & Control, Earned Value Analysis, Earned Value

Indicators:Budgeted Cost for Work Scheduled (BCWS), Cost Variance (CV), Schedule Variance

(SV),Cost Performance Index (CPI), Schedule Performance Index (SPI), Interpretation ofEarnedValue Indicators, Error Tracking, Software Reviews, Types of Review: Inspections,

Deskchecks,Walkthroughs, Code Reviews, Pair

Programming.

UNIT-IV: Software Quality Assurance and

TestingTesting Objectives, Testing Principles, Test Plans, Test Cases, Types of Testing, LevelsofTesting, Test Strategies, Program Correctness, Program Verification & validation,

TestingAutomation & Testing Tools, Concept of Software Quality, Software QualityAttributes,Software Quality Metrics and Indicators, The SEI Cap ability Maturity Model CMM),SQAActivities, Formal SQA Approaches: Proof of correctness, Statistical quality

assurance,Cleanroom

process.UNIT-V: Project Management and Project Management

ToolsSoftware Configuration Management: Software C onfiguration Items and tasks, Baselines,

Planfor Change, Chan ge Control, Change Requests Management, Version Control,

RiskManagement: Risks and risk types, Risk Breakdown Structure (RBS), Risk

ManagementProcess: Risk identification, Risk analysis, Risk planning, Risk monitoring, CostBenefitAnalysis, Software Project Management Tools: CASE Tools, Planning and SchedulingTools,MS-

Project.43


44/52


45/52

ECS-084 Cryptography & Network Security

Unit-

IIntroduction to security attacks, services and mechanism, Classical encryption

techniques-substitution ciphers and transposition ciphers, cryptan alysis, steganography, Stream andblockciphers.Modern Block Ciphers: Block ciphers prin ciples, Shannons theory of confusion anddiffusion,fiestal structure, Data encryption standard(DES), Strength of DES, Idea of

differentialcryptanalysis, block cipher modes of operations, Triple

DES

Unit-

IIIntroduction to group, field, finite field of the form GF(p), modular arithmetic, prime and

relative prime numbers, Extended Euclidean

Algorithm,Advanced Encryption Standard ( AES) encryption and decryptionFermats and Eulers theorem, Primality testing, Chinese Remainder theorem,

DiscreteLogarithmicProblem,Principals of public key crypto systems, RSA algorithm, security of

RSA

Unit-

IIIMessage Authentication Codes: Authentication requirements, authentication functions,

messageauthentication code, hash functions, birthday attacks, security of hash functions, Secure

hashalgorithm

(SHA)Digital Signatures: Digital Signatures, Elgamal Digital Signature Techniques, Digitalsignaturestandards (DSS), proof of digital signaturealgorithm,

Unit-

IVKey Management and distribution: Symmetric key distribution, Diffie-Hellman KeyExchange,Public key distribution, X.509 Certificates, Public key

Infrastructure.Authentication Applications:

KerberosElectronic mail security: pretty good privacy (PGP),

S/MIME.

Unit-V

IP Security: Architecture, Authentication header, Encapsulating security payloads,

combiningsecurity associations, keymanagement.Introduction to Secure Socket Layer, Secure electronic, transaction(SET)System Security: Introductory idea o f Intrusion, Intrusion detection, Viruses and r elatedthreats,firewall

sReferences:

1. William Stallings, Cryptograph y and Network Security: Principals and

Practice,Pearson

Education.2. Behrouz A. Frouzan: Cryptography and Network Security, Tata McGraw

Hill3. Bruce Schiener, Applied Cryptography. John Wiley &

Sons4. Bernard Men ezes, Network Security and Cryptography, Cengage

Learning.5. Atul Kahate, C ryptography and Network Security, Tata McGraw

Hill45


46/52

ECS-085 Neural Networks

Unit-

I: Neurocomputing andNeuroscienceHistorical notes, human Brain, neuron Mode l, Knowledge representation, Al and NN.Learning process: Supervised and unsuperv ised learning, Error correction learning,competitivelearning,adaptation, statistical nature of the learning

process.

Unit-

II

:

Data

processingScaling, normalization, Transformation (FT/FFT), principal component analysis, regression,

co-variance matrix, eigen values & eigen vectors. Basic Models of Artificial neurons,

activationFunctions, aggregation function, single neuron computation, multilayer p erceptron, leastmeansquare algorithm, gradient descent rule, nonlinearly separable problems and ben ch

markproblems in NN.

Unit-

IIIMultilayered network architectur e, back propagation algorithm, heuristics for making

BP-algorithm performs better. Accelerated learning BP (like recursive least square, quick

prop,RPROP algorithm), app roximation properties of RBF networks and comp arison with

multilayerperceptran.

Unit-

IVRecurrent network and temporal feed -forward network, implementation with BP, self

organizingmap and SOM algorithm, properties of feature map and computer simulation.

Principalcomponent and Independent component analysis, application to image and signalprocessing.

Unit-V

Complex valued NN and complex valued BP, analyticity of activation function, applicationin2D information processing. Complexity analysis of network models.

Softcomputing. Neuro-Fuzzy-genetic algorithm

Integration.

References

:1.

Proposed b Tech 3 4 Year5

Documents

Transcript of Proposed b Tech 3 4 Year5