MCA2020- 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


(FALL 2014) ASSIGNMENT

PROGRAM
MCA (Revised Fall 2012)
SEMESTER
2
SUBJECT CODE & NAME
MCA2020- ADVANCED DATA STRUCTURE
CREDIT
2
BK ID
B1476
MAX.MARKS
60

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.

1 Define data structure? Explain different types of data structures
Answer : In computer science, a data structure is a particular way of organizing data in a computer so that it can be used efficiently.
Different kinds of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks. For example, databases use B-tree indexes for small percentages of data retrieval and compilers and databases use dynamic hash tables as look up tables.

Data structures provide a means to manage large amounts of data efficiently for uses such as large databases and internet indexing services.


2 Explain the different types of binary tree with suitable diagrams.
Answer : In computer science, a binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child. A recursive definition using just set theory notions is that a (non-empty) binary tree is a triple (L, S, R), where L and R are binary trees or the empty set and S is a singleton set. Some authors allow the binary tree to be the empty set as well.

Types of binary tree:

·         A rooted binary tree has a root node and every node has at most two children.
·         In a full binary tree or proper binary tree [17] every node other than the leaves has two children. Physicists define a binary tree


3 Explain in detail about Adjacency matrix
Answer : An adjacency matrix is a way of representing an $ \mathtt{n}$ vertex graph $ G=(V,E)$ by an $ \ensuremath{\mathtt{n}}\times\ensuremath{\mathtt{n}}$ matrix, $ \mathtt{a}$, whose entries are boolean values.
    int n;
    boolean[][] a;
    AdjacencyMatrix(int n0) {
        n = n0;
        a = new boolean[n][n];
    }
The matrix entry $ \mathtt{a[i][j]}$ is defined as



4 Explain in detail about topological sorting

Answer : Topological sorting for Directed Acyclic Graph (DAG) is a linear ordering of vertices such that for every directed edge uv, vertex u comes before v in the ordering. Topological Sorting for a graph is not possible if the graph is not a DAG.
For example, a topological sorting of the following graph is “5 4 2 3 1 0″. There can be more than one topological sorting for a graph. For example, another topological sorting of the following graph is “4 5 2 3 1 0″. The first vertex in topological sorting is always a vertex with in-degree as 0 (a vertex with no in-coming edges).
Algorithm to find Topological Sorting:
We recommend to first see implementation of DFS here. We can modify DFS to find Topological Sorting of a graph. In DFS, we start from a vertex,



5 Explain

1. Fixed block storage allocation.
Answer : The simplest memory allocation is to have several fixed memory partitions and allocate a process to each one. Different sized partitions can be allocated to accomodate different processes memory needs.
Unless the workload is very well understood, fixed pertitions are seldom used. There is generally wasted space. Variable



2. Variable block storage allocation
Answer : A variable with Block type is declared using function pointer style notation substituting ^ for *. The following are valid Block



6 What is the use of external Storage Devices? Explain any two external storage devices
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 semiconductor memories is the cost per bit of the stored information. So to fulfill the large storage requirements of computers, magnetic disks, optical disks are generally used.

Advantages of external storage
·         External storage devices provides additional storage other than that available in computer.
·         Data can be transported easily from one

Dear students get fully solved  assignments
Send your semester & Specialization name to our mail id :
“ help.mbaassignments@gmail.com ”
or
Call us at : 08263069601


No comments:

Post a Comment

Note: only a member of this blog may post a comment.