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

History of C language

Image
History of C language C Language history is very interesting which knowing it C programming language was developed by Dennis Ritchie at bell laboraties of AT and T(American Telephone & Telegraphi), which located at the U.S.A.     Dennis Richie is know as the founder of C language . It was developed to overcome the problem which were facing in previous language such as B,BCPL,etc.,     Initially ,c language was developed to be used in UNIX operating system . Later on it inherits many features of previous language such as B and BCPL. Year        programe               Introduced by 1960   ALGOL60 (Algorithmic language) international committee 1963 CPL(combined  programing language) Cambridge university 1967 BCPL(basic combined programing language Cambridge university(Martin Richard) 1970 B language  Kenthompson 1972 C language  Deniel ...
Read more

Notations For Arthmatic Expression

  Polish notation (or) prefix notation and expressions Converse Polish notation are also known as a prefix notation is defined as in this notation system operator is written before the operands, Example of polish and notations or prefix notations is +AB or /CD.    Based on the operator position ,expressions are divided into three types . They are as follows. Infix expression  Postfix expressions  Prefix expression Infix expression In infix expression ,operators is used in between operands. The general structure of an infix expression is as follows . Operand1 operator Operand2 >>Operators are written in between their operations . >>This is used in our common mathematical expression .   The operators forward of evolution are preformed from left to right and it obeys precedence rules i.e multiplication and division are performed before addition and subtraction.  >>Bracket can be used to change the order of evolution . Ex :- a)A + B b)x*(...
Read more