PROGRAM - MCA
SEMESTER SECOND
SUBJECT CODE
& NAME - MCA2010 – OPERATING SYSTEM
1. Define operating system. Explain
any four major functions of Operating system.
Operating System – Definition
Operating System
is a System
Software (Set of
system programs) which provides an
environment to help
the user to
execute the programs.
The Operating System is
a resource manager
which allocates and
manages various resources like processor(s), main memory, input/output
devices and information on secondary storage devices.
CONTACT
US FOR READY MADE SOLVED ASSIGNMENTS
CONTACT
NUMBER : +91 - 8285115522
2. Explain the different process
states.
A
process is executed sequentially,
one instruction at
a time. A
program is a
passive entity. Example: a file on the disk. A process on the other
hand is an active entity. In addition to program code, it includes the values
of the program counter, the contents of the CPU registers, the global variables
in the data section and the contents of the stack that is used for subroutine
calls. In reality, the CPU switches back and forth among processes.
CONTACT
US FOR READY MADE SOLVED ASSIGNMENTS
CONTACT
NUMBER : +91 - 8285115522
3.
Define Deadlock. Explain necessary conditions for deadlock.
Definition of Deadlock
Several processes
compete for a
finite set of
resources in a
multiprogrammed environment. A
process requests for
resources that may
not be readily available at the
time of the request. In such a case the process goes into a wait state. It may
so happen that this process may never change state because the requested
resources are held by other processes which themselves are waiting for
additional resources and hence in a wait state. This situation is called a
deadlock.
CONTACT
US FOR READY MADE SOLVED ASSIGNMENTS
CONTACT
NUMBER : +91 - 8285115522
4.
Differentiate between Sequential
access and Direct
access methods.
Sequential access
Sequential
access increases interaction cost: the user has to inspect all the items that
precede the item of interest in a list. With direct access, the user can focus
on the element of interest without explicitly processing the items that come
before it in the list.
Sequential
access has two potential benefits:
• Progressing
linearly through an information space can be accomplished through particularly
simple navigation controls: basically a “give me more” button.
CONTACT
US FOR READY MADE SOLVED ASSIGNMENTS
CONTACT
NUMBER : +91 - 8285115522
5. Differentiate between
Daisy chain bus
arbitration and Priority encoded bus arbitration.
Daisy
chain arbitration: Here, the requesting device or devices assert
the signal bus_request. The
bus arbiter returns
the bus_grant signal,
which passes through each of the devices which can have access to the
bus, as shown in figure 10.5.
Here, the priority
of a device
depends solely on its
position in the
daisy chain. If
two or more
devices request the
bus at the same time, the
CONTACT
US FOR READY MADE SOLVED ASSIGNMENTS
CONTACT
NUMBER : +91 - 8285115522
6. Explain LRU page replacement
algorithm with example.
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 of the near future, then replace the page that has not
been used for the longest period of time. This is the least recently used (LRU)
algorithm.
CONTACT
US FOR READY MADE SOLVED ASSIGNMENTS
CONTACT
NUMBER : +91 - 8285115522
PROGRAM - MCA
SEMESTER II
SUBJECT CODE & NAME - MCA2020- ADVANCED DATA
STRUCTURE
1. Define algorithm and write a
note on Complexity and TimeSpace
Tradeoff with example
Algorithms: Complexity and Time- Space Tradeoff
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
complexity of an algorithm is the function which gives the running time and/ or
space in terms of the input size.
Each of
our algorithms will
involve a particular
data structure. The
data structure which we choose will depend on many things, including the data and the
frequency with which
various data
CONTACT
US FOR READY MADE SOLVED ASSIGNMENTS
CONTACT
NUMBER : +91 - 8285115522
2. Define Queue and explain how we
can implementation the Queue.
Queue
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 figure 4.7. The terms “front” and “rear” are
used in
describing a linear
list only when
it is implemented
as a queue. Following are
the two methods
offered by queue
for adding and
deleting element from the queue.
·
enqueue - add a new item at the back of the
queue
CONTACT
US FOR READY MADE SOLVED ASSIGNMENTS
CONTACT
NUMBER : +91 - 8285115522
3. List the Advantages and Disadvantages of Linear and linked
representation of tree.
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 are stored without pointer reference of
successor or predecessor
3) This
representation is very
much useful where
the language does
not support the dynamic memory allocation.
Disadvantages of Linear representation of binary tree
1) Memory
is wasted here
because it will
be allocated for
all the nodes absence of node will leads to empty
entries in array.
2) Since
the array size
is limited enhancement
of tree structure
is restricted.
CONTACT
US FOR READY MADE SOLVED ASSIGNMENTS
CONTACT
NUMBER : +91 - 8285115522
4. List and explain any Five types
of graph.
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
Undirected graph only connect to each other.
In an undirected graph, edge (v1,v2)
is equivalent to edge
(v2,v1) since they are unassigned. An
example of Undirected graph is given in below figure.
CONTACT
US FOR READY MADE SOLVED ASSIGNMENTS
CONTACT
NUMBER : +91 - 8285115522
5. Explain
1. Fixed block storage allocation.
2. Variable block storage
allocation
Fixed block storage allocation
First block
storage allocation is the simplest
case of dynamic
storage allocation. This is the straight forward method in which, all
the blocks are of identical in size. The user can decide the size of the block.
The operating system keeps a pointer called
AVAIL. This pointer
points to memory
as shown in below figure.
CONTACT
US FOR READY MADE SOLVED ASSIGNMENTS
CONTACT
NUMBER : +91 - 8285115522
Variable block storage allocation
To overcome
the disadvantages of
fixed block storage,
blocks of variable sizes are used, which is represented
in the figure . Here also linked lists play a vital for the management of
memory blocks. The procedures used for allocation and
deallocation of memory
blocks from the
variable block storage are as
follows.
Figure : Availing a node from a pool with
variable sized blocks.
Procedure GETNODE(NODE)
If (AVAIL=NULL) then
Print “Memory is
insufficient”
Exit.
Endif
CONTACT
US FOR READY MADE SOLVED ASSIGNMENTS
CONTACT
NUMBER : +91 - 8285115522
6. What is
the use of
external Storage Devices?
Explain any two external storage
devices
External Storage Devices
The capacity
of main memory
is limited by
two factors, the
cost of main memory and the technical problem in
developing a large capacity of main memory. We discover that in some instances
programs can also reside in storage units which do not belong to main memory.
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 compared to main
memory.
CONTACT
US FOR READY MADE SOLVED ASSIGNMENTS
CONTACT
NUMBER : +91 - 8285115522
PROGRAM - MCA
SEMESTER SECOND
SUBJECT CODE & NAME - MCA2030- OBJECT ORIENTED
PROGRAMMING – C++
1. Write short notes on:
a) Inheritance
b) Polymorphism
a) Inheritance
Inheritance is
a very powerful
feature of object
oriented programming. It allows
reuse of code
without modifying the
original code. It
also allows flexibility to
programmer to make
modifications to the
program withoutaltering the
original code which saves debugging and programming time and effort.
Inheritance
feature has enabled to distribute class libraries which allows the programmer
to use the standard code developed by some another company. Inheritance is the
process of
CONTACT
US FOR READY MADE SOLVED ASSIGNMENTS
CONTACT
NUMBER : +91 - 8285115522
b) Polymorphism
Virtual functions
in C++ are
important to implement
the concept of polymorphism. Polymorphism means same
content but different forms. In C++,
polymorphism enables the
same program code
calling different functions of
different classes. Imagine a situation
where you would
like to create a class shape and
derive classes such as rectangle, circle, triangle etc. Let us suppose each of
the classes has a member function draw() that causes the
CONTACT
US FOR READY MADE SOLVED ASSIGNMENTS
CONTACT
NUMBER : +91 - 8285115522
2. Differentiate between
Classes and Objects.
Write an example program to
represent a class and its object.
Classes provide
users a method to create user defined datatypes. We have seen two types of user
defined datatypes structures
and enumeration in
the last unit.
Both are primarily used for
modeling data only. In several real life situation, you would require to model
functionality of the datatype along with the data. Classes enable you
to bind data
and functions that
operate on data
together. However, in C++
you can use
structures same
CONTACT
US FOR READY MADE SOLVED ASSIGNMENTS
CONTACT
NUMBER : +91 - 8285115522
3. Describe operator overloading. Which are the operators that
cannot be overloaded?
Operator Overloading in C++
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. It
provides a flexible way to work with classes and can make program code look
obvious. To perform
addition of
two distance objects
we used a
call d3.add(d1,d2). Instead
of such statements
it would be
more clear if
we could use
statements like d3=d1+d2. This is
possible only if we inform compiler about how + operator works with distance
class. This is exactly what operator overloading feature in C++
does. It helps
to use the
default operators with
the user defined objects for
CONTACT
US FOR READY MADE SOLVED ASSIGNMENTS
CONTACT
NUMBER : +91 - 8285115522
4. What are the
advantages of Polymorphism?
How it can be
implemented?
Advantages of Polymorphism
Virtual functions
in C++ are
important to implement
the concept of polymorphism. Polymorphism means same
content but different forms. In C++,
polymorphism enables the
same program code
calling different functions of
different classes. Imagine a situation
where you would
like to create a class shape and
derive classes such as rectangle, circle, triangle etc. Let us suppose each of
the classes
CONTACT
US FOR READY MADE SOLVED ASSIGNMENTS
CONTACT
NUMBER : +91 - 8285115522
5. Differentiate between
Containers and Iterators.
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, deque
and list. sequence containers
in, as their
name suggests, store
data in linear sequence The
standard associative containers
are set, multiset,
map and multimap. Associative
containers are a generalization of
sequences. Sequences are indexed by integers;
CONTACT
US FOR READY MADE SOLVED ASSIGNMENTS
CONTACT
NUMBER : +91 - 8285115522
6. Describe the two basic
exception handling models.
Of course,
the thrown exception
must end up
someplace. This is the
exception handler, and
there’s one for
every exception type
you want to catch. Exception handlers immediately follow
the try block and are denoted by the keyword catch:
try {
// code that may generate
exceptions
} catch(type1 id1) {
// handle exceptions of
type1
} catch(type2 id2) {
// handle exceptions of
type2
}
// etc...
Each catch
clause (exception handler)
is like a
little function that
takes a single argument of one
particular type. The identifier (id1, id2, and so on) may be
used inside the
handler,
CONTACT
US FOR READY MADE SOLVED ASSIGNMENTS
CONTACT
NUMBER : +91 - 8285115522
SEMESTER SECOND
SUBJECT CODE & NAME - MCA2040- COMMUNICATION
SKILLS
1. What is nonverbal
communication? Give five examples for nonverbal 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.
You may wonder,
“How is this
possible?” It is a
proven fact that most of
our communication through words
are laced with non verbal communication. They can be
categorized as:
CONTACT
US FOR READY MADE SOLVED ASSIGNMENTS
CONTACT
NUMBER : +91 - 8285115522
2. What are the prosodic features
of speech?
Prosodic features of speech such as intonation and stress. A
segmentin spoken language is an individual
consonant, vowel, tone, or
stress that makes up a word. An
utterance is made up of both segments and suprasegmental features. These are
broadly divided up into Prosody and
Paralinguistics. Prosody refers to pitch, loudness, duration, intonation and
tempo. Para-linguistics, which is
much more difficult
to measure, r efers
to expression of voice
quality, emotion, speaking
style and speech
clarity. These features of the speech are responsible for the different
meanings an individual can construe from a simple sentence.
CONTACT
US FOR READY MADE SOLVED ASSIGNMENTS
CONTACT
NUMBER : +91 - 8285115522
3. Define hearing and Listening.
How is ‘hearing’ different from ‘listening’
Listening is
a highly complex,
interactive process, “by
which spoken language is
converted to meaning in the mind” (Lundsteen, 1979). As this definition suggests,
listening is more
than just hearing,
although children and adults
often use the
two terms, hearing
and listening, synonymously. Hearing is only one important
component of listening.
i) 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
CONTACT
US FOR READY MADE SOLVED ASSIGNMENTS
CONTACT
NUMBER : +91 - 8285115522
PROGRAM - MCA
SEMESTER SECOND
SUBJECT CODE & NAME - MCA2050- COMPUTER
ARCHITECTURE
1. Differentiate between Process
and Thread.
Concept of process
In operating system
terminology, instead of the term ‘program’, the notion of process is used in connection
with execution. It designates a commission or job, or
a quantum of
work dealt with
as an entity.
Consequently, the resources required,
such as address
space, are typically
allocated on a process
basis. Each process
has a life
cycle, which consists
of creation, an execution phase and termination.
CONTACT
US FOR READY MADE SOLVED ASSIGNMENTS
CONTACT
NUMBER : +91 - 8285115522
2. Explain the any five types of
addressing modes.
The following are the different types of address modes:
Implied Mode:
The operands in
this mode are
specified implicitly in the
explanation of the
instruction. For example,
the instruction ‘‘complement accumulator’’ is
considered as an
implied mode instruction
as the description of the
instruction implies the operand in the accumulator register. In fact,
all register references
instructions that use
an accumulator are implied
mode instructions. Zero-address
introductions are implied
mode instructions.
For example, the operation:
<a: = b + c;>
CONTACT
US FOR READY MADE SOLVED ASSIGNMENTS
CONTACT
NUMBER : +91 - 8285115522
3. Describe the
logical layout of
both RISC and
CISC computers
Pipeline in
RISC architecture: Before
discussing pipelines in
RISC machines, let us
first discuss what
is a RISC
machine? The term RISC
stands for Reduced Instruction Set Computing. RISC computers reduce chip
complexity by using simpler instructions. As a result, RISC compilers have
to generate software
routines to perform
complex instructions that
would have been done in hardware by CISC (Complex Instruction Set
Computing) computers. The salient features of RISC architecture are as follows:
CONTACT
US FOR READY MADE SOLVED ASSIGNMENTS
CONTACT
NUMBER : +91 - 8285115522
4. Explain the concept
of branch handling.
What is delayed branching?
Branch is
a flow altering
instruction that is
required to be
handled in a special
manner in pipelined
processors. Branch instruction’s impact
on the pipeline is shown in figure 1 (a) as below:
Figure 1: Branch Instruction’s impact on Pipeline
As shown
in figure 1,
the instruction Ib
is considered as a branch instruction. In the case
when branch is taken, the control is transferred to instruction It.
On the other hand, if branch is not taken, instructions available in pipeline
are of use.
In the case
when the branch is taken, every instruction available in pipeline, at different
CONTACT
US FOR READY MADE SOLVED ASSIGNMENTS
CONTACT
NUMBER : +91 - 8285115522
5. Explain any five types of
vector instructions in detail.
Types of Vector Instructions: The various types of vector instructions
for a register-register vector processor are:
(a) Vector-scalar instructions
(b) Vector-vector instructions
(c) Vector-memory instructions
(d) Gather and scatter instructions
(e) Masking instructions
(f) Vector reduction instructions
Let us discuss these.
(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 can
CONTACT
US FOR READY MADE SOLVED ASSIGNMENTS
CONTACT
NUMBER : +91 - 8285115522
6. Write short notes on:
a) UMA
b) NUMA
a) UMA
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 uniformity here. Uniformity predicts the performance
which is
a significant aspect for
code writing. Below figure (2) shows uniform memory access from the CPU on the
left.
Modern UMA machines are
of small size
and with single
bus multiprocessors. In the
CONTACT
US FOR READY MADE SOLVED ASSIGNMENTS
CONTACT
NUMBER : +91 - 8285115522
b) NUMA
NUMA (Non Uniform Memory Access): They are
intended for avoiding the memory
access disadvantage of
Uniform Memory Access
machines. The logically shared
memory is spread
between all the
processing nodes of NUMA machines, giving rise to distributed
shared memory architectures. Figure
(2) shows non
uniform memory between
the left and
right disks. Although these
parallel computers became
highly scalable, yet
they are
CONTACT
US FOR READY MADE SOLVED ASSIGNMENTS
CONTACT
NUMBER : +91 - 8285115522
No comments:
Post a Comment