2008
Time : 3Hours
Full Marks : 75
Candidate are required to gibe their answers in their own words as far as practicable.
Answer any Five questions.
Q.1. is Compulsary.
All Question have equal marks.
Q 1. Answer the following question.
Q 3. Explain the different types of queues ? How is implementation of queue done ? What are the
limitation of simple queue ? Explain the insertion and deletion operations of queue.
Q 4. Discuss the linked list with it's operation ? Explain the operation of insert and delete a
node from the doubly linked list.
Q 5. Define a binary tree ? Discuss it's properties What are the differences between trees and a graph?
Q 6. Explain the types of algorithms for tree traversal List and describe the various operations
on binary tree using linked representation.
Q 7. Give the in order, Pre-order, Post-order and breadth first traversal for the following tree.
A
B C
D E F G
H
Q 8. Explain the various types of searching techniques. Write an algorithm with analysis steps
for linear search and binary search.
Q 9. Explain the characteristics of the performance of a sorting algorithm. Describe quick short
algorithm.
Q 10. Write a program in C-language to implement stack with 2-Dimensional array. Perform the
push() and pop() operations.
Answer any Five questions.
Q.1. is Compulsary.
All Question have equal marks.
Q 1. Answer the following question.
a) What is a data structure ? Explain its three components.
b) Define abstract data type ? Discuss the properties of ADT (Abstract data type) ?
c) What are the different data types available in c language ? Explain with examples.
d) Explain algorithm and its types ? Distinguish between a structure and a class.
e) Define trees. Discuss it's usage in different application. And describe binary tree.
Q 2. Explain stack mechanism ? What do you mean by stack overflow and stack underflow ?
Distinguish between static and dynamic implementation of stack.
Q 3. Explain the different types of queues ? How is implementation of queue done ? What are the
limitation of simple queue ? Explain the insertion and deletion operations of queue.
Q 4. Discuss the linked list with it's operation ? Explain the operation of insert and delete a
node from the doubly linked list.
Q 5. Define a binary tree ? Discuss it's properties What are the differences between trees and a graph?
Q 6. Explain the types of algorithms for tree traversal List and describe the various operations
on binary tree using linked representation.
Q 7. Give the in order, Pre-order, Post-order and breadth first traversal for the following tree.
A
B C
D E F G
H
Q 8. Explain the various types of searching techniques. Write an algorithm with analysis steps
for linear search and binary search.
Q 9. Explain the characteristics of the performance of a sorting algorithm. Describe quick short
algorithm.
Q 10. Write a program in C-language to implement stack with 2-Dimensional array. Perform the
push() and pop() operations.
0 Comments