PROGRAMMING METHODOLOGY

AND
DATA STRUCTURES

NOTES

BCA 1ST YEAR

UDAYBHAN YADAV

MOBILE NUMBER - 7415992941

M nnmlll,m
DATA STRUCTURE
CU
INPUT ALU OUTPUT
DEVICE MEMORY DEVICE

INPUT AND OUTPUT DEVICE NAME

INPUT DEVICE OUTPUT DEVICE
1.MOUSE MONITAR
2.KEYBORD PROJECTER
3.MIC SPEAKER
4.JOYSTIC PRINTER
5.SCANER HEADPHONE
6.QR CODE GPS SYSTEM
SCANER
7.LIGHT PEN
8.USB
 1.
C++ PROGRAM
#include<iostream>
2.
3. Int main() {std :: cout <<”name = xyz\n”;
4. std :: cout <<”father name = xyz\n”;
5. std :: cout <<”mother name = xyz\n”;
6. std :: cout <<”class = bca 1 year\n’;
7. std :: cout <<”address = xyz\n”;
8. std :: cout <<”age = xyz\n”;
9. std :: cout <<”mobile no = xxxxxx2941\n”;}

OUTPUT
Name = xyz
Father name = xyz
Class = bca 1 year
Address = xyz
Age = xyz
Mobile no = xxxxxxxx2941

TO CALCULATE TAMPRATURE CENTIGRATE TO FARENHIGHT

 1. #include <iosteam>
2.
3. Int main()
4. {int C,F;
5. Cout<<”entar the value of c “;
6. Cin>>c;
7. f={c*(9/5)+32};
8. cout<<”the answer is “<<f;}

Write a program number print 1 to 100

1.#include<iostream>
2.
3.int main() {
4. for (int i=1 ; i<100;i++);
5. {std :: cout<<std::endl;}}

WRITE A PROGRAM TO GANRATE THE TABLE OF 2

1.#include<iostream>
2.
3.int main(){
4.int n = 10; //table ke liye kitne number chahiye
5.std::cout<<”2 ke table ka output hai”<<std::endl;
6.for(int I = 1 ; i<n ; i++){
7.std::cout<<”2*”<<”<<2*i<<std::endl:
8.}}

WRITE A PROGRAM TOGANRATE THE THE TABLE 2 TO 20

1. #include <iostream>
2. Using namespace std;
3.
4. Int main() {
5. Int n = 10;// table ke liye kitne number chahiye
6. For(int I = 2; i< =20; i++) {
7. Cout<<i<<”ke table ka output hai;”<<endl;
8. For(int I = 1 ; i<=n’i++)} {
9. Cout<<i<<”x”<<i<<”=”<<i*i<<endl
10. }
11. Cout<<endl;}}
 TOKEN
The smallest unit in a program are keyword token

① keyword
② identifiers
③ constants
④ string
⑤ oprations

① keyword
The keyword explicitly reserved identifiers can not be used as names for
the program varibalse or other user -defined elements
Asm double new switch
Aouto else operator template
Break enum private this
Case extern protected throw
Catch float public try
Char for rigister typedef
Class friend return union
Const goto short unsigned
continue If signed virtual
Default inline Siz of void
delete int static valatile
do long struct while

②IDENTIFIERS
IDENTIFIERS REFAR TO THE NAMS OF VARIABLES FUNSTION ARRAYS
CLASSES etc. CRETED BY THE PROGREAMAR THEY ARE THE
FUNDAMENTAL REQUIRMENT OF ONELY LANGUGE EACH LANGUAGE
HAS THIS OWN RUELS FOR NAMEING THESE IDENTIFIERS THE
FOLLOWING RULES ARE COMMON TO BOTH C AND C++
 ONELY ALPHABETIC CHARACTERS DIGIT AND UNDER SUORE
ARE PERMITED
 THE NAME CAN NOT START WITH A NUMBERS
 UPPERCASE AND LOWARCASE LETTERS ARE DISTINECT
 A DECLARED KEYWORD CAN NOT BE USED A VARIBLE NAME

③CONSTENT
CONSTENT REFAR TO FIXED VALUES THTAT DO NOT CHANGE DURING
THE EXEUCATION OF A PROGRAM LIKE C AND C++SUPORTS SEVERAL
KINDS OF INTARL CONSTENTS DO NOT HAVE MEMORY LOCATINS

④STRING
A STRING IS A SECUNACE OF THE CHARCTOR
⑤OPRATOR
① >> instruction OPRATOR
② << Exatraction Oprator
③ :: Scope resahtion oprators
④ ::* Paint to donbor destrauctor
⑤ Pointer to member operator
⑥ * Pointer to multiplayar oprator
⑦ delete Memory rlese oprator
⑧ endl Line feed oprator
⑨ siwie Field with oprator
 C++ DATA TYPE

C++ DATA TYPE

DERIVED TYPE
USER DEFINED TYPE
 ARRAY
 STRUCTURE
 FUNSTION
 UNION BUILT IN TYPE  POINTER
 CLASS
 REFRENCE
 ENUMERATION

INTEGEARL TYPE VOID FLOTING TYPE

int char float double

 EVEN AND ODD
#include <iostream>

using namespace std;

int main() {

int num;

cout << "Enter a number: ";

cin >> num;

if (num % 2 == 0) {

cout << num << " is even.";

} else {

cout << num << " is odd.";

return 0;

ALGORITHAM

① A SET OF FINIGHT RELISE OR INTRACTION TO BE FOLLOWED FAILD

AND HAVE OPPRACTION SOME OF THE REYAREA ALGORITHAM ARIAL
USED INCLUDE ……………………………………..
②A PROCESSER FOR SAVING MATHEMATCALY PROBLAMS IN A FINIGHT
NUMBER OF STEP THEY FREQANCY INVOLS RECLASVE OPRATION
 USE OF ALGORITHAM
(1) Science CAMPUTER – ALGORITHAM FOR IN THE BASIC OF
CAMPUTER PROGRAMING AND AREL USED SOLVE PROBALMS
RANGING FOR SIMPLE SORTING AND SACRCHING TO COMPLEX
TASKSUCH AS (A.I.) AND MACHINE LARNING

(2)mathematics – ALGORITHAM ARE USED SOLVE

MATHEMATICS PROBALMS SUCH ALL TAFING THE ORNTIMUL SOLVE TO A
SYSTEM OF LEWAR EQAVATION OR FOLTING SOLVE SHROSEPRECENT IN THE
GRAPH

(3)operation research – ALGORITHM USE THE OCTMIND ARE VALUE THE

DESIGAN IN FILDS SUCH AS PROGRAMAR LOGICAL ON PREPRERATION AND LOCSTION

(4)A.I.- ALGORITHAM ARE THEY FUNDAMENTAL (A.I.) AND MACHINE

LARNING AND ARE USED TO DEVELOP A.I. SYSTEM THEY CAN PARFORM THE
SUCH OR HUMAN RESEARCH AND DESIGN MAKING

(5)data type – ALGORITHM ARE USED TO ANALAYZED PROCESS OUT EXPART

INSIDE FORM LARGE AMOUNT OF DETA IN FILD SUCH AS .MARKETING FINANCE AND
HETHCARE
THEY ARE JUST A FEW EXAMLE OF MANY APPLICATION OF
ALGORITHAM
THEY USED OF THE OVERLY COUNTINEUSILY EXPENDING AS
NEW TECNOLOGY AND FILD OF MARKETING IT A COMPNY OF MODERN
SECURITY
 CHARATESTICS OF ALGORITHAM
(1)well defined unit – IF AN ALGORITHAM STEP TO TAKE INPUT ITS
SHUD BE WELL DEFINED UNIT IT MAY OR MAY NOR TAAAAKE INPUT

(2)WELL SEFINED OUTPUT – THE ALGORITHAM MUST CLERARLY

DEFINED WHAT OUTPUT RODUES AND IT SHUD BE WELL DEFINED AS WELL

(3)FEASIBLE – THE ALGORITHAM MUST BE SIMPLE JANRIC AND PRACTICAL

SUCH THAT IT CAN BE IS CELD WITH THE AVLEBENT RESERCHES

(4) LANGUGE DEFINED – THE ALGORITHAM DESIGN MUST BE

LANGUGE IN PRODUCT THAT CAN INPINDED IS ONELY LANGUGE AND AT THE
OUTPUT WILL BE THE SAME AS EXPECTED

INPUT – AN ALGORITHAM HAS OR MORE INPUTS THAT CAMPARE

FUNDAMENTAL OPRATOR MOST EXPECTED OR MORE INPUTS

OUTPUT – AN ALGORITHAM PROCASESSD AT LIST ONE

OUTPUT EVERY INFROMATION THAT CALVE A FUNDAMENTAL
OPRATOR MUST EXEPECT OR MORE INPUTS
FINITENESS – AN ALGORITHAM MUST TRASMINT CASE EVERY INSTRACTION WICH
COUTEV A FUNDAMENTAL OPRATOR MUST BE TURMINITED WITH AN INFINIT AMOUNT OF
TIME INFITINANTION LEVES OR RECLASUVE FUNSTION WITHOUT BASS COUNTINUES DO NOT
PROCESS FINITENESS
 TYEPS OF ALGORITHAM
① BRUTE FORCE ALGORITHAM
② RECLUSLIVE ALGORITHAM
③ BACK TRACKING ALGORITHAM
④ SACRHING ALGORITHAM
⑤ SORTING ALGORITHAM
⑥ FLASING ALGORITHAM
⑦ DEVID OF CONVARTOR ALGORITHAM
⑧ GREEDY ALGORITHAM
⑨ DYMENIC PROGRAMING ALGORITHAM
⑩ RANDMIGD ALGORITHAM

FLOW CHART
A flow chart is a graphical representation of a process or
system that illustrates the sequence of steps and
decisions needed to complete a task.
Key Components:
(1) 1. Start
(2) 2. Input
(3) 3. Processing
 (4) 4. Decision
(5) 5. Loop
(6) 6. Output
(7) 7. End

FLOE CHART SIMBLE

① TERMINAL\
TARMINATOR
② PROCESS
③ DESIGN
④ DOCUMENT
⑤ INPUT
⑥ STORED DATA
⑦ FLOW ARROW
⑧ PRE DEFINED PROCESS
⑨ ON PAGE CHARTECOTOR
⑩ OF PAGE REPRESENTER
well program are develop to solve release problems life
environment management payroll processing student
admission examination result processing etc .
date and to be used and complex the appairs to analysing
search Complex problems planning for software development
and controlling the development process is told programming
mythology

(1)PROCIRAL PROGRAMMING – problems is broken down into

procedure or flow of code that perform one task is all procedure it is for token and
to gether from the all program it is suitable only for small program that have low
level of complicate

EXAMPLE – for a calculator program that does edition subtraction

multiplication divisions each of these operation can be develop As spylear
procedure in the man program world be invoked on the base of user requirement

(2)OBJECT ORINTED PROGRAMMING – the solution reverse

around inter or object that are the part of problems the solution desks with how
to store data related be the in right how the intavse behave and how they interact
with each other
EXAMPLE – if we have to develop a payroll management system be will have
salary student leave rules etc around with a the solution must be wild

(3)FUNSTION PROGRAMMING – THE PROBALMS IS

BROKENDOWN IN A FASILITY WILL EACH UNIT PARFORM OF HIGH AN IS SELF
STUDY THIS UNIT ARE CONECTED TO GATHER TO FORM THE COMPLATE

EXAMPLE – A PAYROLL PROCESSING CANHAVE FUNSTIONUNIT EMPTY DATA

MENTINANCE BASIC SALLARY CALCULATION GRAPH LEVE PROCESSING \LOAN
REPAYMENT PROCESSING ETC.

(4)LOGICAL PROGRAMMING – THE PROBALMS BROKEN DOWN IN

THE LOGICAL UNIT FUNSTION UNIT

EXAMPLE – A SCHOOL MANAGEMENT SYSTEM USER HAVE BY DEFINED RULS

LIVE CLASS TELICAST TEACHER LIVE ATANDENCE ETC. SO THE SOFTWARE CAN
DEFIND IS UNIT DEPENDING OF USER RULSE IS USER CAN HAVE DEFRENT
INTERFACE PARIMIOUS SOFTWARE DEVELOPAR MAKE CHOICE ON OR A
COMBINANTION OF MORE THAN OF THESE MATHOLOGY TODEVELOP A
SOFTWARE THE DEVELOPARS USE ANY OF THE FOLLOWING TO APROOVATE
①TOP-DOWN
②BATOM – UP
FUNSTION IN C++
A FUNSTION IS SET OF STATEMENT COMPROMISED AND PRODUCES OUTPUT THE
IDEA IS TO PUT SOME COMPNY AND REPELTLY DONE TASK TO GATHER TO MAKE A
FUNSTION SO THAT INPUT OF RIGHTING THE SAME CODE AGEN FOR DIFIRENT
INPUTS WE CANE CLOVE THIS FUNSTION IN SIMPLE TASK A FUNSTION IS A BLOCK
OF CORE THAT RUIES ONELY WHICH IT IS CODE

Function name parameetar name

Int GFG (int num1 , int num2);

Return type

Int add (int x, int y)

Int main()
{intc;
C = x+y;
Cout<<” addistion of function “ <<c;}
 CALL BY VALUE
A FUNSTION CALL MAKENIZAM THAT PROCESS ARGUMENT TO A FUNSTION BY
PROCESSING A COPY OF THE VALUE OF THE ARGUMENT

CALL BY REFERNCE
A FUNSTION CALL MOST THAT PROCESS ARGUMENT TO FUNSTION BY
PROCESSING THE ADDRESS OF THE ARGUMENT

EXAMPLE – INPUT

#include <iostream>
using namespace std;

int main()
{
int a = 10, b = 20, temp;

cout << "Before swapping" << endl;

cout << "a = " << a << ", b = " << b << endl;

temp = a;
a = b;
b = temp;

cout << "After swapping" << endl;

cout << "a = " << a << ", b = " << b << endl;
 return 0;
}

OUTPUT

Before swapping
a = 10, b = 20
After swapping
a = 20, b = 10

INLINE FUNSTION
AS INLINE FUNSTION IS A FUNSTION THAT IS EXPENDED INLINE WELL IT IS
INVOKED THAT IS THE COMPILAR REPLACE THE FUNSTION CODE WITH THE
CROSHPONDING FUNSTION CODE

INLINE FUNSTION CODE

{function body }

Example – inline double code (double y )

{return (y*y*y);}

DIFALT FUNSTION
IF FUNSTION A SIGN A DEFALT VALUE BE THE PARAMEETAR WHICH DOSE NOT
HAVE MACHING ARGUMENT IN THE FUNSTION CALL . CALL A FUNSTION
WITHOUT EXPONDING ALL ITS ARGUMENT
DEFALT VALUE ARE SEQURELY

EXAMPLE – flot amount (flot,principal,int,time,flot,rate = 0.15)

RECALSUVE FUNSTION
RECALSUVE IS A SUCH FUNSTION WARE A FUNSTION CALL IT SELL ON OF THE
STATEMENT IN THE FUNSTION DIFINANTION MAKES A CALL TO THE SAME
FUNSTION IN WHICH IT IS PRESENT IT MAY SOUND LIKE AND INFINIGHT LOOPING
CONDISTIONS BUT JUST AS A LOOP HAS A CONDISTIONS CHEK TO TAKE THE
PROGRAM CANTROL OUT OF THE LOOP

long flot (int n)

{if (n = = 10
Return 1;
CLASS
Return can is flot (n-1);} AND OJECT
{public: , private: , protected:
Int a, b, c;
Flot x, y ;
Add (int , int);
Sub (flot , flot);
};
CLASS – A GROUP OF OBJECT THAT SHARE COMMAN PROPERTIES AND
RELATIONSHIP IN C++ A CLASS IS NEW DETA TYPE THAT COULAM MEMBER
VARIABLES AND MEMBER FUNSTION THAT OPRATE ON THE VARIBALES .A CLASS IS
DEFINE WITH THE KEYWORD CLASS THAT FOLLOWS IN AN ABSTRACT OF TYPE
CLASS NAME .THE BODY OF CLASS IS INCLOSE WITH IN BRACKETS AND TERMINATE
BY A SEMI COULAM . THE CLASS BODY CONVARSTION DECELERATION OF VARIBLS
AND FUNSTION . THESE FUNSTION AND VARIBLES ARE CELEBRATE COLD CLASS
MEMBER THEY ARE USEALY UNDER TWO SECT PRIVATE AND PUBLIC .THE
KEYWORD PRIVATE AND PUBLIC ARE KNOW AND VISIBALTY LEVAL . THE CLASS
MEMBER THAT HAVE BOTH DECLIRED AS PRIVATE CAN BE ACESS ONELY FORM
WITH IN THE CLASS OR OTHER HAND. PUBLIC MEMBER CAN BE ACESS FORM OUT
SIDE THE CLASS ALSO THE DETA HIDING IS THE KEY FEATURE OF OBJECT ORINTED
PROGRAMMING THE USE OF KEYWORD PRIVATE IS OPSNATIONAL . BY DEFAULT
THE MEMBER OF CLASS ARE PRIVATE .

Class , class name

{ private ;
Variable declaration;
Function deceleration;
Public :
Variable declaration;
Function deceleration;
};
 OBJECT
OBJECT CAN CRETE NECESSARY MEMORIES SPACOP IN A PROGRAM FOR
THE DECLERESTION OBJECT IS SINGULAR TO THAT OF A VARIABLES OF
ANY BASIC TYPE

Class , class name

{ private ;
Variable declaration;
Function deceleration;
Public :
Variable declaration;
Function deceleration;
} X,Y,Z;