Wednesday, 29 June 2016


Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :
“ ”
Call us at : 08263069601


MCA (Revised Fall 2012)

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 algorithm and write a note on Complexity and Time- Space Tradeoff with example
"An algorithm is a well defined list of steps to solve a particular problem". "It is an abstract form of a program." A set of algorithms are always used to perform operations on data structure. Data may be organized in many ways and many levels so algorithm has to be designed in such a manner so that it can perform the desired operation on the stored data.
An algorithm is a well defined list or sequence of steps to solve a particular problem. There may be more than one algorithm to solve a particular problem. The choice of a particular algorithm depends on the following considerations:
·         Performance requirements i.e. time complexity
·         Memory requirements i.e. space

2. Define Queue and explain how we can implement the Queue.
Answer : In computer science/data structures, a priority queue is an abstract data type which is like a regular queue or stack data structure, but where additionally each element has a "priority" associated with it. In a priority queue, an element with high priority is served before an element with low priority. If two elements have the same priority, they are served according to their order in the queue.

While priority queues are often implemented with heaps, they are conceptually distinct from heaps. A priority queue is an abstract concept like "a

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


Answer : Advantages and disadvantages of linear representation

Advantages and disadvantages of linear representation

I. This representation is very easy to understand.
II. This is the best representation for complete and full binary tree representation.
III. Programming is very easy.
IV. It is very easy to move from a

4. List and explain any Five types of graph.

Answer : Various flavors of graphs have the following specializations and particulars about how they are usually drawn.
  • Undirected Graphs.
In an undirected graph, the order of the vertices in the pairs in the Edge set doesn't matter. Thus, if we view the sample graph above we could have written the Edge set as {(4,6),(4,5),(3,4),(3,2),(2,5)),(1,2)),(1,5)}. Undirected graphs usually are drawn with straight lines between the vertices.

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 partitions are more common.

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 variable declarations:
void (^blockReturningVoidWithVoidArgument)(void);
int (^blockReturningIntWithIntAndCharArguments)(int, char);
void (^arrayOfTenBlocksReturningVoidWithIntArgument[10])(int);

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 :
“ ”
Call us at : 08263069601

No comments:

Post a comment