Toggle navigation sidebar
Toggle in-page Table of Contents
Snefru: Learning Programming with C
Keyword
Semantic
Snefru: Learning Programming with C
Preface
What about programming?
Principles of using this textbook
Book Chapters
1. INTERACTIVE QUIZZES!!!!!!
1.1. Interactive Quizzes
2. Introduction to Programming Computers
2.1. The Basic Structure of Computers
2.2. Binary representation in memory
2.3. Development Cycle
2.4. Write Simple C Programs
3. Data representation and operations
3.1. Double data type for real numbers
3.2. Data types and representation
3.3. Operations
3.4. Math library
3.5. Random numbers
3.6. Exercises
3.7. Exercises Demo
4. Decision-Making Statements
4.1. If-statements
4.2. Multiple Conditions
4.3. Nested-if statements
4.4. Exercises
4.5. Exercises Demo
5. Repetition
5.1. While Loop
5.2. Do-while loop
5.3. For loops
5.4. Nested loops
5.5. Debugging for loops
5.6. Exercises
5.7. Exercises Demo
6. Functions
6.1. Functions
6.2. Communicate from a function
6.3. Variable scope
6.4. Pass more values to a function
6.5. Exercises
6.6. Exercises Demo
7. Pointers
7.1. Why do we need pointers?
7.2. What are pointers?
7.3. How to use pointers to communicate more with functions?
7.4. Rules defining scope of variables
7.5. Goldbach conjecture
7.6. Exercises
7.7. Exercises Demo
8. Arrays
8.1. Why and how to use arrays?
8.2. What are arrays, and how are they stored?
8.3. How do we pass an array to a function?
8.4. Exercises
8.5. Exercises Demo
9. Dynamic Memory Allocation
9.1. What is dynamic memory allocation?
9.2. Exercises
9.3. Exercises Demo
10. Multi-dimensional Arrays
10.1. Why and how to use 2D arrays?
10.2. How do we pass a 2D array to a function?
10.3. Dynamic Memory Allocation of 2D Arrays
10.4. Exercises
10.5. Exercises
11. Strings
11.1. What are strings?
11.2. Input/Output Strings
11.3. String Functions
11.4. Array of Strings
11.5. Exercises
11.6. Exercises Demo
12. Recursion
12.1. Recursive functions by definition
12.2. Recursion in Patterns
12.3. Recursion in arrays
12.4. Exercises
12.5. Exercises
13. Data Structures
13.1. What are data structures?
13.2. Pointers to Data Structures
13.3. Exercises
13.4. Exercises
14. Linked Lists
14.1. Why linked lists?
14.2. Form a linked list
14.3. Insert nodes into a linked list
14.4. Delete nodes in a linked list
14.5. Exercises
14.6. Exercises
15. Sorting
15.1. Insertion Sort
15.2. Selection Sort
15.3. Bubble sort
15.4. Exercises
15.5. Exercises Demo
16. Searching
16.1. Linear/Sequential Search
16.2. Binary Search
16.3. Exercises
16.4. Exercises
Appendix: Additional information
Appendix: Additional Resources
Set up Visual Studio Code
More Extensions in VS Code
Coding style
Debugging
Basic UNIX Commands
repository
open issue
.md
.pdf
INTERACTIVE QUIZZES!!!!!!
1.
INTERACTIVE QUIZZES!!!!!!
#
Welcome to the interactive quizzes chapter!
