My Profile
Active Members
TodayLast 7 Days
more...
Awards & Gifts
Online Exams
Fresher Jobs
Our fresher job section is exclusively for fresh graduates! Find jobs for freshers in major Indian
cities including Bangalore, Chennai, Hyderabad, Pune or Kochi
Resources
Find educational articles, blogs, discussion threads and other resources.
Colleges
Find details about any college in India or search for courses.
|
Download Model question papers & previous years question papers
|
Posted By: sivabalan Member Level: Gold Posted Date: 17 Sep 2008
|
2006 Tamil Nadu State Computer Aplications Madurai kamaraj University M.C.A 2nd year Examination May 2006 All subject Question Papers Question paper
M.C.A Second Year May 2006
PAPER-I OPTIMIZATION TECHNIQUES
Time: Three hours maximum: 100marks
PART A Answer all questions (8x5=40 marks)
1. (a) Explain how will you formulate a mathematical model to a given linear programming
problem. Or (b) Use graphical method to solve the following Max z=3x1 +4X2
Subject to 5X1 + 4X2 <= 200 3x1 + 5X2 <=150 5x1 + 4X2 >= 100 SX1 + 4X2>=8O X1X2
>=O.
2. (a) Explain the different categories of stochastic processes with simple examples. Or (b)
explain the recurrent class of Markov chain and state the criteria for recurrence.
3. (a) Explain the main characteristics of the Queuing system. Or (b) establish the
probability distribution formula for pure-death process.
4. (a) What is queuing theory? Explain the basic elements of queues. Or (b) At a public
telephone booth in a post office arrivals are considered to Poisson with an average
inter-arrival time of 12 minutes. The length of the phone. Call may be assumed to be
distributed exponentially with an average of 4 minutes. Calculate the following: (i)
What is the probability that a fresh arrival will not have to wait for phone? (ii) What is
the probability that an arrival will have to wait more than 10 minutes before the phone
is free?
5. (a) Give a brief outline of the revised simplex method. Or (b) Write down the dual of
the following LPP Min z = 4x1 + 3X2 -2x3 Subject to 3X1 + 6X2 + 4x3 >=6 7 X1 + X2 +
2x3 >= 5. 6x1 - 2X2 – X3<= 9 2x1 - X2 + 3x3 >= 4 4x1 + 6X2 – X3 >= 2 X1, X2,
X3>=0.
6. (a) Explain some of the practical applications of Integer programming problem. Or
(b) Explain how the assignment problem can be treated as a particular case of
transportation problem.
7. (a) What are the unbalanced assignment problem? How are they solved? Or(b) Explain
the nature of a travelling salesman problem and give its mathematical formulation.
8. (a) Explain the mechanism of queuing process by considering some illustration.Or (b) A
customer owning a Maruti car right now has got the option to switch over to Maruti,
Ambassador or Fiat next time with the probability (0.20, 0.5 and 0.30) given the
transition matrix.
0040 0.30 0.30
P = 0.20 10.50 0.30
0.25 0.25 0.50 Find the probabilities with his fourth purchase?
PART B Answer ALL questions. (5 x 12 = 60 marks)
9. (a) Solve the following LPP using simplex method Maximize z =3X1 + 5X2 + 4X3 . Subject
to 2X1 +3X2<=8 2X2 + 5x3 <=10 3x1 + 2X2 + 4X3 <=15 and Xl. X2 X3 >= 0 Or (b) Use revised
simplex method to solve the LPP. Minimize z= -4x1 + X2 + 2X3Subject to 2x1 - 3X2 + 2X3 <=12
-5x1 + 2X2+3X3 >=4 3x1-2x3=-1 and X1, X2, X3 >=0.
10. (a) Use penalty method to solve the following LPP. Minimize Z=4X1+X2 Subject
to3X1+X2=3 4X1 + 3X2 >= 6 x1 + 2X2 <=3 and X1,X2 >=0.Or (b) Solve by the dual simplex
method the following LPP Minimize z = 5x1 + 6X2Subject to X +X2 2:24xj + X2 2: 4 X2 2:0.
(b) A fair die is tossed repeatedly. If Xn denotes the maximum of the numbers occurring in the
first n tosses, find the transition probability matrix p of the Markov chain {XnJ. Find also p2
and P(X2 = 6).
11. (a) A supermarket has two girls ringing up sales at the counters. If the service time for each
customer is exponential with mean 4 minutes and if the people arrive in a Poisson fashion at
the rate of 10 per hour (i) What is the probability of having to wait for service?(ii) What is
the expected percentage of idle time for each girl?(iii) If a customer has to wait, what is the
expected length of his waiting time. Or (b) Discus the fields of application for queuing.
Explain queue discipline and its various form.
12. (a) A travelling salesman has to visit 5 cities. He wishes to start from a particular city visit
each city once and then return to his starting point cost of going from one city to another is
shown below. You are required to find the least cost route.
To city
A B C D E
A 00 4 10 14 2
B 12 00 6 10 4
From City C 16 14 00 8 14
D 24 8 12 00 10
E 2 6 4 16 00
Or (b) Find the optimum integer solution to the following linear programming problem
Maximize Z =XI + 2X2 Subject to 2X257 xI + X2 572x] 51 and xI' X2 2: 0 and are integers.
13. (a) Define the Markov -'property for a discrete space continuous time process. Prove that a
process having independent and stationary increments is Markov.
M.C.A Second Year May 2006
PAPER-II COMPUTER GRAPHICS
Time: Three hours maximum: 100marks
PART A Answer all questions (8x5=40 marks)
1. (a) Write short notes on Graphical User Interface. Or (b). Write an algorithm for line
drawing and line commands.
2. (a) Write a note on bundled attributes. Or (b). What are the transformation commands?
3. (a). Write short note on window-to-view port. Or (b). Explain the following: I)
Segment attributes. II) Segment files.
4. (a) Write a note on construction technique. Or (b). Give an account on input functions.
5. (a) Write short notes on 3D- Graphics packages are used in Animation. Or Write short
notes on 3D-coordinate system.
6. (a)What does scaling mean? Give an example. Or (b) List out the various
transformation of 3D images.
7. (a). Write short notes on Back face removal. Or (b) Write short notes on viewing
transformation.
8. (a). Define Projection. Or (b) Write an algorithm for scan line method.
PART B Answer all questions (5*12=60 marks)
9. (a) Write short notes on the following: I) Display processors II) Circle-generation
algorithm. Or (b). Explain the images processing display devices.
10. (a). Write short notes on Composite transformation and transformation commands. Or
Write short notes on matrix representation and homogenous coordinates.
11. (a) Write short notes on workstation. Or (b) explain the line-clipping algorithm in
detail.
12. (a). Write short notes on 3D-Translation, rotation in detail. Or (b). Write short notes on
3D-Display technique.
13. (a). Write short notes on the following: I) Hidden surface. II) Hidden-line removal. Or
(b) Write short notes on the implementation of viewing operations and various
projections.
M.C.A Second Year May 2006
PAPER-III SYSTEM SOFTWARE AND DESIGN
Time: Three hours maximum: 100marks
PART A Answer all questions (8*5=40 marks)
1. (a). What is system analysis and design? Explain. Or (b). Distinguish between testing
and evaluation.
2. (a) Explain the need for cost and benefit analysis. Or (b) what steps do investigators
doing the preliminary investigation take? For what purpose are they taken?
3. (a) List the primary uses of a decision table. Or (b) explain the basic rules for drawing
data flow diagrams.
4. (a). What is requirement determination? Explain. Or (b). List and explain the primary
steps in interviewing.
5. (a). List and explain the various types of file. Or (b). Write short notes on database
concepts.
6. (a). Explain the difference between sequential and direct access organizations. Or (b)
List and explain the design objectives.
7. (a). Give the purpose of constructing HIPO diagrams. Or (b). What is assurance?
Explain the various levels of assurance.
8. (a). What is the relational between conversion and system implementation? Explain. Or
(b) List and explain about the financial factors.
PART B Answer all questions (5*12=60 marks)
9. (a). Explain in detail about the testing methods used to test project feasibility. Or (b)
Discuss in detail about managing project review and selection.
10. (a). What elements comprise systems costs? What are the different categories of system
costs? Explain. Or (b). Explain in detail about the strategies for cost/benefit
comparison.
11. (a) Discuss in detail about the steps that should always be taken to develop and
administer questionnaires. Or (b) how are data and processes described in a data
dictionary? Explain briefly.
12. (a). What is system reliability? Discuss the approaches to system reliability. Which
approach is preferred? Why?
Or
(b) Discuss about any two methods of file organization in detail.
13. (a) Describe the purpose and contents of a conversion plan. Or (b). Discuss about
the various factors involved in evaluation of the software.
M.C.A Second Year May 2006
PAPER-IV RELATIONAL DATABASE MANAGEMENT
Time: Three hours maximum: 100marks
PART A Answer all questions (8x5=40 marks)
1. (a) List the advantages of RDBMS. Or (b). What is meant by entity set? Explain with an
example
2. (a) Write short notes on tuple relational calculus. Or (b) what is an index? How it is
used in RDBMS?
3. (a) Compare data retrieval in network model and hierarchical model. Or (b) Explain the
concept based on relational database design with respect to repetition of information.
4. (a) What is view? Whether multiple view updations are applicable in RDBMS? Or (b).
Explain about aggregate operators in detail.
5. (a). Explain the anomalies in relation database design. Or (b) Explain the BCNF with
examples.
6. (a) Write short notes on snapshots. Or (b). What is RQBE? What is its role in database?
7. (a) Explain the theory of multi-valued dependencies. Or (b) Explain in detail about lossless-
join decomposition.
8. (a). What is distributed database? Where it is in high demand? Or (b) Write down the
method of providing security to the relational database.
PART B Answer ALL questions (5x12=60 marks)
9. (a) Explain about different keys available in RDBMS and write down the significance
each key with an example. Or (b) explain the different access methods and storage
structures in RDBMS.
10. (a) Discuss the data modeling concepts in detail. Or (b). What is correlated sub query?
Illustrate with an example of a correlated sub query projection and union operation as
relational algebra expressions.
11. (a). Explain with example, the different operations in relational algebra. Or (b) Explain
the following terms: I) Full functional dependency. II) Temporal Relational model. III)
Repetition of information
12. (a) Explain in detail, the various stages involved in compiling a query with a neat
diagram. Or (b) describe the security issues and integrity factors regarding database
systems.
13. (a) Explain how will you normalize the given table to the third normal form, by
assuming your own table. Or (b). Discuss in detail about database administration?
M.C.A Second Year May 2006
PAPER-V DATA STRUCTURE USING C++
Time: Three hours maximum: 100marks
PART A Answer all questions (8x5=40 marks)
1. (a) Explain the basics of C++ languages. Or (b) what are abstract data types? Give
example.
2. (a) Discuss the array as an Abstract Data types in detail. Or (b) Discuss the string as an
Abstract Data type in detail.
3. (a). Discuss about templates in C++. Or (b). Explain in detail about inheritance.
4. (a). What are singly linked lists? Describe how to represent them in C++. Or (b) what
are virtual functions? Give examples.
5. (a). What are circular lists? Give examples. Or (b). Give a brief account on linked
stacks and queues.
6. (a). Discuss in detail about static hashing. Or (b). Give a detailed description about
Binomial Heaps.
7. (a) What is a AVL Trees? Give examples. Or (b) Discuss in detail about optimal binary
search trees.
8. (a) What are B trees? Give examples. Or (b). Describe the features of Heap structures
PART B Answer ALL questions (5*12=60 marks)
9. (a) Explain the following: I) Data Abstraction and encapsulation II) system life cycle.
10. (a) What are doubly linked lists? Describe how to represent them in C++. Or (b).
Describe the following: I) A reusable linked list class. II) Dynamic binding in C++.
11. (a). What are binary trees? Explain the various binary tree traversals with
examples. Or (b). Give a detailed description on threaded Binary Trees.
12. (a). Discuss in detail about optimal Binary search trees. Or (b). Write notes on the
Following: I) AVL Trees. II) B-Trees.
13. (a) Discuss the various features of Hashing. Or (b). Give a detailed account on Heap
Structure.
MCA Second year MAY 2006
PAPER VI - COMPUTER BASED NUMERICAL METHODS
Time : Three hours Maximum: 100 marks
PART A Answer ALL questions. (8 x 5 = 40 marks)
1. (a) Use the Secant method to determine the root of the equation x4 - x -10 = 0 .
Or
(b) Apply Newton - Raphson's method to determine a root of the equation x - e -x = 0 .
2. (a) Find 2 iterations with the Muller method for the following equation X3 –1/2 =0with X0 = 0.
Or
(b) Find two iterations with the Chebyshev method for finding root of the equation
x = 1/2 + sin x with Xo = 1.
3. (a) Solve by Gauss elimination method for the following
x+y+z=3
2x- y+3z= 16
3x+y-z=-3.
Or
(b) Solve by Triangularization method
x+5y+z=14
2x+ y+ 3z= 13
3x+ y+4z=17.
4. (a) Solve the following system of equation by using Gauss - Seidel method
8x-3y+2z= 20
4x+lly-z = 33
6x+3y+12z= 35.
Or
(b) Find the inverse of A =
using partition method.
5. (a) Using Lagrange's formula, fit a polynomial to the data.
Or
(b) Prove that = 1/2 2 + 1+ 2/4
6. (a) Using Newton's divided difference formula find f(8) from the following data:
(b) Find the approximate value of f' (2.0) and f"(2.0) using the methods based on linear
interpolation
7. (a) Compute r(0.6) from the following table using the formula Richardson extrapolation.
x: 0.2 0.4 0.5 0.6 0.7 0.8 1.0
f(x): 1.42 1.88 2.13 2.39 2.66 2.94 3.56
With h=0.2.
Or
3 -1 1
3 -1 1
5 -2 2
X : 0 1 3 4
Y : -12 0 6 12
X : 4 5 7 10 11 13
F(x): 48 100 294 900 1210 2028
X : 2.0 2.2 2.6
Y : 0.6932 0.7885 0.9555
(b) Solve the equation dy = 1- y given y(0)= 0
dx
using Euler method for the solutions at x = 0.1, 0.2, 0.3
8. (a) Solve the initial value problem y' = y = (2x/y) y(0) = 1 for x=01 ,0.2
using backward Euler method
Or
(b) Using mid-point method find y(0.1), y(0.2)
given (dy/dx) = X2 + y2 , y(0)=1.
PART B Answer ALL questions. (5 x 12 = 60 marks)
9. (a) Using Bairstow's method to obtain the quadratic factor of the equation
X4 - 3X3 + 20X2 + 44x + 54=0 with (p,q) = (2,2) (perform three iterations).
Or
(b) Using Graeffe's root squaring method to find the roots of X4 - X3 + 3X2 +X-4 =0.
10. (a) Find the largest eigen value of
and the corresponding eigen vector.
(b) Find all the eigen values of the matrix.
11. (a) Obtain a linear polynomial approximation
to the function f(x)= X3 on the interval [0,1] using the least square approximation.
Or
(b) Find the least squares approximation of second degree for the data.
0.8
12. (a) Calculate
(1 + sin x/ x) dx correct to four decimal places.
0
(Or)
5 5
(b) Evaluate
dx dy / (x2 + y2) 1/2 using the trapezoidal rule.
1 1
13. (a) Given the initial value problem u' = t2 + u2,u(O)= 0 find the Taylor series for u(t) and
hence obtain u(0.5)
(b) Solve the initial value problem u'= -2tu2, u(O)=1 with h = 0.1 for x=0.l, 0.2. Use the
fourth order classical Runge -Kutta method.
M.C.A. Second Year May 2006
PAPER VII - MULTIMEDIA AND ITS APPLICATIONS
Time: Three hours Maximum: 100 marks
PART A - (8 x 5 = 40 marks) Answer ALL questions.
1. (a) Describe the various stages of a multimedia project. Or
(b) Describe the role of a multimedia designer and interface designer.
2. (a) Give some of the applications of multi media. Or
(b) Write short notes on creativity.
3. (a) Explain about Macintosh platform. Or
(b) Explain about any three memory devices used in multimedia.
4. (a) Give the features of a good 3D – modeling tool. Or
(b) Write notes on time based authoring tools.
5. (a) Explain about icon based authoring tools. Or
(b) How will you make MIDI audio? Explain
6. (a) Write short notes on computer color models. Or
(b) What are the sound editing operations used in multimedia? Explain.
7. (a) Explain about broadcast video standards. Or
(b) List the Tips for shooting video for multimedia project.
8. (a) Write short notes on internet address. Or
(b) Explain Web servers and Web Browsers
PART B (5 x 12 = 60 marks)
9. (a) Explain the requirement of multimedia in detail. Or
(b) Explain the following:
(i) Connections in multimedia
(ii) Communication devices.
10. (a) Explain in detail about input devices used in multimedia. Or
(b) Explain in detail about animation, video and digital movie tools.
11. (a) Explain about the features of authoring tools. Or
(b) Describe about card and page based authoring tools.
12. (a) Give all the design suggestions considered while choosing text fonts. Or
(b) Write short notes on :
(i) Audio file format
(ii) Image file format.
13 (a) Explain about various recording formats in detail. Or
(b) Explain the images and sound used for the web
MCA Second Year May 2006
Paper VIII - OPERATING SYSTEM
Time: Three hours Maximum: 100 marks
PART A Answer ALL questions. (8 x 5 = 40 marks)
1. (a) Write short note on early operating system. List the differences between
Multiprogramming and Time-sharing systems. Or
(b) Explain the architecture of an operating system.
2. (a) List out the various process states and briefly explain with a state diagram. Or
(b) What do you mean by processor scheduling? Explain the various levels of scheduling.
3. (a) Explain the methods of dead lock prevention and avoidance. Or
(b) Write briefly on fragmentation and swapping.
4. (a) Why disk scheduling is necessary? Explain the different seek optimization techniques.
Or
(b) Describe the different mechanisms used to protect a file.
5. (a) Explain the design principles of Unix
(b) Write a short note on Unix file system
6. (a) Write short notes on Demand Page Memory management. Or
(b) What is segmentation? State it usages.
7. (a) Explain the concepts involved in maintaining the file system security. Or
(b) Write short notes on double - buffering.
8. (a) List the various merits of treating directories and devices as file in Unix. Or
(b) Write short notes on I/O systems on Unix.
PART B Answer ALL questions. (5 x 12 = 60 marks)
9. (a) Explain the various functions of an operating system from a system programmer's
view.
Or
(b) What is s'emaphore? Explain the application of semaphore.
10. (a) Compare preemptive and non-preemptive algorithm. Or
(b) Explain the Banker's algorithm for dead -lock avoidance.
11. (a) Explain any four page replacement algorithms. Or
(b) State about virtual memory concept.
12. (a) Describe the various disk scheduling algorithms. Or
(b) Give an overview of the various protection and access control mechanisms
implemented in a
file system.
13. (a) Discuss the file protection mechanisms incorporated in a Unix file system. Or
(b) List the calls in Unix for process management and write the function of each.
MCA Second Year MAY 2006
PAPER IX Elective - ARTIFICIAL INTELLIGENCE
Time: Three hours Maximum: 100 marks
PART A Answer ALL questions. (8 x 5 = 40 marks)
1. (a) Define artificial intelligence. Explain how do AI problems differ from normal problems.
Or
(b) What is an AI technique? Discuss.
2. (a) Define a problem. Explain the state space representation method of a problem with an
example. Or
(b) Discuss A * algorithm.
3. (a) Discuss mini-max search procedure with examples. Or
(b) Explain the following: (i) Futility cut off (ii) Horizon effect.
4. (a) Describe the steps involved in translating a wff to clause form. Or
(b) Write short notes on Non-monotonic Reasoning.
5. (a) Give a brief discussion on frames. Or
(b) Describe the components of an Expert system.
6. (a) Explain case grammars Or
(b) Give a brief note on understanding
7. (a) Write a note on procedural representation Or
(b) Describe concept learning.
8. (a) Explain discovery as learning. Or
(b) Discuss learning by analogy.
PART B (5 x 12 = 60 marks)
9. (a) Discuss in detail the areas of AI. Or
(b) Explain the organization of AI systems.
10. (a) Elaborate the characteristics of a problem. Or
(b) Discuss the following:
(i) Production systems
(ii) Means ends analysis.
11. (a) Briefly discuss the alpha beta algorithm with suitable examples illustrating the cutoffs
clearly.
Or
(b) Give a detailed account on scripts.
12. (a) Write a note on natural understanding language in general. Or
(b) Explain the use of frames and scripts in understanding.
13. (a) Describe Rote learning. Or
(b) Explain learning in GPS.
MCA Second Year MAY 2006
PAPER X Elective - MODERN COMMUNICATION
Time: Three hours Maximum: 100 marks
PART A Answer ALL questions. (8 x 5 = 40 marks)
1. (a) Why we need for modulation? Explain AM. Or
(b) Briefly explain the single - sideband modulation and demodulation.
2. (a) Compare AM with FM. Or
(b) Explain directly modulated FM transmitters. Explain AGC and AFC
3. (a) Explain AGC and AFC Or
(b) Explain single tone and multi tone FM
4. (a) Explain in detail about PCM. Or
(b) Explain in detail about PAM sampling.
5. (a) Explain in detail Flat-topped PAM sampling. Or
(b) Compare the FSK with ASK.
6. (a) Explain in detail about microwave communication. Or
(b) Describe in detail about mobile dispatch system.
7. (a) Discuss about the Losses in Fibers Or
(b) Explain the p-n photo diode detectors
8. (a) Explain the basic principles of television Or
(b) Discuss about the generation of composite receivers.
PART B Answer ALL questions. (5 x 12 = 60 marks)
9. (a) Briefly explain the balanced modulator circuit. Or
(b) Draw and explain the block diagram of AM transmitters.
10. (a) Sketch the graphs and explain equivalent frequency deviation and average noise power
output for noise in FM receiver. Or
(b) Discuss about the narrow band FM and wide band FM.
11. (a) Explain the pulse transmission system and encoding system. Or
(b) Briefly explain the digital modulation techniques
12. (a) Explain in detail about Satellite Communication system Or
(b) Define orbit and Station keeping. Explain the detail about transmission path in Satellite
system.
13. (a) What is the advantage of using a graded index core in a fiber? Explain how energy is
lost from fiber at a sharp bend. Or
(b) Briefly explain the block diagram of black and white television receiver.
Return to question paper search
|
|
|
Submit Previous Years University Question Papers and make money from adsense revenue sharing program
Are you preparing for a university examination? Download model question papers
and practise before you write the exam.
|
Watch TV Channels
|