0
Data Structures : Question Paper May 2014 - Computer Engineering (Semester 3) | Mumbai University (MU)

Data Structures - May 2014

Computer Engineering (Semester 3)

TOTAL MARKS: 80
TOTAL TIME: 3 HOURS
(1) Question 1 is compulsory.
(2) Attempt any three from the remaining questions.
(3) Assume data if required.
(4) Figures to the right indicate full marks.
1 (a) Explain different types of data structures with example.(5 marks) 1 (b) Write recursive & non-recursive functions to calculate GCD of 2 numbers.(5 marks) 1 (c) Show with example how graph are represented in computer memory.(5 marks) 1 (d) Discuss practical applications of trees.(5 marks) 2 (a) What is hashing? What is mean by collision? Using modulo division method & linear probing, store the values given below in array with 10 elements.
99 33 23 44 56 43 19.
(10 marks)
2 (b) Write a program in 'C' to convert infix expression to postfix expression using stacks.(10 marks) 3 (a) Write a program in 'C' to perform Quick sort. Show steps with example.(10 marks) 3 (b) Write a program in 'C' which will read a text and count all occurrences of a particular word.(10 marks) 4 (a) Write a program in 'C' to implement circular queue using Link-List.(10 marks) 4 (b) Construct Binary tree for the pre-order & Inorder traversal sequences :-

Preorder : A B D G C E H I F
Inorder : D G B A H E I C F
(10 marks) 5 (a) Write a program in 'C' to implement Doubly Link-List with methods insert, delete and search.(10 marks) 5 (b) Write a program in 'C' to implement Binary search on sorted set of integers.(10 marks)


Write short note

6 (a) Discuss Threaded Binary tree in detail.(10 marks) 6 (b) Explain BFS algorithm with example.(10 marks)

0  upvotes

Next up

Read More Questions

If you are looking for answer to specific questions, you can search them here. We'll find the best answer for you.

Search

Study Full Subject

If you are looking for good study material, you can checkout our subjects. Hundreds of important topics are covered in them.

Know More