Pointers in C Programming – Master the C Language
- CategoryOther
- TypeTutorials
- LanguageEnglish
- Total size6.8 GB
- Uploaded Bytutsnode
- Downloads115
- Last checkedOct. 12th '21
- Date uploadedOct. 10th '21
- Seeders 23
- Leechers19
Description
Introduction
C programming language still remains one of the most popular and used languages in 2021.
There is a high demand for C developers in the market – at both large companies as well as startups. Thus, having good C programming skills can give you great career options in different industries, such as:
– Cyber Security.
– Smart Homes & Smart Cities.
– Drones.
– And especially in Embedded Systems where you have Sensors and Micro-Controllers.
What you will learn in this course?
There is an ‘ancient’ phrase saying “to become an expert in C – you need to master pointers”.
This course is designed to take your basic knowledge of pointers (one of the most significant topics) to the next level. The goal is to take the basic skills you’ve gained so far in C programming and take this knowledge to a whole new level.
The course explains pointers in-depth, from different angles, and with various visualizations and illustrations – that should make the learning process of pointers much easier and fun for you.
After completing this course you will gain plenty of new skills and knowledge that may improve your chances of getting a job position as a C Developer as well as increasing your chances to pass the exam (if you’re still a student).
What’s different about this course?
Vlad Budnitski will be your instructor for this course.
He has years of experience working as a Software Developer (also working with complex systems developed in C language). As well as 3 years of experience teaching C Programming for Beginners and Advanced C Programming in College.
So you got lucky on this one because you will get knowledge from a practical software developer and experienced instructor.
You will get a handpicked, concise, and straight to the point material that you will be amazed by the way these complicated pointers can be taught.
This course is also guided with concrete exercises, challenges, and full solution videos – that will help you to practice the materials.
Who’s this course for?
First of all, this course is not for “absolute beginners” and it requires you to have at least the basic knowledge of programming. It’s assumed you have some knowledge of the basics in C – preferably having completed our “C Programming for Beginners” course (here on Udemy).
This course is great both for students in college as well as graduates who need to learn and understand pointers in depth.
Do you still have got doubts?
That’s OK. Pointers can get us all confused to some extent… If you’re still unsure if this course is exactly what you’re looking for, feel free to go over the full detailed curriculum. Then, enroll in the course and be sure that you’ve done a great decision to improve your knowledge in pointers and to become a better C developer.
Who this course is for:
Basic knowledge (and Beyond) C Developers
Students at the Computers and Engineering Faculties
C programmers who need to learn and understand Pointers In Depth
This course is not aimed for “total beginners”. It’s better to have some basic knowledge in C Programming before enrolling in this course. I would suggest purchasing my “C Programming for Beginners” course first, fully complete it and then come back to get ultimate experience with Pointers.
Requirements
Basic knowledge of C programming language – ideally having completed my “C Programming for Beginners” course on Udemy
A computer with Windows, Linux or Mac OS
At least 4GB RAM (recommended)
Last Updated 9/2021
Files:
Pointers in C Programming - Master the C Language [TutsNode.com] - Pointers in C Programming - Master the C Language 4. Pointers Concept and Beyond- 6. Generic Swap Function (including memcpy function).mp4 (344.2 MB)
- 6. Generic Swap Function (including memcpy function)-en_US.srt (25.6 KB)
- 5. Generic Pointer (void star) - What is “void ” [Generic Universal Pointer]-en_US.srt (16.4 KB)
- 3. Milestone #1 - Solution-en_US.srt (10.2 KB)
- 4. Multiple Indirection-en_US.srt (6.2 KB)
- 1. Exercise - Swap Function-en_US.srt (5.6 KB)
- 2. Milestone #1 - Develop Your Real Swap Function!-en_US.srt (3.9 KB)
- 3. Milestone #1 - Solution.mp4 (47.0 MB)
- 5. Generic Pointer (void star) - What is “void ” [Generic Universal Pointer].mp4 (33.6 MB)
- 4. Multiple Indirection.mp4 (20.4 MB)
- 1. Exercise - Swap Function.mp4 (12.3 MB)
- 2. Milestone #1 - Develop Your Real Swap Function!.mp4 (9.0 MB)
- 1. Exercise #1 - Creating a “new array” with NO DUPLICATES-en_US.srt (38.5 KB)
- 2. Exercise #2 - Splitting “source array” into ODD and EVEN arrays-en_US.srt (20.3 KB)
- 3. Exercise #3 - “Lower Case” & “Upper Case” arrays allocation-en_US.srt (15.2 KB)
- 5. 6. Solution - Copy an Array and pass a new one by Reference-en_US.srt (12.1 KB)
- 1. Exercise #1 - Creating a “new array” with NO DUPLICATES.mp4 (264.6 MB)
- 4. 5. Question - Copy an Array and pass a new one by Reference-en_US.srt (1.8 KB)
- 5. 6. Solution - Copy an Array and pass a new one by Reference.mp4 (153.4 MB)
- 2. Exercise #2 - Splitting “source array” into ODD and EVEN arrays.mp4 (153.1 MB)
- 3. Exercise #3 - “Lower Case” & “Upper Case” arrays allocation.mp4 (123.8 MB)
- 4. 5. Question - Copy an Array and pass a new one by Reference.mp4 (28.2 MB)
- 2. “malloc function-en_US.srt (25.1 KB)
- 6. “free” function-en_US.srt (17.2 KB)
- 12. 4. Solution - Allocate and Pass By Reference a 1D Dynamically Allocated Array-en_US.srt (17.0 KB)
- 9. “realloc” function-en_US.srt (16.5 KB)
- 3. Challenge #1 -Returning an Array from a Function using Dynamic Memory Allocation-en_US.srt (10.7 KB)
- 1. What is DMA and why we may need it-en_US.srt (10.2 KB)
- 5. “calloc” function-en_US.srt (10.0 KB)
- 7. Dangling Pointer-en_US.srt (9.5 KB)
- 4. Challenge #2 - Print Dynamically Allocated Array-en_US.srt (8.8 KB)
- 10. “realloc” issues-en_US.srt (7.5 KB)
- 8. Finding Memory Leakages [Valgrind]-en_US.srt (6.7 KB)
- 11. 3. Question - Allocate and Pass By Reference a 1D Dynamically Allocated Array-en_US.srt (3.5 KB)
- 12. 4. Solution - Allocate and Pass By Reference a 1D Dynamically Allocated Array.mp4 (207.0 MB)
- 2. “malloc function.mp4 (84.9 MB)
- 9. “realloc” function.mp4 (62.5 MB)
- 3. Challenge #1 -Returning an Array from a Function using Dynamic Memory Allocation.mp4 (53.0 MB)
- 6. “free” function.mp4 (48.9 MB)
- 11. 3. Question - Allocate and Pass By Reference a 1D Dynamically Allocated Array.mp4 (40.9 MB)
- 4. Challenge #2 - Print Dynamically Allocated Array.mp4 (40.7 MB)
- 7. Dangling Pointer.mp4 (37.9 MB)
- 5. “calloc” function.mp4 (36.8 MB)
- 10. “realloc” issues.mp4 (28.8 MB)
- 1. What is DMA and why we may need it.mp4 (20.8 MB)
- 8. Finding Memory Leakages [Valgrind].mp4 (18.9 MB)
- 2. Enum - Part 2-en_US.srt (24.3 KB)
- 1. Enums - Part 1-en_US.srt (11.4 KB)
- 2. Enum - Part 2.mp4 (262.0 MB)
- 1. Enums - Part 1.mp4 (127.8 MB)
- 2. Exclusive Extra Lecture on Strings & Pointers-en_US.srt (22.4 KB)
- 1. Returning a string from a function - example with strConcat-en_US.srt (12.1 KB)
- 2. Exclusive Extra Lecture on Strings & Pointers.mp4 (134.4 MB)
- 1. Returning a string from a function - example with strConcat.mp4 (61.2 MB)
- 8. Challenge #4 - Advanced Recursive Solution [Using Recursion & Functions]-en_US.srt (21.1 KB)
- 7. Challenge #4 - Iterative Solution-en_US.srt (21.1 KB)
- 9. Exercise - Reverse Array Using Recursion And Pointer Arithmetic-en_US.srt (20.2 KB)
- 10. ATTENTION! Problem with Returning a Static Array from a Function-en_US.srt (15.1 KB)
- 3. Challenge #3 - Finding and Passing by Pointer - “Min” & “Max” values of an array-en_US.srt (13.3 KB)
- 12. 2. Solution - Function to Update the Average by Reference-en_US.srt (12.0 KB)
- 2. Passing an Array to a Function-en_US.srt (10.6 KB)
- 5. Does Array Has An Element With Good Neighbors - Solution-en_US.srt (6.4 KB)
- 11. Question - Function to Update the Average by Reference-en_US.srt (2.8 KB)
- 6. Challenge #4 - Function To Find If Array Is Sorted Or Not - Question-en_US.srt (5.6 KB)
- 4. Challenge #4 - Does Array Has An Element With Good Neighbors - Question-en_US.srt (5.1 KB)
- 1. Arrays - Memory Representation-en_US.srt (4.8 KB)
- 12. 2. Solution - Function to Update the Average by Reference.mp4 (143.4 MB)
- 8. Challenge #4 - Advanced Recursive Solution [Using Recursion & Functions].mp4 (142.0 MB)
- 7. Challenge #4 - Iterative Solution.mp4 (137.2 MB)
- 9. Exercise - Reverse Array Using Recursion And Pointer Arithmetic.mp4 (78.9 MB)
- 10. ATTENTION! Problem with Returning a Static Array from a Function.mp4 (66.2 MB)
- 3. Challenge #3 - Finding and Passing by Pointer - “Min” & “Max” values of an array.mp4 (59.9 MB)
- 2. Passing an Array to a Function.mp4 (45.0 MB)
- 11. Question - Function to Update the Average by Reference.mp4 (33.8 MB)
- 6. Challenge #4 - Function To Find If Array Is Sorted Or Not - Question.mp4 (24.1 MB)
- 5. Does Array Has An Element With Good Neighbors - Solution.mp4 (23.6 MB)
- 4. Challenge #4 - Does Array Has An Element With Good Neighbors - Question.mp4 (16.8 MB)
- 1. Arrays - Memory Representation.mp4 (14.4 MB)
- 9. Swap 2 rows in 2D Dynamic Array - using Universal Approach (solution)-en_US.srt (18.6 KB)
- 2. Arrays of Pointers - Introduction & Usage-en_US.srt (16.8 KB)
- 12. Solution - 2 functions - lower and upper triangle matrix creation-en_US.srt (15.9 KB)
- 5. Developing the “allocate2DMatrix” function-en_US.srt (15.2 KB)
- 4. Creating a Totally Dynamically 2D Array-en_US.srt (12.0 KB)
- 11. Question -
Code:
- udp://open.stealth.si:80/announce
- udp://tracker.tiny-vps.com:6969/announce
- udp://fasttracker.foreverpirates.co:6969/announce
- udp://tracker.opentrackr.org:1337/announce
- udp://explodie.org:6969/announce
- udp://tracker.cyberia.is:6969/announce
- udp://ipv4.tracker.harry.lu:80/announce
- udp://tracker.uw0.xyz:6969/announce
- udp://opentracker.i2p.rocks:6969/announce
- udp://tracker.birkenwald.de:6969/announce
- udp://tracker.torrent.eu.org:451/announce
- udp://tracker.moeking.me:6969/announce
- udp://tracker.dler.org:6969/announce
- udp://9.rarbg.me:2970/announce