C Interview Preparation and Best Practices

# CHAPTER 30

Interview Preparation and Best Practices #

1. Introduction #

2. Learning Objectives #

• Write clean and maintainable C code.

• Prevent common security vulnerabilities (Buffer Overflows).

• Review the Top 10 C Interview Questions.

• Understand the next steps in your programming journey.

3. C Coding Standards (Best Practices) #

#### 1. Naming Conventions

• Variables/Functions: Use snakecase (e.g., calculatetotal, playerscore).

• Macros/Constants: Use UPPERCASEWITHUNDERSCORES (e.g., #define MAXBUFFER 1024).

• Types/Structs: Use PascalCase or suffix with t (e.g., typedef struct Node Nodet;).

#### 2. Memory Management Rules

• Rule of Symmetry: For every malloc(), there MUST be a free() in the same logical scope.

• Null Pointers: Always initialize pointers to NULL. After freeing memory, set the pointer to NULL to prevent dangling pointers.

int *ptr = malloc(sizeof(int));
free(ptr);
ptr = NULL; // Prevents use-after-free bugs

#### 3. Security (Preventing Buffer Overflows) Never use functions that do not check buffer bounds.

• Bad: gets() (Removed from standard C, extremely dangerous).

• Good: fgets(buffer, sizeof(buffer), stdin)

• Bad: strcpy() and strcat()

• Good: strncpy() and strncat() (Always specify the maximum size).

#### 4. Avoid Magic Numbers Never use arbitrary numbers in your code. Use #define or const.

// BAD
for (int i = 0; i < 52; i++) { }

// GOOD
#define DECK_SIZE 52
for (int i = 0; i < DECK_SIZE; i++) { }

4. Top 10 C Interview Questions (Review) #

1. What is the difference between malloc() and calloc()? malloc() allocates memory but leaves it uninitialized (contains garbage). calloc() allocates memory and initializes all bits to zero.

2. What is a Memory Leak? A memory leak occurs when a program allocates dynamic memory (Heap) but loses the pointer to it or forgets to call free(). The OS cannot reclaim the memory until the program exits.

3. What is a Segmentation Fault? It occurs when a program tries to access a memory location that it is not allowed to access (e.g., dereferencing a NULL pointer, reading outside an array bounds, or trying to write to read-only memory).

4. Explain the static keyword in C.

• Inside a function: The variable retains its value between function calls and is stored in the data segment.

• Outside a function (Global): It restricts the variable's scope to ONLY the file it is declared in, hiding it from the Linker.

5. What is the difference between a struct and a union? A struct allocates separate memory for every member, so its size is the sum of its members (plus padding). A union allocates memory only for its largest member, and all members share that same memory location.

6. How do you declare a pointer to a function? returntype (*pointername)(parametertypes); Example: int (*mathptr)(int, int);

7. What is a Dangling Pointer? A pointer that points to a memory location that has already been freed. Using it causes undefined behavior.

8. Explain Pass by Value vs. Pass by Reference. C ONLY supports Pass by Value (it copies arguments). However, we simulate Pass by Reference by passing the *memory addresses* (pointers) of variables, allowing the function to modify the originals.

9. What is the difference between #include <file.h> and #include "file.h"? Angle brackets search the system's standard library directories first. Double quotes search the current working directory of the project first.

10. What is a Macro, and why can it be dangerous? A macro (#define) is a preprocessor directive that performs blind text substitution before compilation. It is dangerous because it lacks type checking and can cause logic errors if arguments are not properly wrapped in parentheses (e.g., #define SQUARE(x) x*x).

5. Algorithmic Interview Tips #

1. 1. Clarify: Ask questions before writing code (e.g., "Will the array always be sorted? Can it contain negative numbers?").

1. 2. Brute Force First: Write the simplest solution first (O(n²)).

1. 3. Optimize: Then, look for ways to make it faster using hash maps or sorting (O(n log n) or O(n)).

1. 4. Check Edge Cases: Test your code mentally with empty arrays, NULL pointers, or extreme values.

6. What's Next? #

• Data Structures and Algorithms (DSA): Build Trees, Graphs, Hash Tables, and learn algorithms (Dijkstra's, Merge Sort).

• Embedded Systems/IoT: Buy an Arduino or Raspberry Pi and write C code to control hardware (LEDs, motors, sensors).

• Operating Systems: Learn about POSIX threads (multithreading), sockets (networking), and processes (fork(), exec()) in Linux.

• Learn C++: Transition to C++ to learn Object-Oriented Programming (Classes, Objects, Polymorphism) while keeping C's performance.

7. MCQ Quiz with Answers #

8. Conclusion #