Mca winter 2013 2nd sem

Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :
help.mbaassignments@gmail.com
or
call us at : 08263069601

WINTER 2013 ASSIGNMENT
PROGRAM MCA (REVISED FALL 2012)
SEMESTER SECOND
SUBJECT CODE & NAME MCA2050- COMPUTER ARCHITECTURE
CREDIT 4
BK ID B1648

Q. No.1 Differentiate between Process and Thread.
[5+5]
Answer:
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.
Process creation involves the following four main actions:
2 What are instruction sets? Give the classification of the various instruction sets.
[5+5]
Answer: An instruction set, or instruction set architecture (ISA), is the part of the computer
architecture related to programming, including the native data types, instructions, registers,
addressing modes, memory architecture, interrupt and exception handling, and external I/O. An ISA
includes a specification of the set of opcodes (machine language), and the native commands
implemented by a particular processor.

3 What do you mean by hazards? Explain the types of hazards
[4+6]
Answer:
Hazards are the situations that stop the next instruction in the instruction stream from being
executed during its designated clock cycle.
Hazards reduce the performance from the ideal speedup gained by pipelining. In general, there are
three major categories of hazards that can affect normal operation of a pipeline.

1. Structural hazards (also called resource conflicts): They occur from resource conflicts when the
hardware cannot support all possible combinations of instructions in simultaneous overlapped
execution. These are caused by multiple accesses to memory performed by segments. In most cases
this problem can be resolved by using separate instruction and data memories.
2. Data hazards (also called data dependency): They occur when an instruction depends on the
result of
4 What do you understand by parallel processing? Describe Pipeline Processing.
[3+7]
Answer: Parallel processing is basic part of our everyday life. The concept of parallel processing is so
natural in our life that we use it without even realising. When we face some crisis, we take help from
others and involve them to solve it more easily. This cooperation of using two or more helpers to
make easy the solution of some problem may be termed parallel processing. The aim of parallel
processing is therefore to solve a particular problem more rapidly, or to enable the solution of a
particular problem that would otherwise be not solvable by one person. The principles of parallel
processing are, however, not recent, as evidence suggests that the computational devices used over
2000 years ago also used this.
5 Differentiate between unconditional and conditional branch.
[5+5]
Answer:
Unconditional Branch
This type of branch is considered as the simplest one. It is used to transfer control to a particular
target. Let us discuss an example as follows:
branch target
Target address specification can be performed in any of the following ways:
6 Write short notes on:
a) Vector Length
b) Vector Stride
[5+5]
Answer: Vector length
Particularly, we have two cases in our hands:
One in which the vector size is less than the vector register size, and
The second in which the vector size is larger than the vector register size.
Let’s observe the easier of these two problems.
Handling smaller vectors: In case the vector size is less than 64, we have to permit the system to
be aware that it should not function on all the 64 elements in the vector registers. This can be
simply done

or
call us at : 08263069601

SEMESTER SECOND
SUBJECT CODE & NAME MCA2040- COMMUNICATION SKILLS

Q. No.1 what is nonverbal communication? Give five examples for non-verbal communication
5+5
10
Answer:
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:
i) word-less communication like gesture; body language or posture; facial expression and eye gaze.

2 What are the prosodic features of speech?
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
communication, we use and interpret these features without really thinking about them. There are
various conventional ways of representing them in writing, although the nuances are often hard to
convey on paper.

3. 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 shortcomings, you just hear it without
paying much attention.
Listening: It is an active process. It involves the conscious desire to determine the meaning of what
is

or
call us at : 08263069601
SEMESTER SECOND
SUBJECT CODE & NAME MCA2030- OBJECT ORIENTED PROGRAMMING – C++

Q. No.1 Differentiate between Objects and Classes
[5+5]
Answer: An Object is a program representation of some real-world thing (i.e person, place or an
event). Objects can have both attributes(data) and behaviours (functions or methods). Attributes
describe the object with respect to certain parameters and Behaviour or functions describe the
functionality of the object.
According to Pressman, Objects can be any one of the following:
a) External entities b) Things c) Occurrences or events d) Roles e) Organisational units f) Places g)
Data Structures
2 Explain about friend functions and friend classes in detail
Answer:
Friend Functions

Friend functions can be declared anywhere within a class declaration, but it is common practice to
list friends at the beginning of the class. The public and protected keywords do not apply to friend
functions, as the class has no control over the scope of friends.
If we want to declare an external function as friend of a class, thus allowing this function to have
access to the private and protected members of this class, we do it by declaring a prototype of this
external function
3 Differentiate between Constructors and Destructors
Answer: Constructor:
Constructor is Used to Initialize the Object.
Constructor can takes arguments.
Constructor overloading can be possible means more than one constructors can be defined
4 Discuss operator overloading. What are the advantage and disadvantage of operator
overloading in brief.
Answer:
Operator overloading is the ability to tell the compiler how to perform a certain operation when its
corresponding operator is used on one or more variables. In object-oriented programming, operator
overloading less commonly known as operator ad-hoc polymorphism is a specific case of
polymorphism, where different operators have different implementations depending on their
arguments. Operator overloading is generally defined by the language, the programmer, or both.
5 Explain the concept of virtual function and polymorphism in OOPS with example.
Answer:
Virtual Functions
Virtual means existing in effect but not in reality. Virtual functions are primarily used in inheritance.
Let us suppose you have a class base as shown in the following program and two classes derv1 and
derv2 are publicly derived from class base. You would like to create a pointer that points to any of
the derived class objects. If you create a pointer of derv1, then it can point to derv1 object only.
Compiler will complain if
6 Describe the two basic exception handling models.
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 context by creating an object containing that information and “throwing” it out of your
current context. This is called throwing an exception. Here’s what it looks like:
throw myerror(“something bad happened”);
myerror is an ordinary class, which takes a char* as its argument. You

or
call us at : 08263069601

SEMESTER SECOND
SUBJECT CODE & NAME MCA2020- ADVANCED DATA STRUCTURE

Q. No.1 Define data structure? Explain different types of data structures
[3+7] 10
Answer: A data structure is a particular way of storing and organizing data in a computer so that it
can be used efficiently.
Different kinds of data structures are suited to different kinds of applications, and some are highly
specialized to specific tasks. For example, B-trees are particularly well-suited for implementation of
databases, while compiler implementations usually use hash tables to look up identifiers.
Data structures provide a means to manage large amounts of data efficiently, such as large
databases and internet indexing services. Usually, efficient data structures are a key to designing
efficient algorithms. Some formal design methods and programming languages emphasize data
structures, rather than algorithms, as the key organizing factor in software design. Storing and
retrieving can be carried out on data stored in both main memory and in secondary memory.
2 Discuss in detail any two Mathematical notations and functions which appear on algorithmic
analysis.
[2*5] 10
Answer:
The following are the some of the mathematical functions.
Floor and ceiling functions
Remainder function
Integer and absolute value functions
3 Describe the following types of linked list
a. Doubly linked list
Answer:
Doubly linked list

In some situation we need to traverse both forward and backward of a linked list. The linked list with
this property needs two link field one to point the next node is called next link field and another to
point the previous node is called previous link field. The linked list containing this type of nodes is
called doubly linked list or two- way list. Here first nodes previous link field and the last nodes next
link field are marked as null. The figure 3.15 shows the node structure.

4 Differentiate between Breadth-first and depth-first search algorithm.
[5+5] 10
Answer: Graph algorithms are generally used in computer science to find and examine a path
between the nodes using algorithm like depth-first search and breadth-first search. These algorithms
are used generally for the examination of the graph so that further manipulation of data structure
becomes easier and more appropriate
Breadth first search
This algorithm uses a queue data structure to perform the search. The effect of this is to process all
nodes adjacent to the start node before we process the nodes adjacent to those nodes.
If all of the edges in a graph are unweighted (or the same weight) then the first time a node is visited
is the
5 Explain the meaning of dynamic storage management. Also explain the concept of storage
release.
[5+5] 10
Answer: Memory holds basically programs and their data. All the program need to manipulate the
data in order to complete the task. These data should be stored in the memory for manipulation, so
these data can be managed in two different ways. Like static storage management and dynamic
storage management.
Primitive and static natures of data structures like integer, real, or character variable has the
characters
6 Write short note on:
a) Sequential search
Answer:
Sequential searching
The simplest type of searching process is the sequential search or linear search. In the sequential
search, each element of the array is compared to the key, in the order it appears in the array, until
the first element matching the key is found. If you are looking for an element that is near the front of
the array, the sequential search will find it quickly. The more data that must be searched, the longer
it will take to find the data that matches the key using this process.
For a list with n items, the best case is when the value is equal to the first element of the list, in
which case only one comparison is needed. The worst case is when the value is not in the list (or
occurs only once at the end of the list), in which case n comparisons are needed. The input to a
search algorithm is an array of objects A, the number of objects n, and the key value being sought x.

or
call us at : 08263069601

SEMESTER SECOND
MCA2010 – OPERATING SYSTEM

Q.No 1 Differentiate between Simple Batch Operating Systems and Timesharing
Operating Systems. 5+5= 10
Answer:
Simple Batch Operating Systems
In the earliest days digital computers usually run from a console. I/O devices consisted of card
readers, tape drives and line printers. Direct user interaction with the system did not exist. Users
made a job consisting of programs, data and control information. The job was submitted
2 What is the best methodology available to create a modular kernel? List the seven types of
loadable kernel modules in Solaris.
3+7 10
Answer: Perhaps the best current methodology for operating-system design involves using objectoriented programming techniques to create a modular kernel. Here, the kernel has a set of core
components and dynamically links in additional services either during boot time or during run time.
Such a strategy uses dynamically loadable modules and is common in modern implementations of
UNIX, such as Solaris, Linux and MacOS. For example, the Solaris operating system structure is
organized around a core kernel with seven types of loadable kernel modules:
3 Explain the following scheduling algorithm.
a) First come First served
Answer:
This is one of the brute force algorithms. A process that requests for the CPU first is allocated the
CPU first. Hence, the name first come first serve. The FCFS algorithm is implemented by using a first-

in-first-out (FIFO) queue structure for the ready queue. This queue has a head and a tail. When a
process joins the ready queue its PCB is linked to the tail of the FIFO queue. When the CPU is idle,
the process at the head of the FIFO queue is allocated the CPU and deleted from the queue.
4. Define deadlock. Discuss any four conditions that lead to deadlock.
2+8 10
Answer:
Several processes compete for a finite set of resources in a multi-programmed 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.
5 Write short notes on:
a) Segmentation
Answer: Memory management using paging provides two entirely different views of memory – User
/ logical / virtual view and the actual / physical view. Both are not the same. In fact, the user’s view is
mapped on to the physical view. How do users visualize memory? Users prefer to view memory as a
collection of variable sized segments.
Segmentation is a memory management scheme that supports user’s view of main memory
described above. The logical address is then a collection of segments, each having a name and a
6 What is computer virus? List the types of virus and its various infection methods
2+2+6 10
Answer: A computer virus is written with an intention of infecting other programs. It is a part of a
program that piggybacks on to a valid program. It differs from the worm in the following ways:
Worm is a complete program by itself and can execute independently whereas virus does not
operate independently.

or
call us at : 08263069601

Mca winter 2013 2nd sem

More Related Content

What's hot

Viewers also liked

Similar to Mca winter 2013 2nd sem

Mca winter 2013 2nd sem