How To Exam?

a knowledge trading engine...


University of Mumbai 2006-2nd Sem M.C.A Computer Aplications - Question Paper

Wednesday, 17 July 2013 05:00Web


MCA Sem - 2

___f?A TT    I n (2SpiP"rc\    ]f\A O-TC,

C02014~06.    BB-6922

   ( 3 Hours )    I Total Marks : 100

N.B. : (1) Question Nb.l is compulsory.

(2)    Attearpt any four questions from the remaining six questions.

(3)    AJ.1 questions carry equal marks*

0.1 a) T. W Tayior suggested rationalizing work for greater labour productivity while Elton Mayo recommended humanizing work for enhanced efficiency and personal satisfaction.1* Discuss.    12

b) Write short note on,    03

i)    Work study

ii)    Materials Management

iii)    Quality Circles

, Q.2 a) Explain following approaches to management in detail,    10

-    i) System approach

ii) Contingency Approach

bj Explain the concept of Management By Objectives with its process, advantages and disadvantages.    10

Q.3 a> What is organization structure? Explain Matrix Organization with examples, advantages and disadvantages.    10

b) What is delegation of authority? Explafn principles of delegation of authority.    -jq

Q. 4 a) Explain following two theories of Motivation.    12

i)    Theory X & Theory Y

ii)    Herzberg's Two factor Theory

b) Define Leadership. Also explain characteristics of good leader, 08

Q.5 a) What is Marketing Research? What is the need & factors affecting Marketing Research?    12

t>) What is new product development? Explain steps in new product development,    00

Q.6 a) What is Production Planning and control? Explain it functions. 03

b) Explain system approach in organization. Also explain different types of production systems.        -J2

Q.7 a) What is financial analysis? Explain the following,    12

i)    Cash flow analysis

ii)    Fund flow analysis

iii)    Ratio analysis

b) Define multinational firm. What are the ways through which a multinational firm can organize its activities?    06    "

_S4-    2-<n>&

c-iji. 'icrtS'pj* t    ILmPI & ho    4V 0 v*

Con. 1685-06;    BB-6915

(3 Hours)    I Total Marks : 100

N,B. (1) Question No. 1 is compulsory.

(2)    Answer any tour out of remaining six questions*

(3)    Figures to the rfght Indicate marks.

(4)    Answer to questions should be grouped and written together i.e. all answer to sub-questions ol individual question like Q. Nos. 1, 2, 3 etc. should be answered one uelow tlie other,

Q. 1 (a) Built Railway Reservation System. Draw contest level diagram, DFD up io two level,

ER diagram, draw input, output screen .    (15)

(b) How data dictionary can be used during software development ?    (5)

Q. 2 (a) Under what circumstances of for what purposes would one use an interview rather than

other data col lection methods ? Explain    (12)

(b) Describe steps in SDLC model with an example.    '    (S)

Q. 3 (a) What are CASE tools ? Explain some CASE tools used for prototyping,    (10)

(b) what is cost/benefit analysis *> Describe any two methods of performing the same.    (10)

Q, 4 (a) Write a detailed note about the different levels and methods of testing software.    (10)

(b) Explain the concept of Normalization with examples. Why would you    (10)

denormoralize ?

Q. 5 (a) What are structured walkthroughs & how are they carried out ? Describe the composition of walkthrough team,    (W)

\ (b) What is user Interface design ? what tools is used to chart a User interface Design. (10)

Q. 6 (a) Describe the different methods of file organization. Illustrate with examples, for what type of systems, which type of file organisation methods can be used.    (12)

, (b) What is mean by prototype ? What Is its use In application prototyping.    (OS)

Q. 7 (a) Distinguish between reliability & validity how are they related?    (OS)

(b) Write short note on :*    (12)

(I) Structure Charts    (ii) MJPO charts

(iii) Security and Disaster Recovery.    (iv) List Of Deliverables..

-h-iVfiteeJL 2*+* A a>f; 2-

Con. 1691-06.    BB-6910

fil >IN


t    (3 Hours)    [ Total Marks: 100

M.B. (1) Question No, 1 is compulsory,

(2)    Attempt any four from question Nos, 2 to 7, *

(3)    Assume suitable data wherever required.

(4)    State your assumptions clearly.

(5)    Answers to sub questions ol any individual questions should be wrilien together

(S)    Use ol pencil should be done only to draw diagrams and graphs,

' {7)    Figures to the right indicate marks.

(a)    Define binary search 1res. Write a pseudo cods for inserting an element In binary search Iree, in

i,


(b)    Find the Huffman's code for each of the Following characters

A 0 C D E F    W

45 13 12 16 9 5 Write lha pseudo code for the same,

(a) Whal is hashing 7 Explain the terms synonyms, collision and home address, Using modulo-tf vision 10 and linear probing method, store the keys given below [n en array of 13 elements. How many collisions occured ?

2,


2B

7

846

70S

431

070

612

675

876

54

34

12

(b) Explain the need for balancing binary search tree. Explain with suitable example the concept and 10 construction of balanced AVL trees.

(a)    Describe in detail Indexed Sequential Access Method,    to lb) Write an algorithm for sorting the elements using shell sort. An array contains the elements shown 10

below, Show the conients of the array alter it has gone through a one-increment pass ol the shell sort. The increment factor rs k 3-.

.    33 3 7 13 09 7 66 2 6 44 18 90 98 57

4.    [a) (J, Define m-way trees, How are B and B+ trees used to maintain indexes 7    5

(ii) Build a B-tree of ordr-f 4 by inserting the following data In the sequence glvn below :    5

92 24 6 7 11 a 22 4 5 16 19 20 78

(b)    With a suitable example explain with slaps to find the path matrix using Wmhall's Algorithm. 10

5.    fa) Create a binary search tree of the following data entered as a sequential set    10

14 33 7 10 33 56 B0 66 70 (b) Write an algorithm for depth first traversal ol a graph, Traverse the following graph using breath 10 firsi and depth first approach from node A*

Con, t631S8-69lB-06.

6. (a) Explain preorder, inorder and post order traversal ol a trie, Give (he preordej, inorder and post 10 order listing of tte nodes ol tlie Mowing:

BE L lip-


(t>) Write a start notes on any two of Ihe lollowing10 ji) Multilist File Organizalion |ii) Quicksort

(iii) Relative File Organization.    .

7. (a) What is a spanning tree 1 What Is a minimum spanning tree ? Write an algorithm to find the to minimum spanning ires.

(b) An array contains the elements shown below, Using the binary search algorithm, trace Ihe steps 10

followed to find 88. At each loop Iteration including the last, show the contents ol Ihe first Iasi and mid.

8 13 17 26 44 56 68 97

N.B. (1) Question No. 1 is compulsory.

(2)    Attempt an/ four out Of remaining six questions in which Two questions should be from Question Nos. 2 lo 4 and remaining two questions from Question Nos. 5 (o 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) (i) Use the method of homogeneous solutions and particular solution to solve ~ 200jit_j I 00 with initial condition a0 = 1.    [5]

(ii) The solution of the recurrence relation    + C(iu_t 4-Czan_2 = _/"() is 2"*t-33+5.

Given that f(n)=40 for nil n. Determine C,, Cz.    [5]

b) A binary communication channel carries data as one of two types of signals denoted by 0 and 1. Owing to noise, a transmitted 0 is sometimes received as 1 and a transmitted

I is sometimes received as 0. I;or a given channel, assume a probability of 0.94 that a transmitted 0 ii correctly received as a 0 and a probability of 0.91 that a transmitted 1 5 correctly received as a I. Further assume a probability of 0,45 of transferring a 0, If a signal is sent, determine:    [10]

(i) Probability Ifial a I is received,

(iii Probability that a 0 is received.

(iii)    Probability Lhat a I was transmitted given that 1 was received.

(iv)    Probability that 0 was transmitted, given that 0 was received.

(v)    P robab i J i Ly o f an erro r.    

2. a) The joint probability density function of the two dimensional random variable (X,Y) is given by

0,    ttifui

rwtxe


(i)    Find the marginal densities of X and Y.    [5]

(ii)    Find the conditional density function of Y given X=x, and the conditional density function olX given Y=y,    [5]

b) CO A bag contains 2 red, 5 white and S blue balls. Two balls are drawn at random from it. What is die probability lhat one is white and other is blue?    [5]

(ii) Let X be a random variable for which E(X)=I0 and V(X)=25. Find the values of a and b such lhat Y=aX-b has expectation zero and variance ].    [5]

3- a) (i) An inspection plan calls for inspecting five chips and for either accepting each chip, rejecting each chip, or submitting it for reinspection, with probabilities of pi0,70, P20.20, pj=0.10 respectively. What is the probability that at least one of the chips must be reinspectcd?    [5]

(ii) State and prove Baye's Theorem on probability,    [5]

b) (i) X and Y arc two random variables having joint density function

ft*,y) - +

where x and y can assume only integer values 0,1 and 2, Find the conditional distribution 0fYforX=x.    [5]

4.    a) (i) The number of jobs arriving at a computer center between 9am and 10 am is a random variable X with u Poisson distribution with mean 2. The number of jobs arriving between 10 am and 11 arn is a random variable Y with Poisson distribution with mean 6. If X and Y arc independent, find the probability that more than 5 jobs will arrive between

9 am and 1 1 am. .    [5]

(ii) If X and Y are independent random variates following N{8,4) and N(12*4S) respectively, find the value of X such that

P(2X~Y2X.) = l1(X+2YA.)    [5]

Where N follow normal distribution with parameters j and cr3 is denoted by N(p, o2).

b) (i) Prove that exponential distribution is memory|ess.    [5J

(ii) A chord is Lakcn at random in a circle. What is the chance that its length, I is not less than 'a, radius of the circle?

5.    a) What is the solution of the recurrence relation art=6afl.1-9aJv.2> with Initial condition -30=1, aj=6.    [5]

,    fO    0<<2

(0 Let an = -I    Find Vatl    [5]

" \2~" +3    3    1 J

b) (i) There are 4 tuples of books on operating systems, 3 copies of another book on Java, and 3 copies oT a third book on Visual Basic. Find the different number of ways in which they can be arranged in a line on a shelf? How many of these arrangements will have two books on Virtual Basic at two ends?    [5]

tii) Give a formula for the coefficient of x in the expansion of (-if.

6.    a) (i) Use the generating functions to solve the recurrence relation    .

a,?**.i, with ihc initial condition Od=S,    [5]

(ii) If m, n, and r are nonnegative integers with r not exceeding either m or n. Then, using combinatorial arguments* prove that

M=W0    E5]

b) (i) An elecLiomcs shop has eight different varieties of mobile phones. How many ways are there to choose i2 mobile phones.    [5]

(ii) Find the number of permutations of the letters in the word INSTITUTE1 when letters are taken all at a Lime.    [5]

7,    a) (i) Each user on a computer system has a password which is six to eight characters long, where each character is an uppercase letter or a digit. Find the maximum number of possible passwords.    [5]

(ii) Prove that Q + (") + (4) +- (")+(3)

+ *.*=2n-1    .    [5]


b> (i) Find the number of solutions of the equation ee+ej17 if e2 ,e3 are non-negative integers wiLh 2<ei5t 3<ie2<{5, 4<e3<7.    [5]

Q, No, 1 is eoopulgprry.

Attenjt any four of remaining six questions.

L aj Consider the following set of processes, with the length of the CPU burst time given in milliseconds:

Process    Burst Time Priority

PI    10    3

P2    1    1

P3    2    3

P4    1    4

P5    5    2

The processes are assumed to have arrived in the order Pi. Pj, P3, P, and P5 alI at time 0*

1.    Draw four Gantt charts illustrating the execution of these processes using FCFS,SJF, a nonpreemptive priority{a smaller priority number implies a higher priority) and RR(quantum=l) scheduling.

2.    What is the turnaround time of each process for each of the scheduling algorithms in part 1,

3.    What is the waiting time of each process for each of the scheduling algorithms in part 1.    10

b) What are the main functions of Operating System?    5

e) Explain Ciock hardware & software in I/O Systems.    5

2.    aj What are the criteria of CPU scheduling? What are the contents of Process

Control Block?    10

y Explain semaphores, binary semaphores, counting semaphores & critical region.

. How is it help in achieving Mutual Exclusion?    10

3.    a) What is thread? Explain various types of threads.    10 b) What is External & internal fragmentation? And discuss the techniques to

overcome fragmentation?    10

4.    a) What are the necessary & sufficient conditions for Deadlock to occur? Explain.

10

b) Given memory partitions of 100 KB , 500 KB, 200 KB, 300 KB and 600 KB(in order), how would each of the first-fit, best-fit and worst-fit algorithms place processes of 212 KB, 417 KB, 112 KB and 426 KB(in order)? Which algorithm makes the most efficient use of memory,    10

5.    al What is the cause of thrashing? How does the system detect thrashing? Once it

detects thrashing, what can the system do to eliminate this problem.    10

b> Explain the elevator algorithm for scheduling disk requests.    10

6.    a) Why security is required? Explain different ways of security.    10 bj Consider the following page reference string:

1,2,3 A3> 1,5,6,2,1,2,3,7,6,3,2,1,2,3,6

How many page faults would occur for the following replacement algorithms, assuming seven frames? Remembe that all frames are initially empty, so your first unique pages will all cost one fault each,

1.    LRU replacement

2.    FIFO replacement

3.    Optimal replacement.    10

iimU    flags'S    4 Xpk'-f'

Con*4272-06*    B&-30B3

( 2 Hours )    i Total Marta : 100

N.B. 11) Q. No. 1_ is oongulsory*

(2)    Answer any four questions out of remaining six question.

(3)    Figures to be right indicated marks,

1-A)    Built a current Admission for MCA system , Draw context level diagram,    15

DFD upto two level, HR diagram, with Input , output Screen along with data dictionary.

BJ Define data structure . What are major types of data structure,    05

2-A?    What cost elements are considered in the cost/benefit analysis ? which do you think 10 is most difficult to estimate to estimate ? why?

B) Discuss the Six Special System test. Give examples.

10


3 A) Describe the concept & procedure used in the constructing DFDs . Using and 10 example of your own to illustrate.

B) What is normalization ? What is purpose of normalization, illustrate the method of normalization of database.

10


4.    A)    What are the major threads of system Security, Which is one of most serious,    08 B)    What are the requirement of good system Analyst 1    12

5.A)    What are CASE tools . Explain same case tolls used for prototyping.    10

B)    WhaL is difference beiween system analysis & system design. How does the focus    10

   of information system analysis is differ from information system design.

6.A;    What are the structural walkthroughs and how are they carried out? Describe the    10 composition of a walkthrough team.

B) Under what circumstances or for what purpose would one use an interview rather than other data collection methods? Explain.

10


7- Write a short note on :

a)    H1PO chart

b)    Warnier orr Diagram

c)    List of deliverables.

d)    SDLC.

N'B' : N.B: (I) Question No. ] ts compulsory.

(2)    Attempt any four out of reinaining si* questions in which two questions should be from Question No.J 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 caEculator is allowed.

1. (i) Give the recurrence relation and initial conditions to find the maximum number 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.    [5]

(ii) Solve the recurrence relation

ana*i-!+3fl-a with initial conditions, aa=l and a|1.    [5]

(b) (i) State and prove Bayes theorem on probability.    [5]

(ti) Out of 100 jobs received at a computer center, 50 are of class 1, 30 of class 2, and 20 of class 3, A sample of 30 jobs is taken with replacement Find the probability that the sample will contain ten jobs of each class. Also find the probability that there will be exactly twelve jobs of class 2.    [5]

2* (a) Given the following bivai iate probability distribution obtain Marginal distribution of X and Y and the conditional distributions of X given Y=2,

_ [10]

XJ

-1

0

1

o '

1/15

2/15

1/15

i

3/15

2/15

1/IS

2

2/15

1/15

2/15

(b) (i) Let A and B be two events with P(A)-p P(B)|and P(AtB). Find P(A/B) and P(B/A).    .    [5]

(ii) A coin is tossed until a head appears, What Is the expectation of the number of tosses required?    [5]

3. (a) (i) Consider discrete random variables X and Y with the joint probability mass function as below.    [5]

-1

0

1

-2

1/16

1/16

1/16

-1

1/S

1/16

1/8

I

1/8

1/16

1/8

2

1/16

1/16

1/16

Are X and Y independent? Are they un-correlated?

(ii) Ten balls are distributed at random among 4 boxes. What is the probability that first box will contain 4 balls.    [5]

(b) (i) A random variable X takes the values 1, 2, 3 and 4 such that

4P(X=1)=2P(X=2)=3P{X=3)=P(X))    [5]

find the probability distribution and cumulative distribution function of X.

(ii) In a binomial distribution consisting of 5 independent trials, probability of 1 and 2 successes are 0.4096 and 0.2048 respectively. Find the parameter lpT of the distribution.    [5]

4. (a) (i) Prove that mean and mode of a normal distribution are equal, [5]

(ii) If X is the Poisson variate such that

P(X=2) = 9P(X=4)+90P(X=6). Find mean of X,    [5]

(b) (i) Prove that exponential distribution is memory less,    [5]

(ii) If X has a uniform distribution in [0J], find the distribution (pdf) of -2 log A1, Identify the distribution.    [5]

5 (a) (i) Use the generating functions to solve the recurrence relation

alt=5a|!.r6a]i,2I kS2, with the initial condition ao=6 a j=30.    [5]

(ii) Find where (a) an=5 > (b) a=7n-4, (c) a11=5n2-n+2 Given that V denotes the backward difference.    [5]

(b) (i) Find the particular solution of aj.-Sar-i+ar.h    [5]

n!

(ii) Using combinatorial arguments* prove that Pinr-1.    [5J

6, (a) (i) How many solutions does the equation

X1+X2+X311 have, if X], *2 ,X3 are non-negative integers,'    [5]

(ii) Find the number of integers between 1 and 250 that are not divisible by 2 nor by 7 but divisible by 5,    [5]

(b) (i) A string containing only 0s, I *s and 2s is called a ternary string. How many ternary strings of length 7 either starts with one bit 2 or end with two bits 1J ?    [5]

[5]


(ii) Verify he Vandermondes Identity tor r=2, m2, n=2.

rm + rt'

' m '

, r j

-E

,kJ

7. (a) (!) What is the coefficient of xy21 in the expansion of (2* - 5)14 ? [5]

(ii) A fruit shop has eight different varieties of mangoes viz M|, M2 ... ,Mj. How many ways are there to choose a dozen mangoes with at least three of "variety M2 and no more than two of variety M?    [5]

(b) (l) In how many ways can three 0s, three ls and three 2s be arranged so that no three adjacent digits are the same in an arrangement?    [5]

(ii) Prove that number of derangements of n symbols is given by    [5]

HCfl- Sitr-U: Sxk.- P*ici?W3 4 fWliceS of y1ryni'>

BB-3895


[ Total Marks : 100


Q. No. 1 is oonpulsory.

Answer any four questions front remaining six questions-Ail questions carry equal narks.

Give brief history of nanagement thought before the twentieth century. What do you understand by scientific management school of thought ? Define Inventory Management ? foy inventory is considered as an important function of production planning and control ?

Define Management. Explain primary and supportive functions of Management, Also explain principles of management.

Write short notes on (arty tvo)

(i) Contributions of Elton Pfcyo.

(ii) Missions and Objectives.

(iii) Strategic Planning,

Define Leadership. Explain various types of leadership styles.

Define Quality Management System (QMS). Explain the concept of TQM with philosophy and principles.

Define product life cycle and product life cycle management.

Explain why product life cycle management has becotne an important marketing management function in ICT companies in these days.

What is meant by perforirance appraisal ? Explain various methods of performance appraisal.


Explain Black and Mouton's theory of leadership in detail. Also state its advantages and disadvantages.

Write short notes on (any three)

(i) Role of Communication in IT industries.    '

(ii) Douglas McGregors theory of motivation.

(iii) SWOT Analysis,

(iv) Incentive System.

Distinguish between power and authority. Authority and responsibility 8 goes hand in hand together. Explain.

Explain organization structure Draw organization chart for a medium 12 scale IT Company with annual sales turnover of 200 million dollar and explain functions of employees at different levels.

Miat is meant by working capital management ? Explain the role and 10 importance of working capital analysis.

Discuss any two strategies/methods for a firm to enter a foreign market, io


XXXXXxxxxx


( 3 Hours )


CD

(2)

13)

(a

{b

Ca

(b


N.B.


10

10

12

3


1.

2.


10

10


(a

Cb


12

8

8

12


(a

(b

Ca

(b

{a

(b


6,


(b


Note: 1) Question No. I is compulsory.

2)    Answer any four from remaining six.

3)    All questions carry equal marks.

Q.1 A) A binary tree has 10 nodes. The inorder and preorder traversal of the tree are shown below. Draw the tree alongwith its postorder traversal.    (10)

Preorder: JCBADEFIGH Inorder: ABCEDFJGIH

B) Given the set of symbols and corresponding frequency table as below, explain the steps to find Huffman Code.    (10)

Symbol    ABCDEFGH

Frequency 22 5 11 19 2 M 25 5

(6)

<S)

(6)


Q.2 A) Explain Insertion and Deletion in General Tree

B)    What is hashing? Describe any 3 techniques for collision resolution.

C)    Write the pseudocode for Rotate AVL tree rights

Q,3 A) Explain the concept of creation, insertion and deletion in B-tree using suitable examples.    (12)

B) What is Direct File Organisation? Discuss overflow handling in direct File Organisation.    (8)

(12)

<&>


Building a heap

ii)Deletc a heap

i)

ii)

iii)

iv)

Relative File organization and Indexed Sequential File Organization

Directed and Undirected Graphs

General Tree and Binary Tree

Depth First and Breadth-First Traversal


i)


(20)


Q.4 A) What is Heap? Write algorithms tor:


Q.6 A) Consider the following set of 10 numbers:    (12)

85, 36, S7, 10, 91, 18, 15. 52, 73, 49 Sort the array using;

i)    Insertion Son .

ii)    Quick Sort

Also find out the complexity for each algorithm in best and worst case.

B) Explain with suitable example WarshalFs algorithm    (8)

Q.7 Write short notes on:    (20)

i)    B*- tree

ii)    Multi-key Organisation

iii)    Modulo-di vision hashing

iv)    Sequential Access mode

1

Write short notes on any four;    20

a}    Monitors

b)    UNIX Operating System

c)    RAM Disk

d)    Direct Memory Access

e)    Spooling

f)    Terminals.







Attachment:

( 0 Votes )

Add comment


Security code
Refresh

Earning:   Approval pending.
You are here: PAPER University of Mumbai 2006-2nd Sem M.C.A Computer Aplications - Question Paper