Data Structures through C++ ¿ A quick reference

Ch. V Raghavendran

ISBN 10: 6138801024 / ISBN 13: 9786138801023

Published by Scholars' Press Feb 2019, 2019

About this Item

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.

Seller Inventory # 9786138801023

Bibliographic Details

• Title: Data Structures through C++ ¿ A quick reference
• Publisher: Scholars' Press Feb 2019
• Publication Date: 2019
• Language: English
• ISBN 10: 6138801024
• ISBN 13: 9786138801023
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 220W x 150H x 11D millimeters 220 millimeters width by 150 millimeters height by 11 millimeters depth
• Weight: 274 grams

About this title

Synopsis

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.