mecom1 question paper

7/31/2019 mecom1 question paper

1/12

~[~~~ -rBen

'3 ~ " " b... (3 H~

I. Question No.1 is compulsory. ?rl~ ,;'t-7th'v"'\...~2. Attempt any Four out of remaining. 0' Cc" ~3. Assume suitable data ifnecessary and justify the ass~~~ti

4. Figures to the right indicate full marks.

6-p3-upq-Con No. File

. " - c o n . 3484-10.

Q I.A.Write a function for Bubble sort and show computation of itB. Give a dynamic-programming solution to the 0-1 Knapsack

Times. where n is the number of items and W is the maximuthief can put in his knapsack.

Q2.A. Prove that Clique is NP-Complete.

B. Compute Longest common subsequence for A = 0001 101 1


2/12

7-p3-upq'-Con No. Fill! '0 ' .'. I

, j

Con. 3484-88-1735-10.I

Q6.A. Find the maximum flow for the network given below.

Give the algorithm and complexity


3/12

rn(; -JI $err) - COn

SottWo.'fe, T1a;'n~eCon. 2822-10.

N.B.: (1) Question no. 1 is compulsory.

(2) Answer any four out of the remaining questions.

1. (a) Discussany two evolutionary softw~re processmodels i

(b) Explain process, project, product and software team stru

2. (a) Explainthe approach used by Software Engineering Inst

an organization's current state of processmaturity

(b) DiscussObject oriented Testing

( ) E l i h k f S f fi i M


4/12

. 71. 1st halt-Exm10-Mina-(d)

~on. 2835-10.

. ( \"". ... (ory~.e.A.-I.sen)

S


5/12

= -_ 8 1 . -~1'8""----------__

. ,.w e~otiY) et.J.-Lv

tJ.eJ-l-DO '1 " ( < : : - P~N~ \.rl 0 l\'1u ~l P 4-Con N cH l

rj

I

II

\

~

I

N.S. : (1)

(2)

(3 Hours)

Question NO.7 is compulsory.

Attempt any five question from seven questions.,

(a) Explain the TCP State Transition Diagram?

(b) Explain Nagle's Algorithm and Clark's solution?

(c) Explain how TCP handles Lost Segment and lost ack


6/12

rn.(;-Jr Sern-

1Hst-, ibu..teJ

C c'); '1 P

o pe'iali'7nO

1. (a) Discuss the following scenarios for retrieval of a buff

i)The kernel cannot find the block on the hash

empty.

ii) The kernel finds the block on the hash queue


7/12

. . . . - - - - - - - - - - - - - - - - - - - - - - - - - - _ -102 : 1st hatf10DD (E)

C oon . 2821-88-1948-10.

(b) Define Consistent Cut and Inconsistent Cut and Strongly

determine types of the following cuts:


8/12

InElI 5("61)' (O"nlp

Ad'Von(ccJ (DCtQccbosc m(H)

N.S. (1) Question No.1 is compUlsory.

(2) Attempt any four of remaining six questions.

(3) Assume any suitable data if necessary and cle

. (a) Consider the relation R = { A, B, C, 0, E, F, G, H, I,

G := { {A, B} -> {C}, {B,D} -> {E. F}, {A,D} -> {What is the key for R? Decompose R into 2NF, then

(b) Explain all the steps for mapping an EER to an ODB

(c) How a vertical and a horizontal partitioning of a relatio

relation be put back together from a complete vertic


9/12

4. Consider the following relations:

Customer (CusCld, CuscName, Street, City, Zip, Account (AccNo, AccType, BranchNo, Balance)

CustAccount (CusCID, AccNo, Interest)

(a) Give example of two simple queries that would be

for horizontal partitioning.

(b) Show the derived horizontal partitioning of CustA

of the Account.

(c) Write a query by which Customer may be hor

5. University database Contains information about the cours

the courses in each Semester. Each course must also ha

of students e'nrolled, Room no., Date and Time (where an


10/12

:lch-

bel

3d).

1. (a) What is Customer Relationship Management? Expl

(b) Explain Enterprise Resource Planning in detail.

2. (a) Explain Executive Information System. in detail.

(b) Explain the Transaction Processing Cycle in detail.

3. (a) Differentiate between DSS and MIS.

(b) Explain in detail systems approach to problem solvi

nlF --11 SCn}- C C "n

A d '\.'0ncE'.s j'n n/cl~ 1 C dE:.')-neo n

N.B. (1) Question No.1 is Compulsory.(2) Attempt any Four Questions out of remaining Six Q

(3) Assumptions made must be clearlY,stated.


11/12

~ ~/

~ 2 7 : 1sl hal f.1 O-AM(k)

, Con. 2824-10.

N.S.: (1) Question No.1 is Compulsory.(2) Attempt any four questions from remaining six questio

(3) Assume suitable data wherever necessary and state

(a) Determine a gray scale transformation that maps the dark

black (0), The brightest 10% of Pixels to white (255), and linea'of all remaining Pixels between black and white.

(b) Show that the wiener filter does not restore the power spe

where as the geometric mean filter does when s = Y 2 ' coerrors of the two filters.


12/12

(a) The output of a binary source is to be coded in blocks of M

outputs are independent and identically distributed with P = 095

Code for M = 1, 2, 3, 4 and calculate their efficiency.

(b) Show that the N x N Cosine transform matrix C is orthogona

case N = 4.

6. (a) Describe and differentiate point, line and edge detection. Also

segmentation.

(b) What are morphological operations? For a region explain Bou

and then region filling operation on the extracted bowndary.

7. Write short notes on the following :-

(a) Uniform and Nonuniform Sampling

(b) Translation, Scaling and Rotation

(c) Properties of OFT(d) Variable Length Coding

(e ) Image Restoration.

mecom1 question paper

Documents