Data Science
Subject and UNIT: Foundation of Data Science: Unit I: Introduction
Very large amount of data will generate in big data and data science. These data is various types
Definition, Characteristics, Comparison, Benefits, Uses
Subject and UNIT: Foundation of Data Science: Unit I: Introduction
Data is measurable units of information gathered or captured from activity of people, places and things.
Hashing Techniques | Data Structure
Subject and UNIT: Data Structure: Unit V (b): Hashing Techniques
Data Structure: Unit V (b): Hashing Techniques : Important Two marks Questions with Answers
Data Structure
Subject and UNIT: Data Structure: Unit V (b): Hashing Techniques
In compilers to keep track of declared variables.For online spelling checking the hashing functions are used.
Definition, Types, Operations, Algorithm with Example C Programs | Hashing Techniques
Subject and UNIT: Data Structure: Unit V (b): Hashing Techniques
If collisions occur then it should be handled by applying some techniques, such techniques are called collision handling techniques.
Hashing Techniques | Data Structure
Subject and UNIT: Data Structure: Unit V (b): Hashing Techniques
The hash function should be simple to compute.
Types, Function, Operations | Hashing Techniques | Data Structure
Subject and UNIT: Data Structure: Unit V (b): Hashing Techniques
There are various types of hash functions or hash methods which are used to place the elements in hash table.
Hashing Techniques | Data Structure
Subject and UNIT: Data Structure: Unit V (b): Hashing Techniques
Binary heaps are useful data structures for sorting the elements using heapsort method
Basic Concepts, Operations | Data Structure
Subject and UNIT: Data Structure: Unit V (b): Hashing Techniques
Hashing is an effective way to reduce the number of comparisons. Actually hashing deals with the idea of proving the direct address of the record where the record is likely to store.
Searching and Sorting | Data Structure
Subject and UNIT: Data Structure: Unit V (a): Searching and Sorting
Sorting is useful for arranging the data in desired order. After sorting the required element can be located easily.
Example Operations, Algorithm with Example C Programs | Data Structure
Subject and UNIT: Data Structure: Unit V (a): Searching and Sorting
Merge sort is a sorting algorithm in which array is divided repeatedly. The sub arrays are sorted independently and then these subarrays are combined together to form a final sorted list.
Example Operations, Algorithm with Example C Programs | Data Structure
Subject and UNIT: Data Structure: Unit V (a): Searching and Sorting
Radix sort is a sorting technique in which sorting can be done by sorting digit by digit starting from least significant digit to most significant digit.