Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
what is the time complexity of merge sort and heap sort algorithmstime complexity of merge sort is on log2 ntime complexity of heap sort is
which sorting algorithm is best if the list is already sorted whyinsertion sort as there is no movement of data if the list is already sorted and
what values are automatically assigned to those array elements which are not explicitly initializedgarbage values are automatically assigned to those
normal 0 false false false en-in x-none x-none microsoftinternetexplorer4
the best average behaviour is shown by quick
the goal of hashing is to produce a search that takes o1 time
an adjacency matrix representation of a graph cannot having information of parallel
representation of data structure in memory is known asabstract data
a linear collection of data elements where the linear node is given by means of pointer is known aslinked
a binary tree of depth d is an almost complete binary tree if a every leaf in the tree is either at level d or at level d-1 b for any node
the pre-order and post order traversal of a binary tree generates the same output the tree can have maximum one
a bst is traversed in the following order recursively right root left e output sequence will be in in descending
how read and write is performed using socketsan application program interface gives the details of how can an application program interacts along
define a socketan application program interface gives the details of how can an application program interacts along with protocol software but socket
what are the main differences between osi and tcp ip reference models explain briefly we will be considering only on the key differences among the
the main function of a browser is tothe important function is to interpret html of a
which type of web document is run at the client siteactive web document is a type of web document is run at client
which one is an error reporting protocolan error reporting protocol is
the addressing specially used by transport layer isthe addressing particularly used through transport layer is application port
which 802 standard provides for a collision free protocol8025 standard gives for a collision free
which method uses the greatest number of layers in the osi modelgateway utilizes the greatest number of layers into the osi
in cyclic redundancy checking crc is thechecking crc in cyclic redundancy is the remainder normal 0 false false false en-in x-none x-none
127001 is a127001 it is a loop-back 127001 is a127001 it is a loop-back
a header in cgi document can representa header into cgi document can show format of the document and the location if document used to various
ftp does not use ftp doesnt use user datagram