University of Mumbai 2007-2nd Sem M.C.A Computer Aplications - Question Paper
MCA Sem - two Dec
r Ji' jViWupjto fjzJtSc-<3 AJy
Con/4868-07. ' Bfk/3652
(3 Hours) [Total Marks : 100
Note:
1. Question no. 1 is compulsory.
2. answer any four out of the remaining six questions -
3. answer to questions should be grouped and written together.
4. use legible handwriting . use a blue/black ink pen to write answers. Use of pencil should be done onlHo draw diagram and graphs.
5. All questions carry equal marks.
1. A. Explain the following approaches to management in detail ; (15)
I) Scientific approach of F W Taylor
II) Human relations approach of Elton Mayo
B. Explain the concept of MBO. (5)
2. A. Explain the following 2 theories of motivation (10)
I) Theory of X and theory of Y M) Herbergs theory
B. What is new product development. (10)
3. A. Explain organization structure? And explain matrix organization with
example. (10)
B. Discuss the marketing research in detail. (10)
4. A. Explain leadership and characteristics of good leader. (10)
B Discuss the main features of marketing mix-,, (10)
5. A. What is performance appraisal and explain the methods of performance
appraisaU (10)
B. Distinguish between power and authority . Authority and responsibility
goes hand in hand together explain , (10)
6. A. Explain internal and external sources of recruitment. (10)
B. Explain the main functions of management. (10)
7. Write a short notes on any 4_ ; (20) Fund flow TQM
Ratio analysis iv> Foreign market v. Systems approach
N.B. 0 Question l_ is compulsory..
Con/4864-07.
(3 Hours)
2) Attempt any four out of the remaining questions.
3) Assumptions should be made whenever required and should be clearly stated.
4) Answer to questions should be grouped an written together.
1. a) Explain briefly the following terms: 10
i) External fragmentation,
ii) binary semaphores,
iii) paging,
iv) threads,
v) thrashing
b) i) Describe the differences among short-term, medium term and long 5 term scheduling.
ii) What are the main functions of an operating system? 5
2. a) Explain the difference between micro kernel and monolithic kernel 8 architectures. Give examples of both types of operating systems
b) Given a system that uses round-robin scheduling, assume that it 12
performs context switch in zero time.
1. If the following conditions prevail, what will be the execution time of a process?
i) ready queue always contains n processes
ii) each process is allowed to run only one instruction before context switch is made and CPU is allotted to another process
iii) a process takes t microseconds to execute in a uniprocessing environment
2. If the context switch takes m microseconds for a context switch and there are p* instructions in a process, calculate the execution time of a process in above conditions.
3- a) What is meant by process priority? How many different types of 10
priorities are there and how important is the role of priority in process scheduling?
b) Explain the concept of DMA and the goals of I/O software. M 10
[ TURN OVER
H'Oft Genyu' pec- 2-ocr. Ope'TrCMtr
Why is the average search time to find a record in indexed sequential file less than that for a sequential file?
;-3648-C7.
What is the concept of working set? How is the resident set size determined? Briefly descrifcjg the different policies in determining the working set size.
Compare the performance of C-SCAN and SCAN scheduling assuming uniform distribution of request.
Suppose that a disk driver has 500 cylinders, numbered 0 to 499.The drive is currently serving a request at cylinder 143 and the previous request was at cylinder 125. The queue of pending requests in FIFO order,is:
86, 147, 412, 91, 177, 48, 309, 222, 175,130
Starting from the current head position, what is the total distance in cylinders, that the disk arm moves to satisfy all the pending requests for each of the following disk scheduling algorithms?
i) SSTF, ii) SCAN, iii) C-SCAN
Explain in brief the advantages of segmentation and paging. Why are these two schemes combined in some systems? List the advantages of segmentations over paging.
Of)
In a simple paging system with 2 bytes of physical'memory, 128 pages of logical address space and page size of 210 bytes, how many bits are in logical address? Explain the difference between physical address space and logical address space
Write short notes on any four
|
i) |
Buffering |
|
ii) |
Spooling |
|
iii) |
RAM disk |
|
iv) |
Bankers Algorithm |
|
v) |
Deadlocks |
|
vi) |
Clocks. |
240 : 2ndHf-l
Con. 4866-07. M C. S-C-'m -Z5JT BB-3642
(3 Hours) [ Total Marks : 100
N.B: (1) Question No. 1 is compulsory.
(2) Attempt any four out of remaining six questions in which two questions should be from Question No.2 to Question No. 4 and remaining two questions from Question Nos. 5 to 7.
(3) Assume any necessary data but justify the same.
(4) Figures to the right indicate marks.
(5) Use of calculator is allowed.
1. ( a) Obtain the recurrence relation and initial conditions to find the maximum number [10]
of regions defined by n lines in a plane. Assume that the lines are not parallel and lines not intersecting at one point, n>2. Solve the recurrence relation.
(b) Prove that Mean, Median and Mode of Normal Distribution Coincides. [10]
2. ( a) The joint probability density function of the two dimensional random variable (X, Y) [10]
is given by
f(x, y) = 2; 0 <x< 1, 0 <y <x ; .
= 0; elsewhere
i) Find the marginal distribution functions of X and Y.
ii) Find the conditional distribution of x | y and y | x.
iii) Check for independence of X and Y.
(b) (i) A consignment of 16 CD Player contains 5 defectives. The CD Players are selected [5] at random, one by one, and examined. These examined are not put back. What is the probability that the 10th one examined is the last defective?
(ii) A man with n keys wants to open his door and tries the keys independently and at [5]
random. Find the mean and variance of the number of trials required to open the door if unsuccessful keys are eliminated from further selection.
3. (a) (i) Let Xj, X2 be independent random variables each having geometric distribution. [5]
Show that the conditional distribution of Xi given Xi + X2 is uniform.
( ii) A department in the works has 10 machines which may need adjustment from time [5]
to time during the day. Three of these machines are old, each having the probability
of yy of needing adjustment during the day and 7 are the new, having
corresponding probabilities of . Assuming that no machine requires adjustment
more than twice on the same day, determine the probabilities that on a particular day if just two machines need adjustment, they are of the same type.
(b) (i) The joint probability distribution of two random variables X and Y is given by : [5]
P(X = 0, Y= 1)= 1/3,P(X= 1, Y = -l)= 1/3 and P(X = 1, Y = 1) = 1/3
Find the Marginal Distributions of X and Y and the conditional distribution Of X
given Y = 1.
ii) In the following figure assume that the probability of a relay being closed is P and [5]
that a relay is open or closed independent of any other. Find the probability that current flows from L to R.
[ TURN OVER
Con. 4866-BB-3642-07. 2
4 (a) i) The marks obtained by a number of students for a certain subject are assumed to be [5] approximately normally distributed with mean value 65 and with a standard deviation of 5. If 3 students are taken at random from this set, what is the probability that exactly 2 of them will have marks over 70.? ii) Prove that Poisson distribution is a limiting case of the binomial distribution. [5]
( b) i) If X has an exponential distribution, then for every constant a > 0, one has P(Y < x | X > a) = P(X < x) for all x, where Y = X a. ii) If four squares are chosen at random on a chessboard, find the chance that they [5]
should be in a diagonal line.
i) Solve the following recurrence relation a= 5a_i - 6an_2, using the generating [5]
5 (a) (b)
functions, n > 2, with the initial conditions ao=6 and ai =30.. ii) Let {a,,} and {bn} be sequences of real numbers. [5]
i) Find the particular solution of an-6ail_i+9an.2 = (n+l)x3n [5]
i) What is the solution of the recurrence relation an = 2an-i - a, with initial condition [5]
ai=1.5, a2=3.
6. (a) i) In how many ways may n girls and n boys be seated in a row of 2n chairs, if the two sexes must alternate ? ii) Find the number of positive integers between 1 and 600 inclusive , which are not divisible by 2, 3, 5 or 7 ?
[5]
[5]
[5]
[5]
(b) i) How many onto functions are there from a set with six elements to a set with three elements ?
ii) The shopkeeper has to dispatch 9 parcels of the same size in three boxes. The first box cannot accommodate more than 4 parcels, the second cant accommodate more than 3 parcels, while the third cant accommodate more than 2 parcels. In how many ways can the shopkeeper dispatch these parcels i?
7. (a) i) Give a formula for the coefficient of xk in the expansion of (x2 1/x)100. [5]
ii) Prove Vandermondes identity using combinatorial arguments [5]
(b) i) How many ways are there to distribute hands of 5 cards at a time to each of four players [5] from the standard deck of 52 cards ?
ii) A machine that inserts letters into envelopes goes haywire and inserts letters randomly into [5] envelopes. What is the probability that in a group of 100 letters
No letter is put into the correct envelope ?
Exactly 1 letter Is put into the correct envelope ?
Exactly 98 letters are put into the correct envelope ?
Exactly 99 letters are put into the correct envelope ?
All letters are put into the correct envelope ?
Y-n C- ft -ero --TT Pec- 5*7
Con/4861-07. MyaOCec| Oam > f [\ g+YUC-'u', BB3639
(3 Hours) [Total Marks : 100
Note: 1) Question No. 1_ is compulsory.
2) Answer any four from remaining six,
3) All questions carry equal marks.
(10)
(10)
Q. 1 A) Differentiate the following terms:
i) Directed & Undirected Graphs
ii) Internal and external sorting B) Explain the following terms:
i) Binary Tree ii) Max Heap iii) Collision
iv) AVL Node Structure
Q.2 A) Given the set of symbols and corresponding frequency table as below, explain the
steps to find Huffman code: (10) Symbol ABCDEF G H I Frequency 9 6 5 3 1 127 8 4
B) Describe in detail Relative File and its access method. (10)
Q.3 A) What do understand by ReheapUp? Write an algorithm for the same. (10)
B) Explain with suitable example, how to find out the shortest path between two
nodes in a graph and also write the algorithm for the same. (10)
Q.4 A) Consider the following set of numbers: (10) 85 36 87 10 91 18 15 52 73 34
Implement a heap sort on this array and show the resulting array after every pass.
B) Using the digit - extraction method (first, third and fifth digits) & quadratic probing, store the keys shown below in an array with 19 elements. How many collisions occurred? What is the density of the list after all keys have been inserted? (10)
224562 137456 214562
140145 214576 162145
144467 199645 234534
Q.5 A) What is a general tree? Explain the conversion of a general tree to binary tree with the help of a suitable example , (10)
B) Given the set of numbers, create B-tree of order 3 and show the deletion of any three numbers from the same.
28 7 26 98 19 31 50 41 (10)
Q.6 A) What is inverted file organization? Where is it used?
B) Write the pseudocode for:
i) Rotate AVL tree right.
ii) Counting the total number of nodes in a binary tree. (10)
Q.7 A) Write short notes on: (10)
i) Direct File Organization
ii) Multilist File organization
B) Give the Breadth First Traversal and Depth First traversal of the graph in the figure given below: (10)
|
Attachment: |
| Earning: Approval pending. |
