Data structure and its types - The scheme of organizing related information is known as ‘data structure’. The types of data structure are:.....
|
Linear and non linear data structure - An array is a set of homogeneous elements. Every element is referred by an index........
|
Array and types of array operations - An array is a set of homogeneous elements. Every element is referred by an index......
|
A matrix is a representation of certain rows and columns, to persist homogeneous data. It can also be called as double-dimensioned array......
|
Algorithm: A step by step process to get the solution for a well defined problem.......
|
Iterative algorithm - The process of attempting for solving a problem which finds successive approximations for solution, starting from an initial guess.......
|
Recursive algorithm - Recursive algorithm is a method of simplification that divides the problem into sub-problems of the same nature......
|
Huffman algorithm - In Huffman Algorithm, a set of nodes assigned with values if fed to the algorithm........
|
Quick sort and merge sort algorithms - Quick sort employs the ‘divide and conquer’ concept by dividing the list of elements into two sub elements.......
|
Bubble Sort and Quick sort - Bubble Sort: The simplest sorting algorithm. It involves the sorting the list in a repetitive fashion.......
|
Stack and a Queue - Stack – Represents the collection of elements in Last In First Out order.......
|
Stack as a pointer - A stack is represented as a pointer. The reason is that, it has a head pointer which points to the top of the stack........
|
Recursion - Recursion is an approach in which a function calls itself with an argument......
|
Insert different type of elements in a stack - Different elements can be inserted into a stack. This is possible by implementing union / structure data type.......
|
Linked list - A linked list is a dynamic data structure. It consists of a sequence of data elements and a reference to the next record in the sequence.......
|
Types of linked lists - The types of linked lists are: Singly linked list: It has only head part and corresponding references to the next nodes.......
|
Sort a linked list - Step 1: Compare the current node in the unsorted list with every element in the rest of the list....
|
Sequential search - Sequential search: Searching an element in an array, the search starts from the first element till the last element.......
|
Binary searching and Fibonacci search - Binary Search: Binary search is the process of locating an element in a sorted list. The search starts by dividing the list into two parts........
|