mca2020 smu mca Winter 2014 IInd sem assignment

Winter 2014 ASSIGNMENT

PROGRAM - MCA (REVISED FALL 2012)

SEMESTER - II

SUBJECT CODE & NAME - MCA2020- ADVANCED DATA STRUCTURE

CREDIT – 4, BK ID - B1476, MAX. MARKS 60

Get fully solved assignment. Buy online from website

www.smuassignment.in

online store

or

plz drop a mail with your sub code

computeroperator4@gmail.com

we will revert you within 2-3 hour or immediate

Charges rs 125/subject and rs 625/semester only.

if urgent then call us on 08791490301, 08273413412

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 complexity

Q2. Define Queue and explain how we can implementation the Queue. [2+8] 10

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 figure. The terms “front” and “rear” are used in describing a linear list only when it is implemented as a queue. Following are the two methods offered by queue for

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

Q4. 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

Q5. 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 method in which, all the blocks are of identical in size. The user can decide the size of the block. The operating system keeps a pointer called AVAIL. This pointer points

Q6. 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 compared to main memory.

Primary

Get fully solved assignment. Buy online from website

www.smuassignment.in

online store

or

plz drop a mail with your sub code

computeroperator4@gmail.com

we will revert you within 2-3 hour or immediate

Charges rs 125/subject and rs 625/semester only.

if urgent then call us on 08791490301, 08273413412