This document provides an overview of problem solving using computers. It discusses the 7 stages of problem solving: 1) problem analysis, 2) algorithm development, 3) flowcharting, 4) coding, 5) compilation and execution, 6) debugging and testing, and 7) documentation. It also covers computer programs, programming languages, and the basic structure of a C program, which typically includes documentation, include libraries, definitions, global declarations, the main function, and subprograms.
This is a brief introductory lecture I conducted on von Neumann Architecture. Von Neumann is a fundamental computer hardware architecture based on the store program concept, designed by John von Neumann.
Introduction to C Programming
Content :
Introduction
-Types of programming language
-Machine Language
-Assembly Language
-High Level Language
Introduction to C programming
-Basic Structure of C Program
-Simple program in C programming
You can get more from our website:
www.programmingcampus.com
This is a brief introductory lecture I conducted on von Neumann Architecture. Von Neumann is a fundamental computer hardware architecture based on the store program concept, designed by John von Neumann.
Introduction to C Programming
Content :
Introduction
-Types of programming language
-Machine Language
-Assembly Language
-High Level Language
Introduction to C programming
-Basic Structure of C Program
-Simple program in C programming
You can get more from our website:
www.programmingcampus.com
To understand algorithm and flowchart, it is better to refer this Slideshare that I have created. I have thoroughly presented the key points that make easy in remembering what algorithm and flowchart is. The slide is really simple and wonderful to use it for a quick reference.
This PPT is for First year engineering student,It covered all about C Programming according to Rajastha Technical University Kota.
flowchart, pseudo code, Programming Languages and Language Translators, Identifiers, Constants, Variables, Basic Data Types, Operators, Expressions, type casting, Input / Output Statement, Scope Rules and Storage classes, Preprocessor and Macro Substitution.
To understand algorithm and flowchart, it is better to refer this Slideshare that I have created. I have thoroughly presented the key points that make easy in remembering what algorithm and flowchart is. The slide is really simple and wonderful to use it for a quick reference.
This PPT is for First year engineering student,It covered all about C Programming according to Rajastha Technical University Kota.
flowchart, pseudo code, Programming Languages and Language Translators, Identifiers, Constants, Variables, Basic Data Types, Operators, Expressions, type casting, Input / Output Statement, Scope Rules and Storage classes, Preprocessor and Macro Substitution.
Before a program can be written, an algorithm has to be created first. An algorithm provides a step by step procedure on how a solution can be derived. It also acts as a blueprint on how a program will start and end, including what process and computations are involved.
C++ programming program design including data structures Ahmad Idrees
The aim of this list of programming languages is to include all notable programming languages in existence, both those in current use and ... Note: This page does not list esoteric programming languages. .... Computer programming portal ...
At the end of this lecture students should be able to;
Define fundamentals of data processing in computer.
Define fundamental terms in computer programming.
Define the phases of program development life cycle.
Define structured program theorem.
a. Concept and Definition
b. Binary Tree
c. Introduction and application
d. Operation
e. Types of Binary Tree
• Complete
• Strictly
• Almost Complete
f. Huffman algorithm
g. Binary Search Tree
• Insertion
• Deletion
• Searching
h. Tree Traversal
• Pre-order traversal
• In-order traversal
• Post-order traversal
Slides at myblog
http://www.ashimlamichhane.com.np/2016/07/tree-slide-for-data-structure-and-algorithm/
Assignments at github
https://github.com/ashim888/dataStructureAndAlgorithm/tree/dev/Assignments/assignment_7
a. Concept and Definition✓
b. Inserting and Deleting nodes ✓
c. Linked implementation of a stack (PUSH/POP) ✓
d. Linked implementation of a queue (Insert/Remove) ✓
e. Circular List
• Stack as a circular list (PUSH/POP) ✓
• Queue as a circular list (Insert/Remove) ✓
f. Doubly Linked List (Insert/Remove) ✓
For more course related material:
https://github.com/ashim888/dataStructureAndAlgorithm/
Personal blog
www.ashimlamichhane.com.np
Queues
a. Concept and Definition
b. Queue as an ADT
c. Implementation of Insert and Delete operation of:
• Linear Queue
• Circular Queue
For More:
https://github.com/ashim888/dataStructureAndAlgorithm
http://www.ashimlamichhane.com.np/
https://github.com/ashim888/dataStructureAndAlgorithm
Stack
Concept and Definition
• Primitive Operations
• Stack as an ADT
• Implementing PUSH and POP operation
• Testing for overflow and underflow conditions
Recursion
• Concept and Definition
• Implementation of:
¬ Multiplication of Natural Numbers
¬ Factorial
¬ Fibonacci Sequences
The Tower of Hanoi
Big O notation is used in Computer Science to describe the performance or complexity of an algorithm. Big O specifically describes the worst-case scenario, and can be used to describe the execution time required or the space used (e.g. in memory or on disk) by an algorithm.
For further information
https://github.com/ashim888/dataStructureAndAlgorithm
References:
https://www.khanacademy.org/computing/computer-science/algorithms/asymptotic-notation/a/asymptotic-notation
http://web.mit.edu/16.070/www/lecture/big_o.pdf
https://rob-bell.net/2009/06/a-beginners-guide-to-big-o-notation/
https://justin.abrah.ms/computer-science/big-o-notation-explained.html
Concept and Definition of Data Structures
Introduction to Data Structures: Information and its meaning, Array in C++: The array as an ADT, Using one dimensional array, Two dimensional array, Multi dimensional array, Structure , Union, Classes in C++.
https://github.com/ashim888/dataStructureAndAlgorithm
For all who wish to learn c graphics programming, no knowledge of graphics concepts is required. C Graphics programming is very easy and interesting. You can use graphics programming for developing your own games, in making projects, for animation etc. It's not like traditional C programming in which you have to apply complex logic in your program and then you end up with a lot of errors and warnings in your program. In C graphics programming you have to use standard library functions ( need not worry if you don't know functions ) to get your task done. Just you pass arguments to the functions and it's done. On this website you will find almost all functions with detailed explanation and a sample program showing the usage of a function. To make things easy you are provided with executable files which you can download and execute. Firstly you should know the function initgraph which is used to initialize the graphics mode . To initialize graphics mode we use initgraph function in our program. initgraph function is present in "graphics.h" header file, so your every graphics program should include "graphics.h" header file. We will discuss initgraph withe help of following sample program:-
Concept of file, Opening and closing of file, Modes, Input/ output function, Random access in file, Printing a file
A file represents a sequence of bytes on the disk where a group of related data is stored. File is created for permanent storage of data. It is a ready made structure.
In C language, we use a structure pointer of file type to declare a file.....
Introduction, Array of structure, Passing structure to function, Passing array of structure to function, Structure within structure ( Nested Structure), Union, Pointer to structure
Introduction, The & and * operator, Declaration of pointer, Pointer to pointer, Pointer arithmetic, Pointer and array, Pointer with multidimensional array, Pointer and strings, Array of pointer with string, Dynamic memory allocation.
Library Functions, User defined functions, Recursion, Function declaration, Local and global variables, Use of array in function, Passing by Value, Passing by Address
https://github.com/ashim888/csit-c
Introduction of arrays, Declaration of array, Initialization of array, Sorting, Multidimensional array. Some code examples that will make you clear about the concept of arrays.
https://github.com/ashim888/csit-c
Branching, Looping, Conditional Statement, Exit function, Difference between break and exit. Some of the codes and some of the branching techniques are covered in this unit. Check conditional statement looping and exit functions too
https://github.com/ashim888/csit-c
C Tokens, Escape sequence, Delimiters, Variables, Data types, Constants/ Literals, Expressions, Statements and Comments
https://github.com/ashim888/csit-c
We all have good and bad thoughts from time to time and situation to situation. We are bombarded daily with spiraling thoughts(both negative and positive) creating all-consuming feel , making us difficult to manage with associated suffering. Good thoughts are like our Mob Signal (Positive thought) amidst noise(negative thought) in the atmosphere. Negative thoughts like noise outweigh positive thoughts. These thoughts often create unwanted confusion, trouble, stress and frustration in our mind as well as chaos in our physical world. Negative thoughts are also known as “distorted thinking”.
Students, digital devices and success - Andreas Schleicher - 27 May 2024..pptxEduSkills OECD
Andreas Schleicher presents at the OECD webinar ‘Digital devices in schools: detrimental distraction or secret to success?’ on 27 May 2024. The presentation was based on findings from PISA 2022 results and the webinar helped launch the PISA in Focus ‘Managing screen time: How to protect and equip students against distraction’ https://www.oecd-ilibrary.org/education/managing-screen-time_7c225af4-en and the OECD Education Policy Perspective ‘Students, digital devices and success’ can be found here - https://oe.cd/il/5yV
Operation “Blue Star” is the only event in the history of Independent India where the state went into war with its own people. Even after about 40 years it is not clear if it was culmination of states anger over people of the region, a political game of power or start of dictatorial chapter in the democratic setup.
The people of Punjab felt alienated from main stream due to denial of their just demands during a long democratic struggle since independence. As it happen all over the word, it led to militant struggle with great loss of lives of military, police and civilian personnel. Killing of Indira Gandhi and massacre of innocent Sikhs in Delhi and other India cities was also associated with this movement.
How to Split Bills in the Odoo 17 POS ModuleCeline George
Bills have a main role in point of sale procedure. It will help to track sales, handling payments and giving receipts to customers. Bill splitting also has an important role in POS. For example, If some friends come together for dinner and if they want to divide the bill then it is possible by POS bill splitting. This slide will show how to split bills in odoo 17 POS.
Palestine last event orientationfvgnh .pptxRaedMohamed3
An EFL lesson about the current events in Palestine. It is intended to be for intermediate students who wish to increase their listening skills through a short lesson in power point.
The Indian economy is classified into different sectors to simplify the analysis and understanding of economic activities. For Class 10, it's essential to grasp the sectors of the Indian economy, understand their characteristics, and recognize their importance. This guide will provide detailed notes on the Sectors of the Indian Economy Class 10, using specific long-tail keywords to enhance comprehension.
For more information, visit-www.vavaclasses.com
Ethnobotany and Ethnopharmacology:
Ethnobotany in herbal drug evaluation,
Impact of Ethnobotany in traditional medicine,
New development in herbals,
Bio-prospecting tools for drug discovery,
Role of Ethnopharmacology in drug evaluation,
Reverse Pharmacology.
Instructions for Submissions thorugh G- Classroom.pptxJheel Barad
This presentation provides a briefing on how to upload submissions and documents in Google Classroom. It was prepared as part of an orientation for new Sainik School in-service teacher trainees. As a training officer, my goal is to ensure that you are comfortable and proficient with this essential tool for managing assignments and fostering student engagement.
The Roman Empire A Historical Colossus.pdfkaushalkr1407
The Roman Empire, a vast and enduring power, stands as one of history's most remarkable civilizations, leaving an indelible imprint on the world. It emerged from the Roman Republic, transitioning into an imperial powerhouse under the leadership of Augustus Caesar in 27 BCE. This transformation marked the beginning of an era defined by unprecedented territorial expansion, architectural marvels, and profound cultural influence.
The empire's roots lie in the city of Rome, founded, according to legend, by Romulus in 753 BCE. Over centuries, Rome evolved from a small settlement to a formidable republic, characterized by a complex political system with elected officials and checks on power. However, internal strife, class conflicts, and military ambitions paved the way for the end of the Republic. Julius Caesar’s dictatorship and subsequent assassination in 44 BCE created a power vacuum, leading to a civil war. Octavian, later Augustus, emerged victorious, heralding the Roman Empire’s birth.
Under Augustus, the empire experienced the Pax Romana, a 200-year period of relative peace and stability. Augustus reformed the military, established efficient administrative systems, and initiated grand construction projects. The empire's borders expanded, encompassing territories from Britain to Egypt and from Spain to the Euphrates. Roman legions, renowned for their discipline and engineering prowess, secured and maintained these vast territories, building roads, fortifications, and cities that facilitated control and integration.
The Roman Empire’s society was hierarchical, with a rigid class system. At the top were the patricians, wealthy elites who held significant political power. Below them were the plebeians, free citizens with limited political influence, and the vast numbers of slaves who formed the backbone of the economy. The family unit was central, governed by the paterfamilias, the male head who held absolute authority.
Culturally, the Romans were eclectic, absorbing and adapting elements from the civilizations they encountered, particularly the Greeks. Roman art, literature, and philosophy reflected this synthesis, creating a rich cultural tapestry. Latin, the Roman language, became the lingua franca of the Western world, influencing numerous modern languages.
Roman architecture and engineering achievements were monumental. They perfected the arch, vault, and dome, constructing enduring structures like the Colosseum, Pantheon, and aqueducts. These engineering marvels not only showcased Roman ingenuity but also served practical purposes, from public entertainment to water supply.
2. Intro
• Number of problems in our daily life.
• Suppose we have to calculate Simple Interest.
• Suppose we have to prepare a mark sheet.
• A computer is a DUMB machine.
• A computer cannot do anything alone without
software i.e. Program
Ashim Lamichhane 2
3. • A software is a set of programs written to
solve a particular problem
• Software is a set of instructions on the basis of
which computer gives output/result.
• If the instructions are not correct, the
computer gives wrong result.
Ashim Lamichhane 3
4. Never Ever Forget
• Just writing code is not sufficient to solve a
problem.
• Program must be planned before coding in
any computer language available.
• There are many activities to be done before
and after writing code.
Ashim Lamichhane 4
5. Stages while solving a problem using
computer
1. Problem Analysis
2. Algorithm Development
3. Flowcharting
4. Coding
5. Compilation and Execution
6. Debugging and Testing
7. Documentation
Ashim Lamichhane 5
6. Fig. Steps in problem solving
Ashim Lamichhane 6
Algorithm Development
Flowcharting
Documentation
Debugging and Testing
Compilation and Execution
Program Coding
Problem Analysis
7. Problem Analysis
• Process of becoming familiar with the problem.
• We need to analyze and understand it well before
solving.
• The user’s requirements cannot be fulfilled without clear
understanding of his/her problem in depth.
• Inadequate identification of problem may cause
program less useful and insufficient.
• Example: Banking Solution, Hospital Medical Study
Ashim Lamichhane 7
8. Algorithm Development
• Step By Step description of the method to
solve a problem.
• Effective procedure for solving a problem in
finite number of steps.
• Developing an algorithm is a step of program
design.
Ashim Lamichhane 8
9. An algorithm to find sum of two numbers:
Step 1: Start
Step 2: Assume two numbers x and y and a variable sum=0
Step 3: Add two numbers x and y; store the value in variable sum
Step 4: If you want to try again with different numbers
then goto step 2
else
goto step 5
Step 5: END
Ashim Lamichhane 9
10. An algorithm to find sum of two numbers:
Step 1: Start
Step 2: Declare variables num1, num2 and sum.
Step 3: Read values num1 and num2.
Step 4: Add num1 and num2 and assign the result to sum.
sum←num1+num2
Step 5: Display sum Step 6: Stop
Ashim Lamichhane 10
11. An algorithm to find largest of three different
numbers:
Ashim Lamichhane 11
12. Three features of Algorithm
• Sequence
– Each step in the algorithm in executed in specified order. If not
algorithm will fail.
• Decision
– We have to make decision to do something.
– If the outcome of the decision is true, one thing is done otherwise
other.
• If condition then process1
OR
• If condition
then process1
Else process2
• Repetition
– For example
Repeat
Fill Water in the kettle
Until Kettle is full
Ashim Lamichhane 12
13. Flowcharting
• Graphical representation of an algorithm using standard
symbols.
• Includes a set of various standard shaped boxes that are
interconnected by flow lines.
• Flow lines have arrows(direction of flow).
• Activities are written within boxes in English.
• Communicates between programmers and business
persons.
Ashim Lamichhane 13
14. Advantages of Flowcharts
• Communication
– Quickly provide logic, ideas and descriptions of algorithms.
• Effective Analysis
– Clear overview of the entire problem.
• Proper Documentation
– Documents the steps followed in an algorithm.
– Helps us understand its logic in future.
• Efficient Coding
– More ease with comprehensive flowchart as a guide
• Easy in debugging and program maintenance
– Debugging and maintenance of operating program
Ashim Lamichhane 14
16. Things to consider
• There should be start and stop to the flowchart.
• Only one flow line should emerge from a
process symbol.
• Only one flow line should enter a decision
symbol, but two or three flow lines can leave
the decision symbol.
Ashim Lamichhane 16
17. Write an algorithm and draw flowchart for finding the
sum of any two numbers.
Algorithm
-------------
Step1: Start
Step2: Display “Enter two numbers”.
Step3: Read A and B
Step4: C= A+B
Step5: Display “C as sum of two numbers”
Step6: Stop
Ashim Lamichhane 17
19. Some questions for Assignment
• Write an algorithm and draw flowchart to
determine a number whether it is positive or
negative.
• Write an algorithm and draw flowchart to test
a number for even or odd.
• Write an algorithm and draw flowchart to find
the largest number among three numbers.
Ashim Lamichhane 19
20. • Read N numbers from user and display sum of
all entered numbers.
• For finding the sum of the series 1+2+3+4+…
up to N terms
• For calculating the factorial of a given number
N.
Ashim Lamichhane 20
21. Coding
• The process of transforming the program logic design into
computer language format.
• An act of transforming operations in each box of the flowchart
in terms of the statement of the program.
• The code written using programming language is also known
as source code.
• Coding isn’t the only task to be done to solve a problem using
computer.
• Anyone can code. TRUST ME!!
Ashim Lamichhane 21
22. Compilation
• Process of changing high level language into machine level
language.
• It is done by special software, COMPILER
• The compilation process tests the program whether it
contains syntax errors or not.
• If syntax errors are present, compiler can not compile the
code.
Ashim Lamichhane 22
23. Execution
• Once the compilation is completed then the program
is linked with other object programs needed for
execution, there by resulting in a binary program and
then the program is loaded in the memory for the
purpose of execution and finally it is executed.
• The program may ask user for inputs and generates
outputs after processing the inputs.
Ashim Lamichhane 23
24. Debugging and Testing
• Debugging is the discovery and correction of
programming errors.
• Some errors may remain in the program because the
designer/programmer might have never thought
about a particular case.
• When error appears debugging is necessary.
Ashim Lamichhane 24
25. Debugging and Testing
• Testing ensures that program performs correctly the
required task.
• Verification ensures that program does what the
programmer intends to do.
• Validation ensures that the program produces the
correct results for a set of test data.
• Test data are supplied to the program and output is
observed.
• Expected output = Error free
Ashim Lamichhane 25
26. Program Documentation
• Helps to those who use, maintain and extend the
program in future.
• A program may be difficult to understand even to
programmer who wrote the code after some
days.
• Properly documented program is necessary
which will be useful and efficient in debugging,
testing, maintenance and redesign process.
Ashim Lamichhane 26
27. Two types of documentations
1. Programmer’s Documentation (Technical
Documentation)
• Maintain, redesign and upgrade
• Logic, DFD, E-R, algorithm and flowchart
2. User Documentation (User Manual)
• Support to the user of the program
• Instructions for installation of the program
Ashim Lamichhane 27
29. Computer Program
• Set of instructions that causes to behave in predetermined
manner.
• To instruct a computer to perform a certain job, we need
languages, but not English or Nepali(!!!FOR NOW!!!).
• We need languages understood by the computer.
Ashim Lamichhane 29
30. Types or levels of Programming
Languages
• High Level
• Low-level
– Machine Level
– Assembly Level
Ashim Lamichhane 30
31. Low Level Language
• Statement or instruction is directly translated
into a single machine code.
• It is machine dependent, i.e. A particular low-
level language works only for a certain
machine.
Ashim Lamichhane 31
32. Machine-level Language
• Language that a computer actually understands.
• 1’s and 0’s.
• Is a sequence of instructions written in the form of
binary numbers consisting of 1’s and 0’s
• It executes fast as computer don’t need any
translation.
Ashim Lamichhane 32
33. • To add two number in machine language:
11 10111001 110
3 machine code for addition (say) 6
• It is difficult to remember different instructions for
programming.
Ashim Lamichhane 33
34. Machine Level Language
ADVANTAGE DISADVANTAGE
Computer directly understands machine
instructions
Difficult to use
Directly starts executing Machine dependent
Takes less execution time Difficult to Debug and modify
Ashim Lamichhane 34
35. Assembly Language
• Symbolic representation(mnemonics) of machine code.
• Close to machine code but the computer cannot understand
• Must be translated into machine code by a separate program
called an assembler.
11 ADD 110
– Suppose ADD is mnemonic for addition
Ashim Lamichhane 35
36. Some examples of instructions for
assembly languages are as follows:
CODE Meaning
ADD Addition
SUB Subtraction
INR Increase
DCR Decrease
CMP Compare
Ashim Lamichhane 36
It is relatively easy for writing programs in assembly
languages, but is slow in execution as it has to be
converted into machine language before execution.
37. Assembly language
Advantage Disadvantage
More convenient than machine language Hard to remember Mnemonics
Symbolic instructions Machine dependent
Improved readability Less efficient than machine language
Need fewer codes than high level
language
Embedded systems and device
programming
Ashim Lamichhane 37
38. High Level Language
• User friendly, Similar to natural languages
• Platform independent
• Easy to write or remember
• Easy to learn and work
• While execution: translated into assembly language then to
machine language.
• Slow in execution but is efficient for developing programs.
• Ex: C, C++, Python, Java etc.
Ashim Lamichhane 38
39. High Level Language
Advantages Disadvantages
Easy to use More execution time
Portability Needs own translator
Easy Debugging
Easy and Fast Development of software
Ashim Lamichhane 39
40. Compiler
• A high level source program must be translated into a form machine
can understand. This done by software called the compiler.
• Source code => Machine language code(Object code)
• During the process of translation, the compiler reads the source
programs statement-wise and checks for syntax errors.
• In case of any error, the computer generates message about the
error.
• Ex: C, C++, Java, FORTRAN, pascal etc.
Ashim Lamichhane 40
41. Interpreter
• Like compiler, it is also a translator which translates high level
to machine level language.
• Translates and executes the program line by line.
• Each line is checked for syntax error and then converted to
the equivalent machine code.
• Ex. QBASIC, PERL, PHP, ASP, PYTHON, RUBY
Ashim Lamichhane 41
42. Difference between compiler and interpreter
Compiler Interpreter
Compiler scans the entire program before
translating it into machine code
Interpreter translates and executes the
program line by line
Syntax errors are found only after the
compilation of complete programs
Syntax errors can be trapped after
translations of every line
It takes large amount of time to analyze
the source code but the overall execution
time is comparatively faster.
It takes less amount of time to analyze the
source code but the overall execution
time is slower.
Generates intermediate object code
which further requires linking, hence
requires more memory.
No intermediate object code is generated,
hence are memory efficient.
Ashim Lamichhane 42
44. • We can assume C as middle level language
• This doesn’t mean C is less power full or harder to use or less developed.
• Instead C combines the advantages of high level language with the
functionalism of assembly language.
• Like high level, C provides block structures, stand-alone functions and
small amount of data typing.
• Like assembly language, it allows manipulations of bits, bytes, pointers
and it is mostly used in system programming.
• Combination of two aspects.
Ashim Lamichhane 44
45. History of C programming language
• C is a programming language which was born at “AT & T’s Bell
Laboratory” of USA in 1972.
• C was written by Dennis Ritchie, that’s why he is also called as
father of C programming language.
• C language was created for a specific purpose i.e. designing the
UNIX operating system (which is currently base of many UNIX based
OS).
• From the beginning, C was intended to be useful to allow busy
programmers to get things done because C is such a powerful,
dominant and supple language.
• It’s use quickly spread beyond Bell Labs in the late 70’s
Ashim Lamichhane 45
46. Why use C?
• Robust Language
• Efficient and fast
• Highly portable
• Structured Language
• Extendibility
• Middle level language
• Rich system library
Ashim Lamichhane 47
49. 1. Documentation Section
• Sets of comment line giving the name of
program, the author, algorithms, methods
used and other details.
• Acts as a communication between members
of the development team.
• Acts as user manual.
• Ex
– /* This program adds two numbers */
– /*…. */ denotes comments in C
Ashim Lamichhane 50
50. 2. Link Section
- Provides Instructions to the compiler to link
functions with program from the system library.
#include<stdio.h>
- Links input/output functions like printf() and
scanf() with the program
Ashim Lamichhane 51
51. 3. Definition Section
- In this section all symbolic constants are
defined.
- Ex.
- #define PI 3.1416
- #define FORMULA 3*x*x*x+2*x*x
Ashim Lamichhane 52
52. 4. Global Declaration Section
- The variables which are used in more than
one functions or blocks are called global
variables.
- This section also declares all the user-defined
functions.
Ashim Lamichhane 53
53. 5. main() Function Section
- Every C program starts with a main() function.
- Declaration part and executable part
- Declaration part declares all the variables used in
the execution part.
- int n1;
- int n2=5;
- Execution part has executable operations like:
- n1= n1 +1;
- n2=n1*5
Ashim Lamichhane 54
54. 6. Subprogram Section
- This section contains all the user-defined
functions that are called in the main function.
- All the sections except the main function
section may be absent when they are not
required.
Ashim Lamichhane 55
55. Note
• For Assignments And Lecture Slides
https://github.com/ashim888/csit-c
http://www.ashimlamichhane.com.np/
Ashim Lamichhane 56