12 Sections
95 Lessons
10 Weeks
Expand all sections
Collapse all sections
Introduction to C and Programming Basics
4
1.1
History & Role Of C in Programming
1.2
VS Code Installation
1.3
Baic Syntax of C
1.4
Problem Solving Overview
Data Types, Operators and Expressions
10
2.1
Variable & DataTypes
2.2
Signed & Unsigned
2.3
Constants
2.4
Operators
2.5
Operators (Logical)
2.6
Operators (Bitwise)
2.7
Operators (Assignmennt)
2.8
Precedence & Associativity
2.9
Typecasting
2.10
Common Pitfalls
Control Structures and Flow Control
9
3.1
scanf() function & Introduction to Conditional Statements
3.2
Conditional Statements Part-2
3.3
Conditional Statements Part-3
3.4
Question Practice (Conditional Statements
3.5
Loops
3.6
Loops control statements
3.7
Problem Solving (Pattern)
3.8
Problem Solving (Prime No.)
3.9
Debugging Techniques
Functions and Recursion
6
4.1
Function Basics
4.2
Function Types and Pass by Value
4.3
Scope & Lifetime
4.4
Recursion Introduction
4.5
Call Stack
4.6
Fibonnaci Series
Arrays and String
10
5.1
Arrays Introduction
5.2
Indexing & 2D Array
5.3
Strings Introduction
5.4
Strings Library Function
5.5
Multidimensional Arrays
5.6
Bubble Sort
5.7
Selection Sort
5.8
Insertion Sort
5.9
Linear Search
5.10
Binary Search
Pointers and Dynamic Memory Allocation
7
6.1
Pointers Fundamentals
6.2
Pointers Arithmetic (Addition)
6.3
Pointer Arithmetic (Subtractions)
6.4
Pointers Arithmetic (Increment Decrement)
6.5
Pointers and Arrays
6.6
Dynamic Memory Allocation
6.7
Dynamic Memory Allocation (Part-2)
Structures and Advanced Data Handline
7
7.1
Structure Intro
7.2
Structure
7.3
Nested Structure
7.4
Typedef
7.5
Union
7.6
Enums
7.7
Student Record Management
File I/O and Command Line Arguments
6
8.1
FIle Handling Introduction
8.2
Writing file (fprintf & fputs)
8.3
Reading Files (fscanf & fgets)
8.4
Binary IO
8.5
Command Line Arguments
8.6
Reading & Writing CSV data, log file analysis
Essential Data Structures and Algorithms
12
9.1
Linked List Creation
9.2
Linked List Insertion
9.3
Linked List Insertion Part 2
9.4
Linked List Deletion
9.5
Stack(Using Array)
9.6
Stack(Using LinkedList)
9.7
Queue (Using Array)
9.8
Queue ( Using LinkedList )
9.9
Trees Introduction
9.10
Tree Creation
9.11
Tree Traversal
9.12
Time Complexity Big-O Notation
Problem Solving Techniques and Strategies
11
10.1
Divide and Conquer
10.2
Greedy Algorithm
10.3
Dynamic Programming
10.4
Sliding Window
10.5
Two pointers
10.6
Hashing
10.7
Recursion vs Iteration
10.8
Sliding Window Ques
10.9
Kadane’s Algorithm
10.10
Valid Parenthesis
10.11
Common pitfalls in C
Advanced Topics and Best Practices
7
11.1
Preprocessor directive Introduction
11.2
File Inclusion
11.3
Macros
11.4
Conditional Compilation
11.5
Stack vs Heap
11.6
Portability & Standards
11.7
Secure Coding Practice
Capstone Project and Beyond
6
12.1
Snake Game Part 1
12.2
Snake Game Part 2
12.3
Project Architecture
12.4
Project Architecture Part 2
12.5
Future Pathways
12.6
Open Source Contribution
C Programming & Problem Solving
Curriculum
This content is protected, please
login
and enroll in the course to view this content!
Home
Courses
Search
Search
Account
Login with your site account
Lost your password?
Remember Me
Modal title
Main Content