Hashing is an approach to searching, which calculates the position of the key in the table based on the value of the key.It is an efficient technique in which key is placed in direct accessible address for rapid search.When the key is known, the position in the table can be accessed directly, without making any […]
Continue ReadingSorting refers to the operation or technique of arranging and rearranging sets of data in some specific order. A collection of records called a list where every record has one or more fields. The fields which contain a unique value for each record is termed as the key field. For example, a phone number directory can […]
Continue ReadingOld Syllabus Question paper Solution Question paper SYLLABUS YEAR2023 Syllabus Here Detailed Notes Unit 1 Unit 2 Unit 3 Unit 4 Unit 5 Unit 6 Unit 7 Unit 8
Continue ReadingWhat Is Linked List? (2002 , 2007,2011) Linked list is one in which all nodes are linked together .Each node contains two parts. Data contains elements . Next/Link contains address of next node . Structure of singly linked list The head always points to the first node . All nodes are connected to each other […]
Continue ReadingAsymptotic Notations Asymptotic notation is useful describe the running time of the algorithm. Asymptotic notations give time complexity as “fastest possible”, “slowest possible” or “average time”. Asymptotic notation is useful because it allows us to concentrate on the main factor determining a functions growth. Following are commonly used asymptotic notations used in calculating running time […]
Continue ReadingUni-1 Complexity analysis What is Big Oh(o) notation? 2007. 2009 When is approximation algorithm used as problem solving approach? 2011 Arrange the following expressions by their growth rate from slowest to fastest. Logn,logn2,n!,n5 2014 What is data structure? What is average case complexity of algorithm? Unit-2 Linked List What do you mean by linked list? […]
Continue Reading> Copy and paste this code on your site.
Continue Reading