Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
what is a height balanced treeheight balanced tree avl tree an avl tree is a binary search tree in which the height of the left and right subtree of
what is xml dtd document type definitiondtd is a document which defines legal building blocks of a particular xml document this defines the document
how optimization is achieved in dnstwo primary optimizations used in dns and they are replication and caching all root servers is replicated various
why wap gateways are usedthe wireless application protocol gateway is a very unique product giving semi -automatic redirection of html documents to
what is wapwap is stands for wireless application protocol it is a global open standard which gives mobile users access to internet services by
how memory is freed using boundary tag method in the context of dynamic memory managementboundary tag method to free memoryto delete an arbitrary
worst fit method- in this method the system always allocate a portion of the largest free block in memory the philosophy behind this method is that
best - fit method- this method obtains the smallest free block whose size is greater than or equal to get such a block by traversing the whole
first - fit method- the free list is traversed sequentially to search the 1st free block whose size is larger than or equal to the amount
memory allocation strategiesif it is not desirable to move blocks of due storage from one area of memory to another it must be possible to relocate
what are the conditions under which sequential search of a list is preferred over binary searchsequential search is a preferred over binary search
write an algorithm for binary search algorithm for binary search1 if lowgt high 2 return -1 3 mid low high2 4 if x amid 5
normal 0 false false false en-in x-none x-none microsoftinternetexplorer4
write down the algorithm of quick sort an algorithm for quick sort void quicksort int a int lower int upper int i if upper gt lower
primitive data structurethese are the basic structure and are directly operated upon by the machine instructions these in general have dissimilar
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