Will you please give me question paper for Punjab technical university MCA 2nd Semester Examination in PDF file format ?

Here I am giving you question paper for Punjab technical university MCA 2nd Semester Examination in PDF file attached with it so you can get it easily.

QUESTION 1.Explain the following
a)Data Communication characteristics.
b)Interfaces
c)Frequency
d)Spectrum of a signal
e)Phase modulation
f)PPP stack
g)Framing
h)Router
i)UDP
j)Virtual Terminal

QUESTION 2
a) Draw two sine waves on the same time domain axes.The characteristics of
each signal are given below:
Signal A:amplitude 40,frequency 9,phase 0
Signal B:amplitude 10,frequency 9,phase 90
b Using the Nyquist theorem,calculate the sampling rate for the following analog signal with
bandwidth 2000Hz

QUESTION 3
a)Explain the features of optical fiber.
b)Describe Satellite Communication.
c)Given the flolloeing information,find the minimum bandwidth for the path:
FDM multiplexing.
Five devices,each requiring 4000Hz
200 Hz guard band for each device.

QUESTION 4
a)Explain different types ofredundancy checks.
b)Construct the Hamming code for the bit sequence 10011101.

QUESTION 5
a)Explain sliding window protocols.
b)Explain CSMA/CD and its use.

QUESTION 6
a)Describe ARP.
b)Explain multi casting routing protocols.
QUESTION 7.Explain services provided by transport layer protocol.

QUESTION 8
a)Explain client-server model.
b)Explain how SMTP is useful to send e-mails.



Q1) (a) Define ADT? What are its advantages?
(b) What is the difference between linklist and array?
(c) What is the difference between graph and tree?
(d) What is the complexity of an algorithm?
(e) What is deque? List its different types?
(f) What are the applications of stack?
(g)Define: (i) almost complete binary tree (ii) strictly binary tree?
(h) A complete binary tree contains 15 nodes. Calculate the depth of the tree?
(i)What are AVL trees? What are its advantages?
(j)Write the complexities of {i) Heap sort (ii) Quick sort (iii) Merge sort
(k)Differentiate between depth first search and breadth first search?
(l) Define: (i) Minimum spanning tree (ii) Forest
(m)What is Bubble sort technique?
(n) What are the applications of graph?
(o) What are the limitations of binary tree?
Section – B (9 x 5 = 45)
Q2) Write an algorithm to insert an element at the end in a circular link list?
Q3)Write the procedure to insert an element in the middle of an array?
Q4) How would you implement a queue of stacks, a stack of queues, a queue of queues? Write routines
to implement the appropriate operations for each of these data structures.
Q5)Write a procedure to convert infix expression to postfix expression? Apply the procedure on the
following data
Q: ((A+B)*D)T(E-F)
Write heap sort algorithm? Discuss its complexity?
Q6) Discuss the different tree representation methods`?
[a+(b-c)] * [(d-e)/(f+g-h)]
(a) Draw the corresponding binary tree. (b) Apply the preorder traversal. (c) Apply the postorder
traversal.
Q7) Explain the various graph representation methods. List merits and demerits -of each?
Q8) Explain Dijkastra's algorithm?
Q9) Write a short note on Redix sort?
Q10) Write an algorithm for selection sort?