Fill this form to get access to our Udemy course for free :
Download Our IDK here :
For help with Installation please refer
Hi Squad… We have launched IDK our own software to write and compile code. It comes built-in with compilers for multiple languages. We would really appreciate if you give it a try and let us know your feedback.
Timestamps:
0:00:00 – Introduction
0:13:06 – int & float
0:22:50 – char & double
0:29:54 – Arithmetic Operators(I)
0:41:52 – Arithmetic Operators(II)
0:50:16 – Relational & Logical Operators
1:06:11 – Scanf
1:13:28 – if else
1:24:24 – Positive or Negative
1:38:22 – Leap Year
1:53:45 – getch()
2:03:49 – Calculator App
2:14:57 – Switch Case
2:25:37 – For Loop
2:39:26 – While Loop
2:52:49 – do while Loop
3:00:26 – Sum of the digits
3:18:13 – Armstrong Number
3:17:54 – Palindrome Number
3:27:07 – Prime Number
3:35:03 – Nested Loop
3:50:13 – Arrays
4:08:30 – Sum & Average of elements
4:19:27 – Maximum and Minimum Elements
4:26:16 – Strings in C
4:38:59 – 2D Arrays
4:48:39 – Addition of Matrix & Transpose
4:57:13 – Functions
5:07:37 – Applications of Functions
5:14:28 – Recursion
5:23:49 – Pointers
5:31:44 – Call by Value & Reference
5:40:07 – Structures
5:49:52 – Unions
5:54:56 – File Handling(I)
6:11:26 – File Handling(II)
6:19:37 – Dynamic Memory Allocation
source
![Major Lazer & DJ Maphorisa – Particula (ft. Nasty C, Ice Prince, Patoranking & Jidenna)[Music Video]](https://3cantinhodovideo.lc7x.com/wp-content/uploads/2026/10/1791522827_maxresdefault-480x270.jpg "Major Lazer & DJ Maphorisa – Particula (ft. Nasty C, Ice Prince, Patoranking & Jidenna)[Music Video]")
Links in Description as comments don't support links
Hi Squad… We have launched IDK our own software to write and compile code. It comes built-in with compilers for multiple languages. You can download it at https://codeio.dev/idk. We would really appreciate if you give it a try and let us know your feedback.
For help with Installation please refer
https://youtu.be/hzd-JI9wBQ0
Hope you like our IDK
Any biology students
best video better then college lectures
Learning after going to college for 1 year
10 11 9
Any one in 2026
what complier he is using?
BRO C PROGRAMMING SOFTWARE EPPADI PC INSTALL PANNURATHU SOLLU GA BRO
Anna na vs code la c code eluthi try pannituu irukee …fullahvee error ne varuthuu ?
Void main eppidi na varum
biology students odda kaduvale
2:25:53
I blinked and the video was over.
anna neega ippo enna work pannuringa
bro i can understand everything easy thank you
Any IT student
Genter ,I can use the touble %
Age ,integer
# include <stdio.h>
# include <conio.h>
viot main ( );
{
char a = 'F';
printf("%c",a);
getch( );
out put
F
Gender =char , %c
Age =int, %d
started at 2/09/2026
A Biology student took computer science as a subject 😬
Maths bio eduthutu, IT department la eppadi polaikiirennaa naa athuku nee thaan bro😅😂❤ Karanam
leap year program la error varuthu bro
anna C epdi download pandradhunu video podunga anna
What IDE does he use?
Thank you sir
10,11 and 10,9
Bio maths eduthuttu clg la ECE eduthavanga attendance podunga 😂😂
😚🥰🥰
Cs group hey Inge tha irukku😅
include <stdio.h>
#include <stdlib.h>
int main()
{
int year;
printf("enter tha year:");
scanf("%d",&year);
if(year%100==0)
{
printf("loop year");
}
else if(year%400==0)
{
printf("loop year");
}
else if(year%4==0)
{
printf("loop year");
}
else
{
printf("not loop year");
}
return 0;
}
Bro write a wrong this program
thanks for this vedio bro
1. Postorder Traversal Program
This program combines the node setup with the postorder traversal logic and execution block.
#include <stdio.h>
#include <stdlib.h>
struct node {
int data;
struct node *left, *right;
};
// Create a new node
struct node* create(int value) {
struct node newnode;
newnode = (struct node)malloc(sizeof(struct node));
newnode->data = value;
newnode->left = NULL;
newnode->right = NULL;
return newnode;
}
// Insert node
struct node* insert(struct node *root, int value) {
if (root == NULL)
return create(value);
if (value < root->data)
root->left = insert(root->left, value);
else
root->right = insert(root->right, value);
return root;
}
// Postorder: Left -> Right -> Root
void postorder(struct node *root)
{
if (root != NULL)
{
postorder(root->left);
postorder(root->right);
printf("%d ", root->data);
}
}
int main()
{
struct node *root = NULL;
root = insert(root, 50);
insert(root, 30);
insert(root, 70);
insert(root, 20);
insert(root, 40);
printf("Postorder Traversal: ");
postorder(root);
return 0;
}
2. Preorder Traversal Program
This program combines the node setup with the preorder traversal logic and execution block.
#include <stdio.h>
#include <stdlib.h>
struct node {
int data;
struct node *left, *right;
};
// Create a new node
struct node* create(int value) {
struct node newnode;
newnode = (struct node)malloc(sizeof(struct node));
newnode->data = value;
newnode->left = NULL;
newnode->right = NULL;
return newnode;
}
// Insert node
struct node* insert(struct node *root, int value) {
if (root == NULL)
return create(value);
if (value < root->data)
root->left = insert(root->left, value);
else
root->right = insert(root->right, value);
return root;
}
// Preorder: Root -> Left -> Right
void preorder(struct node *root)
{
if (root != NULL)
{
printf("%d ", root->data);
preorder(root->left);
preorder(root->right);
}
}
int main()
{
struct node *root = NULL;
root = insert(root, 50);
insert(root, 30);
insert(root, 70);
insert(root, 20);
insert(root, 40);
printf("Preorder Traversal: ");
preorder(root);
return 0;
}
3. Inorder Traversal Program
This program combines the node setup with the inorder traversal logic and execution block.
#include <stdio.h>
#include <stdlib.h>
struct node {
int data;
struct node *left, *right;
};
// Create a new node
struct node* create(int value) {
struct node newnode;
newnode = (struct node)malloc(sizeof(struct node));
newnode->data = value;
newnode->left = NULL;
newnode->right = NULL;
return newnode;
}
// Insert node
struct node* insert(struct node *root, int value) {
if (root == NULL)
return create(value);
if (value < root->data)
root->left = insert(root->left, value);
else
root->right = insert(root->right, value);
return root;
}
// Inorder traversal: Left -> Root -> Right
void inorder(struct node *root) {
if (root != NULL) {
inorder(root->left);
printf("%d ", root->data);
inorder(root->right);
}
}
int main() {
struct node *root = NULL;
root = insert(root, 50);
insert(root, 30);
insert(root, 70);
insert(root, 20);
insert(root, 40);
printf("Inorder Traversal: ");
inorder(root);
return 0;
}
307045….
10 11 10
Py student learning c !
2:02:16 bro why can we use nested if
Biology students lam enda cse edukiringa 😂
🙏
Anyone today 😂
10 11, 10 9