< / this is contradictory value as for any value of as it cannot be assured to be less than / or / an imprecise analogy between the asymptotic comparison of functions (nand (nand the relation between their values can be given asf(no( ( ) ( > (nf(no( ( ) (ng(npoints to remember data structure is particular way of storing and organizing data either in computer' memory or on the disk storage so that it can be used efficiently there are two types of data structuresprimitive and non-primitive data structures primitive data structures are the fundamental data types which are supported by programming language nonprimitive data structures are those data structures which are created using primitive data structures non-primitive data structures can further be classified into two categorieslinear and non-linear data structures if the elements of data structure are stored in linear or sequential orderthen it is linear data structure howeverif the elements of data structure are not stored in sequential orderthen it is non-linear data structure an array is collection of similar data elements which are stored in consecutive memory locations linked list is linear data structure consisting of group of elements (called nodeswhich together represent sequence stack is last-infirst-out (lifodata structure in which insertion and deletion of elements are done at only one endwhich is known as the top of the stack queue is first-infirst-out (fifodata structure in which the element that is inserted first is the first to be taken out the elements in queue are added at one end called the rear and removed from the other end called the front tree is non-linear data structure which consists of collection of nodes arranged in hierarchical tree structure the simplest form of tree is binary tree binary tree consists of root node and left and right subtreeswhere both sub-trees are also binary trees graph is often viewed as generalization of the tree structurewhere instead of purely parent-to-child relationship between tree nodesany kind of complex relationships can exist between the nodes an abstract data type (adtis the way we look at data structurefocusing on what it does and ignoring how it does its job an algorithm is basically set of instructions that solve problem the time complexity of an algorithm is basically the running time of the program as function of the input size the space complexity of an algorithm is the amount of computer memory required during the program execution as function of the input size the worst-case running time of an algorithm is an upper bound on the running time for any input the average-case running time specifies the expected behaviour of the algorithm when the input is randomly drawn from given distribution amortized analysis guarantees the average performance of each operation in the worst case the efficiency of an algorithm is expressed in terms of the number of elements that has to be processed and the type of the loop that is being used exercises review questions explain the features of good program define the termsdatafilerecordand primary key