Saturday, 24 June 2017

bca213 smu bca spring 2017 (july/aug 2017 exam) 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
If urgent then call us on 08791490301

ASSIGNMENT DRIVE - SPRING 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 these variables are that they are created only when the function or program block in which they are

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


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

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

Q2 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 <

Q3 Explain sequence containers 10
Answer:-
STL provides a number of container types, representing objects that contain other objects. The STL contains sequence containers and

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



bca212 smu bca spring 2017 (july/aug 2017 exam) 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
If urgent then call us on 08791490301


ASSIGNMENT DRIVE - SPRING 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 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 memory is stored as linear array DATA and LINK with START pointing to the first element and NULL indicating the end of the list. Let us


Q2 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.  We have two basic operations

Q3 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 associated with

Assignment Set -2 Questions
Q1 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 total weight from vertex  vi  to  vk  via vertex vj  is w(vi , vj ) + w(vj , vk ). Using this form of definition , the weight from a vertex  vs (source) to vertex vt  (end of path) in the graph G for a given path (

Q2 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, the division into two subarrays is made so that the sorted subarrays do not need to be merged later. This is

Q3 Explain the Concept of travelling Salesman Problem 
Answer:-
A tour of G is a directed simple cycle that includes every vertex

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



bca211 smu bca spring 2017 (july/aug 2017 exam) 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
If urgent then call us on 08791490301

ASSIGNMENT DRIVE - SPRING 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 which can access the services of the kernel components using system call interface.
The kernel mode has four major

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 for the ready

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: At least one of the


Assignment Set -2 Questions
Q1 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 of

Q2 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; it is much more efficient if such devices, which can transfer data at a very high rate, place the data directly into the memory, or take the data directly

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 encryption is used, the encryption / decryption devices are needed only at the ends. Data from source to destination moves on the network 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
If urgent then call us on 08791490301



Saturday, 10 June 2017

mit301 smu msc it spring 2017 (july/aug 2017 exam) 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
If urgent then call us on 08791490301

PROGRAM
Master of Science in Information Technology(MSc IT)Revised Fall 2011
SEMESTER
3
SUBJECT CODE & NAME
MIT301– Object Oriented Analysis and Design(OOAD)

Qus:1 Explain the following object oriented properties:
(a) Inheritance
(b) Polymorphism
(c) Encapsulation
(d) Abstraction
Answer: (a) Inheritance
Inheritance is defined as the property of an object oriented system, where one class shares the structure or behavior of one or more other classes. It allows us to build new objects from the existing ones.
We can view inheritance as a relationship between a parent class and the sub classes. To study the use


Qus:2 What is meant by unified approach? Describe the steps, methods and tools of unified approach.
Answer:   Unified approach is a better way for understanding concepts of objects oriented system development. Unified approach is a methodology for software development. The unified approach, based on methodologies given by Booch, Rum Baugh and Jacobson tries to combine the methods and guidelines of unified modeling language.
We can define unified modeling language (UML) as a set of notations and conventions that are used to describe and shape an application of the system. But UML will not specify

Qus:3 Describe the various states of activity diagram.
Answer: Activity diagrams are special cases of state chart diagrams. An activity diagram has actions as states. It can be considered as some kind of elaborate flow diagram and has therefore some graphical structures for handling conditions like a diamond shaped box for conditionals


Qus:4 Discuss the strategies for designing classes.
Answer: The object oriented design process is a complex process. The following methods can help you design better classes:
1) Analyze the role of the objects of the class in the application. An object can play any of the following roles:
 Value


Qus:5 Mention and describe the basic categories of program errors.
Answer: Debugging is a process of finding errors in the code which cause unexpected results and eliminating them. The process of testing and identifying bugs is a balance of science, art and luck.
There are three basic categories of program errors:
1) Syntax errors
2) Run-time

Qus:6 Explain the following:
(a) Black box testing
(b) White box testing
Answer: (a) Black box testing
This treats the system as one that cannot be seen in detail. The structure of the program is not taken into account. The tests are performed based on what the program does. This is sometimes called functional testing.
The functional

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



mca5010 smu mca spring 2017 (july/aug 2017 exam) Vth 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
If urgent then call us on 08791490301

PROGRAM-MCASEMESTER-V
SUBJECT CODE & NAME-MCA5010-WEB TECHNOLOGIES
CREDIT-4
BK ID-B1547
MAX. MARKS-60

Qus: 1 describe the features of XML. What are the important rules to keep in mind about the XML declaration?
Answer:
The features of XML:
XML is popular for many features and few of them are listed here:
1.      Easy Data Exchange: In XML, data and mark-up are stored as text that we can configure. If we like, we can use XML editors to



Qus:2 Differentiate between TCP and UDP
Answer:
Differentiate between TCP and UDP:
TCP (Transmission Control Protocol):
The TCP corresponds to the transport layer of OSI reference model, The TCP is known as a connection-oriented protocol, which means that connection is established and maintained until such time as the message or messages to be exchanged by the application programs at each end have been exchanged. TCP makes sure

Qus: 3. List and explain the Components of XML processor.
Answer.
Components of XML processor:
a) Parser:

Every XML processor has a parser. An XML parser converts an XML document into an XML DOM object - which can then be manipulated with a JavaScript. The parser's job is to translate XML mark-up and data into a stream of bite-sized nuggets, called tokens, to be used for processing. A token may be an element start tag, a


Qus:4. Describe the procedure of fetching data from XML to HTML. Give an example.
Answer.
Procedure of fetching data from XML to HTML:
The process of fetching data from an XML files to be filled in an HTML table, using DSO (Data Source Object) and JavaScript. DSO is an object that operates like a database on the client side. It will accept information that is organized in a certain way and will manipulate it with its own database engine.
DSO allows data binding to HTML table elements. When a table element is bound there is no need to write out the code for


Qus:5. Describe five different categories of PHP Operators.
Answer.
Categories of PHP Operators:
In all programming languages, operators are used to manipulate or perform operations on variables and values. There are many operators used in PHP, so we have separated them into the following categories to make it easier to

Qus:6. Describe about ASP.
Answer.
ASP:
The page on the server called by the JavaScript is an ASP file called AJAX server page. The server file could easily be rewritten in PHP, or some other server languages. Look at the example in PHP. The source code 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
If urgent then call us on 08791490301



mca111 smu mca spring 2017 (july/aug 2017 exam) Ist 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
If urgent then call us on 08791490301


STUDENT NAME:-
ROLL NO:-
ASSIGNMENT DRIVE Spring – 2017
PROGRAM MASTER OF COMPUTER APPLICATION
SEMESTER I
SUBJECT CODE & NAME - MCA111 – Fundamentals of Computer and IT
BK ID B1645 NUMBER OF ASSIGNMNETS, CREDITS & MARKS 2, 4 Credits, 30 marks each


Assignment Set -1 Questions
Q. 1 Explain the features of a mouse and a track ball 5+5 =10
Answer:-
The features of a mouse are:-
A computer mouse with the most common standard features: two buttons and a scroll wheel, which can also act as a third button
In computing,

Q2 What is data communication? Explain different Data Transmission methods. 4+3*2 10
Answer:-
Data Communication 
Data communication is the transfer of data or information between a source and a receiver, the source transmits the data and the receiver receives it. The distance over which data moves within a computer may vary from a few thousandths of an inch, as is the case within a single IC chip, to as much as several feet along the backplane of the main circuit board. Over such small distances, digital data may be transmitted as direct, two-level electrical signals over simple copper conductors. Except for the fastest computers, circuit designers are not very

Q3 What is an IP address? Describe the classes of IP addresses 5+5 10
Answer:-
IP addresses are represented by a 32-bit unsigned binary value. It is usually expressed in a dotted decimal format. For example, 9.167.5.8 is a valid IP address. The numeric form is used by IP software. The mapping between the IP address and an easier-to-read symbolic name, for example, myhost.ibm.com, is done by the Domain Name System (DNS

Assignment Set -2 Questions
Q1 Write short notes on any five Input devices. 2*5  10
Answer:-
1. Touch Screen:
A type of display screen that has a touch-sensitive transparent panel covering the screen. Instead of using a pointing device such as a mouse

Q2 Differentiate combinational circuit and Sequential circuits. 5+5 10
Answer:-
Combinational Circuits
A combinatorial circuit is a system containing basic Boolean operations (AND, OR, NOT), some inputs, and a set of outputs. Since each output corresponds to an individual logic function, a combinatorial circuit often implements several

Q3 What is computer memory? Explain its types. 4+6=10
Answer:-

Computer memory:-
In computer, memory denotes to the state information of a computing system, as it is kept active in some physical structure. The term "memory" is used for the information in physical systems which are fast (i.e. RAM), as a distinction

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