About the course
In this course, you will learn about the components of a computer which includes Memory, processor, input and output devices along with storage and operating system. You will also understand the concept of assembler, compiler, interpreter, loader, and linker. Then you will be introduced to algorithms and flowcharts which includes representation of an algorithm, flowchart, along with the concept of pseudo code and its examples, converting algorithms to programs and writing source code.
After that, you will learn about the basics of programming which includes the structure of a C program, how to write and execute a C program. In addition to this, you will learn about the various types of errors such as logical errors and syntax errors. You will also learn about the components of the C language, variables, data types, memory locations, and storage classes. Then you will learn about arithmetic operators and their precedence, if-else, switch-case statements, for loop, while and do-while loops, break and continue statements. You will also learn about functions, arrays, basic searching and sorting algorithms in detail. The course will conclude with detailed coverage of pointers and file operations in C.
After completing this course, you will be able to:
- Develop simple algorithms for arithmetic and logical problems.
- Translate the algorithms to programs in C language and execute them.
- Implement conditional branching, iteration, and recursion.
- Decompose a problem into functions and synthesize a complete program using the divide and conquer approach.
- Use arrays, pointers, and structures to develop algorithms and programs.
- Boost your hireability through innovative and independent learning.
- Get a certificate on successful completion of the course.
The course can be taken by:
Students: Students: All students who are pursuing any technical/professional courses, and wish to enter application programming industry.
Teachers/Faculties: All computer science and engineering teachers/faculties.
Professionals: All working professionals from the IT industry.
Why learn Programming for Problem Solving?
Problem-solving refers to your ability to solve problems in an effective and timely manner without any impediments. Whether you are a student, a parent, a businessperson, or the president of any country, you face problems every day that needs solving. For all these things, problem-solving is really really important. Especially when it comes to programming, problem-solving is the must. If you do not develop sound problem-solving skills, you will end up messing around with a given problem, and you would not be able to obtain a solution for ages.
- 24X7 Access: You can view lectures as per your own convenience.
- Online lectures:10 hours of online lectures with high-quality videos.
- Updated Quality content:> Content is latest and gets updated regularly to meet the current industry demands.
Test & Evaluation
There will be a final test containing a set of multiple choice questions. Your evaluation will include the scores achieved in the final test.
Certification requires you to complete the final test. Your certificate will be generated online after successful completion of course.
Topics to be covered
UNIT I -
Overview of Computers and Programming-Electronic Computers then and Now, Computer Hardware, Computer Software, Algorithm, Flowcharts, Software Development Method, Applying the Software Development Method.
UNIT II -
Introduction to C Language -C Language Elements, Variable Declarations and Data Types, Executable Statements, General Form of a C Program, Expressions, Precedence and Associativity, Expression Evaluation, Operators and Expressions, Type Conversions, Decision Statements -If and Switch Statements, Loop Control Statements -while, for, do-while Statements, Nested for Loops, Other Related Statements -break, continue, goto.
UNIT III -
Functions -Library Functions, Top-Down Design and Structure Charts, Functions with and without Arguments, Communications Among Functions, Scope, Storage Classes -Auto, Register, Static, Extern, Scope rules, Type Qualifiers, Recursion -Recursive Functions, Preprocessor Commands.Arrays -Declaring and Referencing Arrays, Array Subscripts, Using For Loops for Sequential Access, Using Array Elements as Function Arguments, Arrays Arguments, Multidimensional Arrays.
UNIT IV -
Pointers -Introduction, Features of Pointers, Pointer Declaration, Arithmetic Operations With Pointers, Pointers and Arrays, Pointers and Two-Dimensional Arrays, Array of Pointers, Pointers to Pointers, Void Pointers, Memory Allocation Functions, Programming Applications, Pointer to Functions, Command-Line Arguments. Strings -String Basics, String Library Functions, Longer Strings, String Comparison, Arrays of Pointers, Character operations, String-To-Number and Number-To-String Conversions, Pointers and Strings.
UNIT V -
Structure and Union –Introduction, Features of Structures,Declaration and Initialization of Structures, Structure within Structure, Array of Structures, Pointer to Structure, Structure and Functions, typedef, Bit Fields, Enumerated Data Type, Union, Union of Structures.
UNIT VI -
Files -Introduction, Streams and File Types, Steps for File Operations, File I/O Structures, Read and Write,Other File function, Searching Errors in Reading/Writing of Files, Low Level Disk I/O, Command Line Arguments,Application of Command Line Arguments, File Status functions (error handling).
UNIT VII -
Data Structures -Overview of Data Structure, Representation of a Stack, Stack Related Terms, Operation on a Stack, Implementation of a Stack, Representation of Arithmetic Expressions, Infix, Prefix, and Postfix Notations, Evaluation of Postfix Expression, Conversion of Expression from Infix to Postfix, Recursion, Queues -Various Positions of Queue, Representation of Queue, Insertion, Deletion, Searching Operations.Linked List -Singly Linked List, Linked List with and without header,Insertion, Deletion and Searching Operations.
UNIT VIII -
and Sorting -Exchange (Bubble) Sort, Selection Sort, Quick Sort, Insertion Sort, Merge Sort.Searching-Linear and Binary Search Methods.