College : Vardhaman College Of Engineering
Degree : M.Tech
Semester : I
Department : Digital Electronics and Communication Systems
Subject :Adavanced Data Communications
Document type : Question Paper
Website : vardhaman.org
Download Previous / Old Question Papers :
April – 2012 :https://www.pdfquestion.in/uploads/vardhaman.org/6419-question%20papers%20of%20two%20year%20m.%20tech%20i%20semester%20regular%20examinations%20april%20-%202012.pdf
September – 2012 :https://www.pdfquestion.in/uploads/vardhaman.org/6419-question%20papers%20of%20two%20year%20m.%20tech%20i%20semester%20supplementary%20examinations%20september%20-%202012.pdf
April – 2013 :https://www.pdfquestion.in/uploads/vardhaman.org/6419-question%20papers%20of%20two%20year%20m.%20tech%20i%20semester%20regular%20examinations%20april%20-%202013.pdf
February – 2014 :https://www.pdfquestion.in/uploads/vardhaman.org/6419-MT1R13FEB-14.pdf
Advanced Data Communications Question Paper :
Two Year M. Tech I Semester Regular Examinations, February – 2014
(Regulations: VCE-R11)
(Common to Digital Electronics and Communication Systems &
Wireless and Mobile Communications)
Date : 3 February, 2014
Time : 3 Hours
Max. Marks : 60
Answer any FIVE Questions.
All Questions carry equal marks
Related / Similar Question Paper : Vardhaman M.Tech Mobile Satellite Communications Question Paper
1.a) Assume that there are two circular linked list L1 and L2. Write a pseudo code to create a third linked list L3 merging the L1 linked list’s odd positioned nodes and L2 linked list’s even positioned nodes. 8M
b) Explain various advantages and disadvantages of linked list implementations. 4M
2. a) Explain the difference between performance analysis and performance measurement of an algorithm. 4M
b) What do you mean by time complexity analysis? Explain the different type of time complexity analysis with a suitable example. 8M
3. a) With the help of pseudo code, explain the different types of binary tree traversals algorithm. 6M
b) Write a pseudo code to count the number of nodes in a given graph. 6M
4. a) Insert the following numbers into a binary search tree in the order that they are given and draw the resulting tree. 87, 36, 22, 15, 56, 85, 48, 90, 72, 6 Delete 48 and draw the resulting tree. Delete 15 and draw the resulting tree. 6M
b) Write a pseudo code for deleting a node from AVL tree. 6M
5. a) What is Splay tree? Explain the operations of Splay tree with an example. 8M
b) Explain the properties of red black tree. 4M
6. a) Find a minimum-cost spanning tree using Kruskal’s algorithm for the given graph. 6M
b) Explain Strassen’s matrix multiplication technique with suitable example. 6M
7. a) What do you mean by single source shortest path? Explain Floyd’s algorithm. 6M
b) Using 0/1 Knapsack technique find the optimal solution for the given problem Knapsack Capacity = 30
Item A B C
Price 50 140 60
Size 5 20 10 6M
8. a) What is backtracking algorithm? Write a backtracking algorithm for solving the N-Queen’s problem. 8M
b) Write short notes on following:
i. LC Search
ii. Bounding 0/1 knapsack problem 4M
Two Year M. Tech I Semester Regular Examinations April – 2013
ADVANCED DATA COMMUNICATIONS
(Common to Digital Electronics and Communication Systems &
Wireless and Mobile Communications)
Time: 3 hours
Max Marks: 60
Answer any FIVE Questions.
All Questions carry equal marks
1. a) Explain different linear data structure for inserting and deleting the elements. Discuss their applications. 6M
b) How do you insert the data into and delete data from linked list without traversing the list? Write down the code for the same. 6M
2. a) Discuss the asymptotic notations. How does one measure the efficiency of the algorithm? 6M
b) The time complexity of an algorithm can be measured using Aprioiri analysis or posteriori testing. Discuss these algorithms in detail? 6M
3. a) Discuss threaded binary tree. What are its applications and advantages and disadvantages over binary tree? 6M
b) Write a code for a given graph , outputs
i. Vertices of each connected component,
ii. Its cycle or a message that the graph is acyclic. 6M
4. a) Construct AVL tree for the following numbers 14, 8, 12, 46, 23, 5, 77, 88, 20. 6M
b) What is B-tree? How do you construct the B-tree? Explain with example. 6M
5. a) What is 2-3 tree? How is it better than other search trees? Construct a 2-3 B tree for the list C, O, M, P, U, T, I, N, G. 8M
b) What do you mean by hashing? Why do we need it? 4M
6. a) Write down the divide and conquer technique for multiplying two matrices. Derive its time complexity for total number of basic operations. 6M
b) Write and explain Kruskal’s algorithm for finding the minimum spanning tree. Also find the MST for the following graph. 6M
7. Solve the all pair shortest path problem for the digraph with the weight matrix. 12M
8. a) Describe an efficient implementation for a LCBB travelling sales person algorithm using the reduced cost matrix approach? 6M
b) Present a backtracking algorithm for solving the N-Queen’s problem. Draw the portion of state space tree for the N-Queen’s problem. 6M