Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
define strictly binary treestrictly binary tree- if each non leaf node in binary tree has non empty left and right sub-trees then the tree is known
chainingin 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 addressingthe easiest way to resolve a collision is to start with the hash address and do a sequential search by the table for an empty
two broad classes of collision resolution techniques area open addressing andb
how do collisions happen during hashingusually the key space is much larger than the address space thus many keys are mapped to the same address
define a sparse metricsa matrix in which number of zero entries are much higher than the number of non zero entries is known as sparse matrix the
explain how two dimensional arrays are represented in memoryrepresentation of two-dimensional arrays in memory-let grades be a 2-d array as grades 34
what is a linear arrayan array is a way to reference a series of memory locations using the similar name every memory location is shown by an array
what are stacksa stack is a data structure that organizes data similar to how one organizes a pile of coins the new coin is always placed on the top
define a b-treejustas avl trees are balanced binary search trees b-trees are balanced m-way search trees a b-tree of order m is either the empty tree
explain dijkstras algorithmdijkstras algorithm this problem is concerned with finding the least cost path from an originating node in a weighted
what is the best case complexity of quick sort in the best case complexity the pivot is in the
five popular hashing functions are as follows1 division method2 midsquare method3 folding method4 multiplicative method5 digit
what do you mean by hashinghashing gives the direct access of record from the file no matter where the record is in the file this is possible with
how will you represent a max-heap sequentiallymax heap also known as the descending heap of size n is an almost complete binary tree of n nodes such
define big theta notation big theta notation theta the upper and lower bound for the function f is given by the big oh notation theta considering g
define big omega notationbig omega notation the lower bound for the function f is given by the big omega notation considering g to be a function
big oh notation o the upper bound for the function f is given by the big oh notation o considering g to be a function from the non-negative integers
simulation of queues simulation is the process of forming an abstract model of a real world situation in order to understand the effect of
abstract data types- a useful tool for specifying the logical properties of a data type is the abstract data type or adt the term abstract data type
which are the two standard ways of traversing a graphi the depth-first traversal ii the breadth-first
what is quick sortquick sort is a sorting algorithm that uses the idea if split and conquer this algorithm chooses an element called as pivot element
what is the difference between a grounded header link list and a circular header link lista header linked list is a linked list which always having a
what do you mean by complexity of an algorithm the complexity of an algorithm m is the function fn which gives the running time andor storage space
which sorting algorithm is easily adaptable to singly linked lists simple insertion sort is easily adabtable to singly linked