ABOUT THE COURSEThis course provides an introduction to the development of algorithms to diverse types of problems and the development of computer programs to implement solutions for them. It explores standard programming constructs used to introduce fundamental algorithmic / programming concepts including variables, assignments, control constructs, functions, arrays and their role in problem solving. This course emphasizes structured programming in the development of algorithm solutions to common problems.
COURSE OBJECTIVESUpon successful completion of the course, the learner will be able to :
In this session, you will learn about a framework for problem solving, strategies that are often used by experts in solving problems, basic features of C, Identifiers, Keywords, Data types, Variables and Constants in C, Input and Output Statements in C.
In this session, you will learn about the need for Conditional or Selection or Branching Statements, structure of if construct, structure of if-else construct, structure of if-else if ladder construct, structure of nested if construct, structure of switch construct and appropriate usage of different conditional statements to solve problems.
In this session, you will learn about the need for looping constructs, structure of for construct, structure of while construct, structure of do-while construct, usage of break and continue statements and appropriate Usage of different control constructs to solve problems.
In this session, you will learn to recognize the need for functions, illustrate the different parts in writing a function with examples, and understand the difference between pass by value and pass by reference.
In this session, you will understand the memory structure, usage of pointers, usage and declaration of different types of pointers and to illustrate referencing and dereferencing pointers.
In this session, you will understand the need for 1-D arrays, illustrate few real time applications of 1-D arrays, illustrate how 1-D Arrays are stored in memory and understand how to define and process a 1-D array.
In this session, you will understand the need for 2-D arrays, illustrate few real time applications of 2-D arrays, illustrate how 2-D Arrays are stored in memory and understand how to define and process a 2-D array.
In this session, you will understand what strings are, how to declare a string, how a string is stored in memory and the string functions defined in string.h.
In this session, you will understand how arrays have been passed to functions as arguments and how arrays are returned from functions and learn the relationship between arrays and pointers.
In C programming language, when a function calls itself over and over again, that function is known as recursive function.The process of function calling itself repeatedly is known as recursion. In this session, you will understand the concept of recursion using practical examples.
C language provides functions like fopen, fread, fseek, fwrite to make file handling in C language simple. In this session, we will learn how to open a file, close a file, read from a file and write to a file.
In this session, you will learn the need for structures, how to define a structure, how a structure is stored in memory, processing structures, passing structures to functions and difference between structure and union.
In this session, you will learn how to create and use enums, how to use preprocessor directives and how to use command line arguments from outside instead of hardcoding these values inside the code.
E-Box is a Technology Enabled Active Learning and
Assessment platform for technology and engineering
domains apart from the basic LMS components like
quizzes, assignments, lesson components.