Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
define the translator which perform macro expansion is known as a
determine symbolic names can be associated with symbolic names can be associated with the data or
what is a work processa work process is where individual dialog steps are in fact processed and the work is done every work process ocuurs one
what are the functions of dispatcherthere are four fuctions of dispatcher-a equal distribution of transaction load to the work processes b
what is sap dispatchersap dispatcher is the control agent that handles the resources for the r3
which interface converts sql requirements in the sap development system to those of the database database interface converts sql in the
which interface controls what is shown on the pc presentation interface controls what is shown on the
what are the central interfaces of the r3 systemthere are three central interfaces-presentation interfacedatabase interfaceoperating system
what guarantees the integration of all application modules the r3 basis system guarantees the integration of all application modules the r3 basis
translator for low level programming language were called as assembler
write an algorithm to test whether a binary tree is a binary search treethe algorithm to test whether a binary tree is as binary search tree is as
difference among prisms and kruskals algorithmin kruskals algorithm the set a is a forest the safe edge added to a is always a least-weight edge in
b- tree a b-tree of order m is an m-way true in which 1 all leaves are on the similar level2 all internal nodes except the root have at
methods of collision resolution1 collision resolution by separate chaining 2 collision resolution by open
limitation of binary search -i the complexity of binary search is o log2 n the complexity is similar irrespective of the position of the element
using stacks write an algorithm to determine whether the infix expression has balanced parenthesis or not algorithm parseparensthis algorithm reads a
deletion algorithm for dequeue step 1 check for underflow if front 0 and rear 0 output underflow and returnstep 2 delete element at front
circular queues-a more efficient queue representation is get by regarding the array q1n as circular it becomes more convenient to declare the array
decision treea decision tree is a diagram that shows conditions and actions sequentially and therefore shows which condition is to be considered
various graph traversal schemesgraph traversal schemein many problems we wish to investigate all the vertices in a graph in some systematic order in
write an algorithm for searching a key from a sorted list using binary search technique1 if low gt high2 return
binary search treea binary search tree is a binary tree that is either empty or in which every node having a key that satisfies the following
heap a heap is described to be a binary tree with a key in every node such that 1-all the leaves of the tree are on 2 adjacent levels2- all
thread by changing the null lines in a binary tree to special links known as threads it is possible to perform traversal insertion and deletion
avl treean avl tree is a binary search tree in which the height of the left and right subtree of the root vary by at most 1 and in which the left and