DIT 206 DATA STRUCTURES

4 L T P Cr. 1 4 6.5

Note: Total 8 questions are to be set by the examiner selecting two questions from each unit. A candidate is required to attempt five questions in all selecting at least one question from each unit. All questions shall carry equal marks. Total Marks : 100 Time : 3 Hours Theory Paper : 60 Internal Assessment: 40

Unit-I Problem solving concept, top down and bottom up design, structured programming, Revision of control structures and their applications Concept of Arrays, Single dimensional array, Two dimensional array, Address calculation of an element in an array, Operations on arrays with Algorithms (searching, traversing, inserting, deleting), Strings as array of Characters and operations on strings (strlen, strcpy, strcmp, strcat) Unit-II Introduction to stacks, Representation of stacks, Implementation of stacks, Uses of stacks, Infix, Postfix and Prefix Notations and converting one to another, Introduction to queues, Implementation of queues (with algorithm), Circular Queues, De-queues Unit-III Recursion and its use, Search algorithms (Linear and Binary), Concept of sorting, Sorting algorithms (Bubble Sort, Insertion Sort, Quick Sort, Selection Sort, Merge) Unit-IV Introduction to linked list and double linked list, Representation of linked lists in Memory, Traversing a linked list, Searching linked list, Insertion and deletion into linked list, Application of linked lists, Doubly linked lists, Traversing a doubly linked lists, Insertion and deletion into doubly linked lists

RECOMMENDED BOOKS
TEXT BOOKS 1. Data Structures By Horwitz and Sartaj Sahni, Galgotia Publications, New Delhi. 2. Data structures Schaums Outline Series McGraw Hill Publications, New Delhi.

REFERENCE BOOKS 1. 2. 3. 4. 5. Expert Data Structures with C by R.B. Patel Khanna Publishers, New Delhi. Data structures O.G. Kakde and U.A. Deshpande, Delmar Thomson Learning. Data Structures and Programming Design by Kruse, Prentice Hall India, New Delhi. Data Structures by Sanjiv Sofat, Khanna Publishers, New Delhi Data Structures by Tanenbaum, Pearson Education, New Delhi.

LIST OF PRACTICALS Write programs in C to implement 1. Search an element in the array to find its position. 2. Insert or delete an element at/from specified position. 3. Copy and concatenate two strings. 4. To multiply two matrices. 5. The addition of two matrices using functions 6. To create a stack and define the operations push and pop. 7. To create a queue and define the operations insert and delete. 8. To find the factorial of a given number using recursion. 9. To find the Fibonacci series using recursion. 10. The bubble sort technique 11. The selection sort technique 12. The Insertion sort technique 13. The quick sort technique 14. The merge sort technique 15. The binary search procedure (non-recursive) to search an element in a given list 16. The binary search procedure (recursive) to search an element in a given list 17. Insertion of elements in linked list 18. Deletion of elements from linked list 19. Insertion of elements in doubly linked list and traversal of the list. 20. Deletion of elements from doubly linked list and traversal of the list.