Bangalore University 2007 M.Sc Computer Science MD-3401 Data Structures - Question Paper

M.Sc. Computer Science MD-3401 Data Structures MAY 2007

Time : 3 hours Maximum : 100 marks
part A — (10 * three = 30 marks)
ans ALL ques..
1. Define lower and upper bounds of an array. provide example.
2. Write the C++ implementation of ADT RATIONAL class.
3. Define stack. provide example.
4. What is queue underflow? provide example.
5. Give an example of linear linked list.
6. Write down any 2 primitive operations on circular lists.
7. Explain with an example binary tree traversals.
8. What is a dangling pointer? provide example.
9. How are sorting methods classified? discuss briefly.
10. Give an example for bubble sort.
part B — (4 * 10 = 40 marks)
ans any 4 ques..
11. What are character strings? discuss their operations.
12. How is stack used in evaluating arithmetic expressions? provide example.
13. Discuss ‘threaded binary trees’.
14. With suitable example discuss the tree application for expression valuation.
15. Discuss the binary tree and its variants.
16. Write a note on big – O notation.
part C — (2 * 15 = 30 marks)
ans any 2 ques..
17. Explain with suitable examples any 2 ways of implementing linked lists.
18. Discuss any 2 binary tree representations using necessary code.
19. List the basic searching techniques and explain on sequential searching.

Earning:   Approval pending.