C Programming & Data Structures - Full Course

Data Structures using C Programming & Data Structures includes the concepts of C programming and data structures required for the var...

Data Structures using C

Programming & Data Structures includes the concepts of C programming and data structures required for the various computer science examinations. This course has been created keeping in mind the previous year question papers of GATE and the current trends followed in GATE. These lectures are also useful for college going students and students who are preparing for campus interviews.

Following is the syllabus.

C Programming:

1. Introduction to the course.
2. Variables
3. Global vs Local variables.
4. Data types
5. Operators in C
6. Conditionals and loops
7. Functions
8. Recursion
9. Pointers and arrays
10. Strings
11. Structure and union
12. File Handling

-------------------- Video Titles ----------------

1. Introduction to Programming and Data Structures
2. C Programming – Features & The First C Program
3. Introduction to Variables
4. Variable Naming Conventions
5. Basic Output Function – printf
6. Fundamental Data Types − Integer (Part 1)
7. Fundamental Data Types − Integer (Part 2)
8. Exceeding The Valid Range of Data Types
9. Fundamental Data Types − Character
10. Fundamental Data Types − Float, Double & Long Double
11. C Programming (Important Questions Set 1)
12. Scope of Variables - Local vs Global
13. Variable Modifiers − Auto & Extern
14. Variable Modifiers − Register
15. Variable Modifiers − Static
16. Constants in C (Part 1)
17. Constants in C (Part 2)
18. C Programming (Important Questions Set 2)
19. Basic Input Function – scanf
20. C Programming (Important Questions Set 3)
21. Introduction to Operators in C
22. Arithmetic Operators in C
23. Increment and Decrement Operators in C (Part 1)
24. Increment and Decrement Operators in C (Part 2)
25. Relational Operators in C
26. Logical Operators in C
27. Bitwise Operators in C (Part 1)
28. Bitwise Operators in C (Part 2)
29. Bitwise Operators in C (Part 3)
30. Bitwise Operators in C (Part 4)
31. Assignment Operators in C
32. Conditional Operator in C
33. Comma Operator in C
34. Precedence and Associativity of Operators
35. Operators in C (Solved Problem 1)
36. Operators in C (Solved Problem 2)
37. C Programming (Rapid Fire Quiz-1)
38. Conditionals (if-else, Nested if and else if)
39. Conditionals (Switch)
40. for and while Loops
41. do-while Loop
42. Loop Control Statements − break and continue
43. Conditionals and Loops (Solved Problem 1)
44. Conditionals and Loops (Solved Problem 2)
45. Conditionals and Loops (Solved Problem 3)
46. Conditionals and Loops (Solved Problem 4)
47. Conditionals and Loops (Solved Problem 5)
48. Special Programs in C − Pyramid of Stars
49. Special Programs in C − Check If The Number Is Palindrome Number
50. Special Programs in C− Check If The Number Is Armstrong Number
51. Special Programs in C− Check If The Number Is Strong Number
52. Special Programs in C − Check If The Number Is Prime Number
53. Special Programs in C − Adding Two Numbers Without Using The Plus Operator
54. Special Programs in C − Adding Two Numbers Without Using The Plus Operator (Half Adder Method)
55. Special Programs in C − Fibonacci Series
56. Special Programs in C − Floyd's Triangle
57. Special Programs in C − Binary to Decimal Conversion
58. Special Programs in C − Calculating Power of an Integer
59. Special Programs in C − Check Leap Year
60. Special Programs in C − Check If The Number Is Perfect Number
61. Introduction to Functions in C
62. Function Declaration in C
63. Function Definition in C
64. Call By Value & Call By Reference in C
65. Functions (Solved Question 1)
66. Functions (Solved Question 2)
67. Functions (Solved Question 3)
68. Static Functions in C
69. Static and Dynamic Scoping (Part-1)
70. Static and Dynamic Scoping (Part-2)
71. Static and Dynamic Scoping (Part-3)
72. Static and Dynamic Scoping (Part-4)
73. Static and Dynamic Scoping (Solved Question 1)
74. Static and Dynamic Scoping (Solved Question 2)
75. Recursion in C
76. How to write Recursive Functions
77. Types of Recursion (Part 1) | Direct & Indirect Recursion
78. Types of Recursion (Part 2) | Tail & Non-tail Recursion
79. Advantage and Disadvantage of Recursion
80. Recursion (Solved Problem 1)
81. Recursion (Solved Problem 2)
82. Recursion (Solved Problem 3)
83. Recursion (Solved Problem 4)
84. Recursion (Solved Problem 5)
85. C Programming (Rapid Fire Quiz-2)
86. Definition of Array
87. Declaration of Array
88. Accessing Array Elements
89. Initializing an Array
90. Designated Initialization of Arrays
91. Arrays in C (Solved Problem 1)
92. Arrays in C (Solved Problem 2)
93. Count Array Elements using sizeof() Operator
94. Introduction to Multidimensional Arrays
95. Introduction to Two-Dimensional (2D) Arrays
96. Introduction to Three-Dimensional (3D) Arrays
97. Multidimensional Arrays (Solved Problem)
98. C Program for Matrix Multiplication (Part 1)
99. C Program for Matrix Multiplication (Part 2)
100. Constant Arrays in C
101. Variable Length Arrays in C
102. Introduction to Pointers in C
103. Declaring & Initializing Pointers in C
104. Value of Operator in Pointers
105. Pointer Assignment
106. Pointer Application (Finding the Largest & Smallest Elements in an Array)
107. Returning Pointers
108. Pointers (Important Questions)
109. Pointer Arithmetic (Addition)
110. Pointer Arithmetic (Subtraction)
111. Pointer Arithmetic (Increment & Decrement)
112. Pointer Arithmetic (Comparing the Pointers)
113. Pointers (Program 1) | Sum of Array Elements using Pointers
114. Using Array Name as a Pointer
115. Pointers (Program 2) | Reverse a Series of Numbers using Pointers
116. Passing Array as an Argument to a Function
117. Using Pointers to Print 2D Arrays
118. Processing the Multidimensional Array Elements (or) Address Arithmetic of Multidimensional Arrays
119. Pointers (Program 3)
120. Pointers (Program 4)
121. Pointer Pointing to an Entire Array
122. Pointer Pointing to an Entire Array (Solved Problem)
123. Pointers (Program 5)
124. Pointers (Program 6)
125. Pointers (Program 7)
126. Pointers (Program 8)
127. Pointers (Program 9)
128. Basics of String Literals
129. Storing the String Literals
130. Performing Operations on String Literals
131. String Literal vs. Character Constant
132. Declaring and Initializing String Variables
133. Writing Strings using printf and puts Functions
134. Reading Strings using scanf and gets Functions
135. Designing The Input Function using getchar()
136. putchar() Function in C
137. Strings (Solved Problem 1)
138. C String Library and String Copy Function - strcpy()
139. String Length Function - strlen()
140. String Concatenate Functions - strcat() & strncat()
141. String Comparison Function - strcmp()
142. Array of Strings
143. Strings (Solved Problem 2)
144. Strings (Solved Problem 3)
145. Strings (Solved Problem 4)
146. Strings (Solved Problem 5)
147. Strings (Solved Problem 6)
148. Function Pointers in C
149. Application of Function Pointers in C
150. Introduction to Structures in C
151. Declaring Structure Variables
152. Structure Types (Using Structure Tags)
153. Structure Types (Using typedef)
154. Initializing & Accessing the Structure Members
155. Designated Initialization in Structures
156. Declaring an Array of Structure
157. Pointer to Structure Variable
158. Structure Padding in C
159. Structure Packing in C
160. Structures in C (Solved Problem 1)
161. Structures in C (Solved Problem 2)
162. Structures in C (Solved Problem 3)
163. Introduction to Unions in C
164. Unions in C (Solved Problem 1)
165. Application of Unions (Part 1)
166. Application of Unions (Part 2)
167. Enumerations in C
168. Program to Find Area of Rectangle Using Structures
169. Structures & Unions in C (Solved Problem)
170. File Handling | Chapter-14 | C Programming | nesoacademy.org

-------------------- xxxxxxxxxx ----------------

Data Structures:

1. Introduction to Data Structures
2. Data Types vs. Abstract Data Types
3. Data Structure Definition & Advantages
4. Types of Data Structures
5. Basics of Asymptotic Analysis
6. Void Pointers
7. Null Pointers
8. Dangling Pointers
9. Wild Pointers
10. Basics of Dynamic Memory Allocation
11. Dynamic Memory Allocation using malloc(), calloc(), realloc()
12. Releasing the Dynamically Allocated Memory using free()
13. Structures and Functions
14. Self Referential Structures

-------------------- Video Titles ----------------

1. Introduction to Data Structures
2. Data Types vs. Abstract Data Types
3. Data Structure Definition & Advantages
4. Types of Data Structures
5. Basics of Asymptotic Analysis (Part 1)
6. Basics of Asymptotic Analysis (Part 2)
7. Basics of Asymptotic Analysis (Part 3)
8. Basics of Asymptotic Analysis (Part 4)
9. Basics of Asymptotic Analysis (Part 5)
10. Guidelines for Asymptotic Analysis (Part 1)
11. Guidelines for Asymptotic Analysis (Part 2)
12. Asymptotic Analysis (Solved Problem 1)
13. Asymptotic Analysis (Solved Problem 2)
14. Asymptotic Analysis (Solved Problem 3)
15. Understanding the Void Pointers
16. Understanding the Null Pointers
17. Understanding the Dangling Pointers
18. Understanding the Wild Pointers
19. Basics of Dynamic Memory Allocation
20. Dynamic Memory Allocation using malloc()
21. Dynamic Memory Allocation using calloc()
22. Dynamic Memory Allocation using realloc()
23. Releasing the Dynamically Allocated Memory using free()
24. Structures and Functions (Part 1)
25. Structures and Functions (Part 2)
26. Structures and Functions (Part 3)
27. Structures and Functions (Part 4)
28. Structures and Functions (Part 5)
29. Structures and Functions (Part 6)
30. Self Referential Structures

-------------------- xxxxxxxxxx ----------------