Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
midsquare method- this operates in 2 steps in the first step the square of the key value k is taken in the 2nd step the hash value is obtained by
describe arp message format in brief describe arp message format in brief
multiplication method the multiplication method operates in 2 steps in the 1ststep the key value k is multiplied by a constant a in the range oltalt1
explain division methoddivision method- in this method key k to be mapped into single of the m states in the hash table is divided by m and the
what is the advantage or disadvantage of using inaddrany instead of the ip address of the computer running on the serverthe format of tcpip structure
can a queue be shown by circular linked list with only single pointer pointing to the tail of the queueyes a queue can be shown by a circular linked
method to measure address of any element of a matrix stored in memorylet us consider 2 dimensional array a of size mn further consider that the lower
could tcp allow ip to checksum the datatcp cannot permit ip to checksum data yet ip has its own checksum for its header ip layer is fundamentally
is the tcp checksum necessaryyes tcp checksum is essentialtcp layer is liable for error detection transmission of packets if needed error control
triangular matricestiangular matrices is of 2 typesa lower triangularb upper
the space - time trade offthe best algorithm to solve a given problem is one that needs less space in memory and takes less time to complete its
explain space complexityspace complexity - the space complexity of an algorithm is the amount of memory it requires to run to completion some of the
time complexity- the time complexity of an algorithm is the amount of time it requires to run to completion some of the reasons for studying time
complexity of an algorithm an algorithm is a sequence of steps to solve a problem there may be more than one algorithm to solve a problem the choice
list the major activities of an operating system with respect to memory management secondary storage management and process managementoperating
system defined data types-these are data types that have been defined by the compiler of any program the c language contains 4 basic data types- int
double linked listin a doubly linked list also known as 2 way lists each node is separated into 3 parts the first part is called last pointer field
explain virtual packetsthe router cant transfer a copy of a frame from one kind of network to other since the frame formats be different more
conversion of forest into treea binary tree may be used to show an entire forest since the next pointer in the root of a tree can be used to point to
explain bootp boot strap protocoltcp or ip designer observed that several of the configuration steps could be combined in a single step if a server
write shorts notes on digital signaturethis method is used to authenticate the sender of a message for sign a message the sender encrypts the message
the two famous methods for traversing are-a depth first traversalb breadth
graph traversalin many problems we wish to investigate all the vertices in a graph in some systematic order in graph we often do not have any single
threaded binary tree-by changing the null lines in a binary tree to special links known as threads it is possible to perform traversal insertion and
why use a dtd document type definitionxml gives an application independent method of sharing data along with a dtd independent group of people can