Bit203- DATA File STRUCTURE

Dear students get fully solved assignments

Send your semester & Specialization name to our mail id :

help.mbaassignments@gmail.com

or

call us at : 08263069601

fall 2017 ASSIGNMENT

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

Dear students get fully solved assignments

Send your semester & Specialization name to our mail id :

help.mbaassignments@gmail.com

or

call us at : 08263069601