Vous êtes sur la page 1sur 12

Total No. of Questions : 08] [Total No.

of Printed Page : 02
MASTER OF COMPUTER APPLICATION (MCA)
First Year (Ist Semester)
EXAMINATION, DECEMBER 2013
Accounting and Financial Management
Time-3 Hrs. Max. Marks : 50
Min. Marks : 18
Note: Attempt any five Questions. All questions carry equal marks.
Q.1 (a) What are the objectives of management accounting?
(b) Write different elements of cost and describe
classification of cost.
Q.2 (a) What is absorption cost? And what are the limitations
of it?
(b) Differentiate absorption cost and marginal cost.
Q.3 (a) What is budgeting and budgetary control? Describe
master budget.
(b) Write behavioural aspects of budgeting.
Q.4 (a) What do you understand by standard cost? Describe in
detail.
(b) Write note on material variance and labour variance.
Q.5 (a) What are the objective of capital investment appraisal?
Describe.
(b) What is average rate of return method? Explain.
Q.6 (a) What is material management? How valuation of
material is taken?
(b) How absorption cost effects no profit and stock
valuation?
1MCA - 05
(1)
Q.7 (a) Write down the benefits of budgeting.
(b) How we can control cost using standard costing?
Q.8 (a) Write average rate of return method of capital
investment.
(b) Describe payroll analysis and incentive scheme of
labour.
(2)
Total No. of Questions : 08] [Total No. of Printed Page : 02
MASTER OF COMPUTER APPLICATION (MCA)
First Year (Ist Semester)
EXAMINATION, DECEMBER 2013
Computer Organization and Architecture
Time-3 Hrs. Max. Marks : 50
Min. Marks : 18
Note: Attempt any five Questions. All questions carry equal marks.
Q.1 (a) Convert the following.
i. (41.6875)
10
= ( )
2
ii. (FC00)
16
= ( )
2
iii. (471)
8
= ( )
2
(b) What is fixed point representation? Explain.
Q.2 (a) What is the difference between sequential and
combinatinal circuits?
(b) How you will construct Toggle (T) flip flop by using J-K
flip flop.
Q.3 (a) Write the difference between encoder and decoder.
(b) What is a register? Explain serial in serial out shift
register.
Q.4 (a) What is micro operation? Explain shift micro
operations.
(b) What are memory reference instructions?
Q.5 (a) What is stack? Explain with one example.
(b) What are Instruction formats?
1MCA - 1
(1)
Q.6 (a) What are the different Addressing modes? Explain
with example.
(b) How the DMA transfer in a computer system?
Q.7 (a) What is Cache memory? Explain its hit ratio.
(b) What is virtual memory? Explain its working.
Q.8 Write short notes. (any three)
a. Multiplexer
b. Binary Adder
c. Fetch Cycle
d. Priority encoder
(2)
Total No. of Questions : 08] [Total No. of Printed Page : 02
MASTER OF COMPUTER APPLICATION (MCA)
First Year (Ist Semester)
EXAMINATION, DECEMBER 2013
Mathematical Foundation
Time-3 Hrs. Max. Marks : 50
Min. Marks : 18
Note: Attempt any five Question. All question carry equal marks.
Q.1 (a) A class has 175 students. The following is the
description showing the number of students studying
one or more of the following subjects in this class.
Maths 10, Physics 70, Chemistry 46, Maths & Physics
30, maths and chemistry 28, physics and chemistry 23,
maths, physics, chemistry 18.
How may students are enrolled in maths alone, physics
alone and chemistry alone? Are there students who
have not offered any of these three subjects?
Q.2 Prove that :
(a) A (B C) = (A B) (B C)
(b) (A B) = A B
Q.3 Explain following term with example.
(a) Null sets
(b) Power set
(c) Sub sets
(d) Universal set
Q.4 (a) Let A, B and C be any three sets then prove that
(A (B C) = (A B) (A C)
1MCA - 2
(1)
(b) If A and B have m elements in common how many
elements do and have in common? A B B A
Q.5 (a) If and be the inverse of the relations R and S R
1
S
1
respectively then.
(SoR)
1
= R
1
oS
1
(b) Let R be the following relation on
A = {1, 2, 3, 4}, R = {(1, 3), (1, 4), (3, 2), (3, 3), (3, 4)}
(i) Fine the matrix of R M
R
(ii) Draw the directed graph of R
(iii) Find the domain and range of R.
(iv) Find the composition relation RoR.
(v) Find R
1
Q.6 (a) If R is an equivalance relation in a set A then prove
that is also equivalance relation in A. R
1
(b) Let be defined by and f : R R f(x) = cos x g : R R
be defined by g(x) = x
2
then find out. (fog) : R R
and (gof) : R R
Q.7 (a) Show that Boolean algebra can not have three
elements.
(b) In a Boolean algebra [B, +,] Prove that
(i) a + b c a c, b c
(ii) a b, a c a bc
Q.8 Write Short notes on any four.
a. Partial order set
b. Invertible function
c. cardinality
d. Complexity of Algorithms
e. Karnaugh maps.
(2)
Total No. of Questions : 08] [Total No. of Printed Page : 02
MASTER OF COMPUTER APPLICATION (MCA)
First Year (Ist Semester)
EXAMINATION, DECEMBER 2013
Operating System
Time-3 Hrs. Max. Marks : 50
Min. Marks : 18
Note: Attempt any five Question. All question carry equal marks.
Q.1 (a) Define operating system. Also discuss various
functions performed by it.
(b) Describe distributed operating system.
Q.2 Differentiate the following.
(i) On line system and Real time system.
(ii) Multiprogramming and multi tasking.
(iii) Buffering and spooling.
Q.3 (a) Discuss the concept and importance of semaphores.
(b) What is segmentation? What are the advantages of
segmentation?
Q.4 (a) Explain demand paged memory managements.
(b) How is free space maintained in a disk system?
Q.5 (a) What is Inter-process communication? How is it
achieved?
(b) What do you mean by system protection? What its
need?
1MCA - 4
(1)
Q.6 For the following Jobs calculate turn around time waiting
time and response time, using Round Robin (Time quantum
= 1), SRTN and priority scheduling algorithm. Assume the
Jobs arrive in the order 1, 2, 3, 4, 5, 6 and are to be
executed a single processor.
Job Burst time Priority
01 10 02
02 05 03
03 02 02
04 01 04
05 03 01
06 01 01
Q.7 What is the main difference between deadlock and
starvation? Explain how these two problems are overcome.
Q.8 Write short notes (Any three)
a. Threads
b. Virtual Memory
c. MS-DOS vs MS-Windows.
d. Process Management.
(2)
Total No. of Questions : 08] [Total No. of Printed Page : 02
MASTER OF COMPUTER APPLICATION (MCA)
First Year (IInd Semester)
EXAMINATION, DECEMBER 2013
Data Structures and Applications
Time-3 Hrs. Max. Marks : 50
Min. Marks : 18
Note: Attempt any five Question. All question carry equal marks.
Q. 1 (a) What is Data Structure? Explain all operation on Data
Structure.
(b) What is Doubly link list? What advantages does a double
linked list have over a line linked list?
Q.2 (a) Translate the following infix expression into its equivalent
postfix expression.
(i) (A-B) * ((C+D)/E)
(ii) (A+B)/C {(D-E) + F}
(iii) (A + B)/C ((D-E) * F))
(b) What are spare matrices and how are they implemented
using linked list?
Q.3 (a) What is a stack? Is it a liner or non -liner Data Structure?
(b) What is a Queue? Implement a Queue with the help of
doubly linked list?
Q.4 (a) Design an algorithm and write function two concatenate
two string using recursion.
(b) Draw a binary search tree who elements are inserted in
the following order:-
50, 72, 96, 94, 102, 25, 92, 9, 2, 10, 17, 30.
2MCA - 7
(1)
Q.5 (a) What are the different operation that modify a tree?
(b) What is the need of stack in implementing a recursive
function?
Q.6 (a) Explain the meaning of Graph traversal and various way
of accomplish them.
(b) Write a recursive algorithms for merge sort and show how
merge sort sorts the sequence
4, 31, 1, 6, 7, 2, 4, 9
Q.7 (a) What do you mean by Sorting & why is its important?
(b) What is bubble-sort ? Explain with example.
Q.8 Write short-notes( any three)
(i) Abstract type
(ii) Circular linked list
(iii) Hashing
(iv) Selection Sort
(2)
Total No. of Questions : 08] [Total No. of Printed Page : 02
MASTER OF COMPUTER APPLICATION (MCA)
First Year (IInd Semester)
EXAMINATION, DECEMBER 2013
Business Data Processing
Time-3 Hrs. Max. Marks : 50
Min. Marks : 18
Note: Attempt any five Question. All question carry equal marks.
Q.1 (a) Explain the indexed sequential File Organization
method with the help of suitable example.
(b) Differentiate between a Master and Transaction file.
Q.2 (a) What is meant by Addressing of records? What are the
various addressing methods.
(b) What is Binary Serch? Give an example.
Q.3 What is the meaning of data processing? Explain the
advantage of processing of data of business enterprise
using computers.
Q.4 (a) What do you mean by referencing? What are the types
of referencing.
(b) What is the function of comment?
Q.5 (a) Compare MS-Word a word processor program with
any other program used for word processing.
Q.6 (a) What do you mean by searching? Explain
2MCA - 9
(1)
(b) What are the disadvantage of electonic data
processing.
Q.7 (a) Compare batch processing with on line processing.
(b) What are the various methods which are employed in
data processing.
Q.8 Write Short notes on (any three)
1. Automation
2. Versatitlity
3. Mechanical Data processing System
4. Manual Method of data processing
5. Batch Processing
(2)

Vous aimerez peut-être aussi