-
This course is aimed at enabling the students toFormulate simple algorithms for arithmetic and logical problemsTranslate the algorithms to programs (in C language)Test and execute the programs and correct syntax and logical errorsImplement conditional branching, iteration and recursionDecompose a problem into functions and synthesize a complete program using divide and conquer approachUse arrays, pointers and structures to formulate algorithms and programsApply programming to solve matrix addition and multiplication problems and searching and sorting problemsApply programming to solve simple numerical method problems, namely rot finding of function, differentiation of function and simple integrationINTENDED AUDIENCE: BE/BTech in all disciplines BCA/MCA/M. ScINDUSTRY SUPPORT : All IT Industries
Overview
Syllabus
-
Week 1 :Introduction to Problem Solving through programs, Flowcharts/Pseudo codes, the compilation process, Syntax and Semantic errors, Variables and Data Types
Week 2 :Arithmetic expressions, Relational Operations, Logical expressions; Introduction to Conditional Branching
Week 3 :Conditional Branching and Iterative Loops
Week 4 :Arranging things : Arrays
Week 5 :2-D arrays, Character Arrays and Strings
Week 6 :Basic Algorithms including Numerical Algorithms
Week 7 :Functions and Parameter Passing by Value
Week 8 :Passing Arrays to Functions, Call by Reference
Week 9 :Recursion
Week 10 :Structures and Pointers
Week 11 :Self-Referential Structures and Introduction to Lists
Week 12 :Advanced Topics
