DS PREVIOUS QUESTION PAPERS(DIPLOMA)

C05-CM-402

457

BOARD DIPLOMA EXAMINATION, (C-05)

OCT/NOV-2011

DCME IV SEMESTER EXAMINATION

DATA STRUCTURES THROUGH C

Time : 3 Hours]                                                               [Total Marks: 100

PART-A    10*4=40

Instructions: (1) Answer all questions and each question caries four marks. (2) Answers should be brief and straight to t the point and shall not exceed five simple sentences.

1.    What are the advantages and disadvantages of linked list

2.    What do you meant by dummy header?

3.    List applications of stack.

4.    Define a binary tree and give an example.

5.    Define : (a) Height of a tree (b) tree (c) parent and children (d) order of tree

6.    What are the tree traversals methods?

7.    What is a binary tree for integers?

8.    What is the principle of bubble sort?

9.    What is time and space complexity?

10. Compare linear search and binary search.

PART-B                                              5*12=60

Instructions: (1) Answer any five questions and each question caries twelve marks. (2) The Answers should be comprehensive and criteria for valuation is the Content but not the length of the answer.

11. (a) what is data structure and classify them?. (b) explain how to perform insertion and deletion operation on a double linked list.

12. Write a c program for creating single linked list.

13. What is a queue and write a c program to implement queue using arrays.

14. (a) explain how to convert the following infix expression to postfix form and all rules (A+B*C)/(D+E)

15. Explain how to construct a tree for given in order and post order traversals.                       In order          : D            B         E         A         C                                                                     Post order      : D       E         B         C            A

16.  Write preorder, post order, in order traversals for the following tree.

17. (a) explain aobut binary search sort tree. (b) write a c program for selection sort.

18. (a) explain the working of quick sort and write algorithm (b) write a c program for binary search

C-09-CM-305

3231

BOARD DIPLOMA EXAMINATION, (C09)

OCTOBER/NOVEMBER-2010

DCM-III SEMESTER EXAMINATION

DATA STRUCTURES THROUGH C

TIME: 3 HOURS                                                                              TOTAL MARKS:80

PART-A          10*3=30

Instruction: (1) answer all questions.

                          (2) Each question carries three marks.

1)           Define data structures and classify them.

2)           Explain about non linear data structures.

3)           Explain about dummy header.

4)           Explain briefly about stack.

5)           List the applications of a queue.

6)           List advantages of sparse matrix over ordinary matrix.

7)           Define binary search tree.

8)           List applications of tree.

9)           Write the method of bubble sort.

10)       Differentiate between linear and binary search.

PART-B                                                   5*10=50

Instruction: (1) answer any five questions.

                          (2) Each question carries ten marks.

11)       (a) Explain about various operations on singly linked list.                                       (b) Write an algorithm for minimum element in singly linked list.

12)       (a) Write an algorithm to create a singly circular linked list.                                   (b) Write a program to create a doubly linked list.

13)       (a) Write a program to implement queue operations.                                               (b) Write a program to create sparse matrix and its transpose.

14)       (a) Convert the given infix expression to postfix (A+B)*(C-D)/F+G-H                   (b) Write an algorithm to evaluate a postfix expression.

15)       (a) Explain about the operations on binary tree.                                                       (b) Write the preorder traversal for the given binary tree.

16)           Construct binary tree given inorder and postorder traversals.                Inorder   : DGBAHEICF                                                           Postorder: GDBHIEFCA

17)           (a) Write a algorithm to implement insertion sort and mention its time complexity. (b) Write a program to implement selection sort.

18)           (a) Explain with an example about quick sort. (b) Write a program to implement linear search.

C-09-CM-305

3231

BOARD   DIPLOMA   EXAMINATION,   (C-09)

APRIL/MAY 2011

D.C.M.E   -   III SEMISTER EXAMINATION

DATA STRUCTURE THROUGH C

TIME: 3 Hours]                                                                     [Total Marks :80]

PART   - A                                          10*3=30

Instruction:  (1) answer all question and each question

                                           carries THREE marks

                    (2)  answer should be brief and   straight      to  the point and shall not exceed five simple sentences

1. Define data structures and classify them.
2. Explain about non linear data structures.
3. Explain about dummy header.
4. Explain briefly about stack.
5. List the applications of a queue.
6. List advantages of sparse matrix over ordinary matrix.
7. Difine binary search tree.
8. List applications of tree
9. Write the method of Bubble sort.
10. Differentiate between linear and binary search.

  

PART- B                                    5*10=60

Instructions: (1) Answer any five questions and each question carries ten marks. (2) The answers should be comprehensive and the criteria for valuation is the content but not the length of the answer.

  

11. (a) explain about various operations on singly linked list. (b) write an algorithm for minimum element in singly linked list.
12. (a) write an algorithm to create a singly circular linked list. (b) write a program to create a doubly linked list.
13. (a) write a program to implement queue operations. (b) write a program to create sparse matrix and its transpose.
14. (a) convert the given infix expression to postfix ( A + B ) * ( C - D ) / E * F + G – H     (b) write an algorithm to evaluate a postfix expression.
15. (a) explain about the operations on binary tree. (b) write the preorder traversal for the given binary tree.

11. Construct binary tree given inorder and postorder traversals.                                                            Inorder:                         DGBAHEICF                                                                                                POSTORDER:            GDBHIEFCA
12. (a) write a algorithm to implement insertion sort and mention its time complexity. (b) write a program to implement selection sort.
13. (a) explain with an example about quick sort. (b) write a program to implement linear search.

3231

BOARD DIPLOMA EXAMINATION, (C-09)

OCTOBER/NOVEMBER-2011

DCME III SEMESTER EXAMINATION

DATA STRUCTURES THROUGH C

Time : 3 Hours]                                                               [Total Marks: 80

PART-A    10*3=30

Instructions: (1) Answer all questions and each question caries four marks. (2) Answers should be brief and straight to t the point and shall not exceed five simple sentences.

1.     Define and classify the data structure

2.     What is time and space complexity

3.     List the advantages and disadvantages of linked list.

4.     List applications of queue.

5.     What is a single linked circular list

6.     Differentiate between arrays and linked list

7.     List operations on binary tree

8.     Define a tree structure with example

9.     What is the principle of selection sort

10. What is searching and what are the methods of searching

PART-B                                              5*10=50

Instructions: (1) Answer any five questions and each question caries twelve marks. (2) The Answers should be comprehensive and criteria for valuation is the Content but not the length of the answer.

11. Explain how to perform insertion and deletion operation on a single linked list

12. Explain how to crate a single linked list with the help of an algorithm.

13. What is a stack and write a c program to implement stack using arrays

14. (a) explain the operation of stack and queue. (b) explain how to covert the given infix expression to postfix expression X*Y/Z+(X+Y)

15. Explain how to construct a tree for given in order, post order traversals.              In order: D B E A C                                                                             Post Order: D E B C A

16.  Write an algorithm and a c program to create and display binary tree.

17. (a) write a c program for bubble sort. (b) explain the working of quick sort and write algorithm.

18. (a) what is time and space complexing for merge sort? (b) write an algorithm for linear search.

C05-CM-402

457

BOARD DIPLOMA EXAMINATION, (C05)

APRIL/MAY-2011

DCM-IV SEMESTER EXAMINATION

DATA STRUCTURES THROUGH C

TIME: 3 HOURS                                                                              TOTAL MARKS: 100

PART-A          10*4=40

Instruction: (1) answer all questions. Each question carries four marks.

                          (2) Answer should be brief and straight to the point and shall not exceed five simple sentences.

1. List the advantages of Linked list.
2. Define Stack. Give example.
3. Write the operations of Queue.
4. What is Tree structure
5. List the tree Traversal techniques.
6. What are different representations of Tree in memory
7. What is Sparse Matrix ? Give example.
8. List various methods of Sorting
9. What is Bubble sort?
10. What is Sequential search? Give example.

PART-B                                                   5*12=60

Instruction: (1) answer any five questions, Each question carries twelve marks.

(2) The answers should be comprehensive and the criteria for valuation is the content but not the length of the answer.

11.  (a) write a c program for to reverse a single Linked List.

      (b) Explain inserting an element in Doubly Linked list.

12.  (a)Explain the operations of Stack.(4 marks) (b)Write an algorithm for conversion of Infix to Postfix Expression with an example. (8 marks)

13.  (b) Explain with a program for insertion and deletion operations of Circular Queue.

14.   Write a c program for Creation and Searching an element in binary Tree.

15. Explain how to construct a tree for given Inorder and Preorder traversals with example.

16. (a) Explain binary Search sort. (b) Explain the Operations that can be performed on a Binary Tree for Integers.

17. (a) Explain time and Space complexities of the Sorting techniques. (b) Explain the principle of Quick sort.

18. (a) Explain the Classification of Data Structures. (4 marks) . (b)Write a C program for Binary Search. (8 marks).

C-09-CM-305

3231

BOARD DIPLOMA EXAMINATION, (C09)

OCTOBER/NOVEMBER-2010

DCM-III SEMESTER EXAMINATION

DATA STRUCTURES THROUGH C

TIME: 3 HOURS                                                                              TOTAL MARKS:80

PART-A          10*3=30

Instruction: (1) answer all questions.

                          (2) Each question carries three marks.

1.      Define data structures and classify them.

2.      Explain about linear data structures.

3.      Differentiate between arrays and linked lists.

4.      Explain briefly about queue.

5.      List different types of representing an expression.

6.      List applications of stack.

7.      Define the terms : tree, binary tree, complete binary tree.

8.      List applications of tree.

9.      List various sorting techniques.

10.  Explain the method of linear search.

PART-B                                                   5*10=50

Instruction: (1) answer any five questions.

                          (2) Each question carries ten marks.

11.  (a) write an algorithm to create singly linked list. (b) write a program to search a given element in singly linked list.

12.  explain about the operations of doubly linked list.

13.  (a) write a n algorithm to implement stack operations. (b) write a program to create sparse matrix for the given matrix.

14.  (a) Convert the given infix expression to postfix A + B * C-D/ E * F+ G .            (b)Write an algorithm to convert a given infix expression to postfix.

(a) Write an algorithm to create a binary tree.                                                                                         (b) write the inorder traversal for the given binary tree:

16. Construct binary tree given inorder and preorder traversals:                                                          Preorder : ABDGCEHIF

Inorder   : DGBAHEICF

17 (a) Write an algorithm to implement bubble sort and mention its time complexity.                         (b) Write a program to implement quick sort.

18. (a) Explain with an example about merge sort.

(b) write a program to implement binary search.

3231

BOARD DIPLOMA EXAMINATION, (C09)

MARCH /APRIL-2009

DCM-III SEMESTER EXAMINATION

DATA STRUCTURES THROUGH C

TIME: 3 HOURS                                                                              TOTAL MARKS:80

PART-A          10*3=30

Instruction: (1) answer all questions.

                          (2) Each question carries three marks.

1. Differentiate between arrays and linked list.

2. What are the applications of stack?

3. What is a circular queue? Explain it briefly.

4. Define the following terms related to tree: (a) root (b)leaf (c)subtree (d)degree of a node.

5. Define the tree structure with example.

6. Represent the following tree in array form.

7. Write the various tree traversal techniques.

8. What is time and space complexity in sorting?

9. Explain the principle of bubble sort.

10. Compare linear search and binary search.

PART-B                                                   5*10=50

Instruction: (1) answer any five questions.

                          (2) Each question carries ten marks.

11.  Write a C function to insert and delete elements in a doubly linked list.

12.  Expain how to convert the following infix expression to postfix form and write all rules. (A + B * C)/(D+ E).

13.  Write a C program to implement queues using arrays.

(a) write preorder, inorder and postorder traversals of tree given below

(b) Explain about binary search sort.

15(a) Construct a tree given inorder and preorder

      Preorder : DBEAFCG

Inorder   : ABDECFG

       16. write functions in C to create and display binary tree.

       17. Explain about quick sort with an example and write algorithm.

       18. (a) Write an algorithm form binary search.

             (b) Define data structures and classify them

3231

BOARD DIPLOMA EXAMINATION, (C09)

MARCH /APRIL-2007

DCM-III SEMESTER EXAMINATION

DATA STRUCTURES THROUGH C

TIME: 3 HOURS                                                                              TOTAL MARKS:80

PART-A          10*3=30

Instruction: (1) answer all questions.

                          (2) Each question carries three marks.

1. What is searching and What are the methods of searching.
2. List the advantages and disadvantages of Linked list
3. What is a circular queue? Explain briefly.
4. What do you meant by sparse matrix. Give an example.
PART-B                                                   5*10=50
Instruction: (1) answer any five questions.
                          (2) Each question carries ten marks.
11. Write linear search algorithm.
12. Explain how to insert and delete elements in a double linked list
13(b) Write an algorithm for reversal of a single linked list.

3231

BOARD DIPLOMA EXAMINATION, (C09)

MARCH /APRIL-2008

DCM-III SEMESTER EXAMINATION

DATA STRUCTURES THROUGH C

TIME: 3 HOURS                                                                              TOTAL MARKS:80

PART-A          10*3=30

Instruction: (1) answer all questions.

                          (2) Each question carries three marks.

1. What is a priority queue? Explain it briefly.
2. Explain the purpose of dummy header.

PART-B                                                   5*10=50

Instruction: (1) answer any five questions.

                          (2) Each question carries ten marks.

11. Write algorithm for binary search.

12. Explain how to create a single linked list with the help of an algorithm

13. Explain how to perform insertion/deletion operation on a single linked list

14.Write a C program to represent a matrix as sparse matrix.

15. Explain how to convert the following in fix expression to post fix form and write all rules. X+(y+z).