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
ASSIGNMENT DRIVE - fall 2017
PROGRAM - Bachelor of Computer
Application - BCA
SEMESTER - I
SUBJECT CODE & NAME - BCA211 –
Operating System
BK ID B1405 NUMBER OF ASSIGNMENTS,
CREDITS & MARKS 2, 4 Credits, 30 marks each
Assignment
Set -1 Questions
Q1 What are the components of UNIX
Kernel? 10
Answer:-
The UNIX kernel s
divided in to three modes: user mode, kernel mode, and hardware. The user mode
contains user programs
Q2. Discuss First-Come-First-Served
scheduling algorithm. 10
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
Q3 a) What are the necessary conditions
for deadlock to occur? b) Write a note on Resource Allocation Graph. 4+6
Answer:-
a)
A deadlock occurs
in a system if the following four conditions hold simultaneously:
1) Mutual exclusion:
Assignment
Set -2 Questions
Q1 Discuss the concept of Direct Memory
Access. 10
Answer:-
In most mini and
mainframe computer systems, a great deal of input and output occurs between the
disk system and the processor. It would be very inefficient to perform these
operations directly through the processor;
Q2 Explain demand paging in virtual
memory system. 10
Answer:-
Demand paging is
similar to paging with swapping (Refer figure below). When a process is to be
executed then only that page of the process, which needs to be currently executed,
is swapped into memory. Thus, only necessary pages
Q3 What are the different forms of
Encryption in Distributed System? 10
Answer:-
Encryption in a
distributed environment can be of two forms:
End-to-end encryption
Link encryption
If end-to-end
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
ASSIGNMENT DRIVE - fall
2017
PROGRAM - Bachelor of
Computer Application – BCA
SEMESTER - I
SUBJECT CODE & NAME -
BCA212 – Data Structure and Algorithm
BK ID B1640 NUMBER OF
ASSIGNMENTS, CREDITS & MARKS 2, 4 Credits, 30 marks each
Assignment
Set -1 Questions
Q1 Explain Adjacency Matrix and Incidence
matrix form of representing a graph. 5+5
Answer:-
Adjacency matrix
It is a two-dimensional Boolean matrix to
store the information about the graph nodes. Here the rows and columns
represent source and destination vertices and entries in the matrix indicate
whether an edge exists between the vertices
Q2 Explain in detail the traversing and
searching of linked list. 5+5
Answer:-
Traversing a
Linked List Traversing a linked list means processing each node of list exactly
once. The linked list in
Q3 Discuss the stack data structure with
Push () and Pop () operation. 10
Answer:-
A stack is a data
structures in which insertion and deletion of items are made at the one end,
called the top of the stack
Assignment
Set -2 Questions
Q1 Write the Algorithm for sorting by
Partitioning.
Answer:-
In merge sort,
the file a[1:n] was divided at its midpoint into subarrays which were
independently sorted and later merged.
In quick sort,
Q2 Explain the Concept of travelling
Salesman Problem
Answer:-
A tour of G is a
directed simple cycle that includes every vertex in V. The cost of the tour is
the sum of the cost of the edges on the tour. The travelling salesperson
problem is to find a tour of minimum cost. Let G=(V,E) be a
Q3 Explain how Dijkstra’s algorithm is
used to find the shortest path of Directed weighted graph.
10
Answer:-
This algorithm is
used to find the shortest path between the two vertices in a weighted directed
graph and it is also very popular and efficient to find each and every path
from starting (source) to terminal vertices.
Let w(vi , vj ) be the weight associated with every edge (vi , vj ) in a
given weighted directed graph G. Let us
define that the weights are such that the
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
ASSIGNMENT DRIVE - fall 2017
PROGRAM - Bachelor of Computer
Application – BCA
SEMESTER - I
SUBJECT CODE & NAME - BCA213 – Object
Oriented Programming – C++
BK ID B2114 NUMBER OF ASSIGNMENTS,
CREDITS & MARKS 2, 4 Credits, 30 marks each
Assignment
Set -1 Questions
Q1 Differentiate between an external
variable and an automatic variable with the help of an example. 10
Answer:-
Automatic
variables is default variable in C++. All the variables we have created and
used in programs are automatic variables. These variables can also be declared
by prefixing the keyword auto. One of important characteristics of
Q2 What is “this pointer” in C++? What
are the features of “this pointer”? [3+7]
Answer:-
The this pointer is used as a pointer to
the class object instance by the member function. The address of the class
instance is passed as an implicit parameter to the member functions. The sample
below, in this section shows how to use it. It is common knowledge that C++
keeps only one copy of each member function
Q3 Explain destructor in detail. 10
Answer:-
Destructors are
usually used to deallocate memory and do other cleanup for a class object and
its class members when the object is destroyed. A destructor is called for a
class object when that object passes out of scope or is
Assignment
Set -2 Questions
Q1 What is Polymorphism? What are the
different types of Polymorphism? 3+7
Answer:-
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 object to be drawn on the screen. You would like to write a common
code as
Q2 Explain sequence containers 10
Answer:-
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
Q3 Discuss the following functions of
file operations a) tellg() b) seekp() c) ignore() d) getline() 2.5x4
Answer:-
a) tellg()
tellg() – Returns
an int type, that shows the current position of the inside-pointer. This one
works only when you read a file. Example:
#include <
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
ASSIGNMENT DRIVE - fall
2017
PROGRAM Bachelor of
Computer Application – BCA
SEMESTER - 2
SUBJECT CODE & NAME -
BCA214 – Communication Skills
BK ID B1026 NUMBER OF
ASSIGNMENTS, CREDITS & MARKS 1, 2 Credits & 30 marks
Assignment Questions
Q1 Discuss the advantages and
disadvantages of oral communication. Write a short note on the improvement of
oral communication 5+5=10
Answer:-
Advantages of oral communication:-
In oral
communication there is a possibility of immediate response. This makes speedy
interaction and immediate feedback possible. This is the biggest advantage of
oral communication.
Another advantage
is that the speaker can observe the listener's reaction to what is being
stated.
Time saving: When action
is
Q2 What is the difference between
listening and hearing? Name the different types of listening. 5+5=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
Q3 Discuss the definition and meaning of
reading. 10
Answer:-
The following are
a few definitions regarding the process of reading.
Reading is thinking under the stimulus of the printed page (Webster,
1982:30)
Reading is a Psycho-
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
ASSIGNMENT DRIVE - fall 2017
PROGRAM - Bachelor of Computer
Application – BCA
SEMESTER - I
SUBJECT CODE & NAME - BCA215 –
Computer Organization
BK ID B1642 NUMBER OF ASSIGNMENTS,
CREDITS & MARKS 2, 4 Credits, 30 marks each
Assignment
Set -1 Questions
Q1 What do you mean by addressing modes?
List the different types of addressing modes. 3+7
Answer:-
Addressing Modes
In general, a
program operates on data that reside in the computer’s memory. These data can
be organized in a variety of ways. If we want to keep track of students’ names,
we can write them in a list. If we want to associate information with each
name, for example to record telephone numbers or marks in various courses, we
may organize this
Q2 Explain the programmer’s model of
8086. 10
Answer:-
The programmer’s
model of 8086 is the most important concept to study in the 8086 model. Figure
below shows the register organisation of 8086. This is termed as the
Programmer’s model of 8086. The registers shown in the programmer’s
Q3 Explain the process of fetching a word
from the memory. 10
Answer:-
To fetch a word
of information from the memory CPU must specify the address of the memory
location where this word is located and request a read operation. This includes
whether the information to be fetched represents an instruction
Assignment
Set -2 Questions
Q1 Write a note on replacement
algorithms. 10
Answer:-
When a new block
is to be brought into the cache and all
the positions that it may occupy are full, then the cache controller must
decide which of the old blocks to overwrite. Because the programs usually stay
in localized areas for a reasonable period of time, there is high probability
that the blocks that have been referenced recently will be
Q2 Explain the concept of coprocessor.
Also explain its functions. 4+6
Answer:-
Coprocessor
Coprocessor is a
relatively new concept in the area of multiprocessing. A coprocessor refers to
a computer processor which is utilised as an addition to the functions of the
cpu (the primary processor). A coprocessor is also known as a math processor or
a numeric processor. It is capable of carrying out large amount of
computations, thereby
Q3 How CPU responds to an interrupt? 10
Answer:-
The CPU checks
periodically to determine if an interrupt signal is pending. This check is
usually done at the end of each instruction, although some modern machines
allow for interrupts to be checked for several times during the execution of
very long instructions. When the CPU detects an interrupt, it then saves its
current state (at least the PC
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
