Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
what is a heapa complete binary tree every of whose elements contains a value that is greater than or equal to the value of every of its children
depth-first search is different from breadth-first search in the following waysa depth search traversal method goes to the deepest level of the tree
incidence matrix - this is the incidence matrix for an undirected group for directed graphs the vertex from where an edge is originating will have 1
why dont we permit a minimum degree of t1 for a b-treeaccording to the definition of b-tree a b-tree of order n means that every node in the tree has
in which input data does the algorithm quick sort exhibit its worst-case behaviourthe quick sort method exhibits its worst-case behavior when the
five popular hashing functions are as follows-division methodmidsquare methodfolding methodmultiplicative methoddigit
what are the two methods to resolve collision during hashingthe two methods to resolve collision during hashing area open addressing and b chaining
what is an abstract data type adtabstract data types or adts are a mathematical specification of a set of data and the set of operations that can be
advantage 1 by doing threading we neglect the recursive method of traversing a tree which makes use of stack and consumes
what are threaded binary treesa threaded binary tree is a binary tree in which each node that does not have a right child has a thread in real sense
what is recursion a recursive procedure should have two properties what are they recursion means function call itself
what is a sparse matrix sparse matrixa matrix in which number of zero entries is much higher than the number of non-zero entries is known as sparse
quadratic probing in the above case when the first insertion is made the probability of latest element being inserted in a certain position is
define linear probinglinear probing the easiest way to resolve a collision is to begin with the hash address and do a sequential search by the
explain the difference between depth first and breadth first traversing techniques of a graph depth-first search is dissimilar from
chaining in this method instead of hashing function value as location we use it as an index into an array of pointers every pointer access a chain
open addressing the easiest way to resolve a collision is to begin with the hash address and do a sequential search by the table for an empty
what is hashinghashing hashing gives the direct access of record from the file no matter where the record is in the file this is possible with the
algorithm to insert a key in b-tree is as follows1 first search is completed for the place where the new record must be put as the keys are
define a b tree of order mb tree of order m a balanced multiway search tree of order m in which every non root node having at least m2 keys is
what are priority queuesthere are many queues in which we can insert items or delete items from any of the position based on some property now those
internal path lengthit is described as the number of node traversed while moving by one particular node to any other node in the
complete binary treea complete binary tree can be described as a binary tree whose non leaf nodes have nonempty left and right sub tree and all
height of a treethe length of the longest path from root to any node is called as the height of the
level of a nodethe root is at level zero and the level of the node is 1 more than the level of its