GTU Time table Summer 2014

New Syllabus of ACN

Guys New syllabus of ACN includes 7 Units. Same as the CE Dept. syllabus.
Paper will be common for both the dept.

From Faculty
Our Question bank is small so I have included a few questions that are important from the MSE-1 point of view.

Also u should refer to Question Bank of CE Dept.

Inform everyone about it.

1. What is Optical Networking and what is need of it?
2. Explain basic concepts of ATM Networking.
3. Explain Classful Addressing in IP addressing.
4. What is the hardware used in DWDM?
5. Explain Storage area networks (SAN) with architecture. Give its benefits.
6. State the pros and cons of DWDM.
7. Explain Routing Information Protocol.
8. Explain Border Gateway Protocol (BGP).
9. Explain the working and operation of Multiprotocol Label Switching (MPLS).
10. State the benefits and drawbacks of Optical Networking.
11. State the pros and cons of DWDM.
12. What is Application Layer? Briefly explain Dynamic Host Configuration Protocol (DHCP) protocol.
13. What is Application Layer? Briefly explain Bootstrap protocol.
14. Explain TELNET and FTP?

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
􀀀 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

7 Unit from syllabus. As per CE Dept syllabus.

Mid Sem-I Time table

Design & Analysis of Algorithm(DAA)

GUJARAT TECHNOLOGICAL UNIVERSITY

B.E. SEMESTER : VIII

INFORMATION TECHNOLOGY

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, NP- Completeness 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.

Practical List

Sr. No.	Aim Of Practical	Link to Syllabus	Link to Question Bank
1.	Write a C/C++ program to implement Bubble , Selection sort and measure time complexity	Unit 2	Module 2 Q. No-6
2.	Write a C/C++ program to implement the Quick Sort and measure time complexity.	Unit 2	Module 2 Q. No-7
3.	Write a C/C++ program to implement the Merge Sort using Divide and conquer strategy.	Unit 3	Module 3 Q. No-1
4.	Write a program to implement Binary Search using C or C++ programming.	Unit 2	Module 3 Q. No-2
5.	Write a C/C++ program to implement Kruskal’s algorithm using Greedy strategy.	Unit 4	Module 4 Q. No-3
6.	Write a C/C++ program to implement Prim’s algorithm using Greedy strategy.	Unit 4	Module 4 Q. No-4
7.	Write a C/C++ program to implement knapsack problem using Dynamic Programming.	Unit 5	Module 5 Q. No-5
8.	Write a C/C++ program to implement Matrix Chain Multiplication using Dynamic Programming.	Unit 5	Module 5 Q. No-6
9.	Write a C/C++ program to implement Depth First Search and Breath First Search Algorithm.	Unit 6	Module 6 Q. No-2,3
10.	Write a C/C++ program to implement Naive/ Rabin-Karp String Matching Algorithm.	Unit 7	Module 7 Q. No-2

Advance Computer Networks(ACN)

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
• 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

Practical List

Sr. No.	Aim of Practical	Link to Syllabus	Link to Question Bank
1	Write a program to count the occurrences of different letters by reading the given text file and also find the probability of each letter with number of bits required for them using the formula: No. of bits=1/log2 probi	2	--
2	Write a program in C to determine whether the set of given codes is uniquely decodable or not.	1	11
3	Study of Huffman Compression Algorithm	3	2.43
4	Study of Shannon-Fano compression Algorithm	3	2.4
5	Write a program to implement arithmetic coding	5	2.7
6	Write a program to implement lz77 algorithm.	7	13
7	Write a program to implement lz78 algorithm.	2,7	6.18
8	Write a program to implement lzss algorithm.	2,7	6.17
9	Study of Speech Compression.	8	--

Data Compression(DC)

GUJARAT TECHNOLOGICAL UNIVERSITY

B.E. SEMESTER : VIII

INFORMATION TECHNOLOGY

Subject Name: DATA COMPRESSION

L. J. Institute of Engineering & Technology

S.G. Highway, Ahmedabad-382210

IT Department

Practical List

Subject Name:	Data Compression
Subject Code:	181602
Branch & Semester:	IT-VIII

SUBJECT	TEACHING SCHEME (HOURS)			CREDITS
	THEORY	TUTORIAL	PRACTICAL
DATA COMPRESSION	4	0	2	6

Sr. No.	Aim of Practical	Link to Syllabus	Link to Question Bank
1	Write a program to count the occurrences of different letters by reading the given text file and also find the probability of each letter with number of bits required for them using the formula: No. of bits=1/log2 probi	2	--
2	Write a program in C to determine whether the set of given codes is uniquely decodable or not.	1	11
3	Write a program in C for Huffman Compression.	3	2.43
4	Write a program in C to implement Shannon-Fano compression Algorithm.	3	2.4
5	Write a program to implement arithmetic coding	5	2.7
6	Write a program to implement lz77 algorithm.	7	13
7	Study of JPEG.	2,7	6.18
8	Study of DCT.	2,7	6.17
9	Study of Speech Compression.	8	--

 Facu

Syllabus
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