Wednesday, 28 March 2018

MIT107- DATA & FILE STRUCTURES


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

STUDENT NAME:-
ROLL NO:-
ASSIGNMENT DRIVE - fall 2017
PROGRAM Master of Science in Information Technology (MSc IT)
SEMESTER -1
SUBJECT CODE & NAME - MIT107- DATA & FILE STRUCTURES
BK ID B1476 NUMBER OF ASSIGNMENTS, CREDITS & MARKS 2, 4 Credits, 30 marks each


Assignment Set- 1 Questions
Q1. Define complexity of algorithm. Explain asymptotic notations. 2+8 10
Answer:-
Complexity of algorithm:-
The complexity of the algorithm is given by a function C(n) which gives the running time and space requirement of the algorithm in terms of the size n of the input data. Frequently, the storage space requirement is the multiple of the data size n. So, unless is specified the complexity shall refer to running time of the algorithm. The



 Q2 What is Queue? Describe the two ways of implementing the Queue. 2+4+4 10
Answer:-
Queue:-
A queue is a

Q3 Write a note on the advantages and disadvantages of Linear and linked representation of tree. 5+5 10
Answer:-
Benefits 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
2)    

Assignment Set- 2 Questions

Q1. Describe the deletion of node from binary search tree with suitable example.
Answer:
Deletion of node from BST
Removing a node from a BST is a relatively complex task; because deletion can happen for the node which may be a leaf


Q2 Describe the following storage allocation: 
(a) Fixed block
(b) Variable block  5+5 10
Answer:-
 (a) Fixed block
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

3 Define sorting. With suitable example describe merge sort. 2+4+4 10
Answer:-
Sorting is the process of arranging a collection of items in some specified order.  The items/records in a file or data structures in memory, consist of one or more fields or members. One of these fields is designated as the "sort key" which


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