Professional Documents
Culture Documents
AND MANAGEMENT
GIDA , GORAHKPUR
Presentation on – C language
Presented by – Sonika Gupta
Section – C , Year – 2nd
Roll NO. – 2201200100173
CONTENT
S
• Introduction of C
• Uses of C
• Importance of C
• Historical development of c
• Constants
• variables
• Keywords
• Basic C Program (in /out)
• Array, pointer
• Structure and Union
INTRODUCTION of C
• C is a general-purpose programming language created
by Dennis Ritchie at the Bell Laboratories in 1972.
• It is a very popular language, despite being old. The
main reason for its popularity is because it is a
fundamental language in the field of computer science.
• C is often called a middle level language because it
combines the best element of low level language or
machine level language with high level language .
INTRODUCTION of C
• C is a general-purpose programming language created
by Dennis Ritchie at the Bell Laboratories in 1972.
• It is a very popular language, despite being old. The
main reason for its popularity is because it is a
fundamental language in the field of computer science.
• C is often called a middle level language because it
combines the best element of low level language or
machine level language with high level language .
USES of C
• C language is used to creating computer software.
Software
Types of constants
Primarily , there are three types of constants.
1. Integer constant
2. Real constant
3. Character constant
KEYWORDS
• These are reserved words , whose meaning is already known to the
compiler .
• There are 32 keywords available in C .
BASIC C PROGRAM
#include<stdio.h.
Int main (){
printf (“ hello I am Sonika”);
Return 0 ;
}
ARRAYS
• It is a collection of similar data types stored at contiguous memory
location .
• syntax
int marks [3];
char name [10];
float price [2];
POINTERS
• A pointer is a variable which stores the address of another
variable .
72 87994
Address-87994 Address-87994
STRUCTURE
• A collection of values of different data types.
UNION
• Union has members of different data types, but can hold data of only
one member at a time.
• The total memory allocayed in the union is equal to the maximum size
of the members.