Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
list various problem solving techniques there are two techniques-1 top down2 bottom-
what do you understand by tree traversalthe algorithm walks by the tree data structure and performs some computation at everynode in the tree this
binary search technique- this technique is applied to an ordered list where elements are arranged either in ascending order or descending order
what do you mean by hash clashhashing is not perfect occasionally a collision occurs when two different keys hash into the same hash value and are
multidimensional array multidimensional arrays can be defined as arrays of arrays for example a bidimensional array can be imagined as a
there are four data type groups integer kepts whole numbers and signed numbers floating-point stores real numbers fractional values perfect for
what is a ning tree of a grapha ning tree is any tree having of vertices of graph tree and some edges of graph is known as a ning
maximum numbers of nodes a binary tree of depth d the maximum numbers of nodes a binary tree of depth d can have is 2
almost complete binary tree-a binary tree of depth d is an almost whole binary tree if 1any node and at level less than d-1 has two children 2 for
define complete binary treecomplete binary tree- a whole binary tree of depth d is that strictly binary tree all of whose leaves are at level
define strictly binary treestrictly binary tree- if each non leaf node in binary tree has non empty left and right sub-trees then the tree is known
chainingin 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 addressingthe easiest way to resolve a collision is to start with the hash address and do a sequential search by the table for an empty
two broad classes of collision resolution techniques area open addressing andb
how do collisions happen during hashingusually the key space is much larger than the address space thus many keys are mapped to the same address
define a sparse metricsa matrix in which number of zero entries are much higher than the number of non zero entries is known as sparse matrix the
explain how two dimensional arrays are represented in memoryrepresentation of two-dimensional arrays in memory-let grades be a 2-d array as grades 34
what is a linear arrayan array is a way to reference a series of memory locations using the similar name every memory location is shown by an array
what are stacksa stack is a data structure that organizes data similar to how one organizes a pile of coins the new coin is always placed on the top
define a b-treejustas avl trees are balanced binary search trees b-trees are balanced m-way search trees a b-tree of order m is either the empty tree
explain dijkstras algorithmdijkstras algorithm this problem is concerned with finding the least cost path from an originating node in a weighted
what is the best case complexity of quick sort in the best case complexity the pivot is in the
five popular hashing functions are as follows1 division method2 midsquare method3 folding method4 multiplicative method5 digit
what do you mean by hashinghashing gives the direct access of record from the file no matter where the record is in the file this is possible with
how will you represent a max-heap sequentiallymax heap also known as the descending heap of size n is an almost complete binary tree of n nodes such