KLiC C About C is basic programming language in which you can program easily and develop effective applications, games etc. This course is split up into several sections, lessons, and Exercises for you to demonstrate what has been taught. In this course, we concentrate on the most basic concepts, including the usually frightening concepts of structures, union, file, pointers, dynamic memory allocation, etc. Tools: Turbo C++ Syllabus: Module 1: Getting Started with C Programming 1. Audience for this Course 2. Job Roles and Employment Opportunities 3. Pre-requisite Knowledge and Skills 4. Inspire with C Programming 5. History of C 6. What is C? 7. Why we learn C? 8. Course Objective 9. Checklist for Installation 10. Step by Step Installation Process 11. Hello World Program Module 2: Language Fundamentals 1. The Programming Languages 2. Compiler 3. The Structure of C Programs 4. Understanding Header Files
5. The Main Function 6. Our First C Program Module 3: Essentials for C Programming 1. Typology 2. Size and Signed Qualifiers 3. Variables 4. Constants 5. Keywords 6. Comments 7. Operators 8. Operator Precedence 9. Format Strings and Escape Sequences Module 4: Input and Output Functions 1. Standard I/O Functions 2. Character I/O Functions 3. String I/O Functions Module 5: Decision and Control Flow Statements 1. IFB88:B110 2. Nested IF Statements 3. The switch case and go to Statements 4. The for Loop 5. The while Loop 6. The do...while Loop 7. Working with break and continue Keywords Module 6: Working with Arrays
1. UnB114:B124 2. Un-sized Array Initializations 3. Reading Array Elements 4. Characters in Arrays Module 7: String Manipulations 1. Understanding and Comparing Strings 2. Copying and Finding Length of a String 3. String Reverse and Concatenation 4. String Conversion and Searching a String Module 8: Functions 1. User-defined Functions+B143:B164 2. Using Return Keyword 3. Function with Return Type and without Arguments 4. Function without Return Type and with Arguments 5. Function with Return Type and Arguments 6. Arrays in Functions 7. Recursion 8. Command Line Arguments Module 9: Storage Classes 1. UnB166:B203rage Classes 2. External Variables 3. The Static and Register Variables Module 10: Pointers 1. WhaB177:B202nter? 2. Pointer Conversions
3. Arrays in Pointers 4. Function Pointers 5. Call by Value and Call by Reference 6. Dynamic Memory Allocation 7. The calloc function Module 11: Preprocessor 1. MacB204:B214 2. File Inclusion 3. Conditional Compilation Module 12: Structures and Unions 1. Understanding Structures 2. Nested Structures 3. Arrays in Structures 4. Functions in Structures 5. Pointers in Structures 6. Understanding Unions Module 13: File Management in C 1. File Management B228:B231 2. File Operations 3. Writing and Reading Characters 4. Writing and Reading Strings 5. Structures in Files 6. Using fscanf and fprintf functions 7. Understanding fseek and ftell Functions 8. Copying Files 9. Renaming and Removing Files
Module 14: Working with Mathematical Functions & Time Utility 1. TheB261:B280 2. Using ceil and floor Functions 3. Understanding pow and pow10 Functions 4. Working with Logarithmic Functions 5. Using the Time Function 6. Working with localtime and asctime Functions 7. Understanding mktime Function Module 15: Character Handling Functions 1. Character Testing Functions 2. Character Conversion Functions 3. Convert String to Double 4. Working with atoi Function 5. Understanding the ATOL Function Module 16: Sorting 1. An Overview of Sorting 2. Bubble Sort 3. Quick Sort 4. Merge Sort 5. Selection Sort 6. Shell Sort 7. Heap Sort 8. Insertion Sort Module 17: Advanced Types 1. The typedef keyword
2. Understanding Enumerations 3. Type Conversions Module 18: Linked Lists 1. Understanding Linked Lists 2. Working with Single Linked List 3. Search a Node in a Singly Linked List 4. Deleting First Node from a Simple Linked List 5. Understanding Doubly Linked Lists 6. Reverse the Doubly Linked List 7. Insert a node in the doubly linked list 8. Delete a node from a double linked list 9. Concatenating Two Linked Lists Module 19: Advanced Data Structures 1. Understanding Stack 2. Updating Stack using Arrays 3. Using the Queue 4. Insert an Element in a Queue 5. Understanding Circular Queues 6. Understanding Trees 7. Binary Trees 8. Searching in a Binary Tree