Data Structure

First lesson in DataStructure

Comments

Post a Comment

Popular posts from this blog

Stack

Image
  STACK >> stack is a linear Data Structure . i.e the data elements organised in sequential order like array. >> Stack is a static data structure, i.e it will stare limit elements. >>It is based on array concept. >>Stack is called FILO( first in last out ) i.e that elements which are inserted first displays last (or) LIFO( last in first out )i.e the elements which are inserted last displays first. TERMINOLOGY OF STACK >>Top of stack >>Over flow >>Under flow >>In stack insertion ,deletion will be held at only on end called 'Top' of stack. >>If stack is full, when you call member function push( ),if will display o/pas over flow. >>If stack is empty ,when you call member function pop( ),it will display o/p as under flow Functions of STACK 1.push() 2.pop() 3.show() 4.quit() Push():- It is a Member-function of a stack which is used to insert a new element, into stack . pop ():-It is a Member function, which is used to delet...
Read more

Looping statements

while () Statement:          This executes a block of statements as long as a specified condition is true. Syntax : while(condition) { statement(s); } next_statement; The (condition) may be any valid Java expression. The statement(s) may be either a single or a compound (a block) statement. Execution : When program execution reaches a while statement, the following events occur: The (condition) is evaluated. If (condition) evaluates as false the while statement terminates and execution passes to the first statement following statement(s) that is the next_statement. If (condition) evaluates as true the  statement(s) iside the loop are executed. Then, the execution returns to step number 1. Example : int i=0;  //Initialize loop variable System.out.println("Even numbers\n"); while(i<=10) { System.out.println(i); i+=2; } do..while()  Statement do..while loop is used when you need to run some statements and processes once at least before checking t...
Read more

Infix to postfix converstion

  Infix to Postfix Conversation  Procedure :- 1.Scan the infix string from left to right . 2.Initialise an empty stack  3.If the scanned character is an operand,add to the postfix string . 4.If the scanned character is an operator, and if the stack is empty push the character to stack. 5.Repeat 4 steps till the characters are scanned. 6.After all characters are scanned, we have to add any character that the stock may have to the postfix string . 7.If stock is not empty add Top stack to postfix string and pop the stack. 8.Repeat the steps as long as stack is not empty. Conversation Infix to Postfix Ex:- (a+b)*(c-d) in put out put (a+b)*(c-d) (+b)*(c-d)  b*(c-d) *(c-d) *(-d)  *(-) * Empty -  a a+ ab+ ab+c ab+cd ab+cd- ((ab+)(cd-))
Read more