General English for GATE, PSUs, and Placements (English)

CONCEPTS SERIES

General English for GATE, PSUs, and Placements (English)

   Saturday, April 27, 2024   

Starting a new Lecture Notes Series on General English for GATE, PSUs, and Placements

Youtube Lecture Playlist Credits 

Channel Name: Neso Academy

So Let Us Start to This Journey of Learning 

General English for GATE, PSUs, and Placements By Lecture Notes together!

Lecture 1: General English for GATE, PSUs, and Placements

Lecture 2: Parts of Speech: Nouns

Lecture 3: Nouns (Solved Questions)

Lecture 4: Parts of Speech: Pronouns (Part 1)

Lecture 5: Parts of Speech: Pronouns (Part 2)

Lecture 6: Parts of Speech: Pronouns (Part 3)

Lecture 7: Pronouns (Solved Questions)

Lecture 8: Articles (Part 1)

Lecture 9: Articles (Part 2)

Lecture 10: Articles (Part 3)

Lecture 11: Articles (Part 4)

Lecture 12: Articles (Solved Questions)

Lecture 13: Adjectives (Part 1)

Lecture 14: Adjectives (Part 2)

Lecture 15: Adjectives (Part 3)

Lecture 16: Adjectives (Part 4)

Lecture 17: Adjectives (Part 5)

Lecture 18: Adjectives (Part 6)

Lecture 19: Adjectives (Solved Questions)

Lecture 20: Verbs (Part 1)

Lecture 21: Verbs (Part 2)

Lecture 22: Verbs (Part 3)

Lecture 23: Verbs (Part 4)

Lecture 24: Adverbs (Part 1)

Lecture 25: Adverbs (Part 2)

Lecture 26: Tenses | Chapter-5 | General English | nesoacademy.org

Lecture 27: Subject-Verb Agreement | Chapter-6 | General English | nesoacademy.org

Lecture 28: Critical Reasoning | Chapter-7 | General English | nesoacademy.org

Aptitude & Reasoning for GATE, ESE, and Placements (English)

CONCEPTS SERIES

Aptitude & Reasoning for GATE, ESE, and Placements (English)

   Saturday, April 27, 2024   

Starting a new Lecture Notes Series on Aptitude & Reasoning for GATE, ESE, and Placements

Youtube Lecture Playlist Credits 

Channel Name: Neso Academy

So Let Us Start to This Journey of Learning 

Aptitude & Reasoning for GATE, ESE, and Placements By Lecture Notes together!

Lecture 1: Introduction to Aptitude and Reasoning

Lecture 2: Ratio

Lecture 3: Ratio (Solved Problems) - Part 1

Lecture 4: Ratio (Solved Problems) - Part 2

Lecture 5: Proportion

Lecture 6: Direct and Indirect Proportion

Lecture 7: Proportion (Solved Problems)

Lecture 8: Ratio and Proportion (10 Solved Problems)

Lecture 9: Classification of Numbers

Lecture 10: Prime and Composite Numbers

Lecture 11: Number of Factors (Part 1)

Lecture 12: Number of Factors (Part 2)

Lecture 13: Number of Even and Odd Factors

Lecture 14: Power of Prime Number in a Factorial

Lecture 15: Power of Composite Number in a Factorial

Lecture 16: The Base System

Lecture 17: The Base System - Addition

Lecture 18: The Base System - Subtraction

Lecture 19: The Base System (Solved Problems)

Lecture 20: Number of Trailing Zeros in a Factorial

Lecture 21: Cyclicity of Numbers (Part 1)

Lecture 22: Cyclicity of Numbers (Part 2)

Lecture 23: Unit Place Calculation (Part 1)

Lecture 24: Unit Place Calculation (Part 2)

Lecture 25: Unit Place Calculation (Part 3)

Lecture 26: Unit Place Calculation (Solved Problems)

Control Systems (English)

CSE/IT SERIES

Control Systems (English)

   Saturday, April 27, 2024   

Starting a new Lecture Notes Series on Control Systems

Youtube Lecture Playlist Credits 

Channel Name: Neso Academy

So Let Us Start to This Journey of Learning 

Control Systems By Lecture Notes together!

Lecture 1: Introduction to Control Systems

Lecture 2: System Response Characteristics

Lecture 3: Open Loop Systems

Lecture 4: Closed Loop Systems

Lecture 5: Review of Laplace Transform (Part 1)

Lecture 6: Review of Laplace Transform (Part 2)

Lecture 7: Review of Laplace Transform (Part 3)

Lecture 8: Review of Laplace Transform (Part 4)

Lecture 9: Review of Laplace Transform (Part 5)

Lecture 10: Review of Laplace Transform (Part 6)

Lecture 11: Review of Laplace Transform (Part 7)

Lecture 12: Review of Linear Time-Invariant (LTI) Systems

Lecture 13: Introduction to Transfer Function

Lecture 14: Transfer Function (Solved Problem 1)

Lecture 15: Transfer Function (Solved Problem 2)

Lecture 16: Transfer Function (Solved Problem 3)

Lecture 17: Transfer Function (Solved Problem 4)

Lecture 18: Transfer Function (Solved Problem 5)

Lecture 19: Transfer Function (Solved Problem 6)

Lecture 20: Transfer Function (Solved Problem 7)

Lecture 21: Zeros and Poles of a Transfer Function

Lecture 22: Transfer Function of a Closed Loop System

Lecture 23: Types of Systems

Lecture 24: Initial Value and Final Value Theorems

Lecture 25: Final Value Theorem (Solved Problem)

Lecture 26: Time Constant Form of a Control System

Lecture 27: Time Constant Form (Solved Problem)

Lecture 28: DC Gain of a System

Lecture 29: DC Gain of a System (Solved Problem)

Lecture 30: The Concept of Dominant Pole

Lecture 31: Dominant Pole (Solved Problem)

Lecture 32: Sensitivity of Control System (Part - 1)

Lecture 33: Sensitivity of Control System (Part - 2)

Lecture 34: Sensitivity of Control System (Part - 3)

Lecture 35: Sensitivity of Control System (Solved Example)

Lecture 36: Sensitivity of Control System (Solved Problem)

Lecture 37: Step Response of a System

Lecture 38: Ramp Response of a System

Lecture 39: Basics of Control Systems (Solved Problem 1)

Lecture 40: Basics of Control Systems (Solved Problem 2)

Lecture 41: Basics of Control Systems (Solved Problem 3)

Lecture 42: Basics of Control Systems (Solved Problem 4)

Lecture 43: Basics of Control Systems (Solved Problem 5)

Lecture 44: Introduction to Block Diagrams

Lecture 45: Block Diagram Reduction Rules - Part 1

Lecture 46: Block Diagram Reduction Rules - Part 2

Lecture 47: Block Diagram Reduction (Solved Example 1)

Lecture 48: Block Diagram Reduction (Solved Example 2)

Lecture 49: Block Diagram Reduction (Solved Problem 1)

Lecture 50: Block Diagram Reduction (Solved Problem 2)

Lecture 51: Block Diagram Reduction (Solved Problem 3)

Lecture 52: Block Diagram Reduction (Solved Problem 4)

Lecture 53: Introduction to Signal Flow Graphs

Lecture 54: Mason’s Gain Rule

Lecture 55: Mason’s Gain Rule (Solved Example 1)

Lecture 56: Mason’s Gain Rule (Solved Example 2)

Lecture 57: Signal Flow Graphs (Solved Problem 1)

Lecture 58: Signal Flow Graphs (Solved Problem 2)

Lecture 59: Signal Flow Graphs (Solved Problem 3)

Lecture 60: Signal Flow Graphs (Solved Problem 4)

Lecture 61: Limitations of Mason’s Gain Rule

Lecture 62: Modelling of Physical Systems

Lecture 63: Modelling of Electrical Systems (Solved Example 1)

Lecture 64: Modelling of Electrical Systems (Solved Example 2)

Lecture 65: Modelling of Electrical Systems (Solved Problem)

Lecture 66: Modelling of Mechanical Systems

Lecture 67: Translational Mechanical Systems

Lecture 68: Translational Mechanical Systems (Solved Example)

Lecture 69: Translational Mechanical Systems (Solved Problem 1)

Lecture 70: Translational Mechanical Systems (Solved Problem 2)

Lecture 71: Analogous Systems

Lecture 72: Force-Current Analogy

Lecture 73: Equivalent Mechanical Systems

Lecture 74: Analogous Systems (Solved Problem 1)

Lecture 75: Analogous Systems (Solved Problem 2)

Lecture 76: Introduction to Stability Analysis

Lecture 77: Routh-Hurwitz Criteria

Lecture 78: Routh-Hurwitz Criteria (Special Case 1)

Lecture 79: Routh-Hurwitz Criteria (Special Case 2)

Lecture 80: Applications of R-H Criteria (Part 1)

Lecture 81: Applications of R-H Criteria (Part 2)

Lecture 82: R-H Criteria (Solved Problem 1)

Lecture 83: R-H Criteria (Solved Problem 2)

Lecture 84: R-H Criteria (Solved Problem 3)

Lecture 85: R-H Criteria (Solved Problem 4)

Lecture 86: R-H Criteria (Solved Problem 5)

Lecture 87: Time Response Analysis | Chapter-6 | Control Systems | nesoacademy.org

Data Structures (English) (Part 2)

CSE/IT SERIES

Data Structures (English) (Part 2)

   Friday, April 26, 2024   

Starting a new Lecture Notes Series on Data Structures

Youtube Lecture Playlist Credits 

Channel Name: Neso Academy

So Let Us Start to This Journey of Learning 

Data Structures By Lecture Notes together!

Lecture 73: Doubly Linked List (Deleting the Intermediate Node)

Lecture 74: Reversing the Doubly Linked List

Lecture 75: Doubly Linked List (Solved Problem 1)

Lecture 76: Doubly Linked List (Solved Problem 2)

Lecture 77: Why Doubly Linked List?

Lecture 78: Rapid Fire Quiz (Doubly Linked List)

Lecture 79: Introduction to Circular Linked List

Lecture 80: Circular Singly Linked List (Insertion at the Beginning)

Lecture 81: Traversing a Circular Singly Linked List

Lecture 82: Circular Singly Linked List (Insertion at the End)

Lecture 83: Circular Singly Linked List (Insertion between the Nodes)

Lecture 84: Creating a Circular Singly Linked List

Lecture 85: Circular Singly Linked List (Deleting the First Node)

Lecture 86: Circular Singly Linked List (Deleting the Last Node)

Lecture 87: Circular Singly Linked List (Deleting the Intermediate Node)

Lecture 88: Circular Singly Linked List (Counting the Number of Elements)

Lecture 89: Circular Singly Linked List (Searching an Element)

Lecture 90: Circular Doubly Linked List (Insertion at the Beginning)

Lecture 91: Circular Doubly Linked List (Insertion at the End)

Lecture 92: Circular Doubly Linked List (Insertion between the Nodes)

Lecture 93: Circular Doubly Linked List (Deleting the First Node)

Lecture 94: Circular Doubly Linked List (Deleting the Last Node)

Lecture 95: Circular Doubly Linked List (Deleting the Intermediate Node)

Lecture 96: Sorted Singly Linked List (Inserting a New Element)

Lecture 97: Application of Linked List (Polynomial Arithmetic) - Part 1

Lecture 98: Application of Linked List (Polynomial Arithmetic) - Part 2

Lecture 99: Application of Linked List (Addition of Two Polynomials)

Lecture 100: Application of Linked List (Multiplication of Two Polynomials)

Lecture 101: Application of Linked List (Multiplication of Two Polynomials) - Improvements

Lecture 102: Adding Two Numbers using Linked Lists - Part 1

Lecture 103: Adding Two Numbers using Linked Lists - Part 2

Lecture 104: Adding Two Numbers using Linked Lists - Part 3

Lecture 105: Introduction to Stacks

Lecture 106: Array Implementation of Stacks (Part 1)

Lecture 107: Array Implementation of Stacks (Part 2)

Lecture 108: Array Implementation of Stacks (Part 3)

Lecture 109: Array Implementation of Stacks (Part 4)

Lecture 110: Stacks (Important Questions) – Set 1

Lecture 111: Stacks (Important Questions) – Set 2

Lecture 112: Stacks (Program 1) – Part 1

Lecture 113: Stacks (Program 1) – Part 2

Lecture 114: Stacks (Program 1) – Part 3

Lecture 115: Stacks (Program 2) – Part 1

Lecture 116: Stacks (Program 2) – Part 2

Lecture 117: Stacks (Program 3)

Lecture 118: Linked List Implementation of Stacks (Part 1)

Lecture 119: Linked List Implementation of Stacks (Part 2)

Lecture 120: Linked List Implementation of Stacks (Part 3)

Lecture 121: Stacks (Program 4) – Part 1

Lecture 122: Stacks (Program 4) – Part 2

Lecture 123: Stacks (Program 4) – Part 3

Lecture 124: Stacks (Program 4) – Part 4

Lecture 125: Stacks (Program 4) – Part 5

Lecture 126: Stacks (Program 4) – Part 6

Lecture 127: Stacks (Program 4) – Part 7

Lecture 128: Stacks (Program 5)

Lecture 129: Application of Stacks (Nested Brackets) - Part 1

Lecture 130: Application of Stacks (Nested Brackets) - Part 2

Lecture 131: Application of Stacks (Infix to Postfix) - Part 1

Lecture 132: Application of Stacks (Infix to Postfix) - Part 2

Lecture 133: Application of Stacks (Infix to Postfix) - Part 3

Lecture 134: Application of Stacks (Infix to Postfix) - Part 4

Lecture 135: Application of Stacks (Infix to Postfix) - Part 5

Lecture 136: Application of Stacks (Infix to Postfix) - Part 6

Lecture 137: Application of Stacks (Infix to Postfix) - Part 7

Lecture 138: Application of Stacks (Infix to Postfix) - Part 8

Lecture 139: Stacks (GATE Problems) - Set 1

Lecture 140: Stacks (GATE Problems) - Set 2

Lecture 141: Queues | Chapter-7 | Data Structures | nesoacademy.org

Lecture 142: Binary Trees | Chapter-8 | Data Structures | nesoacademy.org

Lecture 143: Binary Search Trees | Chapter-9 | Data Structures | nesoacademy.org

Lecture 144: AVL Trees | Chapter-10 | Data Structures | nesoacademy.org

Data Structures (English) (Part 1)

CSE/IT SERIES

Data Structures (English) (Part 1)

   Friday, April 26, 2024   

Starting a new Lecture Notes Series on Data Structures

Youtube Lecture Playlist Credits 

Channel Name: Neso Academy

So Let Us Start to This Journey of Learning 

Data Structures By Lecture Notes together!

Lecture 1: Introduction to Data Structures

Lecture 2: Data Types vs. Abstract Data Types

Lecture 3: Data Structure Definition & Advantages

Lecture 4: Types of Data Structures

Lecture 5: Basics of Asymptotic Analysis (Part 1)

Lecture 6: Basics of Asymptotic Analysis (Part 2)

Lecture 7: Basics of Asymptotic Analysis (Part 3)

Lecture 8: Basics of Asymptotic Analysis (Part 4)

Lecture 9: Basics of Asymptotic Analysis (Part 5)

Lecture 10: Guidelines for Asymptotic Analysis (Part 1)

Lecture 11: Guidelines for Asymptotic Analysis (Part 2)

Lecture 12: Asymptotic Analysis (Solved Problem 1)

Lecture 13: Asymptotic Analysis (Solved Problem 2)

Lecture 14: Asymptotic Analysis (Solved Problem 3)

Lecture 15: Understanding the Void Pointers

Lecture 16: Understanding the Null Pointers

Lecture 17: Understanding the Dangling Pointers

Lecture 18: Understanding the Wild Pointers

Lecture 19: Basics of Dynamic Memory Allocation

Lecture 20: Dynamic Memory Allocation using malloc()

Lecture 21: Dynamic Memory Allocation using calloc()

Lecture 22: Dynamic Memory Allocation using realloc()

Lecture 23: Releasing the Dynamically Allocated Memory using free()

Lecture 24: Structures and Functions (Part 1)

Lecture 25: Structures and Functions (Part 2)

Lecture 26: Structures and Functions (Part 3)

Lecture 27: Structures and Functions (Part 4)

Lecture 28: Structures and Functions (Part 5)

Lecture 29: Structures and Functions (Part 6)

Lecture 30: Self Referential Structures

Lecture 31: Introduction to Linked List

Lecture 32: Array vs. Single Linked List (In Terms of Representation)

Lecture 33: Creating the Node of a Single Linked List

Lecture 34: Creating a Single Linked List (Part 1)

Lecture 35: Creating a Single Linked List (Part 2)

Lecture 36: Traversing a Single Linked List (Counting the Nodes)

Lecture 37: Traversing a Single Linked List (Printing the Data)

Lecture 38: Traversing the List (Linked List vs. Arrays)

Lecture 39: Single Linked List (Inserting a Node at the End)

Lecture 40: Insertion at the End (Linked List vs. Array) - Part 1

Lecture 41: Insertion at the End (Linked List vs. Array) - Part 2

Lecture 42: Single Linked List (Inserting a Node at the Beginning)

Lecture 43: Inserting the Data at the Beginning of Single Linked Lists (Possible Mistake)

Lecture 44: Inserting the Data at the Beginning of Single Linked List (2nd Method)

Lecture 45: Inserting the Data at the Beginning (Singly Linked List vs. Array)

Lecture 46: Single Linked List (Inserting a Node at a Certain Position)

Lecture 47: Insertion at a Certain Position (Singly Linked List vs. Arrays) - Part 1

Lecture 48: Insertion at a Certain Position (Singly Linked List vs. Arrays) - Part 2

Lecture 49: Single Linked List (Deleting the First Node)

Lecture 50: Single Linked List (Deleting the Last Node)

Lecture 51: Single Linked List (Deleting the Last Node using Single Pointer)

Lecture 52: Deletion at the End (Singly Linked List vs. Array)

Lecture 53: Deletion at the Beginning (Single Linked List vs. Array)

Lecture 54: Single Linked List (Deleting the Node at a Particular Position)

Lecture 55: Deleting the Entire Single Linked List

Lecture 56: Reverse a Single Linked List

Lecture 57: Singly Linked List (Solved Problem 1)

Lecture 58: Singly Linked List (Solved Problem 2)

Lecture 59: Singly Linked List (Solved Problem 3)

Lecture 60: Singly Linked List (Solved Problem 4)

Lecture 61: Singly Linked List (Solved Problem 5)

Lecture 62: Singly Linked List (Solved Problem 6)

Lecture 63: Rapid Fire Quiz (Singly Linked List)

Lecture 64: Introduction to Doubly Linked List

Lecture 65: Doubly Linked List (Inserting a Node in an Empty List)

Lecture 66: Doubly Linked List (Insertion at the Beginning)

Lecture 67: Doubly Linked List (Insertion at the End)

Lecture 68: Doubly Linked List (Insertion between the Nodes) - Part 1

Lecture 69: Doubly Linked List (Insertion between the Nodes) - Part 2

Lecture 70: Creating an Entire Doubly Linked List

Lecture 71: Doubly Linked List (Deleting the First Node)

Lecture 72: Doubly Linked List (Deleting the Last Node)

C Programming (English) (Part 3)

CSE/IT SERIES

C Programming (English) (Part 3)

   Thursday, April 25, 2024   

Starting a new Lecture Notes Series on C Programming

Youtube Lecture Playlist Credits 

Channel Name: Neso Academy

So Let Us Start to This Journey of Learning 

C Programming By Lecture Notes together!

Lecture 115: Passing Array as an Argument to a Function

Lecture 116: Using Pointers to Print 2D Arrays

Lecture 117: Processing the Multidimensional Array Elements (or) Address Arithmetic of Multidimensional Arrays

Lecture 118: Pointers (Program 3)

Lecture 119: Pointers (Program 4)

Lecture 120: Pointer Pointing to an Entire Array

Lecture 121: Pointer Pointing to an Entire Array (Solved Problem)

Lecture 122: Pointers (Program 5)

Lecture 123: Pointers (Program 6)

Lecture 124: Pointers (Program 7)

Lecture 125: Pointers (Program 8)

Lecture 126: Pointers (Program 9)

Lecture 127: Basics of String Literals

Lecture 128: Storing the String Literals

Lecture 129: Performing Operations on String Literals

Lecture 130: String Literal vs. Character Constant

Lecture 131: Declaring and Initializing String Variables

Lecture 132: Writing Strings using printf and puts Functions

Lecture 133: Reading Strings using scanf and gets Functions

Lecture 134: Designing The Input Function using getchar()

Lecture 135: putchar() Function in C

Lecture 136: Strings (Solved Problem 1)

Lecture 137: C String Library and String Copy Function - strcpy()

Lecture 138: String Length Function - strlen()

Lecture 139: String Concatenate Functions - strcat() & strncat()

Lecture 140: String Comparison Function - strcmp()

Lecture 141: Array of Strings

Lecture 142: Strings (Solved Problem 2)

Lecture 143: Strings (Solved Problem 3)

Lecture 144: Strings (Solved Problem 4)

Lecture 145: Strings (Solved Problem 5)

Lecture 146: Strings (Solved Problem 6)

Lecture 147: Function Pointers in C

Lecture 148: Application of Function Pointers in C

Lecture 149: Introduction to Structures in C

Lecture 150: Declaring Structure Variables

Lecture 151: Structure Types (Using Structure Tags)

Lecture 152: Structure Types (Using typedef)

Lecture 153: Initializing & Accessing the Structure Members

Lecture 154: Designated Initialization in Structures

Lecture 155: Declaring an Array of Structure

Lecture 156: Pointer to Structure Variable

Lecture 157: Structure Padding in C

Lecture 158: Structure Packing in C

Lecture 159: Structures in C (Solved Problem 1)

Lecture 160: Structures in C (Solved Problem 2)

Lecture 161: Structures in C (Solved Problem 3)

Lecture 162: Introduction to Unions in C

Lecture 163: Unions in C (Solved Problem 1)

Lecture 164: Application of Unions (Part 1)

Lecture 165: Application of Unions (Part 2)

Lecture 166: Enumerations in C

Lecture 167: Program to Find Area of Rectangle Using Structures

Lecture 168: Structures & Unions in C (Solved Problem)

Lecture 169: File Handling | Chapter-14 | C Programming | nesoacademy.org

C Programming (English) (Part 2)

CSE/IT SERIES

C Programming (English) (Part 2)

   Thursday, April 25, 2024   

Starting a new Lecture Notes Series on C Programming

Youtube Lecture Playlist Credits 

Channel Name: Neso Academy

So Let Us Start to This Journey of Learning 

C Programming By Lecture Notes together!

Lecture 58: Special Programs in C − Check Leap Year

Lecture 59: Special Programs in C − Check If The Number Is Perfect Number

Lecture 60: Introduction to Functions in C

Lecture 61: Function Declaration in C

Lecture 62: Function Definition in C

Lecture 63: Call By Value & Call By Reference in C

Lecture 64: Functions (Solved Question 1)

Lecture 65: Functions (Solved Question 2)

Lecture 66: Functions (Solved Question 3)

Lecture 67: Static Functions in C

Lecture 68: Static and Dynamic Scoping (Part-1)

Lecture 69: Static and Dynamic Scoping (Part-2)

Lecture 70: Static and Dynamic Scoping (Part-3)

Lecture 71: Static and Dynamic Scoping (Part-4)

Lecture 72: Static and Dynamic Scoping (Solved Question 1)

Lecture 73: Static and Dynamic Scoping (Solved Question 2)

Lecture 74: Recursion in C

Lecture 75: How to write Recursive Functions

Lecture 76: Types of Recursion (Part 1) | Direct & Indirect Recursion

Lecture 77: Types of Recursion (Part 2) | Tail & Non-tail Recursion

Lecture 78: Advantage and Disadvantage of Recursion

Lecture 79: Recursion (Solved Problem 1)

Lecture 80: Recursion (Solved Problem 2)

Lecture 81: Recursion (Solved Problem 3)

Lecture 82: Recursion (Solved Problem 4)

Lecture 83: Recursion (Solved Problem 5)

Lecture 84: C Programming (Rapid Fire Quiz-2)

Lecture 85: Definition of Array

Lecture 86: Declaration of Array

Lecture 87: Accessing Array Elements

Lecture 88: Initializing an Array

Lecture 89: Designated Initialization of Arrays

Lecture 90: Arrays in C (Solved Problem 1)

Lecture 91: Arrays in C (Solved Problem 2)

Lecture 92: Counting Array Elements using sizeof() Operator

Lecture 93: Introduction to Multidimensional Arrays

Lecture 94: Introduction to Two-Dimensional (2D) Arrays

Lecture 95: Introduction to Three-Dimensional (3D) Arrays

Lecture 96: Multidimensional Arrays (Solved Problem)

Lecture 97: C Program for Matrix Multiplication (Part 1)

Lecture 98: C Program for Matrix Multiplication (Part 2)

Lecture 99: Constant Arrays in C

Lecture 100: Variable Length Arrays in C

Lecture 101: Introduction to Pointers in C

Lecture 102: Declaring & Initializing Pointers in C

Lecture 103: Value of Operator in Pointers

Lecture 104: Pointer Assignment

Lecture 105: Pointer Application (Finding the Largest & Smallest Elements in an Array)

Lecture 106: Returning Pointers

Lecture 107: Pointers (Important Questions)

Lecture 108: Pointer Arithmetic (Addition)

Lecture 109: Pointer Arithmetic (Subtraction)

Lecture 110: Pointer Arithmetic (Increment & Decrement)

Lecture 111: Pointer Arithmetic (Comparing the Pointers)

Lecture 112: Pointers (Program 1) | Sum of Array Elements using Pointers

Lecture 113: Using Array Name as a Pointer

Lecture 114: Pointers (Program 2) | Reversing a Series of Numbers using Pointers

C Programming (English) (Part 1)

CSE/IT SERIES

C Programming (English) (Part 1)

   Thursday, April 25, 2024   

Starting a new Lecture Notes Series on C Programming

Youtube Lecture Playlist Credits 

Channel Name: Neso Academy

So Let Us Start to This Journey of Learning 

C Programming By Lecture Notes together!

Lecture 1: C Programming – Features & The First C Program

Lecture 2: Introduction to Variables

Lecture 3: Variable Naming Conventions

Lecture 4: Basic Output Function – printf

Lecture 5: Fundamental Data Types − Integer (Part 1)

Lecture 6: Fundamental Data Types − Integer (Part 2)

Lecture 7: Exceeding The Valid Range of Data Types

Lecture 8: Fundamental Data Types − Character

Lecture 9: Fundamental Data Types − Float, Double & Long Double

Lecture 10: C Programming (Important Questions Set 1)

Lecture 11: Scope of Variables - Local vs Global

Lecture 12: Variable Modifiers − Auto & Extern

Lecture 13: Variable Modifiers − Register

Lecture 14: Variable Modifiers − Static

Lecture 15: Constants in C (Part 1)

Lecture 16: Constants in C (Part 2)

Lecture 17: C Programming (Important Questions Set 2)

Lecture 18: Basic Input Function – scanf

Lecture 19: C Programming (Important Questions Set 3)

Lecture 20: Introduction to Operators in C

Lecture 21: Arithmetic Operators in C

Lecture 22: Increment and Decrement Operators in C (Part 1)

Lecture 23: Increment and Decrement Operators in C (Part 2)

Lecture 24: Relational Operators in C

Lecture 25: Logical Operators in C

Lecture 26: Bitwise Operators in C (Part 1)

Lecture 27: Bitwise Operators in C (Part 2)

Lecture 28: Bitwise Operators in C (Part 3)

Lecture 29: Bitwise Operators in C (Part 4)

Lecture 30: Assignment Operators in C

Lecture 31: Conditional Operator in C

Lecture 32: Comma Operator in C

Lecture 33: Precedence and Associativity of Operators

Lecture 34: Operators in C (Solved Problem 1)

Lecture 35: Operators in C (Solved Problem 2)

Lecture 36: C Programming (Rapid Fire Quiz-1)

Lecture 37: Conditionals (if-else, Nested if and else if)

Lecture 38: Conditionals (Switch)

Lecture 39: for and while Loops

Lecture 40: do-while Loop

Lecture 41: Loop Control Statements − break and continue

Lecture 42: Conditionals and Loops (Solved Problem 1)

Lecture 43: Conditionals and Loops (Solved Problem 2)

Lecture 44: Conditionals and Loops (Solved Problem 3)

Lecture 45: Conditionals and Loops (Solved Problem 4)

Lecture 46: Conditionals and Loops (Solved Problem 5)

Lecture 47: Special Programs in C − Pyramid of Stars

Lecture 48: Special Programs in C − Check If The Number Is Palindrome Number

Lecture 49: Special Programs in C− Check If The Number Is Armstrong Number

Lecture 50: Special Programs in C− Check If The Number Is Strong Number

Lecture 51: Special Programs in C − Check If The Number Is Prime Number

Lecture 52: Special Programs in C − Adding Two Numbers Without Using The Plus Operator

Lecture 53: Special Programs in C − Adding Two Numbers Without Using The Plus Operator (Half Adder Method)

Lecture 54: Special Programs in C − Fibonacci Series

Lecture 55: Special Programs in C − Floyd's Triangle

Lecture 56: Special Programs in C − Binary to Decimal Conversion

Lecture 57: Special Programs in C − Calculating Power of an Integer