UNIT -2 : BASEBAND FORMATTING TECHNIQUES
Part A ( 2 Marks)
1. Define matched filter
2. What is decision device
3. Draw the block diagram of base band binary data transmission system
4. What is Nyquist channel
5. Draw the frequency and time response of raised cosine spectrum
6. What you mean by correlative level coding
7. Define LMSA
8. What is DFE
9. List out the use of eye patterns
10.Define zero crossing effect

Part B
1. Derive the expression for the matched filter and prove any one property. (16)
2. Prove the effect ISI using necessary block diagram and design. (16)
3. Write brief notes on Nyquist’s criterion for distortion less base band binary transmission. (16)
4. Explain the six array PAL transmission. (16)
5. Why do we adoptive equalizer and design any one type of adoptive equalizer.

UNIT – 3: BASEBAND CODING TECHNIQUES
Part - A ( 2 Marks)
1. Define FSK
2. Draw the Basic block diagram of FSK
3. Define MFSK
4. Draw the wave form of the MPSK
5. What is MSK
6. Define Non-coherent FSK
7. Differentiate coherent FSK from Non-coherent FSK
8. What do you mean by Probability error.
9. Define Passband transmission.
10 Draw the baseband signal.

Part B
1. Derive the expression for the BPSK technique. (16)
2. Explain the MFSK and derive the pe. (16)
3. Draw the space diagram of MSK and explain about the same. (16)
4. Derive the error probability expression for the MPSK. (16)
5. Compare the all types of Passband transmission. (16)


Unit- 4: BASEBAND RECEPTION TECHNIQUES
Part A ( 2 Marks)
1. Define the Channel coding
2. List out the uses of the Channel Coding
3. Differentiate Sourced coding from the Channel coding.
4. Prove any two properties of Block Codes.
5. What is syndrome?
6. Define Code rate.
7. What is BSC?
8. Draw the channel diagram of the BPSK system
9. What is turbo codes
10. Define CRC.


Part B
1. Explain the channel coding technique used in the Block codes. (16)
2. What are all the message vectors can be extracted from the
code vector that was generated by 1+X+X3. (16)
3. Explain the Viterbi algorithm for the detection of any two
message vectors (One Word) from the code vectors that
were generated by (111), (101) and (011). (16)
4. Explain the construction of Block Code and
Explain how error syndrome is calculated. (16)
5. Explain in detail about Orthogonal codes, Biorthogonal codes and
Transorthogonal codes. (16)


UNIT- 5: BANDPASS SIGNAL TRANSMISSION AND RECEPTION
Part A ( 2 Marks)
1) What are all the types of SSM
2) What is the use of PN sequence
3) List out the prosperities of PN sequence
4) What is the processing gain of SSM.
5) Define jamming margin
6) Define FHSSM
7) Define SFHSS.
8) Define FFHSM.
9) Draw the PN sequence generator for [6,4,2,1]
10) What you mean by runs in PN sequence
11) State the Gold Theorem.

Part B
1. Generate the PN sequence for [5, 4, 3, 1] and prove the all properties of the same. (16)
2. List out and prove the Properties of the PN sequence. (16)
3. Explain the concept of DS/BPSK. (16)
4. List out the uses of the FH. Explain the FH techniques with the frequency spectrum. (16)
5. Write shorts notes on
1. Probability Error. (4)
2. Jamming Margin (4)
3. (S/N) of the DS System. (8

Results :     CLICK HERE
Official Site: CLICK HERE

http://www.bankofbaroda.com/download/WrittenTestStaffProject2011.pdf

Personal Interviews are scheduled to be held from 22-08-2011 onwards. Candidates can download the Interview Call Letter from the Bank's website. Necessary intimation for Personal Interview is being sent to the above candidates by SMS, E-Mail & Post
about Date, Time & Venue of interview.If you have any issues please post your comments..

4. The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by
page size
physical memory size
the instruction set architecture
number of processes in memory

5. The best data structure to check whether an arithmetic expression has balanced parentheses is a
list
tree
stack
queue

6. Suppose the round trip propagation delay for a 10 Mbps Ethernet having 48-bit jamming signal is 46.4 ms. The minimum frame size is:
464
94
416
512

7. Consider the following C program
main ()
{
int x, y, m, n ;
scanf (“%d %d”, &x, &y); / * Assume x > 0 and y > 0 * /
m = x; n = y ;
while ( m ! = n)
{
if (m > n)
m = m + n;
else n = n – m ;
}
printf(“%d”,n);
}
The program computes
x mod y using repeated subtraction
the greatest common divisor of x and y
the least common multiple of x and y
x + y, using repeated subtraction

8. The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by
the instruction set architecture
physical memory size
page size
number of processes in memory

9. Consider the following C function:
int f (int n)
{
static int i = 1;
if (n >= 5)
return n;
n = n + i;
i++;
return f (n);
}
The value returned by f(1) is
5
8
6
7

10. A Priority-Queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is given below: 10, 8,5,3,2 Two new elements 1 and 7 are inserted in the heap in that order. The level-order traversal of the heap after the insertion of the elements is
10,8,7,3,2,1,5
10,8,7,5,3,2,1
10,8,7,1,2,3,5
10,8,7,2,3,1,5

11. The following numbers are inserted into an empty binary search tree in the given order: 10, 1, 3, 5, 15, 12, 16. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)?
2
4
3
6

12. The relation scheme Student Performance (name, courseNo, rollNo, grade) has the following functional dependencies:
The highest normal form of this relation scheme is:
name, courseNo -> grade
rollNo, courseNo -> grade
rollNo -> name
name -> rollNo


If you have doubts ,please write your comments for more assistance.Share your answers for the above questions..

TNDALU Results 2011
Tamil Nadu Dr. Ambedkar Law University (TNDALU) Chennai yet to declare results for the exams conducted regularly,the results will be updated on its official website (www.tndalu.ac.in).Candidates need to enter only the roll number to know the Result. We made this page especially to update the TNDALU Results 2011.

Get Tndalu Results
Students can get the TNDALU Results 2011from the link given here.