Mumbai University Question Papers Data Structures and Files June 2006
Mumbai University question papers
III Sem CSE – Examination June 2006
Data Structures and Files
N.B. : 1) Question number. 1 is compulsory.
2) Attempt any four questions out of remaining six questions.
3) Assumptions made should be clearly stated.
4) Figures to the right indicate full marks.
5) Assume suitable data wherever required but justify the same.
Q. No.1 a) Write a program to creat ‘STACK’ Abstract Data Type’using linked list implementation. ADT should support the following operations.
(i) createstack (ii)pushstack (iii) pushstack (iv) destlOystac
b)What are the different method of’ File I/O’ in ‘C’language? What different library functions are supported by ‘c’ language to do this?
a) How do you represent arithmetic expression using binary tree? Write a C function’ evalbiI?-tree’that accept a pointer to such tree and returns. value of the expression represented by the tree.
b) Write a program to traverse a nonempty binary tree in inorder, preorder and postorder.
Q.No.3 a) Give psudocode for Huffman algorithm and apply the Huffman Encoding method for following sentence’ MAHARASHTRA’
b) Write a program to creat ‘QUEUE’ Abstract Data Type using array implementation. QUEUE ADT should support the following operations.
(i)create queue (ii)Insert into queue (iii) delete from queue
Q. No.4 a) Write a program to implement’ Towers of Hanoi ‘problem.
b)(i)Develop an algorithm to delete a hode from Binary search tree.
(ii) Write a notes on ‘ Priority queue’. Explain with example.
Q.No.5 a) Given a ‘PREFIX’ expression write a program to convert it into ‘POSTFIX’ form.
b) write notes on the following.
(i) Array implementation oflinked list.
Q. No.6 a) Discuss recursion in C with suitable examples.
b) (i)Write detailed notes on ‘ Threaded Binary tree’
(ii) Define the following with examples.
i) Strictly binary tree ii) Complete Binary tree
a) Discuss the different ways. of representing the binary tree. How would you choose the representation?
b) Write short notes on any two
i) Tree represented list.
ii) Unions, strings and Macro in ‘C’ language.
iii)Dynamic memory and pointers in ‘c’ language.