merit calculator 

here you can calculate your merit that you required when you have to get adimssions

in universaties

source code

in c++ 

#include<iostream>
using namespace std;
class Que
{
public:
     float sum,ag;
float matric,fsc,etest;
float m,f,t;
void get();
void calp();
void show();
};
void Que::get()
{
cout<<"Enter your matric marks: ";
cin>>m;
cout<<"Enter your Fsc marks: ";
cin>>f;
    cout<<"Enter your Enter test  marks: ";
cin>>t;
}
void Que::calp()
{
matric=(m/1050)*1100*0.10;
fsc=(f/1100)*1100*0.40;
etest=(t/1100)*1100*0.50;
sum=matric+fsc+etest;
ag=(sum/1100)*100;
}
void Que::show()
{ cout<<"\nMetric % is:"<<matric;
cout<<"\n";
cout<<"\nFsc % is"<<fsc;
cout<<"\n";
cout<<"\nEntery test % is"<<etest;
cout<<"\n";
cout<<"\nyour Agregate is "<<ag<<"%";
}
int main()
{ cout<<"                                    *:WELCOME TO MERIT CALCULTOR:*"<<endl;
Que obj;
obj.get();
obj.calp();
obj.show();
return 0;
}

software

program to find prefix & postfix
this program will help you to convert infix to both 
*Prefix
*postfix

Even Odd Program using Stack

How to find  Even And Odd NO's Using Stack.?

Example code:

#include<iostream>

using namespace std;

class stack

{    private:

  int A[10],top;

 public:

 public:

   stack()                   //constructor

  {

top=-1;

  }  

 void push()               //fun to push

{

    if(top==10-1)

{  cout<<"Stack is full:";

return;

}

            else{

           int x;

           for( x=0;x<10;x++)

           {cout<<"Enter NO:"<<x+1<<":";

            cin>>A[x];}

            for( x=0;x<10;x++)

            {

             if(A[x]%2==0)

            {

            cout<<"\n even:"<<A[x]<<endl;} 

          else 

           cout<<"odd:"<<A[x];

           }

           

A[top++]=x;

}

}

void pop()              //fun to pop value

{

if(top==-1)

{

cout<<"Stack is Empty:"<<endl;

return;

}

else

{

    A[top--];

cout<<"Stack is deleted:"<<A[10];

}

}

};

int main()

{

int a;

stack s;

start:

cout<<"\n  press 1   press to push: \n 2 to pop:"; 

cin>>a;

switch(a)

{

case 1:

s.push();

goto start;

break;

case 2:

s.pop();

goto start;

break;

default:

cout<<"Thanks:";

}

return 0;

}

Samsung galaxy on 5

NETWORK 

Technology GSM / HSPA / LTE

LAUNCH Announced 2014, February

Status Available. Released 2014, April

BODY 

Dimensions 142 x 72.5 x 8.1 mm (5.59 x 2.85 x 0.32 in)

Weight 145 g (5.11 oz)

SIM Micro-SIM

- IP67 certified - dust and water resistant

- Water resistant up to 1 meter and 30 minutes

DISPLAY 

Type Super AMOLED capacitive touchscreen, 16M colors

Size 5.1 inches (~69.6% screen-to-body ratio)

Resolution 1080 x 1920 pixels (~432 ppi pixel density)

Multitouch Yes

Protection Corning Gorilla Glass 3

- TouchWiz UI

PLATFORM

  OS Android OS, v4.4.2 (KitKat), upgradable to v5.0 (Lollipop)

Chipset Qualcomm MSM8974AC Snapdragon 801

CPU Quad-core 2.5 GHz Krait 400

GPU Adreno 330

MEMORY

Card slot microSD, up to 128 GB

Internal 16/32 GB, 2 GB RAM

CAMERA

  Primary 16 MP, 5312 x 2988 pixels, phase detection autofocus, LED flash, check quality

Features 1/2.6' sensor size, 1.12 µm pixel size, geo-tagging, touch focus, face/smile detection, panorama, HDR

Video 2160p@30fps, 1080p@60fps, 720p@120fps, HDR, dual-video rec., check quality

Secondary 2 MP, 1080p@30fps, dual video call

SOUND

  Alert types Vibration; MP3, WAV ringtones

Loudspeaker Yes

3.5mm jack Yes

COMMS WLAN Wi-Fi

 802.11 a/b/g/n/ac, dual-band, Wi-Fi Direct, hotspot

Bluetooth v4.0, A2DP, EDR, LE, apt-X

GPS Yes, with A-GPS, GLONASS, BDS

NFC Yes

Infrared port Yes

Radio No

USB

microUSB v3.0 (MHL 2.1 TV-out), USB Host

FEATURES

  Sensors Fingerprint, accelerometer, gyro, proximity, compass, barometer, gesture, heart rate

Messaging SMS(threaded view), MMS, Email, Push Mail, IM

Browser HTML5

Java No

- Wireless charging (Qi-enabled) - market dependent

- ANT+ support

- S-Voice natural language commands and dictation

- Air gestures

- Dropbox (50 GB cloud storage)

- Active noise cancellation with dedicated mic

- MP4/DivX/XviD/WMV/H.264 player

- MP3/WAV/WMA/eAAC+/FLAC player

- Photo/video editor

- Document viewer

BATTERY 

Li-Ion 2800 mAh battery

Stand-by Up to 390 h

Talk time Up to 21 h

Music play Up to 67 h

MISC

  Colors Charcoal Black, Copper Gold, Electric Blue, Shimmery White

SAR US 1.20 W/kg (head) 1.58 W/kg (body) 

SAR EU 0.56 W/kg (head) 0.41 W/kg (body) 

Price:

Rs. 46,999
USD $478

Application of Stacks

              Expression Notations

1.Infix Notation

2.Prefix Notation

3.Postfix Notation

Infix Expression

§Infix Expression: The Operators are placed between the Operands

§Example: A + B

§A,B are Operands and  +  is Operator

Postfix Expression

•fix ExpressionPost: The Operator s are  placed after the Operands

•+ is placed after the Operands

•Also Known as Reverse Polish Notation or Suffix notation.

•Postfix notation is another way of writing arithmetic expressions.

•In postfix notation, the operator is written after the two operands.

  infix: 2+5    postfix: 2 5 +

        

Operator Priorities

This is done by assigning operator prio.rities.

^    *   /   +   -

Stack

         

       •A stack is an example of a data structure•A stack is a Last In, First Out (LIFO) data structure•Anything added to the stack goes on the “top” of the stack•Anything removed from the stack is taken from the “top” of the stack•Things are rem oved in the reverse order from that in which they were inserted.

Basic Stack Operations

•Push (Insertion the item)

• Pop  (Remove the item)

•Push

–the operation to place a new item at the top of the stack

•Pop

–the operation to remove the next item from the top of the stack

Example

•Stack size = 6

•Max value of stack top = 5

•Min value of stack top = -1

•First value of stack top = 0

Operation of Stack

•Delete operation

•Add operation

Example code:

#include<iostream>

using namespace std;

class stack

{ private:

int A[10],top;

public:

public:

stack()

{

top=-1;

}

void push(int x)//Addition

{

if(top==10-1)

{cout<<"Stack is full:";

return;}

else{

A[top++]=x;

}

}

void pop()//deletion

{

if(top==-1)

{

cout<<"Stack is Empty:"<<endl;

return;

}

else

{

    A[top--];

cout<<"Stack is deleted:";

}

}

};

int main()

{

int a;

stack s;

start:

cout<<"\n 1 to push: \n 2 to pop:";

cin>>a;

switch(a)

{

case 1:

s.push(a);

goto start;

break;

case 2:

s.pop();

goto start;

break;

default:

cout<<"Thanks:";

}

return 0;

}

nternet Download Manager

Install the latest version of IDMsee us

Turn off any virus guards

Download and Run IDM Universal Web Crack.exe

Click Crack button and wait till it say IDM activated successfully ! (Press the button twice to make sure it worked)

Update IDM Universal Web Crack

Select IDM Installation pathsee us

enjoy!