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

 

 

 

ASSIGNMENT

 

PROGRAM MCA(REVISED FALL 2012)
SEMESTER SECOND
SUBJECT CODE & NAME MCA2020- ADVANCED DATA STRUCTURE
CREDITS 4
BK ID B1476
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. 1. Define Modularity and explain its need in computer programs

 

 

Answer: Modularity is one measure of the structure of networks or graphs. It was designed to measure the strength of division of a network into modules (also called groups, clusters or communities). Networks with high modularity have dense connections between the nodes within modules but sparse connections between nodes in different modules. Modularity is often used in optimization methods for detecting community structure in networks. However, it has been shown that modularity suffers a resolution limit and, therefore, it is unable to detect small communities. Biological networks, including animal brains, exhibit a high

 

 

 

 

  1. 2. Define Queue and explain how we can implement the Queue.

 

Answer:In general, a queue is a line of people or things waiting to be handled, usually in sequential order starting at the beginning or top of the line or sequence. In computer technology, a queue is a sequence of work objects that are waiting to be processed.A queue is also known as a FIFO, which stands for first in first out. It is a container with only three operations: enqueue, dequeue, first and empty.

 

 

 

 

 

 

  1. 3. List the Advantages and Disadvantages of Linear and linked representation of tree.

 

 

Answer:Binary tree traversal is defined as a process of visiting all the nodes in the binary tree once. The visit always starts from the root node.

 

 

 

 

 

 

  1. 4. List and explain any Five types of graph.

 

Answer:Graphs are picture representatives for 1 or more sets of information and how these visually relate to one another. There are many types of charts and graphs of varied complexity. For almost any numerical data set, there is a graph type that is appropriate for representing it. Graphs help you present data in a meaningful way. It is one thing to see a data listed on a page and it’s another to actually understand the details and trends of the data. A lot of the time, sets of data involve values in the millions or billions. This is far too many to print out in a magazine or journal article. Using a graph can help depict data and a well-made graph

 

 

 

  1. 5. Explain
  2. 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.

 

 

 

  1. Variable block storage allocation

 

Answer:In computer programming, an automatic variable is a local variable which is allocated and deallocated automatically when program flow enters and leaves the variable’s scope. The scope is the lexical context, particularly the function or block in which a variable is defined. Local data is typically (in most languages) invisible outside the function or lexical context where it is defined. Local data is also

 

 

The term local variable is usually synonymous with automatic variable, since these are the same thing in many programming languages, but local is more general – most local variables are automatic local variables, but static local variables also exist, notably in C. For a static local variable, the allocation is static (the lifetime is the entire program execution), not automatic, but it is only in scope during the execution of the function.

 

 

 

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

 

Dear students get fully solved assignments

Send your semester & Specialization name to our mail id :

help.mbaassignments@gmail.com

or

call us at : 08263069601

 

Leave a Reply