Updated Airtel USSD Codes

-

Airtel USSD Codes


USSD stands for Unstructured Supplementary Service Data which can also be termed as Quick Codes or Feature Codes. In order to contact or query regarding your mobile, you need to ask the system that was being maintained by your network.

These USSD codes act as the query processors between the mobile and operator system. Though there are many USSD codes that help us to communicate with the operators' system,here is a list of few USSD codes of Airtel network that may help you...

USSD Code It's action
121 Airtel Customer Care Number
198 Airtel Complaint Number
*123# Airtel Balance Check
*123*10# or *123*# Check for Free 2G Data Balance
*123*11# Check for 3G Data Balance
*121*8# Check for Airtel 4G Balance
*123*197# Airtel Night Data Balance
*123*2# or *555# Check for Local SMS Balance
1909 DND Activation/Deactivation
*141*10# or 52141 Airtel Loan Number
*121# My Airtel, My Offer
*121*4# Airtel Value Added Services
*121*7# To Check Last 5 Transactions and also Value Added Services.
*123*1# Check for Airtel to Airtel Mins Balance
*123*6# Local Airtel to Airtel Night Minutes Balance
*123*7# Check for Free Local, STD SMS Balance
*123*8# Check for Free STD Minutes Balance
*141# Airtel Talk time Gift Service [Share or Ask Talk time ]
SMS 3G to 121 Airtel 3g activation USSD code
*222# Special 5 Offers
*321# Airtel Live Services
*325# Free Facebook Access [Rs. 1 per day ]
*515# Twitter Service
*566# Airtel Special Offers and Rewards
*567# GPRS(Activation/Deactivation)
*678# Hello Tunes Menu
*888# Missed Call Alert
*777# Local National SMS Packs
*282# Know Your own Airtel number
*141*10# Airtel loan code
SMS PORT to 1909 Mobile number portability
SMS START to 121 Start any service
SMS STOP to 121 Stop any service
SMS Data USE to 121 Check 2G/3G balance
SMS UNB to 121 Check unbilled amount
SMS OT to 121 Outstanding amount
SMS BP to 121 Current bill plan
SMS BILL to 121 Bill summary
SMS PAY to 121 Last 3 bill payment details
543217 Contests

Comments

Post a Comment

Popular

Traversal In A Binary Tree - Tree -3

-
Image
Traversal In Binary Tree Traversing a binary tree means visiting each node of the tree exactly once. At each node : N : Visit the node L : Traverse its left subtree R : Traverse its right subtree These actions can be performed in any order... (3! = 6 different ways of ordering the three tasks.) Different orders: NRL NLR LNR LRN RNL RLN But we follow the convention which states left subtree to be traversed before right sub tree. Thus we are left with three orders: NLR , LNR and LRN The orders are named according the position of the node i.e., position of N in the order. pre : NLR in  : LNR post : LRN PRE ORDER TRAVERSAL: ( NLR ) N : Visit the node L : Traverse the left subtree R : Traverse the right subtree IN ORDER TRAVERSAL: ( LNR ) L : Traverse the left subtree N : Visit the node R : Traverse the right subtree ...
Read more

Pre Order Traversal In Binary Tree

-
Image
Pre Order Traversal In Binary Tree Its NLR ordered traversal. The order goes this way: N: visit the node L: Traverse the left sub tree. R: Traverse the right sub tree. Lets check with an example. Consider the following example. Visit the node 1 Traverse the left sub tree of node 1 Visit the node 2 Traverse the left sub tree of node 2 Visit the node 4 Traverse the right sub tree of node 2 Visit the node 5 Traverse the right sub tree of node 1 Visit the node 3 Traverse the left subtree of node 3 Visit the node 6 Traverse the right sub tree of node 3 Visit the node 7 On completing the traversal we get the pre order if we follow the bolded nodes. Pre Order: 1 , 2 , 4 , 5 , 3 , 6 , 7
Read more

Tree data structure - 2

-
Image
Trees - 2 Types: Strictly binary tree: Degree is every node either 0 or 2. Full Binary tree: Degree of every node is 2. Complete Binary Tree:A binary tree in which every level , exccept possibly the last , is completely filled and all nodes are as far left as possible. Array Representation of binary tree: Also called as sequential representation or linear representation We use 1D array Store the data with indexed 1 i.e., root node at Array[1](Even we can use 0 based index ) If a node is at index k in the array, its left child is at index 2k and right child at index 2k+1. If a node at index k then its parent is at index floor(k/2) The size of array needed to store a tree of height h is 2 h -1 Linked list representation : struct node { struct node *left; struct node *right; int data; } This structure can be used for the binary tree. Self referential structure where first and second...
Read more