University of Mumbai 2009 M.C.A M Sc Computer Organization and Architecture - Question Paper
M Sc Computer Organization and Architecture
ws April 09 1-17
MC* 8W-X 22.0 2OOC| CoPnpu.kT OrWjOiri'iSodoo o-odl fyrcbitecW-ac
(REVISED COURSE) BB-9285
Con. 2270-09.
(3 Hours) [Total Marks : 100
5
(a) Draw the instruction cycle state diagram.
Q.l
5
5
5
10
10
10
10
20
(M Using K-Map simplify the following expression in four variables A.B.C.D FIA B.C.D) = A'BC+ ABD'+ABCD+A B CD (C) Depict diagrammatically a Micro programmed Control Unit.
( d) Draw the block diagram of an I/O Module, using diagrams.
Q.2
Q.3
you deal with conditional branches?
What is bus arbitration?Explain daisy chaining & polling with suitable block diagram
lb]
Differentiate between following(Any Four):-Sequential Vs Combinational Circuits SRAM Vs DRAM
Q.4
(a)
(b)
(c)
(d) (e)
RISC Vs CISC .
Asynchronous Vs Synchronous Transmission I/O mapped I/O Vs Memory mapped I/O
Truth Table. Draw its implementation using 10
(a) Discuss 4 to 1 multiplexer using the appropriate gates.
Q.5
(b) (i) Explain Flynn's classification of parallel processing
05
05
10
10
(ii) What is a Shift Register.
(a) Explain different RAID levels in detail.
Q.6
(b) What is locality of reference? Explain the different types of localaties.Explain performance characteristics of two level memory.
1 Write short note on the following( any four).
(a) DMA
(b) Flip-flop
(c) Half-adder
(d) Associative Memory.
\V5 April 09 |47 90 (MO-y Q.00-
Con. 2267-09. BB-9282
(3 Hours) [Total Marks : 100
question No. 1 is compulsory
(2) attempt any four questions out of remaining six questions
(3) answer to the questions should be grouped and written together
4) USe legible hand writing use a b]ye /black ink pen to write answers. Use of pencil
|
should be done only to draw diagram and graphs (5) all questions carry equal marks. | ||||||||||||||||||||||||||||||
|
Con. 3026-09.
(3 Hours)
N.B.; (1) Question No. 1 is compulsory.
(2) Attempt any four from the remaining six questions.
(3) Assumptions should be clearly stated.
(4) Give programming examples and syntax where required.
(5) Answers to the questions should be grouped and written together.
What is a symbolic constant ? How is a symbolic constant defined ? How is the definition written ? Where must a symbolic constant definition be placed with in a C Program.
]. (a)
(b)
What is an expression ? What are its components ? 5
(a) How to initialize the structure variable ? Explain with suitable examples. 10
(b) Write a complete C program to compare 10 nos and print maximum and minimum no. 10
3. (a) What is a file ? Compare binary and text file. Give the example to open and 10 close the files.
(b) Write a complete C program to print following format 10
1
121
12321
1234321
123454321
4. (a) Write a function that will scan a character string passed as an argument and
convert all lower case character into their uppercase equivalents.
(b) What are the Storage classes ? Explain with suitable example.
5. (a) Summarize the use of gets and puts function to transfer strings between the computer
and the standard input/output device. Compare the use of these functions with the string transfer features in scanf and printf statements.
(b) Write a program to accept an unsorted list of names and sort them.
6. (a) How is a pointer variable declared ? What is the purpose of data type included
in the declaration ? Explain pointers to ID array.
(b) Write a complete C program to check whether the given number is palindrome.
7. Write short notes (any four) :
(i) Stream File
(ii) Actual Parameters and Formal Parameters
(iii) Type casting
(iv) Relational operators
(v) Multi Dimensional Arrays
(vi) Structure within a structure.
2.
10
10
12
10
10
FVncipVSi "Ecqpqjouc,gj g>,oH y\ovactf\inri
0 BB-S292
Con. 24Ht.no
(3 Hours)
N.B. (1) Question No. 1 is compulsory. . _
(2) -Attempt any two questions from-Question Nos. 2 to 4.
(3) Attempt any two questions from Question Nos. 5 to 7.
(4) Ail quesiions carry equal marks.
1 (a) Economies of scale may be either internal or external they may be technical, 10 managerial, financial or risk-bearing Elucidate.
(b) "One cannot be successful without planning". Give an overview of planning as 10 a Management function. ,
2. (a) Monopolistic Competition does not offer equilibrium in the short run to the 10 industries. Why ?
(b) What do you understand by law of demand ? What factors are important in 10 explaining the law of demand ?
[ Total MarksV 100
. .
Write short notes on ;
(a) Oligopoly
5
5
5
5
(b) Law of Supply
(c) Distinguish between Micro and Macro Economics
(d) Manageriai Economics.
4. (a) What does the term market mean in economics ? What are the assumptions 10
made in defining perfect competition
(b) Explain why MC cuts AC at the bottom of its U Also trace the relationship between 10 cost curves while explaining the law of variable proportion. "
5. (a) What do you perceive are the major challenges that HR managers will have to 10
race in tne near future ?
(b) Discusu the impoitance of performance appraisals and its types. - 10
6 ntnbuotfi,ae"C:iOPmen, f m4"agcmeRt ts;fnd highlights major 10
(b) Define Authority, Accountability and Responsibility as learnt in management. 10
7. Write.short notes on
(a) Marketing Mix
(b) Product Life Cycle
(c) Theory of X and Y
(d) Matrix Organization.
(REVISED COURSE) (3 Hours)
N.B . : (1) Question No. 1 is compulsory.
BB-9288 [Total Marks : 100
(2) Attempt any four out of remaining* questions.
(3) Assume any ncecssary data but justify the same.
(4) Figures to the right indicate marics
1. (a) (i) Obtain a di.ii" active normal form (Pa-<Q ft))V(PQ)
(ii) Let Si- {1,. 4) and let A=SxS Define the following relation R on A:
(a.bl R fa.b) if and only if a+b a-t b
Verify that R is an equivalence relation. Determine A/R. [5]
<b) (i) Determine whether the set S -{1,2,3,.6,12 Jwith a.b-G.C.D{a,b) is a semigroup, [5] a monoid or neither If it is a monoid, specify the identity. If it is a semigroup or a monoid determine whether it is commutative,
(ii) Determine whether the sequence {so} is a solution of the recurrence relation [5]
a = 2a.i - aj.j, for n =2, 3, 4, where a<, = 2" for every non-negative n.
[5]
2, (a) (i) i jt muct li> luthtablcof [5]
-,(P, ii v-,))Q
(ii) What are quantifiers? Explain with suitable examples. [5]
lb1) Let A = { 1. Z. 3. 4. 12 (. Consider the partial order of divisibility on A. That is, if a [10] and b eA, aRb iff a divides b. Draw the Hasse diagram of the poset (A, K).
3. (a) (i) Using mathematical induction prove that (n3+2n) is divisible by 3 for every |5J
positive integer n
(ii) Test the vali 1 ty of the following arguments. [5]
If milk is then every cow is white. If every cow is white then it has four legs.
If every cow has four legs then every buffalo is white and brisk. The milk is black.
So every buffalo is white.
(b) (t) Establish the following result without using truth tables. [5]
(Q -* R) o (P /vQ) > R (ii) Find the solution to the recurrence relation [5]
= Ian-1 - 2a-2 with the initial conditions aj = 5 and a3 = 3.
4. (a) (i) I ln<i (In: psilictilar solution of a,-3a,.i+3ar.3 + afo = 4.
[5J
[5]
[10]
[5]
(ii) Let fa} anil M } be sequence of real numbers then show that Vfoba,,.! V(b)r4-bV(a,) where A denotes the forward difference,
(b) State the Tower of Hanoi problem Obtain its recurrence relation with suitable initial conditions. Solve the recurrence relation.
5. (a) (i) Let G be a group. Show that the function f G-> G defined by fTa) = a.' is an isomorphism if and only if G is abelian.
(ii) LetA = (l,/, 3,4, 5, 6}andP= 4315 j permutation on A find the
smallest positive integer k such that P* = Identity permutation. [5]
|
Attachment: |
| Earning: Approval pending. |
