Categories
r2013 notes

CS6702 Notes Graph Theory and Applications Regulation 2013 Anna University

CS6702 Notes Graph Theory and Applications

CS6702 Notes Graph Theory and Applications Regulation 2013 Anna University free download. Graph Theory and Applications CS6702 Notes pdf free download.

OBJECTIVES: CS6702 Notes Graph Theory and Applications

The student should be made to:
 Be familiar with the most fundamental Graph Theory topics and results.
 Be exposed to the techniques of proofs and analysis.

OUTCOMES: CS6702 Notes Graph Theory and Applications

Upon Completion of the course, the students should be able to:

 Write precise and accurate mathematical definitions of objects in graph theory.  Use mathematical definitions to identify and construct examples and to distinguish examples from non-examples.

 Validate and critically assess a mathematical proof.

 Use a combination of theoretical knowledge and independent mathematical thinking in creative investigation of questions in graph theory.

 Reason from definitions to construct mathematical proofs.

TEXT BOOKS: CS6702 Notes Graph Theory and Applications

1. Narsingh Deo, “Graph Theory: With Application to Engineering and Computer Science”, Prentice Hall of India, 2003.

2. Grimaldi R.P. “Discrete and Combinatorial Mathematics: An Applied Introduction”, Addison Wesley, 1994.

REFERENCES: CS6702 Notes Graph Theory and Applications

1. Clark J. and Holton D.A, “A First Look at Graph Theory”, Allied Publishers, 1995.

2. Mott J.L., Kandel A. and Baker T.P. “Discrete Mathematics for Computer Scientists and Mathematicians” , Prentice Hall of India, 1996.

3. Liu C.L., “Elements of Discrete Mathematics”, Mc Graw Hill, 1985.

4. Rosen K.H., “Discrete Mathematics and Its Applications”, Mc Graw Hill, 2007.

 

Subject Name Graph Theory and Applications
Subject code CS6702
Regulation 2013

CS6702 Notes Graph Theory and Applications click here to download 

CS6702 Syllabus Graph Theory and Applications

CS6702 Important Questions Graph Theory and Applications

CS6702 Question Bank Graph Theory and Applications

 

Categories
UG syllabus R 2013

CS6702 Syllabus Graph Theory and Applications Regulation 2013 Anna University

CS6702 Syllabus Graph Theory and Applications

CS6702 Syllabus Graph Theory and Applications Regulation 2013 Anna University free download. Graph Theory and Applications CS6702 Syllabus pdf free download.

UNIT I INTRODUCTION 9 CS6702 Syllabus Graph Theory and Applications

Graphs – Introduction – Isomorphism – Sub graphs – Walks, Paths, Circuits –Connectedness – Components – Euler graphs – Hamiltonian paths and circuits – Trees – Properties of trees – Distance and centers in tree – Rooted and binary trees.

UNIT II TREES, CONNECTIVITY & PLANARITY 9 CS6702 Syllabus Graph Theory and Applications

Spanning trees – Fundamental circuits – Spanning trees in a weighted graph – cut sets – Properties of cut set – All cut sets – Fundamental circuits and cut sets – Connectivity and separability – Network flows – 1-Isomorphism – 2-Isomorphism – Combinational and geometric graphs – Planer graphs – Different representation of a planer graph.

UNIT III MATRICES, COLOURING AND DIRECTED GRAPH 8 CS6702 Syllabus Graph Theory and Applications

Chromatic number – Chromatic partitioning – Chromatic polynomial – Matching – Covering – Four color problem – Directed graphs – Types of directed graphs – Digraphs and binary relations – Directed paths and connectedness – Euler graphs.

UNIT IV PERMUTATIONS & COMBINATIONS 9 CS6702 Syllabus Graph Theory and Applications

Fundamental principles of counting – Permutations and combinations – Binomial theorem – combinations with repetition – Combinatorial numbers – Principle of inclusion and exclusion – Derangements – Arrangements with forbidden positions.

UNIT V GENERATING FUNCTIONS 10 CS6702 Graph Theory and Applications

Generating functions – Partitions of integers – Exponential generating function – Summation operator – Recurrence relations – First order and second order – Non-homogeneous recurrence relations – Method of generating functions.

Subject Name Graph Theory and Applications
Subject code CS6702
Regulation 2013

CS6702 Graph Theory and Applications Syllabus click here to download 

CS6702 Notes Graph Theory and Applications

CS6702 Important Questions Graph Theory and Applications

CS6702 Question Bank Graph Theory and Applications

 

 

Categories
question bank

CS6701 Question Bank Cryptography and Network Security Regulation 2013 Anna University

CS6701 Question Bank Cryptography and Network Security

CS6701 Question Bank Cryptography and Network Security Regulation 2013 Anna University free download. Cryptography and Network Security CS6701 Question Bank pdf free download.

Sample CS6701 Question Bank Cryptography and Network Security:

1. Specify the four categories of security threads? ._Interruption
._Interception ._Modification ._Fabrication

2. Explain active and passive attack with example? Passive attack:
Monitoring the message during transmission. Eg: Interception
Active attack:
It involves the modification of data stream or creation of false data stream. E.g.: Fabrication,
Modification, and Interruption CS6701 Question Bank Cryptography and Network Security

3. Define integrity and nonrepudiation? Integrity:
Service that ensures that only authorized person able to modify the message.
Nonrepudiation:
This service helps to prove that the person who denies the transaction is true or false. CS6701 Question Bank Cryptography and Network Security

4. Differentiate symmetric and asymmetric encryption?

Symmetric Asymmetric
It is a form of cryptosystem in which encryption and decryption performed using the same key.
It is a form of cryptosystem in which encryption and decryption Performed using two keys.
Eg: DES, AES Eg: RSA, ECC CS6701 Question Bank Cryptography and Network Security

5. Define cryptanalysis?
It is a process of attempting to discover the key or plaintext or both.

6. Compare stream cipher with block cipher with example. Stream cipher:
Processes the input stream continuously and producing one element at a time. Example: caeser
cipher.
Block cipher:
Processes the input one block of elements at a time producing an output block for each input
block.
Example: DES. CS6701 Question Bank Cryptography and Network Security

7. Define security mechanism
It is process that is designed to detect prevent, recover from a security attack. Example:
Encryption algorithm, Digital signature, Authentication protocols.

8. Differentiate unconditionally secured and computationally secured
An Encryption algorithm is unconditionally secured means, the condition is if the cipher text
generated by the encryption scheme doesn’t contain enough information to determine
corresponding plaintext. CS6701 Question Bank Cryptography and Network Security
Encryption is computationally secured means,
1. The cost of breaking the cipher exceed the value of enough information.

2. Time required to break the cipher exceed the useful lifetime of information.

Subject Name Cryptography and Network Security
Subject code CS6701
Regulation 2013

CS6701 Question Bank Cryptography and Network Security click here to download 

CS6701 Syllabus Cryptography and Network Security

CS6701 Notes Cryptography and Network Security

CS6701 Important Questions Cryptography and Network Security

 

 

Categories
Important question

CS6701 Important 16 marks Questions Cryptography and Network Security Regulation 2013 Anna University

CS6701 Important 16 marks Questions Cryptography and Network Security

CS6701 Important 16 marks Questions Cryptography and Network Security Regulation 2013 Anna University free download. Cryptography and Network Security CS6701 Important 16 marks Questions pdf free download.

Sample CS6701 Important 16 marks Questions Cryptography and Network Security:

1. (i) Briefly explain Deffie Hellman key exchange with an example. (16)
2. (i) Write and explain the digital signature algorithm. (8) (ii) Explain in detail Hash Functions.(8)  CS6701 Important 16 marks Questions Cryptography and Network Security
3. (i) Compare the Features of SHA-1 and MD5 algorithm. (8)
(ii) Discuss about the objectives of HMAC and it security features. (8)
4. Users A and B use the Diffie Hellman key exchange technique, a common prime q=11 and a
primitive root alpha=7.
(i) If user A has private key XA=3.What is A’s public key YA? (4)
(ii) If user B has private key XB=6 What is B’s public key YB? (4) (iii) What is the shared secret
key? Also write the algorithm. (4) CS6701 Important 16 marks Questions Cryptography and Network Security
(iv) How man in middle attack can be performed in Diffie Hellman algorithm.(4)
5. (i) Explain in detail EIGamal Public key cryptosystem. (8)
(ii) Discuss clearly Secure Hash Algorithm(SHA) (8)
6. Describe the MD5 message digest algorithm with necessary block diagrams. (16)
Unit-IV
Part-B (16 Marks) CS6701 Important 16 marks Questions Cryptography and Network Security
1. How does PGP provide confidentiality and authentication service for e-mail and file storage
applications? Draw the block diagram and explain its components. (16)
2. Write Short notes on S/MIME .
3. Explain the architecture of IP Security (16) CS6701 Important 16 marks Questions Cryptography and Network Security
4. (i) Describe the SSL Specific protocol – Handshake action in detail. (8)
(ii) Explain Secure Electronic transaction with neat diagram. (8)
5. (i) What is Kerberos? Explain how it provides authenticated service. (8)
(ii)Explain the format of the X.509 certificate. (8)

 

Subject Name Cryptography and Network Security
Subject code CS6701
Regulation 2013

CS6701 Important 16 marks Questions Cryptography and Network Security click here to download 

CS6701 Syllabus Cryptography and Network Security

CS6701 Notes Cryptography and Network Security

CS6701 Question Bank Cryptography and Network Security

 

 

Categories
Important question

CS6701 Important Questions Cryptography and Network Security Regulation 2013 Anna University

CS6701 Important Questions Cryptography and Network Security

CS6701 Important Questions Cryptography and Network Security Regulation 2013 Anna University free download. Cryptography and Network Security CS6701 Important Questions pdf free download.

Sample CS6701 Important Questions Cryptography and Network Security:

1. Distinguish between passive attack and active attack with reference to X.800. (A/M-11)
X.800 categorize the attacks into two, namely passive and active attacks.
Passive attacks: Passive attacks are in the nature of eavesdropping on, or monitoring of, transmissions. It includes release of message contents and Traffic analysis. Passive attacks are very difficult to detect because they do not involve any alteration of data. However, it is feasible to prevent the success of these attacks, usually by means of encryption.
Active attacks: Active attack involves some modification of the data stream or the creation of a false data stream and can be subdivided into four categories namely as a masquerade, replay, modification of messages and the denial of service attack.

2. Define –Key and Plaintext (M/J-09) CS6701 Important Questions Cryptography and Network Security
In cryptography, a key is defined as a piece of information that determines the functional output of a cryptographic algorithm or cipher. In encryption, a key specifies the particular transformation of plaintext into ciphertext or vice versa during decryption. Plaintext is ordinary readable text before being encrypted into ciphertext or after being decrypted.

3. Find the GCD of 2740 and 1760, using Euclidean algorithm. (N/D-08) CS6701 Important Questions Cryptography and Network Security
The GCD of two numbers say a and b can be found using the following formula
gcd(a,b) =gcd(b,a mod b)
GCD(2740,1760) = gcd(1760, 2740 mod 1760)= gcd(1760,980)=980

4. What is encipherment? (A/M-12) CS6701 Important Questions Cryptography and Network Security
The use of mathematical algorithms to transform data into a form that is not readily intelligible. The transformation and subsequent recovery of the data depend on an algorithm and zero or more encryption keys.

5. What is a passive attack? (M/J-09) CS6701 Important Questions Cryptography and Network Security
Passive attacks are in the nature of eavesdropping on, or monitoring of, transmissions. The goal of the opponent is to obtain information that is being transmitted. Two types of passive attacks are the release of message contents and traffic analysis.

 

Subject Name Cryptography and Network Security
Subject code CS6701
Regulation 2013

CS6701 Important Questions Cryptography and Network Security click here to download 

CS6701 Important 16 marks Questions Cryptography and Network Security

CS6701 Syllabus Cryptography and Network Security

CS6701 Notes Cryptography and Network Security

CS6701 Question Bank Cryptography and Network Security

 

 

Categories
r2013 notes

CS6701 Notes Cryptography and Network Security Regulation 2013 Anna University

CS6701 Notes Cryptography and Network Security

CS6701 Notes Cryptography and Network Security Regulation 2013 Anna University free download. Cryptography and Network Security CS6701 Notes pdf free download.

OBJECTIVES: CS6701 Notes Cryptography and Network Security

The student should be made to:
 Understand OSI security architecture and classical encryption techniques.
 Acquire fundamental knowledge on the concepts of finite fields and number theory.
 Understand various block cipher and stream cipher models.
 Describe the principles of public key cryptosystems, hash functions and digital signature.

OUTCOMES: CS6701 Notes Cryptography and Network Security

Upon Completion of the course, the students should be able to:
 Compare various Cryptographic Techniques
 Design Secure applications
 Inject secure coding in the developed applications

TEXT BOOKS: CS6701 Notes Cryptography and Network Security

1. William Stallings, Cryptography and Network Security, 6th Edition, Pearson Education, March 2013. (UNIT I,II,III,IV).
2. Charlie Kaufman, Radia Perlman and Mike Speciner, “Network Security”, Prentice Hall of India, 2002. (UNIT V).

REFERENCES: CS6701 Notes Cryptography and Network Security

1. Behrouz A. Ferouzan, “Cryptography & Network Security”, Tata Mc Graw Hill, 2007.
2. Man Young Rhee, “Internet Security: Cryptographic Principles”, “Algorithms and Protocols”, Wiley Publications, 2003.
3. Charles Pfleeger, “Security in Computing”, 4th Edition, Prentice Hall of India, 2006.
4. Ulysess Black, “Internet Security Protocols”, Pearson Education Asia, 2000.
5. Charlie Kaufman and Radia Perlman, Mike Speciner, “Network Security, Second Edition, Private Communication in Public World”, PHI 2002.
6. Bruce Schneier and Neils Ferguson, “Practical Cryptography”, First Edition, Wiley Dreamtech India Pvt Ltd, 2003.
7. Douglas R Simson “Cryptography – Theory and practice”, First Edition, CRC Press, 1995.
8. http://nptel.ac.in/.

 

Subject Name Cryptography and Network Security
Subject code CS6701
Regulation 2013

CS6701 Notes Cryptography and Network Security click here to download 

CS6701 Syllabus Cryptography and Network Security

CS6701 Important Questions Cryptography and Network Security

CS6701 Question Bank Cryptography and Network Security

 

 

Categories
UG syllabus R 2013

CS6701 Syllabus Cryptography and Network Security Regulation 2013 Anna University

CS6701 Syllabus Cryptography and Network Security

CS6701 Syllabus Cryptography and Network Security Regulation 2013 Anna University free download. Cryptography and Network Security CS6701 Syllabus pdf free download.

UNIT I INTRODUCTION & NUMBER THEORY 10 CS6701 Syllabus Cryptography and Network Security

Services, Mechanisms and attacks-the OSI security architecture-Network security model-Classical Encryption techniques (Symmetric cipher model, substitution techniques, transposition techniques, steganography).FINITE FIELDS AND NUMBER THEORY: Groups, Rings, Fields-Modular arithmetic-Euclid‟s algorithm-Finite fields- Polynomial Arithmetic –Prime numbers-Fermat‟s and Euler‟s theorem-Testing for primality -The Chinese remainder theorem- Discrete logarithms.

UNIT II BLOCK CIPHERS & PUBLIC KEY CRYPTOGRAPHY 10 CS6701 Syllabus Cryptography and Network Security

Data Encryption Standard-Block cipher principles-block cipher modes of operation-Advanced Encryption Standard (AES)-Triple DES-Blowfish-RC5 algorithm. Public key cryptography: Principles of public key cryptosystems-The RSA algorithm-Key management – Diffie Hellman Key exchange-Elliptic curve arithmetic-Elliptic curve cryptography.

UNIT III HASH FUNCTIONS AND DIGITAL SIGNATURES 8 CS6701 Syllabus Cryptography and Network Security

Authentication requirement – Authentication function – MAC – Hash function – Security of hash function and MAC –MD5 – SHA – HMAC – CMAC – Digital signature and authentication protocols – DSS – EI Gamal – Schnorr.

UNIT IV SECURITY PRACTICE & SYSTEM SECURITY 8 CS6701 Syllabus Cryptography and Network Security

Authentication applications – Kerberos – X.509 Authentication services – Internet Firewalls for Trusted System: Roles of Firewalls – Firewall related terminology- Types of Firewalls – Firewall designs – SET for E-Commerce Transactions. Intruder – Intrusion detection system – Virus and related threats – Countermeasures – Firewalls design principles – Trusted systems – Practical implementation of cryptography and security.

UNIT V E-MAIL, IP & WEB SECURITY 9 CS6701 Syllabus Cryptography and Network Security

E-mail Security: Security Services for E-mail-attacks possible through E-mail – establishing keys privacy-authentication of the source-Message Integrity-Non-repudiation-Pretty Good Privacy-S/MIME. IPSecurity: Overview of IPSec – IP and IPv6-Authentication Header-Encapsulation Security Payload (ESP)-Internet Key Exchange (Phases of IKE, ISAKMP/IKE Encoding). Web Security: SSL/TLS Basic Protocol-computing the keys- client authentication-PKI as deployed by SSLAttacks fixed in v3- Exportability-Encoding-Secure Electronic Transaction (SET).

Subject Name Cryptography and Network Security
Subject code CS6701
Regulation 2013

CS6701 Syllabus Cryptography and Network Security click here to download 

CS6701 Notes Cryptography and Network Security

CS6701 Important Questions Cryptography and Network Security

CS6701 Question Bank Cryptography and Network Security

 

 

Categories
Padeepz E-Learning Materials

Padeepz E-Learning Materials MA8353 Transforms and Partial Differential Equations

Padeepz E-Learning Materials MA8353 Transforms and Partial Differential Equations

Padeepz E-Learning Materials for MA8353 Transforms and Partial Differential Equations we have provided the sample materials in this page.  If you like the sample and want to buy the full subject the procedure is also provided in this page.

MA8353 Transforms and Partial Differential Equations

Hi Padeepz.com is a place where we make Engineering Students to understand their subjects in an easy and in a effective way. Which leads to greater knowledge in the subject and Provide plenty of time spending in innovative ideas.

Categories
Padeepz E-Learning Materials

Padeepz E-Learning Materials MA6351 Transforms and Partial Differential Equations

Padeepz E-Learning Materials MA6351 Transforms and Partial Differential Equations

Padeepz E-Learning Materials for MA6351 Transforms and Partial Differential Equations we have provided the sample materials in this page.  If you like the sample and want to buy the full subject the procedure is also provided in this page.

MA8353 Transforms and Partial Differential Equations

Hi Padeepz.com is a place where we make Engineering Students to understand their subjects in an easy and in a effective way. Which leads to greater knowledge in the subject and Provide plenty of time spending in innovative ideas.

Categories
question bank

CS6504 Question Bank COMPUTER GRAPHICS Regulation 2013 Anna University

CS6504 Question Bank COMPUTER GRAPHICS

CS6504 Question Bank COMPUTER GRAPHICS Regulation 2013 Anna University free download. COMPUTER GRAPHICS CG CS6504 Question Bank pdf free download.

Sample CS6504 Question Bank COMPUTER GRAPHICS:

1.Define computer graphics.
2.What is Data set? (Nov/Dec 2015)
3.List any two applications of computer graphics.
4.What is screen grid co-ordinates? CS6504 Question Bank COMPUTER GRAPHICS
5.List out the techniques used for producing color display in CRT.
6.List few input devices.
7.What is an output primitive? (May/June 2016)
8.What is flood fill algorithm?
9.What is scan line algorithm? CS6504 Question Bank COMPUTER GRAPHICS
10.List out the methods used for smoothly joining two line segments.
11.Define line primitive.
12.What is DDA algorithm? (Nov/Dec 2015)
13.What is Bresenham’s line algorithm?
14.List out the attributes of output primitives.
15.What is a CRT? CS6504 Question Bank COMPUTER GRAPHICS
16.Give the discussion parameter for Bresenham’s line algorithm at k and k +1.
17.What is loading frame buffer?
18.What are properties of circle?
19.Define CAD. (May/June 2016)
20.List out the types of visualization.
21.What is Raster scan display?
22.What is shadow mask method?
23.What is data glove? CS6504 Question Bank COMPUTER GRAPHICS
24.List out the two types of graphics software.
25.List out the representatives uses of computer graphics.

PART B
1. Explain Raster scan systems and Random Scan Systems?
2. Explain in detail about the Line drawing DDA scan conversion algorithm? (May/June 2016) CS6504 Question Bank COMPUTER GRAPHICS
3. Explain Ellipse generating Algorithm? (Nov/Dec 2015)
4. Explain Boundary Fill Algorithm? (May/June 2016)
5. Write down and explain the midpoint circle drawing algorithm. (Nov/Dec 2015)
6. Calculate the pixel location approximating the first octant of a circle having centre at CS6504 Question Bank COMPUTER GRAPHICS
(4,5) and radius 4 units using Bresenham’s algorithm.

PART A FIRST HALF
1.What is transformation? (Nov/Dec 2015)
2.What is translation?
3.What is rotation?
4.What is scaling? (May/June 2016)
5.What are the three basic elements of viewing?
6.Define clipping.
7.Define text clipping.
8.List out the various text clipping techniques.
9.What is covering or exterior clipping?
10.Give the expression in matrix form for basic transformation.
11.What is composite transformation?
12.Give the equation for two successive rotation applied to point P for rotation.
13.Give the sequence of operations for translate-rotate-translate.
CS6504 Question Bank COMPUTER GRAPHICS

Subject Name COMPUTER GRAPHICS
Subject code CS6504
Regulation 2013

CS6504 Question Bank COMPUTER GRAPHICS click here to download 

CS6504 Syllabus COMPUTER GRAPHICS

CS6504 Notes COMPUTER GRAPHICS

CS6504 Important Questions COMPUTER GRAPHICS