This action might not be possible to undo. Are you sure you want to continue?

C Programming Schedule

y Course Duration : 4 Weeks. y First 3 Weeks : In the First 3 Weeks we are

going to learn all the programming concepts.

y Week 4: In this Week We need to implement

a project called (Library Management System),using the concepts learned earlier .

y The main objective of Discussion Points is to enable the student to meet QUIZ effectively and remember concepts permanently. Inference or reflection Questions.What s new in 2011-Prep QUIZ and Discussion Points. . y Inference or reflection Questions are going to help the student.e he will inspect himself what he understood. 1. 2. where student can think on his own i.

How to trace an algorithm? 4. Each module will have sub modules through which we will be able to learn the following:1. How to program in "C"? . What is an algorithm? How do we write an algorithm? 2.Week 1 Objectives y In Week One we will be learning about Algorithms and Introduction to C programming. each week can be divided into 10 modules. How do we convert algorithm into flowcharts? 3.

Week 1 Schedule .

y Then Student has to start the task. y Each task has following objectives . y Learning by doing activity (Task description). . y Should submit the deliverable s within given deadline.How to proceed (common instructions) y Each student must go through the readings followed by video resources. y Reflection questions (self evaluation questions).

Module 1-Algorithms y In this module we are going to learn following objectives y Read and evaluate the steps of an algorithm y Describe everyday activities as algorithms y Define a computational algorithm y Write input & output specification for a computational algorithm y Develop unambiguous (clear) and precise steps for computational algorithm. .

Input-it should have zero or more inputs. . (or) An algorithm is a step-by-step method of solving a problem.Effectiveness-an algorithm should be effective in solving the problem that it's meant for.Definiteness-any step of an algorithm should be definite and unambiguous.Algorithm and its Role in Computer Science y What is an algorithm ? y An algorithm is a precise rule (or set of rules or set of steps ) specifying how to solve some problem . 5. 2. y Properties: 1. 3.Finiteness.an algorithm should have finite number of steps. 4.Output-it should have 1 or more outputs.

y Determine if the algorithm is correct for a set of legal input values. y Analyze and determine what is the purpose of the algorithm .Module 2-Tracing an algorithm y In this module we are going to learn following Objectives. y Examine the value of the variables at each step in the execution of the algorithm. .

What is tracing of Algorithm y Tracing of the algorithm is nothing but recording the values of all the variables at every step during the execution of that algorithm. Example : .

Module -3 Visualize algorithms with flow charts y 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 of algorithms represented as flow charts . y Design computational algorithms using flow charts.

y RAPTOR programs are created visually and executed visually by tracing the execution through the flowchart. .Raptor Tracing Tool y RAPTOR is a flowchart-based programming environment. designed specifically to help students visualize their algorithms.

y Implementing Numerical algorithms using RAPTOR y Write algorithms for solving numerical problems .Module 4-Numarical algorithms y In this Module we are going to learn the following objectives. . y Identify test cases to verify the correctness of the numerical algorithm . y Trace the execution of numerical problems for different test cases.

y The main objective of the Discussions is to enable the students to meet the QUIZ effectively.Module 5-Quiz and discussions y We will be having Discussion Points for every 4 modules. Time slot 9:00 AM 10:00 AM 10:00 AM -12:00 PM 12:00 PM -12:45 PM Action to be performed Student has to go through all readings of previous 4 modules Mentor will have discussion with Students Students will have QUIZ on concepts .

. y Implementing String algorithms using RAPTOR y Write algorithms for processing strings.Module 6 : Algorithms with Strings y In this Module we are going to learn the following objectives. y Trace the execution of string processing algorithm for different test cases . y Identify test cases to verify the correctness of the string processing algorithm.

y Identify test cases to verify the correctness of the search algorithm . y Trace the execution of search algorithms for different test cases .Module 7 : Searching Algorithms y In this Module we are going to learn the following objectives. . y Implementing Searching algorithms using RAPTOR y Write algorithms for searching items from a list.

compile and run Hello word program. y Familiarity of Dev C++ (Integrated Development Environment) . y Write Simple Programs in DEV C++ IDE . Operators precedence and Type Casting. Data types. Operators. y Variables. y Write.Module 8: Introduction to C programming y In this Module we are going to learn the following objectives.

y The general form of if-else statement looks like this: if ( this condition is true ) execute this statement Else execute this statement . y Conditional Statements y A decision control instruction can be implemented in C using: y The if statement The if-else statement The conditional operators The general form of if statement looks like this: if ( this condition is true ) execute this statement .Module 9: Conditional statements y In this Module we are going to learn the following objectives. y Familiarity about Conditional statements in C Language.

Example (Decision making) y if(a > b) { printf( a is greater than b ). } else { printf( b is greater than a ). } .

Module 10-Quiz and discussions Discussion points on above concepts followed by QUIZ .

Sign up to vote on this title

UsefulNot useful- 01 Fundamentals
- Continuous k Means
- matrixde
- Checking Chase Termination Cyclicity Analysis and Rewriting Techniques.pdf
- MB0048 Answer Keys
- Parallel Pde
- Programming in Ansi C_E. Balagurusamy
- Unconstrained Op Tim Ization
- MIT2_29F11_lect_20
- Presentacion2
- Linear Programming
- Exact Histogram Specification
- Global Optimization Toolbox
- ME401T CAD Circle Algorithm
- Controlling the Solution of Linear Systems - Fenicsproject
- Improving Preference Prediction Accuracy With Feature Learning
- softwaretesting_149
- 00816520
- 10.1.1.88
- Algorithm_Analysis
- recur-sparse-sciprog
- Shikaku
- Java Course Notes CS3114_09212011
- linear programing example excel solver.pdf
- Aina
- History of Integration
- The Partition of Unity Finite Element Approach With Hp-refinement for the Stationary Fokker-Planck Equation
- Cg Unit 1 5 Notes
- DAA
- Vector Quantization
- C Programming Orientation S