Dear,

A heap is a complete binary tree, and the binary tree is a tree in which the node can have utmost two children. Before knowing more about the heap data structure, you should know about the complete binary tree. A complete binary tree is a binary tree in which

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

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 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

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

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

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

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

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

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