Welcome to your one-stop destination for mastering the art of full stack web development! With over 23 years of experience in crafting websites, building apps, and managing IT projects, I'm excited to share my extensive knowledge and insights to help you become a successful developer.
Check out my premium course "Introduction to Drupal CMS" at www.udemy.com/course/introduction-to-drupal-cms/?referralCode=D790F5F15F6FFA486ECF
Find me directly on Discord: discord.gg/DrCc65cV7k
I'm here to support your journey!
Explore a diverse range of topics on my channel, including: 🐧 Linux (Ubuntu) 🐘 PHP (Drupal & Laravel) 🌐 HTML 🎨 CSS (TailwindCSS) 🔧 JavaScript
Join our growing community by subscribing today, and stay up-to-date with the latest in full stack web development!
Thanks... not straight forward to do, yet you've made it simple to understand. Just one thing... is it possible to make something like a default instead of having to specify it in className ? And thanks again for the video.
Thank you so much. You made this so easy for me. I always search for videos whenever I want to use fonts. This is because I don't seem to remember all the procedures but with this simplified, I'll always remember the process. Thanks to you...And so sorry for the flu. I hope you've treated it.
HI. Thanks for sharing the video. The issue I got thought is that mine's taking WAYYYYY too long. I'm currently over an hour and 10mins now. Is this normal please? Thank you.
I just installed Ubuntu 22.04 in a hyper-v this afternoon and it took 15-ish minutes. Does over an hour include the download? That is definitely a long time. What is your systems specs? And hi and thanks for watching!
Hello. I recorded a quick Python setup video here: ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-uJq98hixGRI.html If that's not what you meant or want help with someting else feel free to comment again or come join the Discord server at discord.gg/bkP9N8xxBj
#include <stdio.h> #include <stdlib.h> #include <string.h> typedef struct Node { int usn; char name[50]; char branch[50]; int sem; long phno; struct Node* next; } Node; Node* createList(int n) { Node* head = NULL; Node* temp = NULL; for(int i = 0; i < n; i++) { temp = (Node*) malloc(sizeof(Node)); printf("Enter USN: "); scanf("%d", &temp->usn); printf("Enter Name: "); scanf("%s", temp->name); printf("Enter Branch: "); scanf("%s", temp->branch); printf("Enter Sem: "); scanf("%d", &temp->sem); printf("Enter PhNo: "); scanf("%ld", &temp->phno); temp->next = head; head = temp; } return head; } void displayList(Node* head) { Node* temp = head; int count = 0; while(temp != NULL) { printf("USN: %d ", temp->usn); printf("Name: %s ", temp->name); printf("Branch: %s ", temp->branch); printf("Sem: %d ", temp->sem); printf("PhNo: %ld ", temp->phno); printf(" "); temp = temp->next; count++; } printf("Total nodes: %d ", count); } int main() { int choice, n; Node* head = NULL; printf("Enter your choice: "); printf("1. Create a SLL of N Students data by using front insertion. "); printf("2. Display the status of SLL and count the number of nodes in it. "); printf("0. Exit. "); scanf("%d", &choice); while(choice != 0) { switch(choice) { case 1: printf("Enter the number of students: "); scanf("%d", &n); head = createList(n); break; case 2: if(head == NULL) { printf("No students data found. Please create the list first. "); } else { displayList(head); } break; default: printf("Invalid choice. Please try again. "); } printf(" Enter your choice: "); printf("1. Create a SLL of N Students data by using front insertion. "); printf("2. Display the status of SLL and count the number of nodes in it. "); printf("0. Exit. "); scanf("%d", &choice); } return 0; }. 11
#include<stdio.h> // function prototypes void push(int arr[], int top[], int val); int pop(int arr[], int top[]); void enqueue(int arr[], int front[], int rear[], int val); int dequeue(int arr[], int front[], int rear[]); void printArr(int arr[], int size); // Main function int main() { int n, i, choice, val; int stackTop = -1, queueFront = 0, queueRear = 0; int stackArr[50], queueArr[50]; printf("Enter the size of array: "); scanf("%d", &n); printf("Choose the operation you want to perform on array: "); printf("1. Push/Enqueue an element. "); printf("2. Pop/Dequeue an element. "); printf("3. Print the array. "); printf("4. Exit. "); while(1) { printf("Enter your choice: "); scanf("%d", &choice); switch(choice) { case 1: printf("Enter the value to be pushed/enqueued: "); scanf("%d", &val); push(stackArr, &stackTop, val); enqueue(queueArr, &queueFront, &queueRear, val); break; case 2: if(stackTop == -1 && queueFront == queueRear) { printf("Both stack and queue are empty. Cannot pop/dequeue. "); } else { printf("Popped element from stack: %d ", pop(stackArr, &stackTop)); printf("Dequeued element from queue: %d ", dequeue(queueArr, &queueFront, &queueRear)); } break; case 3: printf("Elements in the array are: "); printArr(stackArr, n); break; case 4: exit(0); default: printf("Invalid choice. Please enter a valid choice. "); } } return 0; } // function definitions void push(int arr[], int top[], int val) { if(*top == 49) { printf("Stack overflow. Cannot push %d onto stack. ", val); return; } arr[++(*top)] = val; } int pop(int arr[], int top[]) { if(*top == -1) { printf("Stack underflow. Cannot pop from stack. "); return -1; } return arr[(*top)--]; } void enqueue(int arr[], int front[], int rear[], int val) { if(*rear == 49) { printf("Queue overflow. Cannot enqueue %d into queue. ", val); return; } arr[(*rear)++] = val; } int dequeue(int arr[], int front[], int rear[]) { if(*front == *rear) { printf("Queue underflow. Cannot dequeue from queue. "); return -1; } return arr[(*front)++]; } void printArr(int arr[], int size) { for(int i = 0; i < size; i++) { printf("%d ", arr[i]); } printf(" "); }. 17
Sorry for the neglect meat bags. How can I restore some confidence in the channel? Don't call you meat bags? Who's struggling with a problem in language Z in WHO's framework?
Hi, nice job so far. One thing: you don't need to clear cache every time you change something in twig file. You can set this configuration after that nothing will be cached in your local file while you working on changing twig files. It makes your like much easier. twig.config: debug: true auto_reload: true cache: false
I agree, there was a lot of time wasted on teaching vim. I followed along entirely in vscode, which made it super easy to edit file and have multiple instances of bash running in the terminal. Would have liked to see some JS work done too.