MCA212- ADVANCED DATA 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

DRIVE

fall – 2017

PROGRAM

MASTER OF COMPUTER APPLICATION

SEMESTER

II

SUBJECT CODE & NAME

MCA212- ADVANCED DATA STRUCTURE

Set-1

Q1. List and explain 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 classified as:

1)    Undirected graph: In Undirected Graph, the directions of edges are not assigned. Edges in the

Q2. Explain

1. Fixed block storage allocation.

2. Variable block storage allocation [5+5] = 10

Answer:

Fixed block storage allocation

First block storage allocation is the simplest case of dynamic storage allocation. This is the straight forward

Q3. What is the use of external Storage Devices? Explain any two external storage devices [4+3+3]=10

Answer:

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

Set 2

Q1. Define algorithm and write a note on Complexity and Time- Space Tradeoff with example

[2+4+4]=10

Answer:

Definition: 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. The

Q2. Define Queue and explain

a. Array implementation of queue

b. Linked list implementation of 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 Advantages and Disadvantages of Linear and linked representation of tree. [5+5] = 10

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 efficiency of execution time of an algorithm.

2) Data

Dear students get fully solved assignments

Send your semester & Specialization name to our mail id :

help.mbaassignments@gmail.com

or

call us at : 08263069601