# Syllabus of Gujarat Technical University 7th Sem It

**Syllabus of Gujarat Technical University 7th Sem It**

**GUJARAT TECHNOLOGICAL UNIVERSITY**

**B.E. SEMESTER : VIII**

**INFORMATION TECHNOLOGY**

** **

**Subject Name: ****ADVANCE COMPUTER NETWORKS**

** ****1. ****Optical Networking**

- Introduction to Optical Networking
- SONET / SDH Standard
- DWDM

** **

**2. ****ATM: The WAN Protocol**

- Introducing ATM Technology
- Introducing Faces of ATM
- Explaining the basic concepts of ATM Networking
- Exploring the B-ISDN reference model
- Explaining the Physical Layer
- Explaining the ATM Layer
- Explaining the ATM Adaptation Layer
- Exploring ATM Physical interface
- Choosing an Appropriate ATM Public Service

** **

**3. ****Packet Switching Protocols**

- Introduction to Packet Switching
- Introduction to Virtual Circuit Packet Switching
- Introduction to X.25
- Introducing switched multimegabit data service

** **

**4. ****Protocols and Interfaces in Upper Layers of TCP/IP**

- Introducing TCP/IP suite
- Explaining Network Layer Protocols
- Explaining Transport Layer Protocol
- Explaining Application Layer Protocol

** **

**5. ****Routing in the Internet**

- Introduction to Intra-domain and inter-domain routings
- Unicast Routing Protocols
- Multicast Routing Protocols

** **

**6. ****Other Routing Techniques**

**1.**Introduction to traffic Engineering- IP over ATM
- Multiprotocol Label Switching
- Storage Area Network

** **

**7. ****Network Management and Services**

- Introduction to Network Management
- Standard Network Management Protocol

**8. ****Traffic Engineering Basics**

- Introduction to traffic Engineering
- Requirement Definition for Traffic Engineering
- Traffic Sizing
- Traffic Characteristics
- Protocols
- Time and Delay Consideration
- Connectivity
- Availability, Reliability, and Maintainability
- Throughput Calculation

** **

**9. ****Multimedia over Internet**

- Introduction to Multimedia Services
- Explaining Transmission of Multimedia over the Internet
- Explaining IP Multicasting
- Explaining VOIP

** **

**10. Introduction to the Cisco IOS.**

- The Cisco Router User Interface
- Command Line Interface (CLI)
- Router and Switch Administrative Functions
- Router Interfaces
- Viewing, Saving, and Erasing Configurations

** **

**11. IP Routing.**

- Routing Basics
- The IP Routing Process
- Configuration IP Routing in Our Network

** **

**12. Dynamic Routing Protocols.**

- Routing Protocol Basics
- Routing Information Protocol (RIP)
- Interior Gateway Routing Protocol (IGRP)
- Verifying Your Configurations

** **

**13. Layer 2 Switching.**

- Before Layer 2 Switching
- Switching Services
- Spanning Tree Protocol (STP)
- LAN Switch-Types

** **

**Test Books:**

1. Advance Computer Network, By Dayanand Ambawade, Dr. Deven shah, Prof. Mahendra Mehra, Wiley India

2. CCNA Intro – Study Guide – Todd Lammle, Sybex

** **

**Reference Books:**

1. High-Speed Networks and Internets, Performance and Quality of Service, Second Edition, William Stallings, Pearson

** To download engineering ebooks, medical ebooks, management ebooks, free ebooks please visit www.kopykitab.com**

**Subject Name: ****ARTIFICIAL INTELLIGENCE**

** **

**1. Problems And State Space Search**

The AI Problems, The Underlying Assumption, What Is An AI Techniques, The Level

Of The Model, Criteria For Success, Some General References, One Final Word.

** **

**2. Problems And State Space Search**

Defining The Problems As A State Space Search, Production Systems, Production

Characteristics, Production System Characteristics, And Issues In The Design Of

Search Programs, Additional Problems.

** **

**3. Heuristic Search Techniques**

Generate-And-Test, Hill Climbing, Best-First Search, Problem Reduction, Constraint

Satisfaction, Means-Ends Analysis.

** **

**4. Knowledge Representation Issues**

Representations And Mappings, Approaches To Knowledge Representation.

** **

**5. Using Predicate Logic :**

Representation Simple Facts In Logic, Representing Instance And Isa Relationships,

Computable Functions And Predicates, Resolution.

** **

**6. Representing Knowledge Using Rules**

Procedural Versus Declarative Knowledge, Logic Programming, Forward Versus

Backward Reasoning.

** **

**7. Symbolic Reasoning Under Uncertainty**

Introduction To Non-monotonic Reasoning, Logics For Non-monotonic Reasoning.

** **

**8. Statistical Reasoning :**

Probability And Bays’ Theorem, Certainty Factors And Rule-Base Systems, Bayesian

Networks, Dempster-Shafer Theory, Fuzzy Logic.

** **

**9. Weak Slot-And-Filler Structure :**

Semantic Nets, Frames.

** **

**10. Game Playing: Overview, And Example Domain**

The Blocks World, Components Of A Planning System, Goal Stack Planning,

Nonlinear Planning Using Constraint Posting, Hierarchical Planning, Reactive

Systems, Other Planning Techniques.

** **

**11. Natural Language Processing**

Introduction, Syntactic Processing, Semantic Analysis, Semantic Analysis, Discourse

And Pragmatic Processing.

** **

**12. Connectionist Models**

Introduction: Hopfield Networld, Learning In Neural Networld, Application Of Neural

Networks, Recurrent Networks, Distributed Representations, Connectionist AI And

Symbolic AI.

** **

**13. Expert Systems**

An Introduction To Expert System, Explanation Facilities, Expert System

Developments Process, knowledge Acquisition.

** **

**14. Introduction to Prolog**

Introduction To Prolog: Syntax and Numeric Function, Basic List Manipulation

Functions In Prolog, Functions, Predicates and Conditional, Input, Output and Local

Variables, Iteration and Recursion, Property Lists and Arrays, Miscellaneous Topics,

LISP and Other AI Programming Languages.

** **

**Texts:**

1 “Artificial Intelligence” -By Elaine Rich And Kevin Knight (2nd Edition) Tata Mcgraw-Hill

2 Introduction to Prolog Programming By Carl Townsend.

** **

**References:**

1. “Artificial Intelligence And Expert System, Development” -By D.W.Rolston Mcgraw-Hill International Edition.

2. “Artificial Intelligence And Expert Systems ” -By D.W.Patterson

3. “PROLOG Programming For Artificial Intelligence” -By Ivan Bratko( Addison-Wesley)

4. “Programming with PROLOG” –By Klocksin and Mellish.

5. “Artificial Intelligence” (Fifth Edition) –By George F Luger, Pearson Education.

6. “Artificial Intelligence” (Second Edition)–By Stuart Russell and Peter Norvig, Pearson Education.

7. Artificial Intelligence Application Programming, Tim Jones, Wiley India

** To download engineering ebooks, medical ebooks, management ebooks, free ebooks please visit www.kopykitab.com**

**Subject Name: ****DATA COMPRESSION**

** **

**1. Introduction To Data Compression**

The Audience, Why C?, Which C?, Keeping Score, The Structure

** **

**2. The Data Compression Lexicon, With A History**

The Two Kingdoms, Data Compression = Modeling + Coding, The Dawn Age,

Coding An Improvement Modeling, Statistical Modeling, Ziv & Lempel LZ77 LZ78,

Lossy Compression, Programs to Know

** **

**3. The Dawn Age: Minimum Redundancy Coding**

The Sahnnon-Fano Algorithm, The Huffman Algorithm, Huffman in C, BITIO.C, A

Reminder about Prototypes, MAIN-C.C & MAIN-E.C, MAIN-C.C,

ERRHAND.C, Into the Huffman Code, Counting the Symbols, Saving the Counts,

Building the Tree, Using the Tree

** **

**4. A Significant Improvement: Adaptive Huffman Coding**

Adaptive Coding, Updating the Huffman Tree, What swapping Does, The

Algorithm, An Enhancement, The Escape Code, The Overflow Bonus, A Rescaling

Bonus, The Code, Initialization of the Array, The Compress Main Program, The

Expand Main Program, Encoding the Symbol, Decoding The Symbol

** **

**5. Huffman One Better: Arithmetic Coding**

Difficulties, Arithmetic Coding: A Step Forward, Practical Matters, A Complication,

Decoding, Where’s the Beef

** **

**6. Dictionary-Based Compression**

An Example, Static vs. Adaptive, Adaptive Methods, A Representative Example,

Israeli Roots, History, ARC: The Father of MS-DOS Dictionary Compression,

Dictionary Compression, Danger Ahead-Patents, Conclusion

** **

**7. Sliding Window Compression**

The Algorithm, Problems with LZ77, An Encoding Problem, LZSS compression, Data

structures, A balancing Act Greedy vs. Best Possible. The Expansion Routine,

Improvements.

** **

**8. Speech Compression**

Digital Audio Concepts, Fundamentals, Sampling Variables, PC-Based sound,

Lossless Compression of Sound, Problems and Results, Loss compression, Silence

Compression, Other Techniques.

** **

**9. Lossy Graphics Compression**

Enter Compression, Statistical And Dictionary Compression Methods Lossy

Compression Differential Modulation Adaprive Coding, A Standard That Works:

JPEG, JPEG Compression, The Discrete Cosine Transform, DCT Specifics, Why

Bother? Implementing The DCT. Matrix Multiplication, Cpmtomied Improvements,

Output Of The DCT, Quantization, Selecting A Qualtization Matrix. The Sample

Program, Input Format, Initialization, The Forward DCT Routine, Write DCT Data(),

File Expansion, Read DCT Data(), The Inverse DCT.

** **

**Text Books:**

1. “Data Compression”, Mark Nelson

2. “Data Compression”, Khalid shayood, Morgon Kaufmann

** **

**Reference Books:**

1. “Data Compression : The Complete Reference”, David Saloman, Springer

** To download engineering ebooks, medical ebooks, management ebooks, free ebooks please visit www.kopykitab.com**

**Subject Name:** **DESIGN AND ANALYSIS OF ALGORITHM**

** **

**1. Basics of Algorithms and Mathematics: **What is an algorithm?, Mathematics for

Algorithmic Sets, Functions and Relations, Vectors and Matrices, Linear Inequalities

and Linear Equations.

** **

**2. Analysis of Algorithm: **The efficient algorithm, Average and worst case analysis,

Elementary operation, Asymptotic Notation, Analyzing control statement, Amortized

analysis, Sorting Algorithm, Binary Tree Search.

** **

**3. Divide and Conquer Algorithm: **Introduction, Multiplying large Integers Problem,

Problem Solving using divide and conquer algorithm – Binary Search, Sorting (Merge

Sort, Quick Sort), Matrix Multiplication, Exponential.

** **

**4. Greedy Algorithm: **General Characteristics of greedy algorithms, Problem solving

using Greedy Algorithm – Activity selection problem, Elements of Greedy Strategy,

Minimum Spanning trees (Kruskal’s algorithm, Prim’s algorithm), Graphs: Shortest

paths, The Knapsack Problem, Job Scheduling Problem

** **

**5. 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.

** **

**6. 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.

** **

**7. String Matching: **Introduction, The naive string matching algorithm, The Rabin-

Karp algorithm, String Matching with finite automata.

** **

**8. Introduction to NP-Completeness: **The class P and NP, Polynomial reduction, NPCompleteness

Problem, NP-Hard Problems.

** **

**Text Books:**

1. Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, PHI.

2. Fundamental of Algorithms by Gills Brassard, Paul Bratley, PHI.

** **

**Reference Books:**

1. Design and Analysis of Algorithms, Dave and Dave, Pearson.

2. Algorithm Design: Foundation, Analysis and Internet Examples, GoodRich, Tamassia, Wiley India

3. Introduction to Design and Analysis of Algorithms, Anany Levitin, Pearson.

**Subject Name:** **SERVICE ORIENTED COMPUTING**

** **

**1. Introduction**

Introduction, Brief history of information technology, Distributed computing in the large,

Motivations for composition, Challenges for composition, Web Services Architectures

and Standards. Computing with Services, Visions for web, Semantic web, Peer to Peer

Computing, Processes and Protocols. Pragmatic web, Open environments

** **

**2. Basic concepts**

Directory services, SOAP, WSDL, UDDI

** **

**3. Enterprise architectures**

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

** **

**4. 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

** **

**5. Description: Modeling and representation**

XML primer, Conceptual modeling, Ontology and knowledge sharing, Relevant

standards: RDF, RDFS, and OWL, Differencing and tools, Matchmaking

** **

**6. 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

** **

**7. 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

** **

**Text Books:**

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

** **

**Reference Books:**

1. Thomas Erl, “Service-Oriented Architecture: Concepts, Technology, and Design”, Pearson Education.

2. Newcomer, Lomow, “Understanding SOA with Web Services”, Pearson Education.

3. Sandeep Chatterjee, James Webber, “Developing Enterprise Web Services, An Architect’s Guide”, Pearson Education.

4. Dan Woods and Thomas Mattern, “Enterprise SOA Designing IT for Business Innovation” O’REILLY.

## Recent Comments