Online | Offline Tuitions for Data Structures Using C
Visit http://www.learninggeeks.info for Registration.
Call us @ 9718322472, 9810333483
Mail us for any queries: learninggeeks@gmail.com
UNIT-I
Arrays: Representation of single and multidimensional arrays; sparse arrays- lower and upper triangular matrices and Tri-diagonal matrices
Stacks and Queues: Introduction and primitive operations on stack; Stack application: Infix, postfix, prefix expressions; Evaluation of postfix expression; Conversion from infix to postfix.Introduction and primitive operation on queues, D-queues and priority queues.
UNIT-II
Lists: Introduction to linked lists; Sequential and linked lists, operations such as traversal, insertion, deletion, searching, Two way lists and Use of headers
Trees: Introduction and terminology; Traversal of binary trees; Recursive algorithms for tree operations such as traversal, insertion, deletion;
UNIT-III
Multilevel indexing and B-Trees: Introduction: The invention of the B-tree; Statement of the problem; Indexing with binary search trees; Multilevel indexing, a better approach to tree indexes; B-trees: working up from the bottom; Example for creating a B-tree.
UNIT-IV
Sorting Techniques: Insertion sort, selection sort, merge sort, heap sort.
Searching Techniques: linear search, binary search and hashing
TEXT:
1. E. Horowitz and S. Sahani, “Fundamentals of Data Structures”, Galgotia Booksource Pvt. Ltd, 2003
2. R. S. Salaria, “Data Structure & Algorithms”, Khanna Book Publishing Co. (P) Ltd., 2002.
REFERENCES:
1. P. S. Deshpande and O.G. Kakde, “C & Data Structure”, Wiley Dreamtech, 1st Edition, 2003.
2. Y. Langsam et. al., “Data Structures using C and C++”, PHI, 1999.
3. Schaum’s outline series, “Data Structure”, TMH, 2002
