Online | Offline Tutors for Data Structures
Visit http://www.learninggeeks.info for Registration.
Call us @ 9718322472, 9810333483
Mail us for any queries: learninggeeks@gmail.com
UNIT – I
Fundamentals of algorithm analysis: Big ‘O’ notations, Time and space complexity of algorithms., Elementary data structures and their applications
Arrays: ordered lists, representation of arrays, sparse matrices, linked lists: singly and doubly linked lists, stacks, queues, multiples stacks and queues, Applications: polynomial arithmetic, infix, postfix and prefix arithmetic expression conversion and evaluations.
UNIT – II
Trees: Binary trees: Definition, traversal, threaded binary tree, Counting Binary Tree.
Graphs: Representation, traversal, connected components, shortest path and transitive closure, topological sort, activity network, critical path, path enumeration. Dijkstra’s Algorithm, Floyd Warshall’s Algorithm, Minimum Spanning Tree Definitions.
UNIT – III
Searching & Sorting: Binary Search Tree, Insertion & Deletion, AVL Trees, Hash function, Hash table, Internal sort: Radixsort, Insertion sort, Exchange sort, Selection sort, Quicksort, Shellsort, Mergesort, Heaport, External sort: K-way mergesort, balanced mergesort, polyphase mergesort
UNIT – IV
Files: Files, Queries and sequential organization; Cylinder surface indexing, Hashed Indexed, Tree Indexing, B-Trees, Trie Indexing, Sequential file organizational, random file organization, Hashed file organization, Inverted files, cellular partitions.
TEXT BOOKS:
1. E. Horowitz and S. Sahani, “Fundamentals of Data Structures”, Galgotia Booksource Pvt. Ltd, 1999.
2. R. L. Kruse, B. P. Leung, C. L. Tondo, “Data Structures and program design in C”, PHI, 2000.
REFERENCES BOOKS:
1. Schaum’s outline series, “Data Structure”, TMH, 2002
2. Y. Langsam et. al., “Data Structures using C and C++”, PHI, 1999.
3. Yashwant Kanetkar, “Data Structure through C”, BPB, 2005.
No comments:
Post a Comment