1. Dear students get fully solved SMU MBA Spring 2014 assignments
Send your semester & Specialization name to our mail id :
“ help.mbaassignments@gmail.com ”
or
Call us at : 08263069601
SPRING 2014, ASSIGNMENT
PROGRAM – BCA (REVISED FALL 2012)
SEMESTER - II
SUBJECT CODE & NAME - BCA2020/IMC2020-DATA STRUCTURE AND ALGORITHM
BK ID - B1640, CREDIT – 4, MAXIMUM MARKS - 60
Q1. What do you mean by data structure operation? Briefly explain some of the operations used
frequently. 4+6=10
Answer:
Data Structure Operation
Operations are used to process the data appearing in the data structure. In fact, the data structure is
chosen based on the frequency with which specific operations are performed.
Q2. Briefly explain Insertion Algorithms. 10
Answer: Insertion Algorithms
We have algorithms for various situation of inserting an ITEM into linked list.
Q3. What is queue? Briefly explain array implementation of queue. 5+5=10
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 figure
3.7. The terms “front” and “rear” are used in describing a linear list only when it is
Q4. Write a short note on: NP-Completeness and Optimization versus decision problems. 5+5=10
Answer: NP-Completeness
The ‘NP’ stands for ‘nondeterministic polynomial time’, which says about the fact that a solution for
certain type of a problem can be checked (but may not be found) in polynomial time. This class of
algorithms informally indicates that there is a polynomial time for checking a solution for a problem
whose solution may be difficult to be found out. In studying the theory of NP-
Q5. Write the Algorithm to find the maximum and minimum items in a set of ‘n’ element. 5+5=10

2. Answer: The problem is to find the maximum and minimum items in a set of n elements.
Q6. Briefly explain Greedy Method Strategy. 10
Answer: The greedy method suggests that one can device an algorithm that works in stages,
considering one input at a time. At each stage, a decision is made regarding whether a particular
input is in an optimal solution. This is done by considering the inputs in an order determined by
Dear students get fully solved SMU MBA Spring 2014 assignments
Send your semester & Specialization name to our mail id :
“ help.mbaassignments@gmail.com ”
or
Call us at : 08263069601
[SPRING, 2014] ASSIGNMENT
PROGRAM – BCA (REVISED FALL 2012)
SEMESTER - II
SUBJECT CODE & NAME - BCA2010 – OPERATING SYSTEM
CREDIT – 4 BK ID - B1405 MAX. MARKS =60
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, the OS performs basic tasks, such as controlling and allocating memory,
Q2. What is hardware virtual machine? Discuss the three ways through which the software
virtualization can be done 4+6=10
Answer:
Hardware Virtual Machine
The original meaning of virtual machine, sometimes called a hardware virtual machine, is that of a
number of discrete identical execution environments on a single computer, each of which runs
Q3. Explain the following scheduling algorithm [10 Marks].
a) First come first served
b) Shortest Job First 5+5=10
Answer:
a) First-Come-First-Served Scheduling Algorithm

3. 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
Q4. Define deadlock. Discuss any four conditions that lead to deadlock 4+6= 10
Answer: Definition:
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
Q5. 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
Q6. What is computer virus? List the types of virus and its various infection methods. 4+6 = 10
Answer: Computer Virus
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
Dear students get fully solved SMU MBA Spring 2014 assignments
Send your semester & Specialization name to our mail id :
“ help.mbaassignments@gmail.com ”
or
Call us at : 08263069601