Saturday, 27 June 2015

bca2040 smu bca Spring 2015 IInd sem assignment

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 and rs 625/semester only.
if urgent then call us on 08791490301, 08273413412
Spring 2015 ASSIGNMENT
PROGRAM – BCA (REVISED FALL 2012)
SEMESTER - II
SUBJECT CODE & NAME - BCA2040- COMMUNICATION SKILLS
CREDIT – 2, BK ID - B1026, MAX. MARKS 30


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


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

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 and rs 625/semester only.
if urgent then call us on 08791490301, 08273413412



Sunday, 21 June 2015

bca2050 smu bca Spring 2015 IInd sem assignment

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 and rs 625/semester only.
if urgent then call us on 08791490301, 08273413412

Spring 2015, Assignment
PROGRAM – BCA (REVISED FALL 2012)
SEMESTER - 2
SUBJECT CODE & NAME - BCA2050/IMC2050 COMPUTER ORGANISATION
BK ID - B1642CREDIT – 4MAXIMUM MARKS - 60

Qus:1 What are the functions of Input and output devices?
Answer:
The functions of Input and output devices:
Functions of Input devices:
The data input by the human user is in the form of human-understandable language and needs to be converted into machine-


Qus:2 List the fundamental design issues in designing an instruction set.
Answer:
The fundamental design issues in designing an instruction set:
1. Operation Repertoire: How many and which operations to provide, and how complex operations should be?

2. Data Types: The various types of data upon which operations are performed.


Qus:3 What is the meaning of arithmetic associativity? Explain in brief.
Answer:
Arithmetic Associativity:
Computer arithmetic covers methods of representing integers and real values in digital systems and effective algorithms for controlling such numbers by way of software or hardware circuits. Hardware aspect of computer arithmetic includes adders, subtractors, dividers, multipliers, square-rooters,

Q4. Briefly explain the read and write cycle of an 8086 processor.
Answer:
The read and write cycle of an 8086 processor :

After understanding of the instruction cycle of the processor, now let us learn about the Read-Write cycles. Read Cycle is Data


Q5. Briefly explain Interrupt Driven I/O.
Answer:

Interrupt Driven I/O:

Using Program-controlled I/O requires continuous involvement of the processor in the I/O activities. It is desirable to avoid wasting processor execution time. An alternative is for the CPU to issue an I/O command to a module and then


Qus:6 What is the difference between Synchronous and Asynchronous Data Transfer?
Answer:
The difference between Synchronous and Asynchronous Data Transfer:
Synchronous data transfer:

In synchronous data transmission, data is transmitted though a bit-stream, that transmits a group of characters in a single stream. In this type of data transfer, the transmission speed is synchronised at both the sender and receiver by

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 and rs 625/semester only.
if urgent then call us on 08791490301, 08273413412



bca2030 smu bca Spring 2015 IInd sem assignment

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 and rs 625/semester only.
if urgent then call us on 08791490301, 08273413412
Spring 2015, ASSIGNMENT
PROGRAM – BCA (REVISED FALL 2012)
SEMESTER - 2
SUBJECT CODE & NAME - BCA2030- OBJECT ORIENTED PROGRAMMING – C++
CREDIT – 4 BK ID - B1641, MAX. MARKS - 60

Q1. Write short notes on:
a) Switch statement
b) Conditional Operator
Answer:
a) Switch statement:
switch statement allows a variable to be tested for equality against a list of values. Each value is called a case, 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 contains one or more related objects.
A Class is static. All of the


Q3. 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 insame class.
  • Constructor has same name as class name.
  • Syntax of constructor:
                class class_name
                  {
                     clas_sname(){}
                     class_name(argulist){}
                 } ;

  • Constructor are of following:
               1)Default Constructor.
               2)Parameterized Constructor.
               3)Copy Constructor.
 
  • Constructors can be used to dynamically initialize the memory.
  • Constructor indirectly use the New operator to initialize the object.

Destructor:
  • Destructor is used to destroy the object that are created in memory previously.
  • Destructor can not take any arguments.
  • Destructor overloading can not be possible.
  • Destructor has same name as class name with tiled operator.
  • Syntax of Destructor:
                 class class_name
                   {

                       ~class-name(void){}
                   };
 
  • Destructor has no any types.
  • Destructor can be used to deallocate the memory.
  • Destructor indirectly use the Delete operator to destroy the object initialize by constructor.

Q4. Describe the two basic exception handling models. 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 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 myerr


Q5. Write a C++ program to swap two numbers without using a temporary variable. 10
Answer:
1.      /*
2.       * C++ program to swap two numbers without using a temporary variable
3.       */
4



Q6. Write A C++ program to implement class rectangle and find its area.
Answer:
#include <iostream.h> 

#include<conio.h> 

class Rectangle 

{ 

               int x, y; 


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 and rs 625/semester only.
if urgent then call us on 08791490301, 08273413412



bca2020 smu bca Spring 2015 IInd sem assignment

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 and rs 625/semester only.
if urgent then call us on 08791490301, 08273413412

Spring 2015, 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


Qus:1 Briefly explain about memory allocation and garbage collection.
Answer:
Memory Allocation:
The maintenance of linked lists in memory assumes the possibility of inserting new nodes into the lists and hence requires some mechanism which provides unused memory space for the new nodes. Analogously, some mechanism is required whereby the memory space of deleted nodes becomes available for


Qus:2 Briefly explain basic concepts of Graphs.
Answer:
Basic concepts of Graphs:
In a graph data structure there are certain terms and terminologies that you should know about. A graph data structure consists mainly of
a)      A set of entities



Qus:3 What is queue? Briefly explain array 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 figure. The terms “front” and “


Qus:4 Write a short note on: NP-Completeness and Optimization versus decision problems.
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


Qus:5 Briefly explain the Binary search Method.

Answer:

The Binary search Method:

Let ai, 1 < i < n be a list of elements that are sorted in non-decreasing order. Consider the problem of determining whether a given element x is present in the list. If x is present we are to determine a value j


Qus:6 Briefly explain Greedy Method Strategy.
Answer:

Greedy Method Strategy:

The greedy method suggests that one can device an algorithm that works in stages, considering one input at a time

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 and rs 625/semester only.
if urgent then call us on 08791490301, 08273413412



bca2010 smu bca Spring 2015 IInd sem assignment

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 and rs 625/semester only.
if urgent then call us on 08791490301, 08273413412

Spring 2015 ASSIGNMENT
PROGRAM BCA
SEMESTER - 2
SUBJECT CODE & NAME –bca2010
CREDIT – 4 BK ID - B1405, MAX. MARKS - 60

Q1. 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 to an operator who would execute the job on the computer system. The output appeared after minutes, hours or sometimes days. The user collected the output from the operator, which also included a memory dump. The operating system was very simple and its major task was to transfer control from one job to another.
To speed up processing, jobs with the same needs were batched together and executed as a group. For example, all FORTRAN jobs were batched together for execution; all COBOL jobs
were


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:



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 processes


Q4 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 on the tape

Q5 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


Q6. Explain LRU page replacement algorithm with example.
Answer: The least recently used page (LRU) replacement algorithm, though similar in name to NRU, differs in the fact that LRU keeps track of page usage over a short period of time, while NRU just looks at the usage in the last clock interval. LRU works on the idea that pages that have been most heavily used in the past few instructions are most likely to be used heavily in the next few

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 and rs 625/semester only.
if urgent then call us on 08791490301, 08273413412