Hashing is the process of mapping large amount of data item to smaller table with the help of hashing function(A fixed process converts a key to a hash key is known as a hash function).Hashing is also known as Hashing algorithm or message digest function.It is a technique to convert a range of key values into a range of indexes of an array.It is used to facilitate the next level searching method when compared with the linear or binary search.Hashing allows to update and retrieve any data entry in a constant time O(1).Constant time O(1) means the operation does not depend on the size of the data.Hasing is used with database to enable items to be retrieved more quickly.It is used in the encryption and decryption of digital signatures.

Matrix is a way to store data in an organized form in the form of rows and columns.Mtrices are usually used in computer graphics to project 3 dimensional space onto a 2 dimensional screen.Matrices in the form of arrays are used to store data in an organized form.A matrix is a representation of certain rows and columns,to persist homogeneous data.It can also be called as double dimensioned array.The uses of matrix are to represent class hierarchy using Boolean square matrix,for data encryption and decryption,To represent traffic flow and plumbing in a network,to implement graph theory of node representation.

A Graph is a non-linear data structure consisting of nodes and edges. The nodes are sometimes also referred to as vertices and the edges are lines or arcs that connect any two nodes in the graph.Graphs are used to solve many real-life problems. Graphs are used to represent networks. The networks may include paths in a city or telephone network or circuit network. Graphs are also used in social networks like linkedIn, Facebook. For example, in Facebook, each person is represented with a vertex(or node). Each node is a structure and contains information like person id, name, gender, locale etc.

In computer science, a tree is a widely used abstract data type that simulates a hierarchical tree structure, with a root value and subtrees of children with a parent node, represented as a set of linked nodes. A tree data structure can be defined recursively as a collection of nodes (starting at a root node), where each node is a data structure consisting of a value, together with a list of references to nodes (the "children"), with the constraints that no reference is duplicated, and none points to the root. Alternatively, a tree can be defined abstractly as a whole (globally) as an ordered tree, with a value assigned to each node. Both these perspectives are useful: while a tree can be analyzed mathematically as a whole, when actually represented as a data structure it is usually represented and worked with separately by node (rather than as a set of nodes and an adjacency list of edges between nodes, as one may represent a digraph, for instance). For example, looking at a tree as a whole, one can talk about "the parent node" of a given node, but in general, as a data structure, a given node only contains the list of its children but does not contain a reference to its parent (if any).

A heap is a tree-based data structure in which all the nodes of the tree are in a specific order.

For example, if X is the parent node of Y, then the value of X follows a specific order with respect to the value of Y and the same order will be followed across the tree. The maximum number of children of a node in a heap depends on the type of heap. However, in the more commonly-used heap type, there are at most 2 children of a node and it's known as a Binary heap. In binary heap, if the heap is a complete binary tree with N nodes, then it has smallest possible height which is log N to the base of 2.

Heaps can be of 2 types:

Max-Heap: In a Max-Heap the key present at the root node must be greatest among the keys present at all of it’s children. The same property must be recursively true for all sub-trees in that Binary Tree. Min-Heap: In a Min-Heap the key present at the root node must be minimum among the keys present at all of it’s children. The same property must be recursively true for all sub-trees in that Binary Tree.

A list is an ordered data structure with elements seprated by a comma and enclosed within square brackets.

For example:List 1 and List 2 here contains a single type of data:

List 1=[2,3,4,5,6]

List 2=['Python','is','Awesome']

Here,list 1 has integers while list 2 has strings.Lists can also store mixed data types as shown in lost 3

List 3=[1,'Python',2,'is',3'Awesome']

Hi,

A list in computer is an ordered data structure with a number of elements that are separated by a comma and are enclosed within square brackets .  For example, list1 and list2 below contains a single type of data. Here, list1 has integers while list2 has strings. Lists can also store mixed data types as shown in the list3 here.

List 1- [1,2,3,4,5]

List 2- [ 'Python', 'Java', 'C++']

List 3- [1, 'Python', 2, 'Java', 3]

I hope this helps,

All the best

A Queue is a linear structure which follows a particular order in which the operations are performed. The order is First In First Out (FIFO). An example of a queue is any queue of consumers for a resource where the consumer that came first is served first. The difference between stacks and queues is in removing. In a stack we remove the item the most recently added; in a queue, we remove the item the least recently added.

Dear,

Understanding of data structures is very important. Stacks, Queues, Linked Lists, Graphs are various Data Structures. Stack is kind of data structure which follows LIFO concept. LIFO basically means Last In First Out which means that the element that is added last into the stack will be popped out first. The elements are added from the beginning and deleted from the same end. A pile of books, a stack of dinner plates, a box of pringles potato chips can all be thought of examples of stacks. The basic operating principle is that last item you put in is first item you can take out. That is, that a stack is a Last In First Out (LIFO) structure.

Hope this helps!

Hi aspirants

If you have studied maths in your 12th as a complusory subjects, then you are eligible. It doesn't matters whether you studied maths in graduation or not. In 12th you must have studied maths in order to write NIMCET

The basic NIMCET eligibility criteria requires Indian candidates to be graduates in Science/ IT/ CA/ Technology or Engineering, with at least 60% marks or 6.5 CGPA.

For more information click the link

https://it.careers360.com/articles/nimcet-eligibility-criteria

Hope this Helps

Good Luck!