GUJARAT UNIVERSITY

B.E. SEM VIII (INFORMATION TECHNOLOGY)

IT 801 Algorithm Analysis & Design

Subject Code Teaching Examination Scheme

Scheme
Elective Theory Lab/ Exam Theory Theory Pract TW Total
IT Pract Paper Marks
801 04 02 University 3 Hr 100 25 25 150

Basics of Algorithms and Mathematics

What is an algorithm? Mathematics for Algorithmic, Sets , Functions and Relations, Vectors and
Matrices , Linear Inequalities and Linear Equations

Analysis of Algorithm
The efficient of algorithm, average and worst case analysis, elementary operation, Asymptotic
Notation, Analyzing control statement, Analyzing Algorithm using Barometer, Amortized
analysis, solving recurrence Equation, Sorting Algorithm, Binary Tree Search

Greedy Algorithm
General Characteristics of greedy algorithms, Problem solving using Greedy Algorithm
- Making change problem; Graphs: Minimum Spanning trees (Kruskal’s algorithm, Prim’s
algorithm); Graphs: Shortest paths; The Knapsack Problem; Job Scheduling Problem

Divide and Conquer Algorithm

The general Template derives using multiplying large Integers Problem, Problem Solving using
divide and conquer algorithm - Binary Search; Sorting (Merge Sort, Quick Sort); Matrix
Multiplication; Exponential

Dynamic Programming
Introduction, The Principle of Optimality, Problem Solving using Dynamic Programming –
Calculating the Binomial Coefficient; Making Change Problem; Assembly Line-Scheduling;
Knapsack Problem; Shortest Path; Matrix Chain Multiplication; Longest Common Subsequence,
memory functions

Exploring Graphs
An introduction using graphs and games, Traversing Trees – Preconditioning; Depth First Search
- Undirected Graph; Directed Graph, Breath First Search, Backtracking – The Knapsack
Problem; The Eight queens problem; General Template, Brach and Bound – The Assignment
Problem; The Knapsack Problem, The minmax principle

String Matching
Introduction, The naïve string matching algorithm, The Rabin-Karp algorithm, String Matching
with finite automata

Introduction to NP-Completeness
1
The class P and NP, Polynomial reduction, NP- Completeness Problem, NP-Hard Problems

Practical and Term work:

Practical and Term work should be carried out as per the above syllabus. Minimum 10 exercises
should be carried out.
Text Books:
1 Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald
L. Rivest and Clifford Stein
Reference book:
1. Fundamental of Algorithms by Gills Brassard, Paul Bratley, Publication : Pentice Hall of
India
2. Fundamental of Computer Algorithms by Ellis Horowitz, Sartaz sahni and sanguthevar
Rajasekarm

2
 IT 802 Soft Computing and Neural Network

Subject Code Teaching Examination Scheme

Scheme
Elective Theory Lab/ Exam Theory Theory Pract TW Total
IT Pract Paper Marks
802 04 02 University 3 Hr 100 25 25 150

NEURAL NETWORKS
Supervised Learning Neural Networks – Perceptrons - Adaline – Backpropagation Mutilayer
Perceptrons – Radial Basis Function Networks – Unsupervised Learning Neural Networks –
Competitive Learning Networks – Kohonen Self-Organizing Networks – Learning Vector
Quantization – Hebbian Learning.

FUZZY SET THEORY

Introduction to Neuro – Fuzzy and Soft Computing – Fuzzy Sets – Basic Definition and
Terminology – Set-theoretic Operations – Member Function Formulation and Parameterization –
Fuzzy Rules and Fuzzy Reasoning – Extension Principle and Fuzzy Relations – Fuzzy If-Then
Rules – Fuzzy Reasoning – Fuzzy Inference Systems – Mamdani Fuzzy Models – Sugeno Fuzzy
Models – Tsukamoto Fuzzy Models – Input Space Partitioning and Fuzzy Modeling.

GENETIC ALGORITHM:
Difference between Traditional Algorithms and GA, The basic operators, Schema theorem,
convergence analysis, stochastic models, applications in search and optimization. Encoding,
Fitness Function, Reproduction, Cross Over, Mutation, Convergence Theory; Applications.

ROUGH SET:
Indiscernibility Relations, Reducts, Rough Approximation. Applications.Hybrid Systems: Neuro
Fuzzy Systems, Fuzzy Logic Controlled GA, Fuzzy Membership Interpretation using Rough Set
theory etc.

NEURO FUZZY MODELING

Adaptive Neuro-Fuzzy Inference Systems – Architecture – Hybrid Learning Algorithm –
Learning Methods that Cross-fertilize ANFIS and RBFN – Coactive Neuro Fuzzy Modeling –
Framework Neuron Functions for Adaptive Networks – Neuro Fuzzy Spectrum. Neuro-Fuzzy
Systems for Pattern Recognition: Image-, Speech- and Language Processing

NEURO-GENETIC INFORMATION PROCESSING FOR OPTIMIZATION:

Adaptation in Intelligent Systems , Evolving Connectionist and Fuzzy Connectionist Systems,
Applications for Adaptive Systems, On-line Intelligent Systems

MACHINE LEARNING
Learning form Examples - Inductive Concept Learning - Sequence Prediction - Effect of Noise
in Input. Learning by Analogy- Concept formation - Derivational Analogy.
Learning by Observation and Discovery - Search for Regularity-Conceptual Clustering,
Computational Learning Theory

3
APPLICATIONS OF COMPUTATIONAL INTELLIGENCE
Printed Character Recognition – Inverse Kinematics Problems – Automobile Fuel Efficiency
Prediction – Soft Computing for Color Recipe Prediction.

Practical: Minimum 10 experiments should be carried out according to topic covered in subject.

TEXT BOOK
• J.S.R.Jang, C.T.Sun and E.Mizutani, “Neuro-Fuzzy and Soft Computing”, PHI, 2004,
Pearson Education 2004.

• Michalski, Carbonnel & Michel (Eds.): Machine Learning - An A. I. Approach, Vol-I.

REFERENCES

• Timothy J.Ross, “Fuzzy Logic with Engineering Applications”, McGraw-Hill, 1997.

• Davis E.Goldberg, “Genetic Algorithms: Search, Optimization and Machine Learning”,
Addison Wesley, N.Y., 1989.
• S. Rajasekaran and G.A.V.Pai, “Neural Networks, Fuzzy Logic and Genetic Algorithms”,
PHI, 2003.
• Neuro-Fuzzy Techniques for Intelligent Information Systems by Nikola Kasabov and
Robert Kozma (eds), ISBN 3-7908-1187-4.
• Neural network fuzzy logic genetic algorithm synthesis and application- S. Rjaesh Karan.

4
 IT 803 Service Oriented Computing

Subject Code Teaching Examination Scheme

Scheme
Elective Theory Lab/ Exam Theory Theory Pract TW Total
IT Pract Paper Marks
803 04 02 University 3 Hr 100 25 25 150

Introduction
Introduction, Brief history of information technology, Distributed computing
in the large, Motivations for composition, Challenges for composition, Web
Services Architectures and Standards.

Basic concepts
Directory services, SOAP, WSDL, UDDI

Enterprise architectures
Integration versus interoperation, J2EE, .NET, Model Driven Architecture,
Legacy systems.

Principles of Service-Oriented Computing

Use cases: Intra-enterprise and Inter-enterprise Interoperation,
Application,Configuration, Dynamic Selection, Software Fault Tolerance, Grid,
and,Utility Computing,Elements of Service-Oriented Architectures, RPC
versus Document, Orientation, Composing Services

Description: Modeling and representation

XML primer, Conceptual modeling, Ontologies and knowledge sharing, Relevant
standards:
RDF, RDFS, and OWL, Inferencing and tools, Matchmaking

Engagement
Execution Models: Messaging, CORBA, Peer to peer computing, Jini, Grid
Computing, Transactions: ACID Properties, Schedules, Locking, Distributed
Transactions,Transactions over Composed Services: Architecture,
Properties,Compositional Serializability,Process specification: Processes,
Workflows, Business Process Management,Process Specification
Language,Relevant standards: BPEL4WS, WSCI, WS-C, ebXML,Relaxed
transactions,Exception handling

Collaboration
Describing collaborations, Agents, Multiagent systems, Agent
communication, languages, Protocols, Commitments and contracts,
Planning,Consistency maintenance, Relevant standards: FIPA, OWL-S,
Economic models, Organizational models

5
Selection
Quality of service, Application-level trust, Reputation mechanisms, Referral
systems

Engineering
Engineering composed services, Compliance, Trust, Privacy.

Synthesis
Common threads, Open problems Status and trends

Text Book:
Service-Oriented Computing: Semantics, Processes, Agents
by Munindar P. Singh and Michael N. Huhns
John Wiley & Sons, Ltd., 2005

Reference Book:
Service-Oriented Architecture: Concepts, Technology, and Design
By Thomas Erl
Publisher: Prentice Hall PTR , 2005

6
 IT 804 Software Architecture and Project Management

Subject Code Teaching Examination Scheme

Scheme
Elective Theory Lab/ Exam Theory Theory Pract TW Total
IT Pract Paper Marks
804 04 02 University 3 Hr 100 25 25 150

SOFTWARE ARCHITECTURE

Introduction to Software Architecture

Software Architecture ,Relationships to Other Disciplines ,Multi-Disciplinary Overview ,
Foundations of Software Architecture , Software architecture in the context of the overall
software life cycle, Architectural Styles, CASE study of Architectures

Software Architecture Design

Designing, Describing, and Using Software Architecture, IS2000: The Advanced Imaging
Solution, Global Analysis, Conceptual Architecture View, Module Architecture View, Styles of
the Module Viewtype, Execution Architecture View, Code Architecture View. Component-and-
Connector Viewtype, Styles of Component-and-Connector Viewtype, Allocation Viewtype and
Styles, Documenting Software Interfaces, Documenting Behavior, Choosing the Views, Building
the Documentation Package.

Archetype Patterns
Archetypes and Archetype Patterns, Model Driven Architecture with Archetype Patterns.
Literate Modeling, Archetype Pattern. , Customer Relationship Management (CRM) Archetype
Pattern, Product Archetype Pattern, Quantity Archetype
Pattern, Rule Archetype Pattern.

Introduction to Design Patterns.

Design Patterns, Creational Patterns, Patterns for Organization of Work, Access Control
Patterns, Service Variation Patterns, Service Extension Patterns

Pattern Types
Object Management Patterns Adaptation Patterns, Communication Patterns, Architectural
Patterns, Structural Patterns, Patterns for Distribution, Patterns for Interactive Systems
Adaptable Systems, Frameworks and Patterns, Analysis Patterns

PROJECT MANAGEMENT

Introduction to Software Project Management System

Software Development as a project, stakeholders in software project, software product,
processes, quality and cost, objectives, issues and problems relating to software projects.

Overview of Project Planning

7
Steps in project planning, defining scope and objectives, deliverables and other products,
alternatives in planning.

Project Estimation
Project Size Estimation Metric: LOC, FP, Feature Point. Estimation Technique: Empirical,
Heuristics and analytical. COCOMO Model, Halstead, Putnam and SLIM models for Time and
Effort Estimation. Staffing Level Estimation: Effect on schedule change on cost and Jensen
model.
Project Scheduling
Work Breakdown structure, Activity Network: Network planning model, Activity –on-arrow
network, precedence network, Forward and Backward pass, Critical Path, Stack and float, Gantt
Chart, PERT Charts.
Organization and Team Structure
Overview of Organization structure and Team Structure, Organizational Behavior, Recruitment
and Placement, Staffing, Motivation and Group Behavior. Individual and Group Decision
making, Leadership and Leader style, Forms of Organizational Structure.

Risk Analysis and Management

Risk Identification, Nature and Categories of Risk in software Development, Risk Assessment;
Risk Mitigation, Monitoring and Management(RMM), RMM Plan, Risk Containment,
Evaluating Scheduling Risk using PERT.

Resource Allocation
Nature of Project Resources, Identifying resource requirement for Activities, Allocating and
Scheduling Resources, Cost of Resources, Standard, Plan and Actual Cost, Cost variance, Time
cost trade off.

Project Tracking and Configuration Management

Measurement of Physical and Financial progress, Earned value analysis, Status reports and
Milestone reports. Necessity of configuration management, Configuration Management Activity,
Change control, Source code Control System (SCCS).

Project Contract Management

Outsourcing of products and services, Types of contract, Stages in contract placement, Terms
and Condition of contract, Contract monitoring and Acceptance Testing.

Practical: Minimum 10 experiments should be carried out according to topic covered in subject.

Text:

1. Bob Hughes and Mike Cotterell, “Software Project Management”, Third Edition 2002, Mc
Graw-Hill.

8
 2. Pankaj Jalote, “Software Project Management in Practice”, 2002, Pearson, Education Asia.

ReferenceBooks:
1. Applied Software Architecture ,Christine Hofmeister, Robert Nord, Deli Soni,
Addison-Wesley Professional; 1st edition (November 4, 1999).

2. Essential Software Architecture, Ian Gorton Springer; 1 edition (2006).

3. Pattern-Oriented Software Architecture Volume 1, 2, 3, 4, 5 by Frank Buschmann, Hans

Rohnert, Kevin Henney, Douglas C. Schmidt, Publisher: Wiley; 1 edition (August 8, 1996-
2004).

4. Design Patterns: Elements of Reusable Object-Oriented Software (Addison- Wesley

Professional Computing Series) by Erich Gamma, Richard Helm, Ralph Johnson, John Vlissides
Publisher: Addison-Wesley Professional; 1st edition.

5. Roger S. Pressman, “Software Engineering: A practical Approach”, Fifth Editoin 2001,

McGraw-Hill.

6. Software Engineering By Ian Sommerville Addison Wesley.

7.Fundamentals of Software Engineering By Rajib Mall, Prentice Hall of India.

9
 IT 805 Language Processor

Subject Code Teaching Examination Scheme

Scheme
Elective Theory Lab/ Exam Theory Theory Pract TW Total
IT Pract Paper Marks
805 04 02 University 3 Hr 100 25 25 150

Language translation overview

Phases in language translation, overview of system software used during translation –language
processors, linker , loader. Types of language processors– assembler, interpreter, compiler etc.

Compiler structure
Analysis-synthesis model of compilation, various phases of a compiler.

Lexical analysis
Interface with input, parser and symbol table, token, lexeme and patterns. Difficulties in lexical
analysis. Error reporting. Implementation. Regular definition, Transition diagrams
Syntax analysis
CFGs, ambiguity, associativity, precedence,Top down parsing-recursive descent parsing,
transformation on the grammars, predictive parsing,Bottom up parsing, operator precedence
grammars, LR parsers, (SLR, LR).

Syntax directed translation:

Inherited and synthesized attributes, L- and S-attributed definitions, semantic stacks in bottom-
up compilation, action symbols in top-down
Intermediate Code generation:
Polish Notation,N-tuple, Abstract syntax trees,Threaded code(P-code abstract machine for
Pascal) ,Intermediate languages, Issues in implementation.

Run time system:

storage organization, activation tree, activation record, parameter passing, symbol table, static,
dynamic and heap storage allocation, garbage collection.

Symbol table management

Symbol table organizations for blocked and non-blocked languages.

Code optimizations:
Machine dependent, machine independent optimizations

10
Real time environment

Error detection of recovery

Practical and Term work:

Practical and Term work should be carried out as per the above syllabus. Minimum 10
exercises should be carried out.

Text Books:
(1) The theory and practice of Compiler Writing by Jean Paul
Tremblay and Paul G. Sorenson
(2) Compilers: Principles, Techniques and Tools, By A. V. Aho,
R. Sethi, and J. D. Ullman. Publisher Addison-Wesley.
Ref. Book:
(1) Compiler design in C by Allen Holup, Publisher-PHI
(2) Compiler Construction by Dhamdhere, Publisher- McMillan India

11
 IT 806 Distributed & Parallel Computing

Subject Code Teaching Examination Scheme

Scheme
Elective Theory Lab/ Exam Theory Theory Pract TW Total
IT Pract Paper Marks
806 04 02 University 3 Hr 100 25 25 150

Parallel Computing Architectures

Speedup factor and efficiency, Shared memory multiprocessors,Interconnection
Networks,Flynn’s classifications,Parallel computing architectures memory model,Solving
problems in parallel

Memory Hierarchy
Memory hierarchies,Cache basics,Matrix multiplication,Latency,Impact of memory
bandwidth,Multilevel caches,Introduction to cache coherence

Virtual Memory and Programming Performance

Motivations for VM,Address translation,Accelerating with TLB’s,How architecture
impacts your programs,How (and how not) to tune your code

Message Passing Computing I

SPMD and MPMD model,Point-to-point send and receive communications,Synchronous
and asynchronous message passing,Simple MPI examples,Basics of collective
communications,Evaluating parallel programs

Message Passing Computing II

Buffered and nonbuffered point-to-point communication,Collective
communications,Performance issues

Parallel Techniques I
Embarrassingly Parallel Computations,Ideal Parallel Computation,Embarrassingly
Parallel Examples

Parallel Techniques II
Partitioning and Divide-and-Conquer Strategies,Pipelined Computations

Parallel Techniques III

Synchronous Computations,Synchronization,Data Parallel Computations,Synchronous
Iteration Program Examples,Solving a System of Linear Equations by Iteration,Heat
Distribution Problem

Parallel Techniques IV
Load Balancing and Termination Detection,Dynamic Load Balancing (DLB),Centralized
DLB,Decentralized DLB,Load Balancing Using a Line Structure,Distributed Termination
Detection Algorithms
12
Programming with shared memory I
Basic shared memory architecture,Differences between a process and threads,Accessing
shared data,Shared data in systems with caches,Cache coherence problem

Programming with shared memory II

Introduction to OpenMP

Programming with shared memory III

Snoopy cache coherence,Directory based cache coherence

Practical and Term work:

Practical and Term work should be carried out as per the above syllabus. Minimum 10
exercises should be carried out.

TEXT BOOK :

1. M. Paprzycki, R. Waśniowski, and J. Zalewski, “Parallel and Distributed

Computing Education: A Software Engineering Approach,”
2. D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Compuation:
Numerical Methods, D. P. Bertsekas and J. N. Tsitsiklis, Prenctice Hall.

13
 IT 807 Mobile Computing

Subject Code Teaching Examination Scheme

Scheme
Theory Lab/ Exam Theory Theory Pract TW Total
Elective IT 807 Pract Paper Marks
4 2 University 3 Hrs 100 25 25 200

1 Mobile Computing Architecture

Architecture for mobile computing, Three tier architecture, design considerations
for mobile computing, mobile computing through internet, making existing
applications Mobile-Enabled

2 Mobile Computing Through Telephony

Evolution of telephony, multiple access procedures, mobile computing through
telephone, Developing an IVR application, voice XML, telephony application
programming interface

3 Mobile Technologies

Bluetooth, Radio frequency identification(Rfid),Wireless Broadband, Mobile

IP,IPv6,javacard
4 Global System For Mobile Communication
Global system for mobile communication, GSM architecture, GSM entities, call
routing in GSM,PLMN interface, GSM addresses and identifiers, network aspects
in GSM,GSM frequency allocation, authentication and security
5 Short Message Services
Mobile computing over SMS,SMS, value added services through SMS,
accessing the SMS bearer
6 General Packet Radio Service(GPRS)
GPRS and packet data network, GPRS network architecture, GPRS network
operation, data services in GPRS, Applications of GPRS, Billing and charging in
GPRS
7 Wireless Application Protocol(Wap)
WAP,MMS,GPRS application
8 CDMA And 3G
Spread-spectrum Technology, CDMA versus GSM, Wireless data, third
generation networks, applications in 3G
9 Wireless LAN
Wireless LAN advantages,IEEE802.11 standards ,Wireless LAN architecture,
Mobility in Wireless LAN, Deploying Wireless LAN, Deploying Wireless LAN,
Mobile ad hoc networks and sensor networks, wireless LAN security, WiFi v/s
3G
10 Voice Over Internet Protocol And Convergence

14
 Voice over IP,H.323 framework for voice over IP,SIP, comparison between
H.323 ad SIP, Real time protocols, convergence technologies, call routing, call
routing, voice over IP applications, IMS, Mobile VoIP

11 Security Issues In Mobile

Information security, security techniques and algorithms, security framework for
mobile environment

Practical and Term work:

Practical and Term work should be carried out as per the above syllabus. Minimum 10
exercises should be carried out.

Text Books:
1 Mobile Computing
Asoke K Telukder,Roopa R Yavagal by TMH
2 The complete reference J2ME
TMH
3. Handbook of Wireless Networks and Mobile Computing
Ivan Stojmenovic , Wiley

15