Sunday, 21 June 2015

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



mit3043 smu msc it Spring 2015 IIIrd 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 500/semester only.
if urgent then call us on 08791490301, 08273413412

PROGRAM Master of Science in Information Technology (MSc IT)Revised Fall 2011
SEMESTER 3
SUBJECT CODE &
NAME
MIT3043– Graphics and Multimedia Systems

Qus:1. Explain the types of 3D displays.
Answer:
The types of 3D displays:
The types of 3D displays are :
·         Stereoscopy (also called stereoscopic or 3-D imaging) refers to a technique for creating or enhancing the illusion of depth in an image by presenting two offset images separately to the left and right eye of the viewer. Both of these 2-D offset images are then combined in the


Qus:2 Explain Midpoint circle algorithm.
Answer:
Midpoint circle algorithm:
In computer graphics, the midpoint circle algorithm is an algorithm used to determine the points needed for drawing


Qus:3 Write a note on 3D viewing.
Answer:
3D viewing:
Viewing a scene in 3D is much more complicated than 2D viewing, where in the latter the viewing plane on which a scene is projected from WCs is basically the screen, except for its dimensions. In 3D, we can choose different viewing planes, directions to view from and positions to view from. We also have a choice in how we project from the WC scene onto the viewing plane. In


Qus:4 What are the different types of coherence? Explain any three.
Answer:
The different types of coherence:
1.      Object Coherence
2.      Face Coherence
3.      Edge Coherence
4.      Scan line Coherence
5.      Area and Span Coherence
6.      Depth Coherence
7.      Frame Coherence
1. Object Coherence:
Visibility of an object can


Qus:5 What is multimedia? Explain briefly the uses of multimedia.
Answer:
Multimedia:
Multimedia is the media that uses multiple forms of information content and information processing (e.g. text, audio, graphics, animation, and video, interactivity) to inform or entertain the user. Multimedia also refers to the use of electronic media to store and experience multimedia content.


Qus:6 Explain the types of MIDI messages.
Answer:
The types of MIDI messages:
MIDI messages can be broadly classified into two types as shown 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 500/semester only.
if urgent then call us on 08791490301, 08273413412



mit3033 smu msc it Spring 2015 IIIrd 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 500/semester only.
if urgent then call us on 08791490301, 08273413412

PROGRAM Master of Science in Information Technology (MSc IT)Revised Fall 2011
SEMESTER 3
SUBJECT CODE &
NAME
MIT3033– Software Architecture
Qus:1 What are the advantages and disadvantages of layered systems?
Answer:
Advantages of layered systems:
The advantages of layered systems are:

·         It facilitates design based on the increasing levels of abstraction. This permits division of a complex


Qus:2 What are the benefits and properties of architectural styles?
Answer:
The benefits and properties of architectural styles:
Benefits of architectural styles:
Some of the benefits of architectural styles are:

·         It provides a common language that can be understood by the architect as well as the developers of


Qus:3 List the steps involved in the implementation of the blackboard pattern.
Answer:
The steps involved in the implementation of the blackboard pattern:
The steps involved in the implementation of the blackboard pattern, which are as follows:

Step 1: The problem has to be defined by:

·         Specifying the problem domain and the field of knowledge necessary to find a solution.
·         Scrutinizing
·          
·          
·          



Qus:4 List and explain the two design methods used in software engineering.
Answer:
The two design methods used in software engineering:
The two design methods used in software engineering. They are:
·         Routine Design Method.
·         Innovative Design Method.

·         Routine Design

·          




Qus:5 List the different types of design patterns and explain any three.
Answer:
The different types of design patterns:


Qus:6 Explain the importance of documenting architecture.
Answer:
The importance of documenting architecture:
Documenting the software architecture is considered as a blueprint for analysis and offers a high level view of the evolving system. Documenting the various views and every stage of architectural

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