Data Structures Quick Reference by Raghavendran Ch V (5 results)

Condition: Sehr gut. Zustand: Sehr gut | Seiten: 172 | Sprache: Englisch | Produktart: Bücher.

Condition: Hervorragend. Zustand: Hervorragend | Seiten: 172 | Sprache: Englisch | Produktart: Bücher.

Taschenbuch. Condition: Neu. Neuware -This books starts with an overview on Object Oriented Programming Language C++. After the introduction of C++ we discussed the Linear Data structures - Linked list, Stack, Queue, Circular Queue and Priority queues along with implementation in C++. Under the Non-Linear data structures section, we focused on Trees, Graphs and its representations. Various graph traversals and algorithms such as Prim's, Kruskal's are also included. Searching techniques such as Linear Search, Binary Search and Hashing methods are discussed. Under the Sorting mechanisms we have presented - Bubble sort, Insertion sort, Merge sort, Quick sort, Heap sort, Radix sort along with implementation in C++. In Search trees section Binary Search Tree (BST) is discussed along with its implementation. We have introduced the advanced search trees like AVL Trees, B-Trees and Red-Black Trees.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 172 pp. Englisch.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This books starts with an overview on Object Oriented Programming Language C++. After the introduction of C++ we discussed the Linear Data structures - Linked list, Stack, Queue, Circular Queue and Priority queues along with implementation in C++. Under the Non-Linear data structures section, we focused on Trees, Graphs and its representations. Various graph traversals and algorithms such as Prim's, Kruskal's are also included. Searching techniques such as Linear Search, Binary Search and Hashing methods are discussed. Under the Sorting mechanisms we have presented - Bubble sort, Insertion sort, Merge sort, Quick sort, Heap sort, Radix sort along with implementation in C++. In Search trees section Binary Search Tree (BST) is discussed along with its implementation. We have introduced the advanced search trees like AVL Trees, B-Trees and Red-Black Trees. 172 pp. Englisch.

Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This books starts with an overview on Object Oriented Programming Language C++. After the introduction of C++ we discussed the Linear Data structures - Linked list, Stack, Queue, Circular Queue and Priority queues along with implementation in C++. Under the Non-Linear data structures section, we focused on Trees, Graphs and its representations. Various graph traversals and algorithms such as Prim's, Kruskal's are also included. Searching techniques such as Linear Search, Binary Search and Hashing methods are discussed. Under the Sorting mechanisms we have presented - Bubble sort, Insertion sort, Merge sort, Quick sort, Heap sort, Radix sort along with implementation in C++. In Search trees section Binary Search Tree (BST) is discussed along with its implementation. We have introduced the advanced search trees like AVL Trees, B-Trees and Red-Black Trees.