Roll Numbers for sets

SET1:

13B01A1246,50,51,53,60,63,71,77,78,83,84,85,86,13B01A1244,47,48,49,52,54

SET2:

13B01A1245,56,57,59,62,64,65,66,68,72,73,75,76 ,55,61,69,70,74,80,82,10-64

CNS Important Questions

UNIT-4

1. Explain key management and distribution in detail.

2. Define  Message Authentication code. Explain its functions and basic uses.    

3. Describe the steps in message digest generation in Secure Hash Algorithm in detail.

4. Explain the Digital Signature Algorithm

UNIT-5

1. Explain how email messages are protected using S/MIME signing and encryption?

2. Describe the services provided by PGP

3. Describe about SSL secure communication and SSL authentication.

4. Explain how authentication is performed in Kerberos.

UNIT-6

1. Define intruder. Explain the Intrusion detection System in detail

2. Briefly describe encapsulating a security payload.

3. Briefly describe various approaches for IDS/IPS.

4. Draw and discuss the Architecture of IPSec

CNS Assignment II questions

Submit on 24.10.2016

ASSIGNMENT-2    SET  - 1

1. Explain key management and distribution in detail.

2.   Explain how email messages are protected using S/MIME signing and

      encryption?

3. Briefly describe encapsulating a security payload.

ASSIGNMENT-2    SET  - 2

1. Describe the steps in message digest generation in Secure Hash Algorithm in

detail.

2. Explain how authentication is performed in Kerberos.

3. Briefly describe various approaches for IDS/IPS.

Compiler Design Assignment -II Questions

the last date for submission is 4th October 2016.

SET-1

1. Define Syntax Directed Translation scheme. Explore different types of SDT schemes.

2. Define DAG. Discuss the Steps for constructing the DAG with an example SDD.

3. Discuss Heap allocation of Storage in detail.

4. Define Garbage collection. Discuss Reference counting Garbage collectors.

5. Write any two two techniques on code motion. Apply the Code motion techniques on loop optimisation.

6. Discuss Copy propagation with an example.

SET-II

1. Define annotated parse tree. Evaluate SDD at the nodes of parse tree with an example.

2. a) Deine DAG. Discuss value number method for constructing DAG with an example. b) Draw and explain SDT of Array type for the array int[2][3].

3. Discuss Heap allocation of Storage in detail.

4. Define Garbage collection. Discuss Reference counting Garbage collectors.

5. Write short notes on Strength reduction.

6. Discuss Constant folding with any example.

SET-III

1. Describe Inherited and Synthesized Attributes. Explain with an example grammar in detail.

2. Define Type expression. Discuss various types of Type expressions.

3. Discuss Heap allocation of Storage in detail.

4. Define Garbage collection. Discuss Reference counting Garbage collectors.

5. Write notes on Global common subexpression elimination.

6. Define Dead code elimination with the example.

SET-IV

1. Discuss Ordering the Evaluation of S-Attributed Definitions and L-Attributed Definitions.

2. a) DefienType checking. Discuss the rules of type checking. b) DefienType conversion, Discuss Conversions between primitive types in Java in detail.

3. Discuss Heap allocation of Storage in detail.

4. Define Garbage collection.Discuss Reference counting Garbage collectors.

5. Write notes on Semantics-Preserving Transformations

6. Discuss Copy propagation with an example.

LR(1) Ttems and TABLE for CLR, LALR link for set-II Q-NO-4(a)

CLR or LR(1) Items link


file:///C:/Users/mobility/Downloads/a.pdf


LR(1) and  LALR(1) Tbles link

file:///C:/Users/mobility/Downloads/b.pdf

CD-ASSIGENMENT-1 SET 4 MODIFICATIONS

SET-1V

1.(a) Explain the Functionality of the compilers,assembler, interpreter, linker and loader.
   (b) Compare and construct pass with phase with an example.
2. (a) Explain the Regular definitions for the language.
    (b) What are lexical error? explain the error-recovery action in the lexical errors.
3. (a) Discuss general strategies for the parser can employ from his syntactic error.
   (b) Find the FIRST() and FOLOW() for the grammar and also construct LL(1) parsing table:
       S--> L=R | R
          L-->*R  | id
          R--> L
4. (a). Compute  LR(0) items for the folowing grammar:
     S-->AB
      A-->a | E(it is epsilon)
     B-->b | E( it is epsilon)

 (b) Differentiate between LR parser and LL parser.

CD Assignments -I Questions

  SET-I

1. What are the various phases of the compilers? Explain each phase in details. Write down the output of  the each phase for expression a:=b+c*50.

2.  a) Explain the Role of Lexical Analyzer.
     b) Give the regular expression to recognise
        i) Identifies that start with Alphabet
        ii) Float  number in Exponent form
     c) Differencing with Compilers and Interpreters.
3.   (a)  Consider the Grammars
        bexpr--> bexpr or bterm | bterm
        bterm --> bterm and bterm | bfactor
        bfactor --> not bfcator | (bfactor ) | true | false
      Construct the predictive parser table for the above grammar and parser for the sentence not ( true or false).
b) Why should we use Regular Expression for the to define the lexical syntax for the language?
4.   a) Compute the LR(0) items for the Following Grammar:
         S--> L=R | R
          L-->*R  | id
          R--> L
      b) Mention the conflicts that occur the shift -reduce the parser.

SET-II

1. a) What is Pre-processor? What various function that performed by the Pre-processor?

    b)Give the structure of the compiler and also mention function performed by a compiler?

2.  (a) Give the reasons that separate the lexical analyser from the syntax analyser.

      (b) Write the short notes on the language specifying the language analyser.

      (c) Differentiate between terms: Token, Pattern,Lexemes

3. (a) What are the pre-processing steps required for predictive parsing?

    (b) Remove the Left Recussion for the following Grammar and Construct the predictive parsing           table.

          S-->iEtSS' | a

          S' --> eS | E(it is epsilon)
          E-->b
4. (a) Construct the LR(1) parsing table for the following grammar
        E--> E+T |T
        T-->T*F | F
        F--> (E) | id
    (b) Ho the Bottom-up parser differs from the Top-down parser?

SET-III

1. (a) Explain the various phase of the compilers?

    (b) Write short notes on Cross-Compilers?

2. (a) What is Regular Expression? List the rules that define the regular Expressions.

    (b) Explain the transition diagrams for Reserved words and identifiers?

3. (a) Construct the LL(1) parsing table for the following Grammar:

      E-->E+T | T

      T--> T*F | F

       F--> (E)  | id

   (b) Explain the model of non-recursive predictive parser?

4. (a) Consider the Ambiguous grammar and construct the sets of LR(0) items?

       S-->As | b

       A-->SA | a

    (b) Explain the various actions performed by shiftreduce parser with examples?

SET-1V

1.(a) Explain the Functionality of the compilers,assember, interpreter, linker and loader.
   (b) Compare and construct pass with phase with example>
2. (a) Explain the Regular definitions for tje language.
    (b) What are lexical error? explain the error-recovery action in the lexical errors.
3. (a) Discuss about general stragies for the parser can employ fromt he syntatic error.
   (b) Find the FIRST() and FOLOW() fot the grammar and also construct LL(1) parsing table:
       S--> L=R | R
          L-->*R  | id
          R--> L
4. (a). Compute  LR(0) items for the folowing grammar:
     S-->AB
      A-->a | E(it is epsilon)
     B-->b | E( it is epsilon)

 (b) Differeciate between LL parser and LL parser.

IV-IT-SVECW-CNS -Assigments Qeuations

Dear IV-IT-SVECW-CNS students

Assigments -1 on or before 4th August 2016

Roll Numbers for sets

SET1:

13B01A1246,50,51,53,60,63,71,77,78,83,84,85,86

SET2:

13B01A1245,56,57,59,62,64,65,66,68,72,73,75,76

 SET3:

 13B01A1244,47,48,49,52,54,55,61,69,70,74,80,82,10-64

Cryptography and Network Security

Assignment-1

SET-1

1. a) Briefly explain format string vulnerabilities

b) b) Explain poly alphabetic cipher technique with an example.

2. a) Computer and network security is both fascinating and complex, what are the challenges

of Computer Security.

b) Explain the Distributed Denial of Service

3. Draw the general structure of DES and explain the encryption and decryption process in

detail?

4. Explain IDEA encryption and decryption process in detail?

5. Briefly explain Elgamal encryption & decryption.

6. Discuss the following related to Elliptic Curve Cryptography(ECC)

i) ECC Encryption / Decryption and Security of ECC ii) ECC Diffie Hellman Key Exchange

SET-2

1. a) Briefly explain Buffer overflow vulnerabilities

b) Explain mono alphabetic cipher technique with an example.

2. a) What is session hijacking? Explain about TCP session hijacking in detail.

b) What is symmetric cipher model? Explain simple substitution techniques with an example.

3. What is AES algorithm? Explain different phases of AES algorithm.

4. Explain CAST-128 encryption and decryption process in detail?

5. Explain RSA algorithm in detail with an example.

6. a) Describe briefly Chinese remainder theorem with an example.

b) State Euler’s theorem and explain with example?

SET-3

1. a) Explain the Fiestel cipher structure with a neat sketch. And also explain its importance.

b) Compare all the features of stream and block ciphers.

2. a) What is session hijacking? Explain about UDP session hijacking in detail.

b) What is symmetric cipher model? Explain simple substitution techniques with an example.

3. With a neat sketch explain Blowfish algorithm

4. Explain various block cipher design ciphers and models of operation in detail.

5. a) Discuss various principles of public key crypto Systems.

b) The public key crypto Systems addresses certain problems of symmetric crypto systems.

What are those problems explain in detail

6. Briefly explain Diffie-Hellman key exchange protocol.

Hai Every one I will send the updated information to this blog for next time