C-09-CM-402
457
BOARD DIPLOMA EXAMINATION, (C-09)
OCT/NOV-2012
DCME-FOURTH SEMESTER EXAMINATION
Time: 3 hours] [Total
Marks: 80
PART-A
Instructions: (1)
Answer all questions
Each question carries three marks.
Answers should be brief and straight to the
point and shall not exceed five simple sentences.
1. Define
non-linear data structure and give an example.
2. What
is the time complexity?
3. Write
how the queue data structures are sued in computers.
4. Define
a linked list.
5. What
is a postfix expression? Give an example.
6. What
are the uses of a sparse matrix?
7. Construct
a binary tree from the inorder dbeac and the preorder abdec.
8. List
the operations that can be performed on a binary tree.
9. Write
how the merge sort works.
10. What
is searching? List the types of searching methods.
PART-B
Instructions: (1) Answer any five
questions.
(2) Each question carries ten
marks.
(3) Answers should be comprehensive and the criteria for valuation is
the content but not the length of the answer
11. (a)
write how a node is inserted in a doubly linked list. (b) write how a node is
deleted from a doubly linked list.
12. Explain
how to search and replace an element in a singly linked list.
13. Write
a program for implementing a circular queue using arrays.
14. Explain
the stack operations with example.
15. Explain
various tree traversal operations for the given example and write the outputs :
16. Explain
the representation of a binary tree using (a) arrays (b) linked lists.
17. Explain
the process of selection sort.
18. (a)
write a pseudo code bubble sorting. (b) write the algorithm for binary search.
Answers
PART-A
.
1. Define non-linear data structure and give an example.
2. What is the time complexity?
3. Write how the queue data structures are sued in computers.
4. Define a linked list.
5. What is a postfix expression? Give an example.
6. What are the uses of a sparse matrix?
7. Construct a binary tree from the inorder dbeac and the preorder abdec.
8. List the operations that can be performed on a binary tree.
9. Write how the merge sort works.
10. What is searching? List the types of searching methods.
PART-B
1. (a) write how a node is inserted in a doubly linked list. (b) write how a node is deleted from a doubly linked list.
12. Explain how to search and replace an element in a singly linked list.
13. Write a program for implementing a circular queue using arrays.
14. Explain the stack operations with example.
15. Explain various tree traversal operations for the given example and write the outputs :
16. Explain the representation of a binary tree using (a) arrays (b) linked lists.
17. Explain the process of selection sort.
18. (a) write a pseudo code bubble sorting. (b) write the algorithm for binary search.
No comments:
Post a Comment