Get fully solved assignment. Buy
online from website
online store
or
plz drop a mail with your sub
code
we will revert you within 2-3
hour or immediate
Charges rs 125/subject
if urgent then call us on 08791490301, 08273413412
DRIVE
Spring
2018
PROGRAM
MASTER OF COMPUTER APPLICATION
SEMESTER
II
SUBJECT CODE & NAME
MCA211 – OPERATING SYSTEM
Set
1
Q1
Differentiate between Sequential access and Direct access methods. 5+5
Answer.
Sequential
access and Direct access methods
Sequential
access
In
this simple access method, information in a file is accessed sequentially one
record after another. To process the ith record all the i-1 records previous to
i must be accessed. Sequential access is based
Q2
Differentiate between Daisy chain bus arbitration and Priority encoded bus
arbitration. 5+5
Answer.
Daisy chain bus
arbitration and Priority encoded bus arbitration
There
are many ways of addressing the “bus arbitration” problem; three techniques
which are often implemented in processor systems are the following: Daisy chain
arbitration, priority encoded
Q3. Explain LRU page replacement
algorithms with an example 4+6= 10
Answer:
LRU page replacement algorithm
The
main distinction between FIFO and optimal algorithm is that the FIFO algorithm
uses the time when a page was brought into memory (looks back) whereas the
optimal algorithm uses the time when a page is to be used in future (looks
ahead). If the recent past is used as an approximation
Set 2
Q1. Define operating system.
Explain any four major functions of operating system 2+8 = 10
Answer:
Operating System is a System Software (Set of system programs) which provides
an environment to help the user to execute the programs. An operating system
(OS) is a software program that manages the hardware and software resources of
a computer. A key component of system software
Q2
Explain the different process states. 5*2
Answer.
Different
process states
A program in execution is a
process. A process is executed sequentially, one instruction at a time. A
program is a passive entity.
Example: a
Q3
Define Deadlock. Explain necessary conditions for deadlock. 2+(2*4)
Answer.
Deadlock
Deadlock
occurs
when we have a set of processes [not necessarily all the processes in the
system], each holding some resources, each requesting some resources, and none
of them is able to obtain what it needs, i.e. to make progress. We will usually
reason in terms of resources R1, R2... Rm and
Get fully solved assignment. Buy
online from website
online store
or
plz drop a mail with your sub
code
we will revert you within 2-3
hour or immediate
Charges rs 125/subject
if urgent then call us on 08791490301, 08273413412
Get fully solved
assignment. Buy online from website
online store
or
plz drop a mail with
your sub code
we will revert you
within 2-3 hour or immediate
Charges rs 125/subject
if urgent then call us on 08791490301, 08273413412
DRIVE
Spring 2018
PROGRAM
MASTER OF COMPUTER APPLICATION
SEMESTER
II
SUBJECT CODE & NAME
MCA212- ADVANCED DATA STRUCTURE
Set-1
Q1. List and explain any Five types of
graph. [5*2]= 10
Answer:
Types
of Graphs
Depending
upon the vertices and edges and the weight associated to it, graphs can be
classified as:
1) Undirected graph: In
Undirected Graph, the directions of edges are not assigned. Edges in the
Q2. Explain
1. Fixed block storage allocation.
2. Variable block storage allocation
[5+5] = 10
Answer:
Fixed
block storage allocation
First
block storage allocation is the simplest case of dynamic storage allocation.
This is the straight forward
Q3. What is the use of external Storage
Devices? Explain any two external storage devices [4+3+3]=10
Answer:
An
external storage device may be defined as device other than the main memory on
which information or data can be stored and from which the information
retrieved for processing. External storage devices are having larger capacities
and fewer expenses to store
Set 2
Q1. Define algorithm and write a note on
Complexity and Time- Space Tradeoff with example
[2+4+4]=10
Answer:
Definition: An algorithm is a step by
step procedure for solving a particular problem. One major purpose of this text
is to develop efficient algorithms for the processing of our data. The
efficiency of the algorithm is depending on the time and space it uses. The
Q2. Define Queue and explain
a. Array implementation of queue
b. Linked list implementation of queue
Answer:
A
queue is a linear list of elements in which deletions can take place only at
one end, called the front and insertions can take place only at the
other end, called the rear as referred in the
Q3. List the Advantages and Disadvantages
of Linear and linked representation of tree. [5+5] = 10
Answer:
Advantages
of linear representation of binary tree
1) Node can be accessed directly with the help of the index
through which we can improve the efficiency of execution time of an algorithm.
2) Data
Get fully solved
assignment. Buy online from website
online store
or
plz drop a mail with
your sub code
we will revert you
within 2-3 hour or immediate
Charges rs 125/subject
if urgent then call us on 08791490301, 08273413412
Get fully solved assignment. Buy
online from website
online store
or
plz drop a mail with your sub
code
we will revert you within 2-3
hour or immediate
Charges rs 125/subject
if urgent then call us on 08791490301, 08273413412
DRIVE
Spring
2018
PROGRAM
MASTER OF COMPUTER APPLICATION
SEMESTER
II
SUBJECT CODE & NAME
MCA213- OBJECT ORIENTED PROGRAMMING
– C++
Set 1
Q1.
What are the advantages of Polymorphism? How it can be implemented? 5+5=10
Answer:
Advantages
·
Code is simpler to write (
·
Q2.
Differentiate between Containers and Iterators 5+5= 10
Answer: Containers
STL provides a number of container
types, representing objects that contain other objects. The STL contains
sequence containers and associative containers. The standard sequence
containers include vector,
Q3.
Describe the two basic exception handling models. 5+5= 10
Answer:
If you encounter an exceptional situation in your code – that is, one where you
don’t have enough information in the current context to decide what to do – you
can send information about the error into a larger
Set 2
Q1.
Write short notes on:
a)
Inheritance
b)
Polymorphism 5+5 = 10
Answer:
A)
Inheritance
Inheritance is one of the most powerful features of
Object Oriented Programming Languages that allows you to derive a class from an
existing class and inherit all the characteristics and
Q2.
Differentiate between Classes and Objects. Write an example program to
represent a class and its object. 4+6= 10
Answer:
Classes and objects are separate but related
concepts. Every object belongs to a class and every class
Q3.
Describe operator overloading. Which are the operators that cannot be
overloaded?
5+5=
10
Answer:
Operator overloading is an interesting feature of C++ that allows programmers
to specify how various arithmetic, relational and many other operators work
with user defined data types or classes
Get fully solved assignment. Buy
online from website
online store
or
plz drop a mail with your sub
code
we will revert you within 2-3
hour or immediate
Charges rs 125/subject
if urgent then call us on 08791490301, 08273413412
Get fully solved
assignment. Buy online from website
online store
or
plz drop a mail with
your sub code
we will revert you
within 2-3 hour or immediate
Charges rs 125/subject
if urgent then call us on 08791490301, 08273413412
Spring 2018 ASSIGNMENT
PROGRAM – MCA (REVISED FALL 2012)
SEMESTER - II
SUBJECT CODE & NAME - MCA214-
COMMUNICATION SKILLS
Q. No.1 What is nonverbal communication? Give five examples
for non-verbal communication. 5+5= 10
Answer: Non-verbal communication
Non-verbal communication means the messages that do not
contain words.
In this type of communication, words are not used in the
process of sending and receiving messages. It is a
Q2. What are the prosodic features of speech? 10
Answer: Prosodic features (sometimes known as suprasegmental phonology) are
those aspects of speech which go beyond phonemes and deal with the auditory
qualities of sound. In spoken
Q3. Define hearing and Listening. How is ‘hearing’
different from ‘listening’ 4+6= 10
Answer:
Hearing is a passive
process. It is merely the detection of sounds around us. Normally, we come
across ‘hearing’ in certain situations. E.g.: When your lecturer reprimands you
for some of your
Get fully solved
assignment. Buy online from website
online store
or
plz drop a mail with
your sub code
we will revert you
within 2-3 hour or immediate
Charges rs 125/subject
if urgent then call us on 08791490301, 08273413412
Get fully solved
assignment. Buy online from website
online store
or
plz drop a mail with
your sub code
we will revert you
within 2-3 hour or immediate
Charges rs 125/subject
if urgent then call us on 08791490301, 08273413412
Spring 2018 ASSIGNMENT
PROGRAM - MCA (REVISED
FALL 2012)
SEMESTER - SECOND
SUBJECT CODE & NAME - MCA215- COMPUTER ARCHITECTURE
Set 1
Q1. Explain the
concept of branch handling. What is delayed branching? 5+5= 10
Answer:
Branch
Handling
Branch is a flow
Q2. Explain any five
types of vector instructions in detail.5*2= 10
Answer: Types of Vector Instructions:
(a) Vector-scalar instructions: Using these instructions, a
scalar operand can be combined with a vector one. If A and B are vector
registers and f is a function that performs some operation on each element of a
single or two vector operands, a vector-scalar operand
Q3. Write short notes
on:
a) UMA
b) NUMA 5+5= 10
Answer:
a)
UMA
(Uniform Memory Access):
In this
category every processor and memory module has similar access time. Hence each
memory word can be read as quickly as other memory word. If not then quick
references are slowed down to match the slow ones, so that programmers cannot
find the difference this is called
Set 2
Q1. Differentiate
between Process and Thread. 5+5=10
Answer:
Concept
of process
In
operating system terminology, instead of the term ‘program’, the notion of
process is used in
Q2. Explain the any
five types of addressing modes. 5*2= 10
Answer:
Every
instruction of a computer states an operation on certain data. There are a
numerous ways of specifying address of the data to be operated on. These
different ways of specifying
Q3. Describe the
logical layout of both RISC and CISC computers 5+5= 10
Answer:
While
processing operates instructions, RISC pipelines have to cope only with
register operands. By contrast, CISC pipelines must be able to deal with both
register and memory
Get fully solved
assignment. Buy online from website
online store
or
plz drop a mail with
your sub code
we will revert you
within 2-3 hour or immediate
Charges rs 125/subject
if urgent then call us on 08791490301, 08273413412
No comments:
Post a Comment