MIT107 - DATA & FILE STRUCTURES

Dear students get fully solved assignments

Send your semester & Specialization name to our mail id :

  help.mbaassignments@gmail.com

or

call us at : 08263069601

ASSIGNMENT

DRIVE	FALL 2016
PROGRAM	Master of Science in Information Technology (MSc. IT)
SEMESTER	1
SUBJECT CODE & NAME	MIT107 - DATA & FILE STRUCTURES
BK ID	B1476
CREDITS	4
MARKS	30

Note: Answer all questions. Kindly note that answers for 10 marks questions should be approximately of 400 words. Each question is followed by evaluation scheme.

Question. 1.Briefly explain any two mathematical functions.

Answer:In mathematics, a function or groups of functions are important enough to deserve their own names. This is a listing of articles which explain some of these functions in more detail. There is a large theory of special functions which developed out of statistics and mathematical physics. A modern, abstract point of view contrasts large function spaces, which are infinite-dimensional and within which most functions are 'anonymous', with special functions picked out by properties such as symmetry, or relationship to harmonic analysis

Question. 2. Define Queue and explain array implementation of the Queue.

Answer:Like Stack, Queue is a linear structure which follows a particular order in which the operations are performed. The order is First In First Out (FIFO).  A good example of queue is any queue of consumers for a resource where the

Question. 3. Briefly explain the process of converting the general tree to a binary tree.

Answer:General trees are those in which the number of subtrees for any node is not required to be 0, 1, or 2. The tree may be highly structured and therefore have 3 subtrees per node in which case it is called a ternary tree. However, it is often the case that the number of subtrees for any node may be variable. Some nodes may have 1 or no subtrees, others may have 3, some 4, or any other combination. The ternary tree is just a special case of a general tree (as is true of the binary tree).

Question. 4. Explain the Fixed block storage allocation.

Answer:Fixed-size blocks allocation, also called memory pool allocation, uses a free list of fixed-size blocks of memory (often all of the same size). This works well for simple embedded systems where no large objects need to be allocated, but suffers from fragmentation, especially with long memory addresses. However, due to the significantly reduced overhead this method can substantially improve performance for objects that need frequent allocation / de-allocation and is often used in video games.

Fixed-size blocks allocation, also called memory pool allocation, uses a free list of fixed-size blocks of memory (often all of the same size). This

Question. 5. What is the use of external Storage Devices? Explain any one external storage device.

Answer:In computing, external storage comprises devices that temporarily store information for transporting from computer to computer. Such devices are not permanently fixed inside a computer.

Semiconductor memories are not sufficient to provide the whole storage capacity required in computers. The major limitation in using

Dear students get fully solved assignments

Send your semester & Specialization name to our mail id :

  help.mbaassignments@gmail.com

or

call us at : 08263069601