Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
what is oo developmentoo development is a way of thinking about software based on abstractions that exist in the actual world development refers to
what is object orientationobject orientation means that we classify software as a collection of discrete objects that incorporate with together ds
define the terms i key attribute ii value set key attribute an entity type usually has an
define null values in some cases a particular entity might not have an applicable value for an attribute or if we do not know the value of an
what are stored and derived attributes stored attributes the attributes kept in a data base are called stored attributes derived attributes the
define data model a data model is a collection of conceptual tools for explaning data data relationships data semantics and consistency
explain the halting problemgiven a computer program and an input to it verify whether the program will halt on that input or continue working
explain class p problemsclass p is a class of decision problems that can be solved in polynomial
explain the theory of computational complexity a problems intractability remains the similar for all principal
define tractable and intractable problemsproblems that can be solved in polynomial time are known as tractable problems problems that cannot be
explain state space treeif it is convenient to execute backtracking by constructing a tree of choices being made the tree is known as a state space
explain backtrackingthe principal idea is to construct solutions single component at a time and evaluate such partially constructed
explain the memory function methodthe memory function method seeks to combine strengths of the top down and bottom-up approaches to
explain optimal binary search treesone of the principal application of binary search tree is to execute the operation of searching if probabilities
explain principle of optimalityit indicates that an optimal solution to any instance of an optimization problem is composed of optimal solutions
explain floyds algorithmit is convenient to record the lengths of shortest paths in an n by n matrix d known as the distance matrix the element
explain all-pair shortest-paths problemgiven a weighted linked graph undirected or directed the all pairs shortest paths problem asks to find the
define dynamic programming dynamic programming is a method for solving problems with overlapping
define prims algorithmprims algorithm is a greedy algorithm for constructing a minimum ning tree
define min-heapa min-heap is a complete binary tree in which each element is less than or equal to its children all the principal properties of heaps
define minimum ning treea minimum ning tree of a weighted linked graph is its ning tree of the smallest weight where the weight of a tree
define ning treea ning tree of a connected graph is its linked acyclic sub graph ie a tree that having all the vertices of the
explain about greedy techniquethe greedy method suggests constructing a solution to an optimization
define the external path lengththe external path length e of an extended binary tree is explained as the sum of the lengths of the paths - taken over
define the internal path lengththe internal path length i of an extended binary tree is explained as the sum of the lengths of the paths taken over