Monday 9 June 2014

MIT102 smu MSC IT spring 2014 jul/aug exam assignment Ist sem

Get fully solved assignment
100%  trusted website bcoz we use instalment payment
 
smu mba/bba/bca/mca assignment Spring season (JUL/AUG exam) 2014 sem (I , II , III , IV) in only Rs 700/ sem ( 6 sub) or Rs 125/question paper.
You can pay in 6 instalment of Rs 125-125 if u have any doubt.
 
For solution-
mail us on computeroperator4@gmail.com with your question subject code or question paper
 
if urgent then
Call us on 08273413412 , 08791490301 or

web- www.smuassignment.in
www.assignmenthelpforall.blogspot.in

PROGRAM-Master of Science in Information Technology (MSc IT)Revised Fall 2011
SEMESTER-1
SUBJECT CODE & NAME-MIT102- DATA & FILE STRUCTURES
CREDIT-4
BK ID-B1476
MAX. MARKS-60
Q1. Define algorithm and write a note on Complexity and Time- Space Tradeoff with example [2+4+4]
Answer.
Algorithm
An algorithm is a step by step procedure for solving a particular problem. One major purpose of this text is to develop efficient algorithms for the processing of our data. The efficiency of the algorithm is depending on the time and space it uses.

Q2. Define Queue and explain how we can implementation the Queue. [2+4+4]
Answer.
Queue
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 “rear” are used in describing a linear list only when it is implemented as a queue.

Q3. List the Advantages and Disadvantages of Linear and linked representation of tree. [5+5]
Answer.
Linear and linked representation of tree
Array representation of binary tree
If a binary tree is a complete binary tree, it can be represented using an array which is capable of holding n elements where n are the number of nodes in a complete binary tree. If the tree is an array of n elements, we can

Q4 List and explain any Five types of graph. [5*2]
Answer.
Types of graph
Depending upon the vertices and edges and the weight associated to it, graphs can be classified as:
1) Undirected graph: In Undirected Graph, the directions of edges are not assigned. Edges in the Undirected

Q5. Explain
1. Fixed block storage allocation.
2. Variable block storage allocation [5+5]
Answer.
1. Fixed block storage allocation
First block storage allocation is the simplest case of dynamic storage allocation. This is the straight forward

Q6. What is the use of external Storage Devices? Explain any two external storage devices [4+3+3]
Answer.
Use of external Storage Devices
An external storage device may be defined as device other than the main memory on which information or data can be stored and from which the information retrieved for processing. External storage devices are having larger capacities and fewer expenses to store compared to main memory. Primary uses of external storage devices are:

Get fully solved assignment
100%  trusted website bcoz we use instalment payment
 
smu mba/bba/bca/mca assignment Spring season (JUL/AUG exam) 2014 sem (I , II , III , IV) in only Rs 700/ sem ( 6 sub) or Rs 125/question paper.
You can pay in 6 instalment of Rs 125-125 if u have any doubt.
 
For solution-
mail us on computeroperator4@gmail.com with your question subject code or question paper
 
if urgent then
Call us on 08273413412 , 08791490301 or

web- www.smuassignment.in
www.assignmenthelpforall.blogspot.in


No comments:

Post a Comment