CoreTechED

Loading

Master C compound data types with 19 practice problems on arrays, pointers, strings, structs, and unions. Full C99 code with edge cases.

C Compound Data Types Practice Problems

C Compound Data Types Practice Problems: A Comprehensive Tutorial

Compound data types in C—arrays, pointers, strings, structures, and unions—are built on top of the primitive types and enable programmers to model real-world entities. Fluency with them is non-negotiable for systems programming, embedded work, and technical interviews.

This tutorial walks through 19 graded practice problems organized into Easy and Medium tiers. Each problem is a complete, portable C99/C11 program with inline comments and precise expected output.


Conceptual Introduction & Fundamentals

What are Compound Data Types?

Compound data types are constructed from primitive types to model more complex data:

TypeDescription
ArrayContiguous collection of same-type elements
PointerVariable storing a memory address
StringNull-terminated array of char
StructGrouping of different-typed fields
UnionOverlapping storage for multiple types

Why Practice Them?

  • Real-world modeling: Records, buffers, packets, matrices.
  • Foundation for data structures: Linked lists, trees, hash tables.
  • Interview staples: Almost every C interview problem uses one or more.
  • Bug magnet: Pointer arithmetic, string termination, struct padding are common sources of subtle bugs.

The Concepts You Must Know

  • Array decay: Arrays pass to functions as pointers.
  • Pointer arithmetic: p + 1 advances by sizeof(*p).
  • Null termination: C strings end with '\0'.
  • Struct layout: Fields may be padded for alignment.
  • Union semantics: Only the last-written member is valid.

Syntax & Core Mechanics

Array Basics

c

int arr[5] = {1, 2, 3, 4, 5}; size_t n = sizeof(arr) / sizeof(arr[0]); /* number of elements */

Pointer Basics

c

int x = 10; int *p = &x; *p = 20; /* modify x */ printf("%p\n", (void*)p); /* print address */

String Basics

c

char name[32]; if (fgets(name, sizeof(name), stdin) == NULL) { /* error */ } name[strcspn(name, "\n")] = '\0'; /* strip newline */

Struct Basics

c

struct Point { int x, y; }; struct Point p = {1, 2}; struct Point *pp = &p; printf("%d\n", pp->x);

Union Basics

c

union Value { int i; float f; };

Full Practical Code Example with Explanation

Below are all 19 problems, grouped by difficulty.


Easy Problems

Problem 1: Size of an Array

c

#include <stdio.h> int main(void) { int arr[] = {1, 2, 3, 4, 5}; size_t total = sizeof(arr); size_t elem = sizeof(arr[0]); size_t count = total / elem; printf("Size: %zu bytes, Elements: %zu\n", total, count); return 0; }

Expected output:

text

Size: 20 bytes, Elements: 5

Problem 2: Print Array

c

#include <stdio.h> void printArray(const int arr[], int n) { for (int i = 0; i < n; i++) printf("%d ", arr[i]); printf("\n"); } int main(void) { int arr[] = {10, 20, 30, 40, 50}; printArray(arr, 5); return 0; }

Expected output:

text

10 20 30 40 50

Problem 3: Print Array in Reverse

c

#include <stdio.h> void printReverse(const int arr[], int n) { for (int i = n - 1; i >= 0; i--) printf("%d ", arr[i]); printf("\n"); } int main(void) { int arr[] = {10, 20, 30, 40, 50}; printReverse(arr, 5); return 0; }

Expected output:

text

50 40 30 20 10

Problem 4: Array Insert at End

c

#include <stdio.h> void insertAtEnd(int arr[], int *n, int capacity, int value) { if (*n >= capacity) return; /* caller must check */ arr[(*n)++] = value; } int main(void) { int arr[10] = {1, 2, 3}; int n = 3; insertAtEnd(arr, &n, 10, 4); insertAtEnd(arr, &n, 10, 5); for (int i = 0; i < n; i++) printf("%d ", arr[i]); printf("\n"); return 0; }

Expected output:

text

1 2 3 4 5

Problem 5: Count Smaller Than X

c

#include <stdio.h> int countSmaller(const int arr[], int n, int x) { int count = 0; for (int i = 0; i < n; i++) if (arr[i] < x) count++; return count; } int main(void) { int arr[] = {10, 5, 20, 15, 25}; printf("%d\n", countSmaller(arr, 5, 20)); /* 2 */ return 0; }

Expected output:

text

2

Problem 6: Sum of All Array Elements

c

#include <stdio.h> long long arraySum(const int arr[], int n) { long long sum = 0; for (int i = 0; i < n; i++) sum += arr[i]; return sum; } int main(void) { int arr[] = {1, 2, 3, 4, 5}; printf("%lld\n", arraySum(arr, 5)); return 0; }

Expected output:

text

15

Problem 7: Largest Element in Array

c

#include <stdio.h> int findLargest(const int arr[], int n) { if (n <= 0) return 0; int max = arr[0]; for (int i = 1; i < n; i++) if (arr[i] > max) max = arr[i]; return max; } int main(void) { int arr[] = {3, 7, 1, 9, 4}; printf("%d\n", findLargest(arr, 5)); return 0; }

Expected output:

text

9

Medium Problems

Problem 8: Increment Variable Using Pointer

c

#include <stdio.h> void increment(int *p) { if (p != NULL) (*p)++; } int main(void) { int x = 42; increment(&x); printf("%d\n", x); return 0; }

Expected output:

text

43

Problem 9: Print Address of Variable

c

#include <stdio.h> int main(void) { int x = 10; int *p = &x; printf("Address of x: %p\n", (void*)&x); printf("Value of p: %p\n", (void*)p); printf("Value of x via pointer: %d\n", *p); return 0; }

Expected output (addresses vary):

text

Address of x: 0x7ffc1234 Value of p: 0x7ffc1234 Value of x via pointer: 10

Problem 10: Array Insert at Index

c

#include <stdio.h> int insertAtIndex(int arr[], int n, int capacity, int idx, int value) { if (idx < 0 || idx > n || n >= capacity) return -1; for (int i = n; i > idx; i--) arr[i] = arr[i - 1]; arr[idx] = value; return n + 1; } int main(void) { int arr[10] = {1, 2, 3, 5}; int n = 4; n = insertAtIndex(arr, n, 10, 3, 4); for (int i = 0; i < n; i++) printf("%d ", arr[i]); printf("\n"); return 0; }

Expected output:

text

1 2 3 4 5

Problem 11: First Repeating Element

c

#include <stdio.h> #include <stdlib.h> #define TABLE_SIZE 1024 typedef struct { int *keys; int *seen; int capacity; } IntSet; static unsigned int hashFunc(int key, int cap) { return ((unsigned int)key) % (unsigned int)cap; } IntSet *setCreate(int cap) { IntSet *s = malloc(sizeof(IntSet)); if (s == NULL) return NULL; s->keys = malloc((size_t)cap * sizeof(int)); s->seen = calloc((size_t)cap, sizeof(int)); if (s->keys == NULL || s->seen == NULL) { free(s->keys); free(s->seen); free(s); return NULL; } s->capacity = cap; return s; } void setFree(IntSet *s) { if (s) { free(s->keys); free(s->seen); free(s); } } int setInsert(IntSet *s, int key) { unsigned int idx = hashFunc(key, s->capacity); int start = (int)idx; while (s->seen[idx]) { if (s->keys[idx] == key) return 0; idx = (idx + 1) % (unsigned int)s->capacity; if ((int)idx == start) return -1; } s->keys[idx] = key; s->seen[idx] = 1; return 1; } int firstRepeating(const int arr[], int n) { IntSet *s = setCreate(TABLE_SIZE); if (s == NULL) return -1; int result = -1; for (int i = 0; i < n; i++) { if (!setInsert(s, arr[i])) { result = arr[i]; break; } } setFree(s); return result; } int main(void) { int arr[] = {10, 5, 3, 4, 3, 5, 6}; printf("%d\n", firstRepeating(arr, 7)); return 0; }

Expected output:

text

3

Problem 12: Reverse String

c

#include <stdio.h> #include <string.h> void reverseString(char s[]) { int i = 0, j = (int)strlen(s) - 1; while (i < j) { char tmp = s[i]; s[i] = s[j]; s[j] = tmp; i++; j--; } } int main(void) { char s[] = "Hello"; reverseString(s); printf("%s\n", s); return 0; }

Expected output:

text

olleH

Problem 13: Anagram Check

c

#include <stdio.h> #include <string.h> #include <stdbool.h> bool isAnagram(const char *a, const char *b) { if (strlen(a) != strlen(b)) return false; int count[256] = {0}; for (int i = 0; a[i]; i++) count[(unsigned char)a[i]]++; for (int i = 0; b[i]; i++) { if (--count[(unsigned char)b[i]] < 0) return false; } return true; } int main(void) { printf("%s\n", isAnagram("listen", "silent") ? "true" : "false"); printf("%s\n", isAnagram("hello", "world") ? "true" : "false"); return 0; }

Expected output:

text

true false

Problem 14: Struct Area (Rectangle)

c

#include <stdio.h> struct Rect { double width, height; }; double area(struct Rect r) { return r.width * r.height; } int main(void) { struct Rect r = {4.5, 3.0}; printf("%.2f\n", area(r)); return 0; }

Expected output:

text

13.50

Problem 15: Add Two Complex Numbers

c

#include <stdio.h> struct Complex { double real, imag; }; struct Complex addComplex(struct Complex a, struct Complex b) { struct Complex c; c.real = a.real + b.real; c.imag = a.imag + b.imag; return c; } int main(void) { struct Complex x = {2.0, 3.0}; struct Complex y = {4.0, -1.0}; struct Complex z = addComplex(x, y); printf("%.2f + %.2fi\n", z.real, z.imag); return 0; }

Expected output:

text

6.00 + 2.00i

Problem 16: Implement Union (Type Punning)

c

#include <stdio.h> #include <stdint.h> union FloatBits { float f; uint32_t bits; }; int main(void) { union FloatBits u; u.f = 3.14f; printf("Float: %f, Bits: 0x%08X\n", u.f, u.bits); return 0; }

Expected output (typical):

text

Float: 3.140000, Bits: 0x4048F5C3

Problem 17: Maximum in Struct Array

c

#include <stdio.h> struct Student { int id; int grade; }; struct Student topStudent(const struct Student arr[], int n) { struct Student top = arr[0]; for (int i = 1; i < n; i++) { if (arr[i].grade > top.grade) top = arr[i]; } return top; } int main(void) { struct Student arr[] = {{1, 85}, {2, 92}, {3, 78}}; struct Student top = topStudent(arr, 3); printf("ID %d, Grade %d\n", top.id, top.grade); return 0; }

Expected output:

text

ID 2, Grade 92

Problem 18: Self-Referencing Structures

c

#include <stdio.h> #include <stdlib.h> struct Node { int value; struct Node *next; }; int main(void) { /* Build a tiny linked list: 10 -> 20 -> 30 */ struct Node *head = malloc(sizeof(struct Node)); if (!head) return 1; head->value = 10; head->next = malloc(sizeof(struct Node)); if (!head->next) { free(head); return 1; } head->next->value = 20; head->next->next = malloc(sizeof(struct Node)); if (!head->next->next) { free(head->next); free(head); return 1; } head->next->next->value = 30; head->next->next->next = NULL; for (struct Node *p = head; p; p = p->next) printf("%d ", p->value); printf("\n"); /* Free */ while (head) { struct Node *tmp = head; head = head->next; free(tmp); } return 0; }

Expected output:

text

10 20 30

Problem 19: Swap Numbers Using a Function

c

#include <stdio.h> void swap(int *a, int *b) { int tmp = *a; *a = *b; *b = tmp; } int main(void) { int x = 5, y = 9; swap(&x, &y); printf("x=%d, y=%d\n", x, y); return 0; }

Expected output:

text

x=9, y=5

Bonus: 2D World Representation

c

#include <stdio.h> #define ROWS 3 #define COLS 4 int main(void) { char grid[ROWS][COLS] = { {'.', '.', '#', '.'}, {'.', '#', '.', '.'}, {'.', '.', '.', '#'} }; for (int r = 0; r < ROWS; r++) { for (int c = 0; c < COLS; c++) putchar(grid[r][c]); putchar('\n'); } return 0; }

Expected output:

text

..#. .#.. ...#

Common Pitfalls, Edge Cases & Memory Considerations

1. Array Bounds

arr[n] is out of bounds for a size-n array. Check bounds before every write.

2. Array Decay

Arrays decay to pointers when passed to functions; sizeof returns pointer size.

c

void f(int arr[]) { size_t s = sizeof(arr); /* pointer size */ }

Pass the length explicitly.

3. String Termination

Every C string must end with '\0'. Forgetting this breaks printf("%s", ...) and all str* functions.

4. strcpy Overflow

Use snprintf or strncpy with explicit bounds and manual null termination.

c

strncpy(dest, src, size - 1); dest[size - 1] = '\0';

5. Struct Padding

sizeof(struct) may exceed the sum of member sizes due to alignment. Use sizeof for allocation.

6. Union Field Access

Reading a union member that wasn’t last written is undefined behavior (except for unsigned char aliasing).

7. Pointer Dereferencing

Check for NULL before dereferencing. Free heap allocations exactly once.

8. Aliasing

Two pointers pointing to the same memory can cause subtle bugs in swap or comparison code.

9. Off-by-One in Loops

i <= n iterates n+1 times. Use < when appropriate.

10. Memory Considerations

  • Prefer stack arrays for small, short-lived data.
  • Use malloc/free for large or dynamic data.
  • Free every allocation; never return pointers to stack data.
  • Zero-initialize structs with {0} when partial initialization is expected.

Summary & Best Practices

Compound data types are the vocabulary of C programming. Mastering them unlocks larger programs, cleaner designs, and better performance.

Key Takeaways

  • Arrays are contiguous and index-based; size is not stored.
  • Pointers store addresses; arithmetic scales by type size.
  • Strings are char arrays terminated by '\0'.
  • Structs group different types; watch out for padding.
  • Unions overlap storage; access only the last-written member.

Best Practices

  1. Always pass array length to functions.
  2. Check every malloc and free every allocation.
  3. Use snprintf for formatted string building.
  4. Prefer sizeof for array and struct sizes.
  5. Zero-initialize structs when only some fields are set.
  6. Never access out-of-bounds array elements.
  7. Cast to unsigned char for character processing.
  8. Return structs by value for small ones; use pointers for large.
  9. Test edge cases: empty arrays, single element, negative numbers.
  10. Compile with -Wall -Wextra -std=c11 to catch issues early.

By working through these 19 problems, you’ll build the practical fluency required for real C programming.

Master C interview questions: pointers, memory management, recursion, strings, and data structures. Prepare for beginner to advanced levels.

C Programming Interview Questions: Complete Guide

C Programming Interview Questions: A Comprehensive Tutorial

C is one of the oldest and most widely used programming languages, developed by Dennis Ritchie at Bell Labs between 1971 and 1973. It is a structured, procedural, and general-purpose programming language that serves as the foundation for many modern programming languages and systems. Interview questions on C help evaluate your understanding of programming fundamentals, memory management, pointers, data structures, and problem-solving skills.

This tutorial provides an in-depth compilation of C programming interview questions, organized from beginner to intermediate and advanced levels, with detailed explanations and code examples.


Conceptual Introduction & Fundamentals

Why C Interview Questions Matter

  • Foundation assessment: Evaluate core programming concepts.
  • Memory management understanding: Pointers, allocation, deallocation.
  • Problem-solving skills: Algorithm implementation and optimization.
  • Systems programming knowledge: Low-level operations.
  • Code quality: Proper error handling and best practices.

Categories of Interview Questions

LevelTopics Covered
BeginnerBasic syntax, data types, loops, functions
IntermediatePointers, memory management, strings, structures
AdvancedLinked lists, recursion, file operations, optimization

Key Areas to Master

  1. Memory management: malloc, calloc, realloc, free
  2. Pointers: Pointer arithmetic, double pointers, void pointers
  3. Data structures: Arrays, structures, unions, linked lists
  4. Strings: String functions, character arrays
  5. File I/O: Reading, writing, error handling
  6. Recursion: Base cases, stack usage
  7. Preprocessor: Macros, header files, conditional compilation
  8. Storage classes: static, extern, register, auto

Beginner Level Interview Questions

1. Why is C called a mid-level programming language?

C combines features of both low-level and high-level languages:

  • Low-level: Direct memory access via pointers, bit manipulation.
  • High-level: Functions, loops, conditionals, structured programming.

2. What are the basic data types in C?

Data TypeDescription
intInteger values
charSingle character
floatSingle-precision floating-point
doubleDouble-precision floating-point
voidAbsence of value

3. What are tokens in C?

Tokens are the smallest meaningful units:

  • Keywords: int, if, return
  • Identifiers: Variable/function names
  • Constants: Fixed values
  • Strings: Character sequences
  • Operators: +, -, *
  • Special symbols: (), {}, ;

4. What is the scope of a variable?

Scope defines where a variable is accessible:

  • Local: Inside a function/block
  • Global: Throughout the program
  • Formal parameters: Function parameter list

5. What are static variables?

Static variables retain their value between function calls and are initialized only once.

c

#include <stdio.h> void countCalls(void) { static int count = 0; // Initialized once count++; printf("%d\n", count); } int main(void) { countCalls(); // 1 countCalls(); // 2 countCalls(); // 3 return 0; }

Expected output:

text

1 2 3

6. Difference between malloc() and calloc()

malloc()calloc()
Single block of memoryMultiple contiguous blocks
One argument (total size)Two arguments (count, size)
Uninitialized (garbage)Initialized to zero
FasterSlightly slower

7. What are dangling pointers?

A dangling pointer points to memory that has already been freed.

c

int *ptr = malloc(sizeof(int)); free(ptr); // ptr is now dangling ptr = NULL; // Fix: set to NULL

8. Difference between local and global variables

LocalGlobal
Declared inside a function/blockDeclared outside all functions
Garbage value by defaultZero by default
Destroyed after blockExists for program lifetime
Stack storageData segment storage

9. What are pointers?

Pointers store memory addresses of other variables.

c

int x = 10; int *ptr = &x; // ptr stores address of x printf("%d\n", *ptr); // 10 (dereference)

10. What is typedef?

typedef creates an alias for an existing data type.

c

typedef long long ll; ll num = 1000000000;

Intermediate Level Interview Questions

11. Difference between strcpy() and strncpy()

strcpy()strncpy()
Copies entire stringCopies up to n characters
Always appends '\0'May not append '\0'
Risk of buffer overflowSafer (limited copy)

c

#include <stdio.h> #include <string.h> int main(void) { char src[] = "GeeksforGeeks"; char dest[20]; strncpy(dest, src, 5); dest[5] = '\0'; // Ensure null termination printf("%s\n", dest); // Geeks return 0; }

12. What is pointer arithmetic?

Pointer arithmetic moves pointers by the size of the data type.

c

#include <stdio.h> int main(void) { int arr[] = {10, 20, 30}; int *ptr = arr; printf("%d\n", *ptr); // 10 ptr++; printf("%d\n", *ptr); // 20 return 0; }

13. What is a double pointer?

A double pointer stores the address of another pointer.

c

int num = 10; int *ptr = &num; int **dptr = &ptr; printf("%d\n", **dptr); // 10

14. What is a void pointer?

A void pointer can store any address but must be cast before dereferencing.

c

int num = 10; void *ptr = &num; printf("%d\n", *(int *)ptr); // 10

15. Difference between stack and heap memory

StackHeap
Automatic allocationManual allocation (malloc/free)
Local variablesDynamic data
FasterSlower
Limited sizeLarger size

16. How to convert string to number?

Use atoi, strtol, or sscanf.

c

#include <stdio.h> #include <stdlib.h> int main(void) { char str[] = "123"; int num = atoi(str); printf("%d\n", num); // 123 return 0; }

17. What is a structure?

A structure groups variables of different types.

c

struct Student { char name[50]; int roll; float marks; };

18. What is a union?

A union shares memory among its members.

c

union Data { int i; float f; }; /* sizeof(union Data) = sizeof(float) or sizeof(int), whichever is larger */

19. Difference between call by value and call by reference

Call by ValueCall by Reference
Passes copy of valuePasses address
Original unchangedOriginal can be modified
SimpleRequires pointers

20. What are command-line arguments?

Arguments passed to a program at execution.

c

int main(int argc, char *argv[]) { printf("Argument count: %d\n", argc); for (int i = 0; i < argc; i++) { printf("argv[%d]: %s\n", i, argv[i]); } return 0; }

Advanced Level Interview Questions

21. Write a program to print Fibonacci series using recursion

c

#include <stdio.h> int fibonacci(int n) { if (n <= 1) return n; return fibonacci(n - 1) + fibonacci(n - 2); } int main(void) { for (int i = 0; i < 10; i++) { printf("%d ", fibonacci(i)); } printf("\n"); return 0; }

Expected output:

text

0 1 1 2 3 5 8 13 21 34

22. Write a program to check if a number is prime

c

#include <stdio.h> #include <math.h> #include <stdbool.h> bool isPrime(int n) { if (n <= 1) return false; if (n <= 3) return true; for (int i = 2; i <= sqrt(n); i++) { if (n % i == 0) return false; } return true; } int main(void) { int num = 17; if (isPrime(num)) { printf("%d is prime\n", num); } else { printf("%d is not prime\n", num); } return 0; }

23. Write a program to reverse a number

c

#include <stdio.h> int main(void) { int n = 12345; int reversed = 0; while (n != 0) { reversed = reversed * 10 + n % 10; n /= 10; } printf("Reversed: %d\n", reversed); // 54321 return 0; }

24. What is the volatile keyword?

volatile tells the compiler the variable may change unexpectedly (hardware, interrupts).

c

volatile int flag = 0; /* Compiler always reads from memory, never optimizes */

25. What is a memory leak?

A memory leak occurs when allocated memory is not freed.

c

int *ptr = malloc(100); /* Missing free(ptr); */

Solution: Always free allocated memory.


Full Practical Code Example with Explanation

This program demonstrates several common interview topics in one comprehensive example.

Program: Interview Concepts Demo

c

/** * interview_concepts.c * Demonstrates common C interview topics: * pointers, memory management, recursion, and string operations. */ #include <stdio.h> #include <stdlib.h> #include <string.h> #include <stdbool.h> /* Function prototypes */ void demonstratePointers(void); void demonstrateMemoryManagement(void); void demonstrateRecursion(void); void demonstrateStringOperations(void); bool isPalindrome(const char *str); int factorial(int n); void swapWithoutTemp(int *a, int *b); int main(void) { printf("=== C Interview Concepts Demo ===\n"); demonstratePointers(); demonstrateMemoryManagement(); demonstrateRecursion(); demonstrateStringOperations(); return 0; } /* Demonstrates pointer concepts */ void demonstratePointers(void) { printf("\n--- Pointers ---\n"); int value = 42; int *ptr = &value; int **dptr = &ptr; printf("Value: %d\n", value); printf("Via pointer: %d\n", *ptr); printf("Via double pointer: %d\n", **dptr); /* Pointer arithmetic */ int arr[] = {10, 20, 30, 40, 50}; int *p = arr; printf("Array traversal: "); for (int i = 0; i < 5; i++) { printf("%d ", *(p + i)); } printf("\n"); } /* Demonstrates memory management */ void demonstrateMemoryManagement(void) { printf("\n--- Memory Management ---\n"); /* malloc */ int *arr = malloc(5 * sizeof(int)); if (arr == NULL) { perror("malloc failed"); return; } for (int i = 0; i < 5; i++) { arr[i] = i * 10; } /* realloc */ int *temp = realloc(arr, 10 * sizeof(int)); if (temp == NULL) { perror("realloc failed"); free(arr); return; } arr = temp; printf("Memory allocated and resized successfully.\n"); /* free */ free(arr); arr = NULL; // Prevent dangling pointer printf("Memory freed.\n"); } /* Demonstrates recursion */ void demonstrateRecursion(void) { printf("\n--- Recursion ---\n"); printf("Factorial of 5: %d\n", factorial(5)); printf("Factorial of 0: %d\n", factorial(0)); } /* Recursive factorial */ int factorial(int n) { if (n <= 1) { return 1; // Base case } return n * factorial(n - 1); } /* Demonstrates string operations */ void demonstrateStringOperations(void) { printf("\n--- String Operations ---\n"); char str1[] = "racecar"; char str2[] = "hello"; printf("'%s' is %s\n", str1, isPalindrome(str1) ? "palindrome" : "not palindrome"); printf("'%s' is %s\n", str2, isPalindrome(str2) ? "palindrome" : "not palindrome"); /* Swap without third variable */ int a = 10, b = 20; printf("\nBefore swap: a=%d, b=%d\n", a, b); swapWithoutTemp(&a, &b); printf("After swap: a=%d, b=%d\n", a, b); } /* Checks if a string is palindrome */ bool isPalindrome(const char *str) { int start = 0; int end = strlen(str) - 1; while (end > start) { if (str[start++] != str[end--]) { return false; } } return true; } /* Swaps two numbers without third variable */ void swapWithoutTemp(int *a, int *b) { *a = *a + *b; *b = *a - *b; *a = *a - *b; }

Expected Output

text

=== C Interview Concepts Demo === --- Pointers --- Value: 42 Via pointer: 42 Via double pointer: 42 Array traversal: 10 20 30 40 50 --- Memory Management --- Memory allocated and resized successfully. Memory freed. --- Recursion --- Factorial of 5: 120 Factorial of 0: 1 --- String Operations --- 'racecar' is palindrome 'hello' is not palindrome Before swap: a=10, b=20 After swap: a=20, b=10

Common Pitfalls, Edge Cases & Memory Considerations

1. Not Checking malloc Return

Always check if memory allocation succeeded.

c

int *ptr = malloc(100); ptr[0] = 10; // BUG if malloc failed

Solution: Check if (ptr != NULL).

2. Memory Leaks

Forgetting to free allocated memory.

Solution: Always pair malloc with free.

3. Dangling Pointers

Using pointers after freeing.

Solution: Set pointer to NULL after free.

4. Buffer Overflow

Writing beyond array bounds.

Solution: Use bounds checking and safe functions.

5. Not Understanding Pointer Arithmetic

Confusing pointer addition with byte addition.

Solution: Remember: ptr + 1 moves by sizeof(*ptr) bytes.

6. Recursion Without Base Case

Causes stack overflow.

Solution: Always include base case.

7. Integer Overflow

Large arithmetic operations can overflow.

Solution: Use appropriate data types (long long, int64_t).

8. Not Null-Terminating Strings

Forgetting '\0' causes string function errors.

Solution: Ensure proper null termination.

9. Using == for String Comparison

Compares pointers, not contents.

Solution: Use strcmp.

10. Ignoring Compiler Warnings

Warnings often indicate real bugs.

Solution: Compile with -Wall -Wextra and fix warnings.


Summary & Best Practices

C interview questions test fundamental programming concepts, memory management, pointers, and problem-solving. Thorough preparation requires understanding both theory and practical application.

Key Takeaways

  • Master pointers, memory management, and data structures.
  • Understand recursion and its stack implications.
  • Know string functions and their safe usage.
  • Practice common algorithms (Fibonacci, prime, palindrome).
  • Understand stack vs. heap memory.
  • Be familiar with file I/O and error handling.

Best Practices for Interview Preparation

  1. Practice coding daily in C.
  2. Understand memory layout (stack, heap, data, text).
  3. Master pointer operations and pointer arithmetic.
  4. Write code with proper error handling.
  5. Learn common algorithms and their C implementations.
  6. Practice with previous interview questions.
  7. Understand time and space complexity.
  8. Review data structures (arrays, linked lists, trees).
  9. Test edge cases in your solutions.
  10. Explain your thought process clearly during interviews.

By mastering these concepts, you’ll be well-prepared for C programming interviews at all levels.

Learn to find array length in C using sizeof, pointer arithmetic, and macros. Understand array decay and avoid common pitfalls.

Length of Array in C: Complete Guide

Length of Array in C: A Comprehensive Tutorial

The length of an array in C refers to the maximum number of elements that an array can hold. Unlike higher-level languages that provide built-in functions or properties for array length, C requires manual calculation. Understanding how to determine array length correctly is essential for writing safe, efficient, and bug-free C programs.

This tutorial provides an in-depth exploration of finding array length in C: the sizeof method, pointer arithmetic trick, limitations due to array decay, practical applications, common pitfalls, and best practices.


Conceptual Introduction & Fundamentals

What is Array Length?

Array length (also called array size) is the number of elements an array can store. It is determined at the time of declaration and cannot be changed for static arrays.

Example:

c

int arr[5]; // Array length is 5 int matrix[3][4]; // Array length is 12 (3 × 4)

Why Array Length Matters

  • Loop bounds: Prevent out-of-bounds access.
  • Memory allocation: Know how much memory is used.
  • Function parameters: Pass size information to functions.
  • Algorithm implementation: Many algorithms require array size.
  • Safety: Avoid buffer overflows and undefined behavior.

The Challenge: No Built-in Length

C does not provide a built-in function or property to get array length. You must calculate it manually. The most common method uses the sizeof operator:

c

int arr[5]; size_t length = sizeof(arr) / sizeof(arr[0]);

Array Decay Problem

When an array is passed to a function, it decays to a pointer, losing its size information. Therefore, methods that work in the same scope as the array declaration will fail inside functions.

c

void func(int arr[]) { sizeof(arr); // Returns pointer size, not array size }

Syntax & Core Mechanics

Method 1: sizeof Operator

The simplest and most reliable method within the same scope.

Syntax:

c

size_t length = sizeof(array) / sizeof(array[0]);

Example:

c

#include <stdio.h> int main(void) { int arr[5] = {1, 2, 3, 4, 5}; size_t length = sizeof(arr) / sizeof(arr[0]); printf("Array length: %zu\n", length); printf("Total bytes: %zu\n", sizeof(arr)); printf("Element bytes: %zu\n", sizeof(arr[0])); return 0; }

Expected output:

text

Array length: 5 Total bytes: 20 Element bytes: 4

Method 2: Pointer Arithmetic Trick

A less common method that uses pointer arithmetic.

Syntax:

c

size_t length = *(&array + 1) - array;

Example:

c

#include <stdio.h> int main(void) { int arr[5] = {1, 2, 3, 4, 5}; size_t length = *(&arr + 1) - arr; printf("Array length: %zu\n", length); return 0; }

Expected output:

text

Array length: 5

How it works:

  1. &arr — Address of the entire array (type: int (*)[5]).
  2. &arr + 1 — Moves pointer to just past the end of the array.
  3. *(&arr + 1) — Dereferences to get address just after the array.
  4. Subtracting arr (base address) gives the element count.

Method 3: Macro for Array Length

Define a macro for convenience:

c

#include <stdio.h> #define ARRAY_LENGTH(arr) (sizeof(arr) / sizeof((arr)[0])) int main(void) { int arr[5] = {1, 2, 3, 4, 5}; double values[10] = {0}; printf("arr length: %zu\n", ARRAY_LENGTH(arr)); printf("values length: %zu\n", ARRAY_LENGTH(values)); return 0; }

Expected output:

text

arr length: 5 values length: 10

Method 4: For Character Arrays (Strings)

For character arrays containing strings, use strlen for the string length (excluding null terminator) or sizeof for the array capacity.

c

#include <stdio.h> #include <string.h> int main(void) { char str[20] = "Hello"; size_t capacity = sizeof(str); // 20 (total capacity) size_t stringLength = strlen(str); // 5 (actual string length) printf("Capacity: %zu\n", capacity); printf("String length: %zu\n", stringLength); return 0; }

Expected output:

text

Capacity: 20 String length: 5

Method 5: For Multidimensional Arrays

For multidimensional arrays, sizeof gives total elements when divided by element size.

c

#include <stdio.h> int main(void) { int matrix[3][4]; size_t totalElements = sizeof(matrix) / sizeof(matrix[0][0]); size_t rows = sizeof(matrix) / sizeof(matrix[0]); size_t cols = sizeof(matrix[0]) / sizeof(matrix[0][0]); printf("Total elements: %zu\n", totalElements); printf("Rows: %zu\n", rows); printf("Cols: %zu\n", cols); return 0; }

Expected output:

text

Total elements: 12 Rows: 3 Cols: 4

Full Practical Code Example with Explanation

This program demonstrates multiple methods to find array length in different contexts, including the array decay problem.

Program: Array Length Calculator

c

/** * array_length.c * Demonstrates methods to find array length in C. * Shows sizeof method, pointer trick, and array decay problem. */ #include <stdio.h> #include <stdlib.h> #include <string.h> #include <errno.h> #define MAX_LINE_LEN 100 #define ARRAY_LENGTH(arr) (sizeof(arr) / sizeof((arr)[0])) /* Function prototypes */ void demonstrateSizeofMethod(void); void demonstratePointerTrick(void); void demonstrateMacroMethod(void); void demonstrateMultidimensional(void); void demonstrateArrayDecay(int arr[], size_t size); void demonstrateStringLength(void); int readInteger(const char *prompt, int *outValue); int main(void) { int choice; char buffer[MAX_LINE_LEN]; printf("=== Array Length Calculator ===\n"); while (1) { printf("\n--- Menu ---\n"); printf("1. sizeof Method\n"); printf("2. Pointer Arithmetic Trick\n"); printf("3. Macro Method\n"); printf("4. Multidimensional Array\n"); printf("5. Array Decay Problem\n"); printf("6. String Length vs Capacity\n"); printf("7. Exit\n"); printf("Enter choice: "); fflush(stdout); if (fgets(buffer, sizeof(buffer), stdin) == NULL) { fprintf(stderr, "Error reading choice.\n"); return EXIT_FAILURE; } choice = atoi(buffer); switch (choice) { case 1: demonstrateSizeofMethod(); break; case 2: demonstratePointerTrick(); break; case 3: demonstrateMacroMethod(); break; case 4: demonstrateMultidimensional(); break; case 5: { int arr[10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; size_t size = ARRAY_LENGTH(arr); printf("\nIn main: array length = %zu\n", size); demonstrateArrayDecay(arr, size); break; } case 6: demonstrateStringLength(); break; case 7: printf("Exiting.\n"); return EXIT_SUCCESS; default: printf("Invalid choice. Please try again.\n"); break; } } return EXIT_SUCCESS; } /* Demonstrates sizeof method */ void demonstrateSizeofMethod(void) { printf("\n=== sizeof Method ===\n"); int arr[5] = {1, 2, 3, 4, 5}; size_t totalBytes = sizeof(arr); size_t elementBytes = sizeof(arr[0]); size_t length = totalBytes / elementBytes; printf("Array: [1, 2, 3, 4, 5]\n"); printf("Total bytes: %zu\n", totalBytes); printf("Element bytes: %zu\n", elementBytes); printf("Length: %zu\n", length); /* Also works for other types */ double doubleArr[4] = {1.5, 2.5, 3.5, 4.5}; size_t doubleLength = sizeof(doubleArr) / sizeof(doubleArr[0]); printf("\nDouble array length: %zu\n", doubleLength); char charArr[10] = "Hello"; size_t charLength = sizeof(charArr) / sizeof(charArr[0]); printf("Char array capacity: %zu\n", charLength); } /* Demonstrates pointer arithmetic trick */ void demonstratePointerTrick(void) { printf("\n=== Pointer Arithmetic Trick ===\n"); int arr[5] = {1, 2, 3, 4, 5}; size_t length = *(&arr + 1) - arr; printf("Array: [1, 2, 3, 4, 5]\n"); printf("Length using pointer trick: %zu\n", length); /* Explanation */ printf("\nExplanation:\n"); printf("&arr = %p\n", (void*)&arr); printf("&arr + 1 = %p\n", (void*)(&arr + 1)); printf("arr = %p\n", (void*)arr); printf("*(&arr + 1) - arr = %zu\n", length); } /* Demonstrates macro method */ void demonstrateMacroMethod(void) { printf("\n=== Macro Method ===\n"); int arr[7] = {1, 2, 3, 4, 5, 6, 7}; double values[12] = {0}; char text[25] = "Hello"; printf("int arr[7] length: %zu\n", ARRAY_LENGTH(arr)); printf("double values[12] length: %zu\n", ARRAY_LENGTH(values)); printf("char text[25] capacity: %zu\n", ARRAY_LENGTH(text)); } /* Demonstrates multidimensional array length */ void demonstrateMultidimensional(void) { printf("\n=== Multidimensional Array ===\n"); int matrix[3][4] = { {1, 2, 3, 4}, {5, 6, 7, 8}, {9, 10, 11, 12} }; size_t totalElements = sizeof(matrix) / sizeof(matrix[0][0]); size_t rows = sizeof(matrix) / sizeof(matrix[0]); size_t cols = sizeof(matrix[0]) / sizeof(matrix[0][0]); printf("3x4 Matrix\n"); printf("Total elements: %zu\n", totalElements); printf("Rows: %zu\n", rows); printf("Columns: %zu\n", cols); int cube[2][3][2] = {{{1, 2}, {3, 4}, {5, 6}}, {{7, 8}, {9, 10}, {11, 12}}}; size_t total3D = sizeof(cube) / sizeof(cube[0][0][0]); printf("\n2x3x2 Cube\n"); printf("Total elements: %zu\n", total3D); } /* Demonstrates array decay problem */ void demonstrateArrayDecay(int arr[], size_t size) { printf("In function: sizeof(arr) = %zu bytes (pointer size)\n", sizeof(arr)); printf("In function: ARRAY_LENGTH(arr) = %zu (incorrect!)\n", ARRAY_LENGTH(arr)); printf("Passed size: %zu (correct)\n", size); } /* Demonstrates string length vs capacity */ void demonstrateStringLength(void) { printf("\n=== String Length vs Capacity ===\n"); char str[20] = "Hello"; size_t capacity = sizeof(str); size_t stringLength = strlen(str); printf("String: \"%s\"\n", str); printf("Array capacity: %zu\n", capacity); printf("String length (strlen): %zu\n", stringLength); printf("Null terminator: %c\n", str[stringLength] == '\0' ? 'Y' : 'N'); } /* Reads an integer safely */ int readInteger(const char *prompt, int *outValue) { char buffer[MAX_LINE_LEN]; char *endPtr; long val; printf("%s", prompt); fflush(stdout); if (fgets(buffer, sizeof(buffer), stdin) == NULL) { return -1; } errno = 0; val = strtol(buffer, &endPtr, 10); if (endPtr == buffer || (*endPtr != '\n' && *endPtr != '\0')) { return -1; } if (errno == ERANGE || val < -2147483647 - 1 || val > 2147483647) { return -1; } *outValue = (int)val; return 0; }

Explanation

  1. sizeof Method: Divides total bytes by element bytes.
  2. Pointer Trick: Uses pointer arithmetic to calculate length.
  3. Macro: Defines reusable ARRAY_LENGTH macro.
  4. Multidimensional: Calculates total elements, rows, and columns.
  5. Array Decay: Shows why methods fail inside functions.
  6. String Length: Distinguishes between capacity and actual string length.

Expected Output (sample run)

text

=== Array Length Calculator === --- Menu --- 1. sizeof Method 2. Pointer Arithmetic Trick 3. Macro Method 4. Multidimensional Array 5. Array Decay Problem 6. String Length vs Capacity 7. Exit Enter choice: 1 === sizeof Method === Array: [1, 2, 3, 4, 5] Total bytes: 20 Element bytes: 4 Length: 5 Double array length: 4 Char array capacity: 10 --- Menu --- ... Enter choice: 5 In main: array length = 10 In function: sizeof(arr) = 8 bytes (pointer size) In function: ARRAY_LENGTH(arr) = 2 (incorrect!) Passed size: 10 (correct) --- Menu --- ... Enter choice: 6 === String Length vs Capacity === String: "Hello" Array capacity: 20 String length (strlen): 5 Null terminator: Y

Common Pitfalls, Edge Cases & Memory Considerations

1. Array Decay in Functions

Using sizeof on an array parameter gives pointer size, not array size.

c

void func(int arr[]) { size_t length = sizeof(arr) / sizeof(arr[0]); // BUG: gives pointer/element // On 64-bit: 8 / 4 = 2 (incorrect) }

Solution: Pass array size as a separate parameter.

2. sizeof on Dynamic Arrays

sizeof on a pointer to dynamically allocated memory gives pointer size, not allocated size.

c

int *arr = malloc(10 * sizeof(int)); size_t length = sizeof(arr) / sizeof(arr[0]); // BUG: pointer/element

Solution: Track the allocated size manually.

3. Empty Arrays

C does not support zero-length arrays as standard (except as compiler extensions).

c

int arr[0]; // Non-standard, may not compile

Solution: Use NULL pointer for empty arrays, or minimum size 1.

4. Character Arrays and strlen

strlen returns the string length (up to null terminator), not the array capacity.

c

char str[100] = "Hi"; size_t len = strlen(str); // 2, not 100 size_t cap = sizeof(str); // 100

Solution: Use sizeof for capacity, strlen for string length.

5. Pointer Arithmetic Trick Limitations

The pointer trick *(&arr + 1) - arr only works when arr is a true array, not a pointer.

c

void func(int *arr) { size_t len = *(&arr + 1) - arr; // BUG: arr is a pointer }

Solution: Only use the trick in the same scope as the array declaration.

6. Macro Side Effects

Macros that evaluate their arguments multiple times can cause side effects.

c

#define ARRAY_LENGTH(arr) (sizeof(arr) / sizeof((arr)[0])) ARRAY_LENGTH(arr++); // arr++ evaluated twice (not actually valid syntax)

Solution: Use the macro only with simple array names, not expressions.

7. Multidimensional Array Confusion

Using sizeof on a row vs. the entire array gives different results.

c

int matrix[3][4]; sizeof(matrix); // 48 (entire array) sizeof(matrix[0]); // 16 (one row) sizeof(matrix[0][0]); // 4 (one element)

Solution: Be clear about what you’re measuring.

8. sizeof on Incomplete Types

Arrays with incomplete types (e.g., extern int arr[]) cannot use sizeof.

c

extern int arr[]; size_t len = sizeof(arr); // Error: invalid application of sizeof

Solution: Define the array with a known size before using sizeof.

9. Variable-Length Arrays (VLA)

C99 supports VLAs where sizeof is evaluated at runtime.

c

int n = 10; int arr[n]; size_t len = sizeof(arr) / sizeof(arr[0]); // Works, but evaluated at runtime

Solution: Be aware that VLA sizeof is not compile-time.

10. Memory Considerations

  • sizeof is a compile-time operator (except for VLAs).
  • Array length calculation uses no extra memory.
  • Tracking array size in a variable uses minimal memory.
  • For large arrays, use size_t to avoid integer overflow.

Summary & Best Practices

Finding array length in C requires manual calculation using sizeof. The method works reliably in the same scope as the array declaration but fails when arrays decay to pointers in functions.

Key Takeaways

  • Use sizeof(arr) / sizeof(arr[0]) for array length.
  • Pointer trick: *(&arr + 1) - arr (same scope only).
  • Macro: #define ARRAY_LENGTH(arr) (sizeof(arr) / sizeof((arr)[0])).
  • Array decay: Functions receive pointers, losing size information.
  • Pass array size explicitly to functions.
  • For strings, use strlen for length, sizeof for capacity.

Best Practices

  1. Use size_t for array lengths to avoid overflow.
  2. Pass array size explicitly to functions.
  3. Use a macro for consistent length calculation.
  4. Track dynamic array sizes manually when using malloc.
  5. Distinguish between capacity and string length for character arrays.
  6. Avoid using sizeof on function parameters (they are pointers).
  7. Use const arrays when the size should not change.
  8. Document the array size in comments for clarity.
  9. Test edge cases: empty arrays, single element, multidimensional.
  10. Consider using _Static_assert (C11) to verify array sizes at compile time.

By mastering array length calculation, you’ll write safer C code that avoids out-of-bounds access and handles arrays correctly in all contexts.