Airtel Mobile Cell Customer Care Numbers

-

Airtel Mobile Cell Customer Care Numbers



Toll free query no. from Airtel mobile:    121
Toll free service request no. from Airtel mobile:  198
SMS no. to send SERVICE START sms:      122
Email id for customer care:     121@in.airtel.com



All India Airtel Prepaid/Postpaid customer care numbers
SNo. Circle Post Paid Customer care no. from non Airtel phone Prepaid Paid Customer care no. from non Airtel phone
1 Andhra Pradesh 9849012345 9849098490
2 Assam 9954012345 9954099540
3 Bihar & Jharkhand 9934012345 9934099340
4 Chennai 9840012345 9840198401
5 Delhi 9810012345 9810198101
6 Gujarat 9898012345 9898098980
7 Haryana 9896012345 9896098960
8 Himachal Pradesh 9816012345 9816098160
9 Karnataka 9845012345 9845098450
10 Kerala 9895012345 9895198951
11 Kolkata 9831012345 9831098310
12 MP & Chattisgarh 9893012345 9893098930
13 Maharashtra & Goa 9890012345 9890098900
14 Mumbai 9892012345 9892098920
15 North East 9862012345 9862098620
16 Orissa 9937012345 9937099370
17 Punjab 9815012345 9815098150
18 Rajasthan 9829012345 9950099500
19 Tamil Nadu 9894012345 9894198941
20 UP East 9935012345 9935199351
21 UP(West) & Uttarakhand 9897012345 9897098970
22 West Bengal 9933012345 9933099330

Website: AIRTEL

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