Skip to main content

Introduction to C

About C:-


  • C is a high-level language .
  • It was initially first developed by Dennis Ritchie in 1972.
  • It was developed to overcome the limitation of previous language such as B,BCPL etc.
  • It was developed for Unix operating System
  • It inherits many features of previous language



Features/Advantage:-

  • Simple :- because it provide data types, library function etc.
  • Machine Independent or Portable:- because it can be executed on different machine
  • Procedural language:- Instruction in c program are executed step by step

  • Structured programming language:- break the problem into parts
  • It provide dynamic memory allocation , pointers etc.
  • Speed:-It is faster than another programming language like java, python etc.

Disadvantage of C:-

  • It does not support oops concept in which inheritance, polymorphism, encapsulation etc. come.
  • It does not support namespace concept
  • It does not support constructor and destructor
  • There is lack of exception handling
  • low level of abstraction

Software using for C programming:- turbo c,dev c, code blocks, etc.




Comments

  1. please wait i provide you many programming languages such as c,c++,python,java,html,css,
    javascript,datastructure,django etc.

    ReplyDelete

Post a Comment

Popular Posts

Type casting

type casting or type conversion  allows us to convert one data types into another.for type casting cast operator is required. Syntax:--      (type)expression or value; Example:       int f =9/4; //without type casting       o/p=2       float f=(float)9/4;  //with type casting       o/p=2.3 Type conversion are of two types: 1)Implicit Type Conversion:-  it is also known as automatic type conversion.When the type conversion is performed automatically by the compiler,such type of conversion is known as implicit type conversion. 2)Explicit Type Conversion:-  the type conversion performed by the programmer is known as explicit type conversion.which is done by cast operator as above mentioned.

Recursion--

Definition:- when a function call itself is called recursion. note:- the problem which is solved by recursion is also solved by loops, but it is not necessary the problem solved by loops is also solved by recursion.  Example:- Explanation:- 1) a fun function declared which takes argument and return value 2) main starts fun is called by passing 3 value 3)after calling fun definition starts, where check if a==1 no because a is 3, s=a+fun(a-1) means s=3+fun(2)  from here fun function is again called now this body again execute now a is 2, so s=3+fun(2), fun(2) is replaced by 2+fun(2-1=1) i.e s=3+2+fun(1) again fun function is called... overall s=3+2+1=6, s is return this return value goes where fun function is called , where return value is stored in k, so k=6 now print is 6.