UNIX PROGRAMMING ASSIGNMENT-1

 Submit the Assignment on before 17th January 2018.

 SET-1(Roll No:1201-1220)

1.       Discuss in detail the various modes of operations supported by vi editor.

2.       Discuss about shell variables and environment variables?

3.       What are various low level file access commands available in UNIX? Explain the syntax briefly.

SET-2(Roll No:1221-1240)

1.       What is an operating system? Write and explain the characteristics of Unix Operating System.

2.       Explain about pipes and input redirection in UNIX shells.

3.       With the help of syntax and example explain the various directory handling systems calls.

SET-3(Roll No:1241-1260)

1.       Explain the following commands with examples.

(i) cut               (ii) sort                        (iii) cat                         (iv) grep          (v) awk

2.       What is a shell? Explain the responsibilities of a shell.

3.       Write about link, symlink and unlink?

SVECW-III-IT-A

CD Assignment -II

Submit on or before 25/9/2017

SET-I(1-20)

1. a) Construct the syntax-directed definition to produce a syntax trees for assignment        statements.  

   b) Write the quadruples, triples and indirect triples for the expression:

            -a + a * ( b + c ) + ( b + c ) * d .

2. a) What is peephole optimization? Mention the transformations that are characteristic of peephole optimizations.  

  b) Discuss storage allocation for non block structured languages. ?

3. a) Distinguish machine dependent and machine independent optimization?

   b) Explain the function preserving transformation techniques? 

SET-2(21-40)

1.a) Write the quadruples, triples and indirect triples for the expression:

            b* – ( c – d) + b* a – (c – d )

   b) Give the syntax-directed definition for a desk-calculator.     

2. Explain the following

      i) Garbage collectors   ii) Basic blocks and flow graphs   iii) Simple code  

3.a) Explain the   Inter procedural optimization

     b) what is a loop optimization? Explain various techniques in loop optimization.

SET-3(41-60)

1.a)  Explain in-detail, the Syntax Directed Translation Schemes.

    b) Discuss the type declarations with examples.  

             

2.a) Explain the importance of register allocation with respect to optimization.

    b) Explain with advantages and disadvantages of stack and heap storage allocation strategies for strings and records. 

3. a) Explain in brief about Loop optimization techniques? 

     b) Explain how redundant sub-expression elimination can be done at global level in a given Problem.  

                     

 SVECW-IT-A SECTION   

COMPILER DESIGN ASSIGNMENT-II(UNIT-II)

 SET-I

1. a) Compute First and Follow for the grammar

E →E+T/T, T →T*F/F, F→(E)/id 

b) Eliminate Left Recursion for the grammar

E →E+T/T, T→T*F/F, F→(E)/id.

2. a) Convert the following grammar into LL(1) grammar and construct the LL(1)

Parsing table:

E→E + T | T, T→T * F | F, F → (E)/id

b) Convert the following grammar into LL(1) grammar and construct the LL(1)

Parsing table:

R→R “|’R|RR|R*|(R)|a|b

3. a) Convert the following grammar into LL(1) grammar and construct the LL(1) Parsing

table:

bexpr → bexpr or bterm | bterm, bterm → bterm and bfactor | bfactor

bfactor → not bfactor | ( bexpr) | true | false

b) Write the differences between top down parsers and bottom up parsers.

4. a)Convert the following grammar into LL(1) grammar and construct the LL(1) Parsing table:

S →iEtS | iEtSeS, T→b

b) What is left recursion and left factoring? Eliminate left recursion for the following grammar

E→ E + E / num

5. a) Construct SLR parsing table for the grammar E→ E+T/T, T→ T*F/F, F→ (E)/id.
      b) Write the differences between LL parsers and LR parsers.

 SET-II

1. a) Consider following grammar

S→( L ) | a , L →L, S | S

Find parse trees for the sentences i) (a, (a,a)) ii) (a, (a,a), (a,a))

b)Explain about Top down parsing techniques.

2. a) Show that the following grammar is LL(1)

S -> AaAb | BbBa , A -> ε, B -> ε

b) Explain in brief about the model of Non recursive predictive parser?

3. a) Explain FIRST and FOLLOW Rules [4M]

b) Construct recursive descent parser for the following grammar

E→TE′ , E′→+TE′│€ , T→FT′ , T′→* FT′ │€ , F→ (E) │id

4. a) Write the algorithm for Constructing the predictive Parser.

b) Show that the following grammar is LL(1)

S→aAB│bA│€ A→aAb│€ B→bB│€

5.  a) Construct CLR Parsing table for the grammar S→L=R|R, L→*R|id,R→L
    b) Explain in brief about Operator Precedence parsing.

SEI-III 

1. a) Explain in detail the difficulties in top down parsing

b) Find FIRST & FOLLOW from the following grammar

S→aAB│bA│€ A→aAb│€ B→bB│€

2. a) What is left recursion? Eliminate left recursion from the following grammar.

A→Ba│Aa│c B→Bb│Ab│d

b) Explain error recovery strategies in predictive parsing?

3. a)S→Aa|b, A→Ac|Aad|bd|€  check the given grammar LL(1) or not

 b) Write first and follow rulres

4.a) explain Error recovery in predictive parser with relevant example. 

  b) Discuss the short notes on Ambiguity. 
5. a) Construct the LALR parsing table for the following grammar:    
             S→Aa | bAc | dc|bda,     A→d
    b) Write an algorithm to find LR(0) items.    

III-I SEM IT -SVECW

COMPILER DESIGN 

ASSIGNMENT-I  QUESTIONS

SET-I

1. a) Differentiate between compiler and interpreter.

   b) What is compiler? Explain in brief about phases of a Compiler.

2 a) Write regular expressions for the following patterns. 

   i) The set of words having a, e, i, o, u appearing in that order, although not   necessarily consecutively.  

  ii) All the strings of a's and b's that do not contain the substring abb.

  b) Explain the  lexical analyzer in compiler construction process.

3.  a) What are compiler & interpreter? Write short notes on  compiler and

         an interpreter.

   b) Explain various phases in the construction of a compiler.

4. a)   Explain the role of lexical analyzer.

   b) What are the reasons for separating lexical analysis from syntax analysis?

                            SET-II

1. a ) What is regular expression? Write the regular expression following.

     i) Accepts all strings of 0’s & 1’s which and with 01.

      ii) Accepts all strings of 0’s & 1’s, whose 9 th position from the right end is 1.

       iii) Equal no of 1’s & 0’s

     b) What is Transition diagram? Explain with examples.

2. a) Describe the need and functionality of linkers, assemblers and loaders.

    b) What is the role of lexical analysis? Give examples.

    c) Differentiate between lexical analysis and parsing.

3.  a) Explain the different phases of the compiler, showing the output of each phase using  the  example for the statement

                      z = ( a*20 ) + b – c

      b)  Construct transition diagram for  the Regular Expression (a/b)*abb(a/b)*.

   c) Write about Lexical errors and their handlers.

                          SET-III

1. a) Describe the output for the various phases of compiler with respect to the following statement

position=initial+rate*60     

      b) Explain the reserved words and identifiers.

2. a) What is a regular expressions? Write a regular expression for identifier keyword and design a transition diagram for it.

       b) Explain the following terms with example

 i) token  ii) pattern  iii) lexeme

3.  a) Explain the structure of a compiler. 

      b) Consider the following fragment of ‘c’ code

                 float i, j;                  i= i*70+j+2;

        Write the output at all phases of a compiler. 

SVECW-III-IT-B-SECTION-UP Assignments

submit assigenment onor before 20/3/2017

SET-1(roll no-1261-81)

1. (a) Define process. Explain about process structure.

(b) Explain in detail about zombie process.

2. (a) Explain in detail about interrupted system calls.

(b) Explain in detail about abort and sleep functions.

3. Briefly explain about the following IPCs:

(a) FIFO                (b) Pipes              (c) Name spaces

SET-2         (roll no1282-A2)

1. (a) Explain in detail about Advisory Locking versus Mandatory Locking.

(b) Explain in detail about File Locking versus Record Locking.

2. Explain the following system calls with clear syntax and example:

(a) fork( )             (b) wait( )           (c) exec( )

3. (a) What is an orphan process? Write a program to illustrate orphan process.

(b) Explain various exit statuses with an example program.

SET-3 (roll no  12A3-C0,1247)

1. Explain the following with example:

(a) Process Creation       (b) Process Termination                (c) Signal function            (d) Reliable signals.

2. (a) Explain the advantages of FIFOs over pipes.

(b) Write a C program to illustrate two way communication using FIFOs.

3. (a) Explain in detail about Zombie process and Orphan process.

(b) Differentiate between fork( ) and vfork( ).

IV-B.Tech IT-A-SVECW-BVRM

Distributed Systems

Assigemennt-II  

submit on or before 28/2/2017

SET-1( Roll No:131AB01201-131AB01222)

1.a) Explain architecture of server threads. Give its applications.

   b) Write about invocation and address space.

2. a) Explain and summarize Napster and its legacy with respect to distributed   file system.

    b) Explain sun network file system.

3. Write about bully algorithm and summarize how it is different from other

    election algorithms.

4.  a) Explain about locking in strict two phase locking.

    b) Write about distributed deadlocks. How to prevent deadlocks in distributed

    systems.

 SET-2( Roll No:131AB01223-131AB01243)

 

1. Explain processes and threads with  examples.

2. a) Distinguish between IP and overlay routing for peer to peer applications.

   b) Discuss about overlay routing.

3. a) What are the features required for election algorithms.

     b) What meant by total ordering and where it is used.

4.  Discuss in detail about distributed deadlock and transaction recovery.

SVECW-III-IT-B UNIX PROGRAMMING

Assignment-3(UNIT-3)

 Submit on or before 1/2/2017

SET-1 (1261-1280)

1. Discuss in detail about various directory handling system calls.

2. Distinguish between stat and fstat system calls.

3. Explain getchar and putchar system calls.

SET-2 (1281-12A0)

1. Explain the following system calls.

a) symlink b)unlink c)chown d)octal

2. Give brief description about the low level file I/O.

3. Describe the formatted input and output functions.

SET-3 (12A1-12C0,47)

1. Explain the importance of dup command in UNIX and also explain the various forms of it with suitable example.

2. Explain the following system calls

a) fflush b)fgetc c)getc d)getchar

3. Write about system calls, library functions and low level file access functions with examples.

IV-IT-A-SVECW

Distributed Systems 

Assignment -I 

submit this on or before 27.01.2017

Set-1

1.What is architecture model.Explain different varients in architecture model?

2.What is inter process communication.Explain characteristics of inter process communications?

3.Write a short notes on 

 a)Stream communication.      b)UDP coomunication.

Set-2

1.What is distributed system?Explain the goals and challenges of distributes system?

2.Explain briefly about external data representation and marshelling?

3.Explain about client server communication?

 UNIX PROGRAMMING 

Assignment-1(UNIT-1)
SET-1
1. Explain about the features of UNIX.
2. Explain the following commands with suitable examples.
Umask, chmod, mkdir, rmdir, sort, cp
SET-2
1. Explain in detail about file permissions and process utilities.
2. Explain in detail about backup utilities.
SET-3
1. Explain in detail about disk utilities and text processing utilities.
2. Explain in detail about UNIX file system with neat diagram.


Assignment-2(UNIT-2)
SET-1
1. Write a shell program for file contains records. Each record containing name and city, name of state and name of country. How would you sort this file with country as the primary key and state the secondary sort key.
2. Write a shell script which counts the number of lines and words present in a given file.
3. Write a shell script that copies multiple files to a directory.
4. Implement a shell script to show that the given number is even or odd?
SET-2
1. Write a shell script which displays the list of all files in the given directory.
2. Write a shell script (small calculator) that adds, subtracts, multiplies and divides the given two integers. There are two division options: one returns the quotient and the other returns reminder. The script requires 3 arguments: The operation to be used and two integer numbers. The options are add
 (-a), subtract(-s), multiply(-m), quotient(-c) and reminder(-r).
3. Write a shell script to reverse the rows and columns of a matrix.
4. Write a shell script to show the given strings and numbers are equal or not?

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