Data Structures through C++ ¿ A quick reference

Ch. V Raghavendran

ISBN 10: 6138801024 / ISBN 13: 9786138801023

Verlag: Scholars' Press, 2019

Beschreibung

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.

Bestandsnummer des Verkäufers 9786138801023

Bibliografische Details

• Titel: Data Structures through C++ ¿ A quick reference
• Verlag: Scholars' Press
• Erscheinungsjahr: 2019
• Sprache: Englisch
• ISBN-10: 6138801024
• ISBN-13: 9786138801023
• Einband: Taschenbuch
• Zustand: Neu

Über diesen Titel

Inhaltsangabe

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.