Skip to main content

if control statement - Basic Programming Concepts With psudo Code

if( )

 is a control statement. it based on some condition. if the condition can true the block of statements can execute other wise skip the statements.




syntax

 if([condition])
{
//statement;
}

example1,

 #include<stdio.h>
#include<conio.h>
main()
int num=1;
{
if(num==1)
{
printf("\n its true");
}
}
from the above program we can declare the variable named as num and assign the value as 1. then, check the value 1 equal value of num through if statement.the statement can true.so, the block of statements can executed.

example2,

 #include<stdio.h>
#include<conio.h>
main()
int num=5;
{
if(num==1)
{
printf("\n its true");
}
}

suppose the value of num is 5.the block of if statement can skip to execution.

Comments

Popular posts from this blog

Class is a collection of similar objects. Which have common properties

Class is a collection of similar objects. Which have common properties. Syntax class class_name {        //member functions and variables. } How to create a objects for class class_name c=new class_name; We can access the member variable and member methods using dot operator. c.member_function(); Eg : class bike { void fun() { System.out.println("member method"); } public static void main(String[] args) { bike B=new bike(); B.fun(); } } output member method

Linked List - Data Structure Basic With Example Java

//linked list /*     Linked List is a Linear Data Structure.      Drawback of Array Is continues Block Of Memory. Linked Is Used To Allocate the Different Memory Location. Each node Contains Data And Pointer. Header Is Used To Denote The First Node Of Linked List. Tail Is Used To Denote the Last Node of The Linked List. 1.Singly Linked List Each Node as Data And pointer To The Next Node. [ data(header) | pointer of next]->[ data | pointer of next]->[ data | pointer of next]->[ data | null]; 2.doubly Linked List Each Node as Data And pointer To The Next Node and prev Node. [ data(header) | pointer of next]<->[pointer to prev|data | pointer of next]<->[pointer to prev|data | pointer of next]<->[pointer to prev|data | null]; 3.Circle Linked List [ data(header) | pointer of next]->[ data | pointer of next]->[ data | pointer of next]->[ data | null]-->header */ class...