MU Computer Engineering (Semester 3)
Data Structures
December 2012
Total marks: --
Total time: --
INSTRUCTIONS
(1) Assume appropriate data and state your reasons
(2) Marks are given to the right of every question
(3) Draw neat diagrams wherever necessary


1(a) Compare Iteration and Recursion
5 M
1(b) Explain different types of data structures with example
5 M
1(c) Write a program in Java to implement Binary search on sorted set of integers
10 M

2(a) Write a program to implement COPY command for copying bytes from one file to another file using file I/O commands. Program should make use of command line argument.
10 M
2(b) Write a program in Java to sort given n integer numbers using heap sort
10 M

3(a) Write an ADT for rational numbers addition and multiplication. Addition of two rational numbers a/b and c/d is (ad+cb)/ba and multiplication of two rational numbers a/b and c/d is ac/bd
10 M
3(b) Write a program in Java to find the nth term of Fibonacci sequence using recursion
10 M

4(a) Write a Non-Recursive function for inorder traversal
10 M
4(b) Write a program in Java to create a singly linked list and perform the following operations
1. Insert into list
2.Search for data
3. Delete from list
4. Display data
10 M

5(a) Explain Circular queue and Double ended queue with example
10 M
5(b) Write a program in Java to implement DFS traversal of a graph using adjacency matrix.
10 M

6(a) Write a program to convert an expression from infix to postfix. Use STACK ADT array implementation for the above program
10 M
6(b) Construct a binary tree for the following preorder and inorder traversal sequences
Pre-order: A B D G C E H I F
Inorder : D G B A H E I C F
10 M

7(a) Threaded binary tree
5 M
7(b) Huffman coding
5 M
7(c) Applications of stacks
5 M
7(d) Indexed sequential search
5 M
7(e) Array implementation of linked list
5 M



More question papers from Data Structures
SPONSORED ADVERTISEMENTS