data structures syllabus

PART – A

C Language Features

UNIT 1:

1.       Pointers: Concepts, Pointer variables, Accessing variables through pointers, Pointer declaration and definition, Initialization of pointer variables, Pointers and functions, Pointer to pointers, Compatibility, Lvalue and Rvalue, Arrays and pointers, Pointer arithmetic and arrays, Passing an array to a function, Understanding complex declarations, Memory allocation functions, Array of pointers.

7 Hours

UNIT 2:

2.       Strings: String concepts, C strings, String I/O functions, Array of strings, String manipulation function, Memory formatting.

2 Hours

3.       Derived types-Enumerated, Structure, and Union:  The type definition, Enumerated types, Structure, Accessing structures, Complex structures, Array of structures, Structures and functions, Unions

3 Hours

4.       Binary Files:  Classification of Files, Using Binary Files, Standard Library Functions for Files

2 Hours

UNIT 3:

5.       The Stack: Definition and Examples, Representing Stacks in C, An Example – Infix, Postfix, and Prefix

6 Hours

UNIT 4:

6.       Recursion: Recursive Definition and Processes, Recursion in C, Writing Recursive Programs, Simulating Recursion, Efficiency of Recursion

http://improvec.blogspot.in/2011/08/recursive-functions.html

4 Hours

7.       Queues: The Queue and its Sequential Representation

                                                2 Hours

PART – B

UNIT 5:

8.       Lists: Linked Lists, 

http://rajdsinc.blogspot.in/2012/05/linked-list.html

Lists in C, 

An Example – Simulation using Linked Lists                                         

7 Hours

UNIT 6:

9.       Lists contd.: Other List Structures

                                                                                                               

UNIT 7:

10. Trees: Binary trees, Binary Tree Representations                                                                                                                                                           

6 Hours

UNIT 8:

11.    Trees contd.: Representing Lists as Binary Trees, Trees and their applications

                                                                                                                7 Hours

http://rajdsinc.blogspot.in/2012/10/avl-trees_22.html

Record questions

http://rajdsinc.blogspot.in/2012/06/data-structures-record-questions.html

previous question papers

http://rajdsinc.blogspot.in/2011/12/ds-previous-question-papersdiploma.html

Text Books

1.     Computer Science A Structured Programming Approach Using C, Second Edition, Behrouz A. Forouzan and Richard F. Gilberg, , Thomson, 2003

(Chapter 9.1 to 9.9, Chapter 10.1 to 10.6, Chapter 11.1 to 11.6, Chapter 12.1 to 12.8, Chapter 13.1 to 13.3).

2.     Data Structure using C, Aaron M. Tenenbaum, Yedidyah Langsam & Moshe J. Augenstein, Pearson Education/PHI, 2006.

(Chapter 2, 3, 4, 5.1, 5.2, 5.4, 5.5).

Reference Books

3.     Data Structures A Pseudocode approach with C, Richard F. Gilberg and Behrouz A. Forouzan, Thomson, 2005.

4.     Data Structures & Program Design in C, Robert Kruse & Bruce  Leung, Pearson Education, 2007.

diploma DS previous question papers

C LANGUAGE  

C with DATA STRUCTURES

C++ TUTORIALS
Data Structures through c++

JAVA

OPERATING SYSTEMS

SOFTWARE ENGINEERING

WEB DESIGNING

POLYTECHNIC DIPLOMA PREVIOUS QUESTION PAPERS FOR DS THROUGH C

POLYTECHNIC DIPLOMA PREVIOUS QUESTION PAPERS Computer hardware

POLYTECHNIC RDBMS PREVIOUS QUESTION PAPERS

APRIL/MAY-2012 (c-09)

C-09-CM-305

3231

BOARD DIPLOMA EXAMINATION, (C09)

APRIL/MAY-2012

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 time and space complexity?

2.    what is Linear data structure and give examples?

3.    What is linked list?

4.    List applications of STACK

5.    What is a double linked circular list?

6.    Differentiate between queues and stacks.

7.    Define a tree structure with example.

8.    List operations on binary tree.

9.    What is the principle of bubble sort?

10.  Differentiate between linear and binary searching.

PART-B                                                   5*10=50

Instruction: (1) answer any five questions.

                          (2) Each question carries ten marks.

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

12) Explain how to perform insertion and deletion operation on a double linked list.

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

14) (a) explain the operation of stack. (b) explain how to convert the given infix expression to postfix expression A*B+(C/D)

15)  Explain how to construct a tree for given in order, preorder traversals.                               In order :    Z,A,Q,P,Y,X,C,B                                                                                             Pre order:  Q,A,Z,Y,P,C,X,B

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

17) (a) write a c program for selection sort. (b)What is time and space complexing for merge sort?

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

APRIL/MAY 2011(C-09)

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.

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.

OCTOBER/NOVEMBER-2010(C09)

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.

OCTOBER/NOVEMBER-2011 (c-09)

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.

APRIL/MAY-2011 (c-05)

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).

OCTOBER/NOVEMBER-2010 (c-09)

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.