Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
a graph with n vertices will definitely have a parallel edge or self loop of the total number of edges are more than
in a circular linked listthere is no beginning and no
explain essential loop in process schedulingthe complex part of scheduling is to balance policy enforcement along with resource optimization so as to
the smallest element of an arrays index is called itslower
consider a linked list of n elements what is the time taken to insert an element after an element pointed by some pointero
an undirected graph g with n vertices and e edges is shown by adjacency list what is the time required to generate all the connected componentso
which sorting algorithms does not have a worst case running time of o n2 merge
what is a process scheduling scheduling is a key element of the workload management software that usually performs several or all of queuing
a sort which relatively passes by a list to exchange the first element with any element less than it and then repeats with a new first element is
describe the necessary conditions for deadlockrequired conditions for deadlock1 mutual exclusion2 hold and wait3 no preemption4 circular waitmutual
a linear list of elements in which deletion can be done from one end front and insertion can take place only at the other end rear is called as a
a binary tree in which if all its levels except possibly the last have the maximum number of nodes and all the nodes at the last level appear as far
if a node in a bst has two children then its inorder predecessor hasno right child
in worst case quick sort has order o in worst case quick sort has order o
merging 4 sorted files having 50 10 25 and 15 records will take time o
the complexity of multiplying two matrices of order mn and np is
the number of interchanges needed to sort 5 1 6 2 4 in ascending order using bubble sort
a mathematical-model with a collection of operations described on that model is known asabstract data
the searching technique that takes o 1 time to find a data is hashing is used to find a
if a node having two children is deleted from a binary tree it is replaced byinorder
technique for direct search is hashing is the used for direct
you have to sort a list l having of a sorted list followed by a few random elements which sorting methods would be especially suitable for this type
the os of a computer might be periodically collect all the free memory space to form contiguous block of free space garbage
digital signaturesa digital signature is an electronic rather than a written signature that can be used by someone to validate the uniqueness of the
e-brokeragean e-brokerage is an investment house that permits you to buy and sell stocks and get investment information from its web