Bhagvan Kommadi

Author
+ Follow
since Oct 15, 2001
Cows and Likes
Cows
Total received
5
In last 30 days
5
Total given
0
Likes
Total received
2
Received in last 30 days
2
Total given
1
Given in last 30 days
1
Forums and Threads
Scavenger Hunt
expand Ranch Hand Scavenger Hunt
expand Greenhorn Scavenger Hunt

Recent posts by Bhagvan Kommadi

Congratulations to the winners.....
6 days ago
Go

AVL trees belong to unique type of binary search trees.In AVL trees,difference of height of left subtree and right subtree of every node is nearly one.They are called as self-balancing binary search trees.
1 week ago
Go
Tree, Queue, Linked List, Stacks are the dynamic data structures covered in the book. Dynamic data structures are used to support the modification of data structures.
1 week ago
Go
Arrays, tables, sequences are the data structures used in genome analysis related to biotechnology. Vectors, matrices and tensors are also used.
1 week ago
For unmarshalling json, structs and arrays are used. Go objects are converted to Json and Json to Go Object by using  Marshal and Unmarshal methods.
1 week ago
Go
pseudo code and flow chart are the methods used for representing the algorithms. In the pseudo code, data presented will be described in data dictionaries.
1 week ago
Go
Brute force algorithms  enumerate  all  candidates.  The candidates which give the solution are picked . data dredging is one good where you look for patterns in data using statistical methods.
1 week ago
Go
T-tree is a balanced data structure which has actual data in memory and index. It is used for ordered scanning of data.
1 week ago
Matrices, lists, vectors and tensors data structures are used in scientific analysis.
1 week ago
Go is a powerful language and it has a easy structure. Developers can easily code and learn data structures & algorithms .
1 week ago
Go
Tree data structures types covered in the book are: Binary Trees, Binary Search Trees, Red black trees, AVL trees, K-D trees and Heaps
1 week ago
Go
Blockchain is like a linked list.  A blockchain in general is a hash pointer based data structure composed of blocks.

consensus and proof of work algorithms are used for validating and generating the transaction blocks
1 week ago
Go
Dependency inversion principle is:

a) High level modules should not depend upon low level modules. Both should depend upon abstractions

b) Abstractions should not depend upon details. Details should depend upon abstractions

Implementing the dependency inversion principle involves using algorithms for defining consumers, service providers, and abstractions in different modules.
1 week ago
Go
yes.  This book covers for students various topics in computer science related to data structures and algorithms in go language. It will be a good reference and a text book for indian universities to teach courses in computer science.
1 week ago
Go
Sedge Wick book is a basic book for data structures and algorithms in java. My book covers basic, medium and advanced topics in data structures and algorithmsin go language. it covers samples from real life applications and memory management in go applications...
1 week ago
Go