c programming orientation s

8/6/2019 C Programming Orientation S

1/21


2/21

C Programming ScheduleyCourse Duration : 4 Weeks.

y First 3 Weeks : In the First 3 Weeks we aregoing to learn all the programming concepts.

y

Week 4: In this Week We need to implementa project called (Library ManagementSystem),using the concepts learned earlier .


3/21

Whats new in 2011-Prep1. QUIZ and Discussion Points.

2. Inference or reflection Questions.

y The main objective ofDiscussion Points is to enablethe student to meet QUIZ effectively and rememberconcepts permanently.

y Inference or reflection Questions are going to help the

student, where student can think on his own i.e he willinspect himself what he understood.


4/21

Week 1 Objectivesy In Week One we will be learning about Algorithms and

Introduction to C programming. each week can bedivided into 10 modules.

Each module will have sub modules through which we will beable to learn the following:-

1. What is an algorithm? How do we write an algorithm?2. How do we convert algorithm into flowcharts?3. How to trace an algorithm?4. How to program in "C"?


5/21

Week 1 Schedule


6/21

How to proceed (common instructions)y Each student must go through the readings followed

byvideo resources.

y Then Student has to start the task.y Each task has following objectives .

y Learning by doing activity (Task description).

y Reflection questions (self evaluation questions).

y Should submit the deliverables within given deadline.


7/21

Module 1-Algorithmsy In this module we are going to learn following

objectives

y

Read and evaluate the steps of an algorithmy Describe everyday activities as algorithms

y Define a computational algorithm

y Write input & output specification for a computational

algorithmy Develop unambiguous (clear) and precise steps for

computational algorithm.


8/21

Algorithm and its Role in Computer Sciencey What is an algorithm ?y An algorithm is a precise rule (or set ofrules or set of steps ) specifying how

to solve some problem. (or)An algorithm is a step-by-step method of solving a problem.

y Properties:

1.Finiteness- an algorithm should have finite number of steps.

2.Definiteness-any step of an algorithm should be definite andunambiguous.

3.Effectiveness-an algorithm should be effective in solving the problem thatit's meant for.

4.Input-it should have zero or more inputs.

5.Output-it should have 1 or more outputs.


9/21

Module 2-Tracing an algorithmy In this module we are going to learn following

Objectives.

y

Examine the value of the variables at each step in theexecution of the algorithm.

y Determine if the algorithm is correct for a set of legalinput values.

y

Analyze and determine what is the purpose of thealgorithm .


10/21

What is tracing of Algorithmy Tracing of the algorithm is nothing but recording the

values of all the variables at every step during the

execution of that algorithm.Example :


11/21

Module -3

Visualize algorithms with flow chartsy In this Module we are going to learn the following

objectives.

y Identify the components of a given flow chart .

y Trace the flow and execution ofalgorithms representedas flow charts .

y Design computational algorithms using flow charts.


12/21

Raptor Tracing Tooly RAPTOR is a flowchart-based programming

environment, designed specifically to help students

visualize their algorithms.

y RAPTORprograms are created visually and executedvisually by tracing the execution through the

flowchart.


13/21

Module 4-Numarical algorithmsy In this Module we are going to learn the following

objectives.

y

Implementing Numerical algorithms using RAPTORy Write algorithms for solving numerical problems .

y Identify test cases to verify the correctness of thenumerical algorithm .

y

Trace the execution ofnumerical problems for differenttest cases.


14/21

Module 5-Quiz and discussionsyWe will be having Discussion Points for every 4

modules.

yThe main objective of the Discussions is to enable thestudents to meet theQUIZ effectively.

Time slot Action to be performed

9:00 AM 10:00 AM Student has to go through all readings of previous 4 modules

10:00 AM -12:00 PM Mentor will have discussion withStudents

12:00 PM -12:45 PM Students will have QUIZ on concepts


15/21

y In this Module we are going to learn the followingobjectives.

y Implementing String algorithms using RAPTORy Write algorithms for processing strings.

y Identify test cases toverifythe correctness of the stringprocessing algorithm.

y Trace the execution of string processing algorithm fordifferent test cases .

Module 6 :

Algorithms with Strings


16/21

Module 7 :

Searching Algorithms


y

Implementing Searching algorithms using RAPTORy Write algorithms for searching items from a list.

y Identify test cases to verify the correctness of the searchalgorithm .

y

Trace the execution of search algorithms for differenttest cases .


17/21

Module 8:

Introduction to C programming


y Familiarity ofDev C++ (Integrated Development

Environment) .y Write, compile and run Hello word program.

y Variables, Data types, Operators, Operators precedenceand Type Casting.

y Write Simple Programs in DEVC++ IDE


18/21

Module 9:

Conditional statements

y In this Module we are going to learn the following objectives.y Familiarityabout Conditional statements in C Language.

y Conditional Statementsy Adecision controlinstruction can be implemented in C using:

y The ifstatementThe if-else statementThe conditional operatorsThegeneral form ofifstatement looks like this:

if( this condition is true )execute this statement ;

y The general form ofif-else statement looks like this:

if( this condition is true )execute this statementElseexecute this statement


19/21

Example (Decision making)y if(a > b)

{

printf(a is greater than b);}

else

{

printf(b is greater than a);

}


20/21

Module 10-Quiz and discussions

Discussion points on above concepts followed byQUIZ


21/21

c programming orientation s

Documents