College : Vardhaman College Of Engineering
Degree : M.C.A
Semester : V
Subject : Middleware Technologies
Document type : Question Paper
Website : vardhaman.org
Download Previous / Old Question Papers : https://www.pdfquestion.in/uploads/vardhaman.org/6477-MA5R11DEC-13.pdf
Middleware Technologies Question Paper :
MCA V Semester Regular Examinations, December – 2013
(Regulations: VCE-R11) (Master of Computer Applications)
Date : 6 December, 2013
Time : 3 Hours
Max. Marks : 60
Answer any FIVE Questions.
All Questions carry equal marks
Related : Vardhaman College Of Engineering Software Testing Methodologies MCA Question Paper : www.pdfquestion.in/6476.html
All parts of the question must be answered in one place only
1. a) Explain briefly evolution of corporate computing models from monolithic to distributed computing. 8M
b) List any four pitfalls of client server computing. 4M
2. a) What is remote method invocation? Explain the process with the help of neat sketch. 6M
b) Explain RMI API with an example. 6M
3. a) What are the different types of .Net assemblies? 6M
b) What are Delegates? How they are Different From Normal C# Methods? 6M
4. a)What is attribute based programming? How is this achieved in C#? 6M
b) Illustrate the concept of late binding with a suitable example. 6M
5. a) Illustrate CORBA dynamic invocation with the help of ORB. 8M
b) Contrast between static and dynamic method invocations in CORBA. 4M
6. a) Explain briefly BOA shared server and BOA persistent server for CORBA. 6M
b) With suitable example illustrate CORBA constants and primitive types. 6M
7. a) Explain briefly taxonomy of event adapters. 6M
b)What java beans can do for CORBA? 6M
8. a)Explain briefly Enterprise Java Beans/Container protocol. 6M
b) Describe CORBA Object Transaction Monitor. 6M
Data Structures And Algorithms :
(Common to Computer Science and Engineering and Software Engineering)
Time: 3 hours
Max Marks: 60
Answer any FIVE Questions.
All Questions carry equal marks
All parts of the questions must be answered in one place only
1 Consider the following arithmetic p, written in postfix notation. P: 12, 7, 3, -, /, 2, 1, 5, +, *, +. Evaluate it in Infix Expression. 12M
2 a) Which of the given options provides the increasing order of asymptotic complexity of the functions: f1,f2, f3 and f4? f1(n)=2n f2(n)=n3/2 f3(n)=n log2n f4(n)=nlog 2 n 6M
b) What does the following recurrence relation evaluates to? T(0)=1, T(n)=T(n-1)+3n 6M
3 a) A complete n array tree is a tree in which each node has n children or no children. Let I be the number of internal nodes and L be the number of leaves in a complete n array tree. If L=41 and I=10, then what is the value of n? 4M
b) What is the total number of distinct binary trees with ‘n’ nodes? Draw all the distinct binary trees with ‘5’ nodes. 4M
c) How many vertices and how many edges are there in complete bipartite graphs K4,7 and K7,11? If the graph Kr,12 has 72 edges, what is r? 4M
4 a) A binary search tree is generated by inserting in order of the integers: 50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24. What is the total number of nodes in the left sub-tree and the right sub-tree? 4M
b) What is the maximum height of any AVL tree with 7 nodes? Assume that the height of a tree with a single node is 0. 4M
c) The following numbers are inserted into an empty binary search tree in the given order one by one: 15, 32, 20, 9, 3, 25, 12, 1.
i. Show the final binary search tree after the insertions.
ii. Draw the binary search tree after deleting 15 from it. 4M
5 a) What is a red black tree? Explain, in detail, its operations and applications. 6M
b) Insert the characteristics of the string: K R P C S N Y T J M into a hash table of size 10.Use the hand function: h(x) = (ord(x) – ord(‘a’)+1) mod 10 and linear probing to resolve collisions.
i. Which insertions cause collisions?
ii. Obtain the final hash table. 6M
6 a) Write a short notes on KNAPSACK PROBLEM. 4M
b) Consider the following instances of the Knapsack problem: n=3, m=20, (p1,p2,p3)=(25,24,15) and (w1,w2,w3)=(18,15,10). Find optimal solution. 8M