Ganpat University s1

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY
Programme / Master of Technology / Branch/Spec. / Information Technology
Semester / I / Version / 2.1.0.0
Effective from Academic Year / 2016-17 / Effective for the batch Admitted in / Aug-2016
Subject code / 3IT102 / Subject Name / Computer Algorithms
Teaching scheme / Examination scheme (Marks)
(Per week) / Lecture(DT) / Practical(Lab.) / Total / CE / SEE / Total
L / TU / P / TW
Credit / 3 / 0 / 1 / - / 4 / Theory / 40 / 60 / 100
Hours / 3 / 0 / 2 / - / 5 / Practical / 25 / 25 / 50
Pre-requisites:
Basic knowledge of Data Structure and C language.
Learning Outcome:
· The principal objective of this course is to build a solid foundation in algorithms and their applications.
· Students completing this course are expected to appreciate the importance of algorithms in other areas for example routing in networks, query processing in databases, collaboration in distributed computing, efficient caching in operating systems etc.
Theory syllabus
Unit / Content / Hrs
1 / Algorithmic paradigms / 03
2 / Asymptotic complexity / 04
3 / Recurrence relations and solutions techniques
Intelligent guesswork, homogeneous recurrences, Inhomogeneous recurrences, Change of variable, substitution method, Iteration method, Recurrence trees, Master method & master theorem / 09
4 / Divide & Conquer , Dynamic Programming, Greedy, Branch and bound and Backtracking / 12
5 / Graph Algorithms / 03
6 / Shortest paths / 03
7 / Amortized analysis / 02
8 / NP completeness / 02
9 / Approximation algorithms / 02
Practical content
Experiments/simulation based on the syllabus
Text Books
1 / Introduction to Algorithms By T.H. Cormen, C.E. Leiserson, R.L. Rivest, McGraw Hill, 1994.
Reference Books
1 / Fundamentals of computer algorithms By Ellis Horowitz, SartajSahni, Computer Science Press.
2 / Fundamentals of AlgorithmicsBy Brassard &Bratley, Prentice Hall of India.
3 / Computer Algorithms: Introduction to Design and AnalysisBy Sara Baase, AddisonWesley, 1998.
4 / Algorithm Design: Foundations, Analysis & Internet Examples By Michael T Goodrich & Roberto Tamassia, John Wiley, 2002.
5 / Algorithms on Strings, trees and Sequences By Dan Gusfield, Cambridge, 2005.

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY
Programme / Master of Technology / Branch/Spec. / Information Technology
Semester / I / Version / 1.0.0.0
Effective from Academic Year / 2016-17 / Effective for the batch Admitted in / Aug-2016
Subject code / 3IT103 / Subject Name / Cryptography and Network Security
Teaching scheme / Examination scheme (Marks)
(Per week) / Lecture(DT) / Practical(Lab.) / Total / CE / SEE / Total
L / TU / P / TW
Credit / 3 / 0 / 1 / - / 4 / Theory / 40 / 60 / 100
Hours / 3 / 0 / 2 / - / 5 / Practical / 25 / 25 / 50
Pre-requisites:
Basic Concepts of Information Security
Learning Outcome:
· Provide students with a highlevel understanding of how information security functions are works.
· To master information security governance, and related legal and regulatory issues,
· To master understanding external and internal threats to an organization,
· To be familiar with how threats to an organization are discovered, analyzed, and dealt with. To master fundamentals of secret and public cryptography.
Theory syllabus
Unit / Content / Hrs
1 / Introduction: Introduction to the concept of security, The need of security, Security Goals, Types of attacks,Attacks Threatening Confidentiality, Attacks Threatening Integrity, Attacks Threatening Availability, Passive versus Active Attacks, Security approaches, Steganography. / 04
2 / Symmetric key Cryptography Techniques: Introduction, Plaintext andcipher text , Substitution technique,Caesarcipher,Modifiedcaesarcipher,Monoalphabeticcipher, Polyalphabeticvigenerecipher, Playfaircipher, Hill cipher, Transposition techniques: Rail fence technique, Columnar transposition techniques, Vernamcipher (one time pad), Encryption and decryption, Symmetric & asymmetric cryptography. / 07
3 / Stream cipher and Block cipher, Confusion and Diffusion Fiestel Cipher Structure. / 03
4 / Symmetric-Key Agreement:Key Exchange Problem, Diffie-Hellman Key exchange/Agreement. / 04
5 / Algorithm Types Algorithm Modes:Block cipher modes of operation:Electronic Code Book (ECB),Cipher Block Chaining (CBC),Cipher Feedback (CFB), Output Feedback (OFB), Counter Mode (CTR). / 05
6 / Data Encryption Standard (DES) , Advanced Encryption Standard (AES). / 05
7 / Number Theory: Integer ARITHMETIC, GCD, Euclidean Algorithm, Extended Euclidean Algorithm, MODULAR ARITHMETIC: ModuloOperator, Set of Residues, Congruence, Inverse, Additivenverse, MultiplicativeInverse,Linear Congruence and quadratic Congruence, Euler’s PHI function ( Euler’s Tot ion Function), PrimalityTest: Fermat test (Fermat Little’s Theorem), Square root test, Miller Rabin Test, Chinese Remainder Theorem. / 03
8 / Knapsack Cryptosystem,RSACryptosystem,RABIN Cryptosystem. / 03
9 / Symmetric and Asymmetric both together :Digital Envelop. / 02
10 / Digital Signature Introduction, Techniques, Message Digests , Birthday attack, MAC, HMAC , Disadvantages of HMAC. / 03
11 / Firewalls:Types of Firewalls –Circuit Level firewall,Packet filters & Application Gateways, Network Address Translation (NAT), Demilitarized Zone (DMZ) Networks. / 03
12 / Secure Socket Layer (SSL). / 02
13 / E-mail Security, PGP Algorithm / 02
Practical content
Experiments/simulation based on the syllabus
Text Books
1 / Atul Kahate: “Cryptography and Network Security”, 3/E, Tata Mac Graw Hill.
Reference Books
1 / William Stallings: “Cryptography and Network Security – Principles and Practice”, 4/E,Pearson Education, 2005.
2 / Bruce Scheneir: “Applied Cryptography”, 2/E, John Wiley, 1996.
3 / BehrouzForouzan: “Cryptography & Network Security”, 1/E, TMH, 2007.

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY
Programme / Master of Technology / Branch/Spec. / Information Technology
Semester / I / Version / 1.0.0.0
Effective from Academic Year / 2016-17 / Effective for the batch Admitted in / Aug-2016
Subject code / 3IT106 / Subject Name / Advanced Topics in Networks
Teaching scheme / Examination scheme (Marks)
(Per week) / Lecture(DT) / Practical(Lab.) / Total / CE / SEE / Total
L / TU / P / TW
Credit / 3 / 0 / 1 / - / 4 / Theory / 40 / 60 / 100
Hours / 3 / 0 / 2 / - / 5 / Practical / 25 / 25 / 50
Pre-requisites:
Fundamentals of Computer Networks. Wireless Technologies basics, Basics of Probability theory
Learning Outcome:
Students Understand the mobility & its impact on information exchange, simulation environment,behaviour of existing protocols and Implementation of effective routing protocols, also Bridges the gap between elementary communication networks studied.
Theory syllabus
Unit / Content / Hrs
1 / Challenged Networks and Novel Architectures: Delay Tolerant Networks (DTN), Pocket Switched Networks, Vehicular Ad Hoc Networks (VANETs) and Peer To Peer Wireless (AdHoc) Networks.
Mobility Modeling (Scheduled or Predictable) & its impact, DTN RoutingandMulticasting:Epidemic Routing, Mobility‐assisted Routing, Replication and Erasure coding,MessageFerrying, Utility‐based Routing, Probabilities based routing protocols, Opportunistic Routing and Performance Modeling / 23
2 / Transport and other Issues: Reliability Issues in DTNs, Network Coding, BufferManagement, Flow Control, etc.
Applications and Feasibility Studies: Content distribution, Traffic Reports and AccidentPrevention, Taxi Dispatch, Delay Tolerant Broadcasting.
Social Networks and Mobility Modeling: Mobility Models for Delay Tolerant Networks,Human Mobility and Routing, Social based Routing, Vehicular Mobility.
GSM, Wi-Fi Networks / 23
Practical content
Experiments/simulation based on the syllabus
Text Books
1. / Delay Tolerant Networks: Protocols and Applications by Athanasios V. Vasilakos, Yan Zhang, ThrasyvoulosSpyropoulos, CRC Press Taylor & Francis group.
Reference Books
1. / Delay Tolerant Networks by Longxiang Gao,Shui Yu, Tom H. Luan and Wanlei Zhou, SpringerBriefs in Computer Science, Springer.
2. / Advances in Delay-tolerant Networks (DTNs): Architecture and Enhanced Performanceby J Rodrigues,Woodhead PublisherFirst edition.
3. / Delay- and Disruption-Tolerant Networking by Stephen Farrelland Vinny Cahill,Artech HousePublication
4. / Routing in Opportunistic Networks by Zhang, Dhurandher,Anpalagan,Vasilakos
5. / Research papers from reputed Journals & Conferences.