Android Phone Secret Codes

Dialing the code

Here in this post, I am listing down some secret codes for Android phones.

*#*#4636#*#*   :Phone info (packet data), batttery info,usage statistics,wifi info

*#*#7780#*#*  :Factory reset

*2767*3855#   :Format Phone

*#*#197328640#*#*  :Service mode (version info,Factory test,and many debugs)

Sony Xperia Secret Menu for Service Test and Hard Reset

In Xperia series phones of Sony, there is a secret menu which has options for Service test and Hard reset of the phone. This menu is available almost all Xperia phones including Xperia Z, Xperia J, Xperia P, Xperia U, Xperia ION, Xperia S,Xperia E, Xperia L, Xperia tipo, Xperia arc, Xperia zola The menu can be made available by dialing a secret code in the dial-pad of the phone.

Dial pad of Sony Xperia P

The code is *#*#7378423#*#*. When you dial this code in the dialpad, the secret menu will appear which contains options:

1. Service Info
2. Service Settings
3. Service Tests
4. Customisation Settings

How to Display Mathematical Symblos, Greek Letters etc in HTML

When i was writing a post, i found it difficult to display some mathematical symbols in the post. At last, i solved it and found that there are easy to remember mnemonics for most of the symbols we come across. Sometimes you can get them only from the 'charmap' (enter charmap in 'Run' in your windows OS). There are escape sequences in HTML which will help you to include mathematical symbols and other Greek letters which are often used as variables or notation for some processes. To display these symbols in a webpage, simple mnemonics or corresponding code can be used. These informations are directly available in HTML4.0 website.

C and C++ Programs to Reverse a Number

This post includes a C program and a C++ program to reverse a given number. That is, to reverse the order of digits. If 543 is entered, it will be displayed as 345.

C Program:

#include<stdio.h>
main()
{

Conditional Operator in C and C++

Conditional Operator is an operator which is substitutive for if-else statements. It is a ternary operator (operator which operates on 3 operands). It is often called ?: operator. The operands are expression1, expression2 and expression3. The syntax is as follows:

expression1 ? expression2 : expression3

The expression expression1  will be evaluated always. Execution of expression2 and expression3 depends on the outcome of expression1. expression1 is checked whether true or not. It is considered like a boolean variable. The outcome of an expression is true if it has a non zero value. If its value is zero, the outcome of expression is false. If the expression1 is true, then expression2 is evaluated. If the expression1 is false, then expression3 is evaluated. Consider the following example:

Mathematics Capsule for Engineering Entrance Exams in India

In this post, i am adding a mathematics capsule for entrance exams for engineering in India. This capsule is based on Higher secondary syllabus and contains Formulae, shortcut equations, tips and tricks that may be helpful for solving objective questions from mathematics.
I hope this pdf will be helpful for those students who are preparing for competitive entrance exams like KEAM, AIEEE, IIT JEE etc.
Click the following link to download the capsule as pdf.
Download

Ebay Promo Codes or E-coupons

This post contains insta Coupons for online purchasing from ebay.in. They are also called e-coupons, promo codes,.discount coupons etc. I am listing each.

EBAY3WATCH to get Rs. 1000 off on premium watches.

To get 7% off:

JPDXN8PEFI
4BQE54TNRW
RIJQVJHEJF
BAVCVXVZWW
HVFKSSU1HL
QF5NDOHMNK
COHBMJ2HM4

When you proceed to buy any product from Ebay.in you can see a field to enter a code like this. Enter any of above code there to get discounts as mentioned above.

Binary Tree And Prefix & Postfix Notations Of Arithmetic Expressions

We can construct meaningful derivation trees that enable us to represent arithmetic expressions in infix, prefix and postfix forms. A binary tree is enough to represent all these three notations of arithmetic expressions. Both prefix and postfix notations are unintelligable for humans. But they are of great use in computer science. Compilers often convert infix to prefix notation and then to assembler code. From a derivation tree of an algebraic expression, we can get equivalent prefix and postfix notations. An algebraic expression in terms of operators and operands can be derived by an ambiguous context-free grammar. Prefix notation is the parenthesis-free notational scheme invented by Polish logician Jan Lukasiewicz and is often called polish notation. In prefix notation operators are followed by operands.

For example, in prefix notation A + B is written as +AB. Postfix notation is reverse of prefix notation. AB+ is  the equivalent postfix notation of A + B. The infix form is evaluated and the binary tree is created according to the priority of the operators. Let us start from the simplest examples.

Fourier Series Textbook

A textbook for chapter ( Module ) Fourier series. Fourier Series  is included in Mathematics Syllabus for Bachelor Degrees including BTech (Engineering) in most universities. Download pdf BTech maths text for MG University on Fourier series
Download here