Polish Notation

In polish notation, the operator is placed before the operands. Polish notation has types called Infix, Postfix, and Prefix notation. Infix Notation: In this notation, the operator symbol is placed between its two operands. For example, to add A to B we can write as A + B, to subtract D from C we write […]

Mathematical Notation in Data Structure

Mathematical Notation in Data Structure – First of all we will consider various types of notations for writing mathematical expressions. there is the following set of operations. Symbol Used Operation Performed Precedence ^ (Exponention) Power Highest * (Asterisk) Multiplication Next Highest / (Slash) Division Next Highest + (Plus) Addition Lowest – (Hyphen) Subtraction Lowest Note […]

Operations on Stack

Operations on stacks: The following operations are performed on stacks. Creating an empty stack PUSH (STACK. ITEM) – to push element ITEM onto stack STACK POP (STACK) to access and remove the top element of the stack STACK PEEK (STACK) to access the top element of the stack STACK without removing the top element from […]

Selection Sorting Algorithm

Selection Sorting Algorithm: The selection sort starts from the first element and searches the entire list until it finds the minimum value. The sort places the minimum value in the first place, selects the second element, and searches for the second smallest element. The process continues until the complete list is sorted. A selection sort […]

Matrix in Programming

Two-dimensional array(Marix) – A two-dimensional array is a list of finite numbers m*n homogeneous data elements such that the element of the array is referenced by two index sets consisting of m and n consecutive integer numbers. the elements of the array are stored in consecutive The size of two – a dimensional array is […]

Arrays in Data Structure

An array is a list of a finite number of homogenous data elements (i.e. data elements of the same type) Arrays can be classified as One – dimensional array or linear array that requires only one index to access an individual element of the array. Two – dimensional arrays require two indices to access an individual […]

What is Data Structure

Data: – The term data simply refers to a value or a set of values These values may represent some observation from an experiment, some figures collected during some survey ( such as census, exit polls, etc. ), or marks obtained by a student in an examination, etc. Data Item: – A data item refers […]

Queue in Data Structure

The queue is a linear list in which we can insert data from one end and delete data from another end. let’s understand it with a simple example, let’s say we have a line of people at the shop waiting for their turn at the counter. so the person who enters first in the line […]

Stack in Data Structure

A stack is a linear list where insertion and deletion can perform only at one end. and the end where we perform the operation is called the top of the stack. It uses Last-In-First-Out (LIFO) functionality means the item that inserts last will out first. In the technical form insertion operation in the stack is […]

Sorting Techniques in data structure

Sorting is a technique for arranging a set of data in some order like ascending or descending. we have different types of methods to apply to sort in ascending or descending order. and these methods are divided into two categories. Internal Sorting If we have enough memory so that the data that we want to […]