Sunday, 13 May 2018

smu bsc it 2nd sem assignment spring 2018 (july/aug 2018 exam)


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

DRIVE Spring 2018
PROGRAM Bachelor of Science in Information Technology
SEMESTER II
SUBJECT CODE & NAME BIT201 – Object Oriented Programming – C++


Assignment Set -1
1 What is Polymorphism? What are the different types of Polymorphism?

Answer: Virtual functions in C++ are important to implement the concept of polymorphism. 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


2 Discuss the following functions of file operations
a) tellg()
b) seekp()
c) ignore()
d) getline()

Answer: A. 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 <fstream.h>
void main


3 Explain sequence containers

Answer: Sequence Containers
There are three types of sequence containers in the STL. These, as their name suggests, store data in linear sequence. They are the vector, deque and list:
·         vector<


Assignment Set -2
1 Differentiate between an external variable and an automatic variable with the help of an example.

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


2 What is “this pointer” in C++? What are the features of “this pointer”?

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 and the data members are allocated memory for all of their instances. This kind

3 Explain destructor in detail.

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 explicitly deleted. A destructor is a member function with the same name as its class

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

DRIVE Spring 2018
PROGRAM Bachelor of Science in Information Technology - B.SC(IT)
SEMESTER II
SUBJECT CODE & NAME BIT202 – Basic Mathematics


Assignment Set -1

1 Integrate the following w.r.t. x
i) x √(x + a)
ii) x /√(a + bx)

Answer: a) x √(x + a)

∫x√(x+a) dx = I                                 (say)


2 If a = cos q + i sin q, 0<q <2p prove that {1+a}/{1-a} = i cot q/2

Answer: i. If a = cos q + i sin q,0 <q < 2p prove that 1+a/1-a = i cot q/2

L.H.S = 1+ cos q + i sin q
                1 - cos q - i sin q

= 2 cos^2 q/2 + 2 i sin q/2 cos q/2
   2 sin^ 2


3 Solve: 3/1 + (3.5/1.2) . (1/3) + (3.5.7/1.2.3) . (1/3^2) + …………..∞]

Answer: Comparing the given series with one of the general Binomial series, we get

P=3, q=2, x/q=1/3

x=2/3

But the


Assignment Set -2
1 a) If in group G, (ab)^2 = a^2b^2 for every a, b Î G prove that G is abelian.
b) Show that if every element of a group G is its own inverse then G is abelian.

Answer: a) (ab)^2 = a^2.b^2

Ø  (ab) (ab) = (a . a) (b . b)

Ø  a[b(ab)] = a[a(bb)] (Associative)


2 If tan A = 1- cos B . show that tan 2A = tan B.
                          sinB

Answer: Given that tan A = 1-cosB
                                                                SinB

i.e tan


3 Evaluate dy/dx,  when y = log[√(1+x^2)+x]) / [√(1+x^2)-x])

Answer: d/dx{(log[√(1+x^2)+x]) - log[√(1+x^2)-x])

(Since


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

Spring 2018ASSIGNMENT
PROGRAM - MCA (REVISED FALL 2012)
SEMESTER - II
SUBJECT CODE & NAME – Bit203- DATA File STRUCTURE
CREDIT – 4, BK ID - B1476, MAX. MARKS 60


Set 1
Q1. Describe any Five types of graph. [5*2]= 10

Answer:

Types of Graphs
Depending upon the vertices and edges and the weight associated to it, graphs can be


Q2. Describe the following storage allocation:
1. Fixed block
2. Variable block

Answer:


Fixed block storage allocation
First block storage allocation is the simplest case of dynamic storage allocation. This is the straight forward method in which, all the blocks are of identical in size. The user can decide the


3. Define sorting. Explain merge sort with suitable example.
Answer:
Sorting
Sorting is the process of arranging a collection of items in some specified order. The items/records in a file or data structures in memory, consist of one or more fields or members. One of these fields is designated as the "sort key" which means the records will be ordered


Set 2
Q1. What do you mean by complexity of algorithm? Explain asymptotic notations.
Answer:
Complexity of Algorithm
To compare the efficiency of the algorithms we need some criteria to measure the efficiency. Time and space are two main measures for the efficiency of an algorithm.
Time is the number of time the basic operation is executed. For example in sorting and


Q2. What is Queue? Describe the two ways of implementing the 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



Q3. List the benefits and drawbacks of Linear and linked representation of tree.

Answer:

Advantages of linear representation of binary tree
1)      Node can be accessed directly with the help of the index through which we can improve 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
Spring 2018 ASSIGNMENT
PROGRAM - MCA (REVISED FALL 2012)
SEMESTER - SECOND
SUBJECT CODE & NAME – BIT204- COMPUTER ARCHITECTURE
CREDIT 4, BK ID - B1648, MAX. MARKS 60


Set 1
Q1. Differentiate between Process and Thread. 5+5=10

Answer:
Concept of process
In operating system terminology, instead of the term ‘program’, the notion of process is used in connection with execution. It designates a commission or job, or a quantum of work dealt with as an entity


Q2. Explain the any five types of addressing modes. 5*2= 10
Answer:

Every instruction of a computer states an operation on certain data. There are a numerous ways of specifying address of the data to be operated on. These different ways of specifying data


Q3. Describe the logical layout of both RISC and CISC computers 5+5= 10
Answer:

While processing operates instructions, RISC pipelines have to cope only with register operands. By contrast, CISC pipelines must be able to deal with both register and memory

Set 2
Q1. Explain the concept of branch handling. What is delayed branching? 5+5= 10

Answer:
Branch Handling
Branch is a flow altering instruction that is required to be handled in a special manner in pipelined


Q2. Explain any five types of vector instructions in detail.5*2= 10

Answer: Types of Vector Instructions:
(a)      Vector-scalar instructions: Using these instructions, a scalar operand can be combined with a vector one. If A and B are vector registers and f is a function that performs some operation on each element of a single or two vector operands, a vector-scal




Q3. Write short notes on:
a) UMA
b) NUMA 5+5= 10

Answer:
a)      UMA (Uniform Memory Access):
In this category every processor and memory module has similar access time. Hence each memory word can be read as quickly as other memory word. If not then quick references are

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

Drive Spring 2018
PROGRAM Bachelor of Science in Information Technology
SEMESTER II
SUBJECT CODE & NAME BIT205 – Basics of Data Communication

Assignment Set -1
1 What are the criteria for a Data Communication Network?

Answer: Communication Network is set of equipment or say facilities that provide a communication services like to transfer of data between two or more nodes located in any of its geographical point. Example of such networks includes computer networks (LAN/WAN), telephone networks,


2 Explain the TCP/IP Protocol Architecture.

Answer: Two protocol architectures have served as the basis for the development of interoperable communications standards: the TCP/IP protocol suite and the Open Systems Interconnection (OSI)



3 Write short notes on Delta Modulation (DM).

Answer: Delta Modulation (DM)
In delta modulation, an analog input is approximated by a staircase function that moves up or down by one quantization level ᵟ at each sampling interval (TS). An example is shown in figure below, where the staircase



Assignment Set -2

1 What are communication model?

Answer: Data communication model:
The figure below shows the simple



2 What is the need for Protocol Architecture?

Answer: The architecture of the TCP / IP protocol is the result of protocol development and experimental packet-switched


3 Write short notes on Pulse Code Modulation (PCM).

Answer: Pulse Code Modulation
Pulse code modulation (PCM) is based on the sampling theorem.

Sampling Theorem: It states that “If a signal f(t) is sampled at regular intervals of time and at a rate higher than twice the highest signal frequency, then the samples contain all the information of the original signa



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




No comments:

Post a Comment