second mid assignment questions

DATA COMMUNICATIONS

1(a) Explain in detail about error correction process with the help of a neat block diagram?

(b) Write a short note on Interfacing

2(a) Write and explain the need for STOP AND WAIT and SLIDING WINDOW flow control protocols?

(b) Define Bit Stuffing? Explain with an example?

3) Briefly explain the HDLC protocol.

4) What are the different types of Multiplexing Techniques? Explain about synchronous TDM and statistical TDM?

5(a) Write a short notes on DSL family?

(b) What are the general application areas for Local Area Network?

6(a) Define Topology? Explain briefly about different types of Local Area network Topologies?

(b) Explain Fiber Channel Protocol Architecture?

DATA BASE MANAGEMENT SYSTEMS

1(a) Explain the procedure for finding the minimal set FD’s with an example?

(b) Write an algorithm to find closure of attributes based on the given FD set.

2(a) Why the decomposition is needed? Explain the desirable properties of decomposition?

(b) Write short notes on

1. Join Dependency.

2. Multi-valued Dependency.

3(a) Discuss about different transactions and describe various states of state transition with a neat sketch.

(b) List and explain about various concurrency problems with an example?

(c) Define 2-phase locking protocol? Explain how to handle concurrency problems with locking mechanisms?

4(a) Explain the following

(i). Time-Stamp ordering algorithm.

(ii). Dead locks

(iii). Multi-version concurrency control techniques?

(b) What is the purpose of recovery? Explain its concepts?

5(a) Explain in detail about immediate update and Shadow paging recovery techniques?

(b) Describe difficult security mechanics used for database systems?

6(a) Write short notes on primary file organizations?

(b) Explain in detail the concepts of serializability?

AUTOMATA AND FORMAL LANGUAGES

1(a) Define Grammer? Explain different types of grammers with examples?

(b) Write a short note on applications of CFG?

2(a) Construct PDA to accept equal number of a’s and b’s

(b) Construct PDA for the following CFG

S->0A

A->0ABC/1B/0

B->1

C->2

3(a) Convert the following grammer into GNF having prductions?

(b) Find the reduced grammer equivalent to

S->AB/CA/BD

B->BC/AB

D->a

A->A

C->aB/b

4(a) Write CYK algorithm?

(b) Consider the grammer

S->AB/BC

A->BA/a

B->CC/b

C->AB/a

Check if baabab is in the language generated by the above grammer.

5(a) Design a TM to recognize the language L={1n2n3n/n>=1}

(It is 1 power n 2 power n 3 power n)

(b) Write a short note on programming techniques for TMs

6(a) Explain undecidability of PCP problem?

(b) Write a short note on Universal Turing Machine?