Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
what is block scopeblock scope the variables with block scope appear in a block or within the list of formal parameter declarations in a function
two-dimensional array is represented in memory in following two ways1 row major representation to attain this linear representation the first row
two properties of recursion are- 1 a smallest base case that is processed without recursion and acts as decision criterion for stopping the method of
what is recursionrecursion - recursion is described as a technique of defining a set or a process in terms of
assume that a graph has a minimum ning tree already computed how fastly can the minimum ning tree be updated if a new vertex and incident
the six several application of stack in computer application is1 conversion of infix to postfix notation and vice versa2 evaluation of
what are stacks a stack is an abstract data type in which items are additional to and removed only from one end known as top for example consider
what is a heapa complete binary tree every of whose elements contains a value that is greater than or equal to the value of every of its children
depth-first search is different from breadth-first search in the following waysa depth search traversal method goes to the deepest level of the tree
incidence matrix - this is the incidence matrix for an undirected group for directed graphs the vertex from where an edge is originating will have 1
why dont we permit a minimum degree of t1 for a b-treeaccording to the definition of b-tree a b-tree of order n means that every node in the tree has
in which input data does the algorithm quick sort exhibit its worst-case behaviourthe quick sort method exhibits its worst-case behavior when the
five popular hashing functions are as follows-division methodmidsquare methodfolding methodmultiplicative methoddigit
what are the two methods to resolve collision during hashingthe two methods to resolve collision during hashing area open addressing and b chaining
what is an abstract data type adtabstract data types or adts are a mathematical specification of a set of data and the set of operations that can be
advantage 1 by doing threading we neglect the recursive method of traversing a tree which makes use of stack and consumes
what are threaded binary treesa threaded binary tree is a binary tree in which each node that does not have a right child has a thread in real sense
what is recursion a recursive procedure should have two properties what are they recursion means function call itself
what is a sparse matrix sparse matrixa matrix in which number of zero entries is much higher than the number of non-zero entries is known as sparse
quadratic probing in the above case when the first insertion is made the probability of latest element being inserted in a certain position is
define linear probinglinear probing the easiest way to resolve a collision is to begin with the hash address and do a sequential search by the
explain the difference between depth first and breadth first traversing techniques of a graph depth-first search is dissimilar from
chaining in this method instead of hashing function value as location we use it as an index into an array of pointers every pointer access a chain
open addressing the easiest way to resolve a collision is to begin with the hash address and do a sequential search by the table for an empty
what is hashinghashing hashing gives the direct access of record from the file no matter where the record is in the file this is possible with the