Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
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
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