North Maharashtra University 2009 B.E Computer Science and Engineering Data Structure and Files, S.E, / - Question Paper
DATA STRUCTURE & FILES NOV - DEC 2009
Thr Hours P<u\sr-ea._Max. Marks : 100
#
Instructions to Candidates:
1 Do not write anything on question paper except Seat No
2. Answersheet should be written wrth blue ink only Graph or diagram should be drawn with the same pen being used for writing paper or black HB pencil
3 Student should note, no suppbment will be provided.
4. Answer any two questions from each unit.
5. Figures to the right indicate full marks
6. Assume suitable data if necessary.
7. Algorithms may also be wntten in sparks fc Language.
UNIT-I
1. Write an algorithm to generate fully parenthesized infix expressions from the*
postfix form
10
Design a data representation sequentially mapping - queues into an array V( 1 m) Repretent each queue as a circular queue w<hn V Show the representation diagrammatically and write conditions for QUEUE - FULL and QUEUE-EMPTY. 10
Discuss use of stack by function call and recursive function cat 10
UNIT. II
Let P be a pointer to the first node in a singly linked list and X an arbitrary node in this list Write an algorithm to delete this node from the List If X P, then P should be reset to pomt to the new first node in the Mst 10
Design a storage management scheme for the case when all requests for memory are of the same size, say k Wnte algonthms to free and allocate storage in this scheme 10
Explain suitable data structure of polynomials 10
1
Writ* an algorithm (or non recursive procedure of postorder tree traversal Writ* an algorithm to count th number of Reaf nodes in a binary tree. Discuss haight balanced binary traa
UNIT - IV
Give a comparison of beet, average and worst cate time complexity of any four aortmg algorithm*
Write an algorithm to list al! the identifiers in a haah table in lexicographic order Assume the hash function fm/fx)* first character of X and Linear probing la used
Explain various haah functions.
UNIT - V
Discuss various Me organizations Explain indexing technique on We*
Explain Multi lt We* with example
|
Attachment: |
| Earning: Approval pending. |
