A student database system is an excellent project for practicing C programming skills. It combines multiple concepts: structures, file I/O, dynamic memory allocation, linked lists, searching and sorting algorithms, and user interface design. This project will guide you through building a fully functional student database that can add, search, modify, delete, and persist student records.

Project Overview

Features:

• Add new student records
• Display all students
• Search students by various criteria
• Update student information
• Delete students
• Sort students by different fields
• Save/load data to/from file
• Statistics and reports
• Input validation
• User-friendly menu interface

System Design

┌─────────────────────────────────────┐
│         Student Database            │
├─────────────────────────────────────┤
│ 1. Add Student                      │
│ 2. Display All Students             │
│ 3. Search Students                   │
│ 4. Update Student                    │
│ 5. Delete Student                    │
│ 6. Sort Students                     │
│ 7. Statistics                        │
│ 8. Save & Exit                       │
└─────────────────────────────────────┘

Complete Implementation

1. Header File (studentdb.h)

#ifndef STUDENTDB_H
#define STUDENTDB_H
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
// Constants
#define MAX_NAME_LEN 50
#define MAX_DEPT_LEN 30
#define MAX_EMAIL_LEN 50
#define MAX_PHONE_LEN 15
#define MAX_SUBJECTS 10
#define FILENAME "students.dat"
// Enum for gender
typedef enum {
MALE,
FEMALE,
OTHER
} Gender;
// Enum for search criteria
typedef enum {
SEARCH_ID,
SEARCH_NAME,
SEARCH_DEPT,
SEARCH_YEAR
} SearchType;
// Enum for sort criteria
typedef enum {
SORT_ID,
SORT_NAME,
SORT_GPA,
SORT_YEAR
} SortType;
// Subject structure
typedef struct {
char name[50];
int marks;
char grade;
} Subject;
// Student structure
typedef struct Student {
int id;                         // Unique student ID
char name[MAX_NAME_LEN];
Gender gender;
char department[MAX_DEPT_LEN];
int year;                       // Year of study (1-4)
char email[MAX_EMAIL_LEN];
char phone[MAX_PHONE_LEN];
Subject subjects[MAX_SUBJECTS];
int num_subjects;
float gpa;                      // Calculated from subjects
struct Student *next;            // For linked list
} Student;
// Database structure
typedef struct {
Student *head;                   // Head of linked list
int count;                       // Number of students
int next_id;                      // Next available ID
} Database;
// Function prototypes
void initDatabase(Database *db);
void freeDatabase(Database *db);
// Core operations
int addStudent(Database *db);
void displayAllStudents(const Database *db);
void displayStudent(const Student *s);
Student* searchStudent(const Database *db, int id);
void searchStudents(const Database *db);
int updateStudent(Database *db);
int deleteStudent(Database *db);
// Sorting
void sortStudents(Database *db, SortType sort_by, int ascending);
void swapStudents(Student *a, Student *b);
// Statistics
void showStatistics(const Database *db);
// File operations
int saveToFile(const Database *db);
int loadFromFile(Database *db);
// Utility functions
void clearInputBuffer();
int getIntInput(const char *prompt, int min, int max);
float getFloatInput(const char *prompt, float min, float max);
void getStringInput(const char *prompt, char *buffer, int max_len);
Gender getGenderInput();
int getYearInput();
void calculateGPA(Student *s);
char calculateGrade(int marks);
void printLine(char ch, int length);
void printHeader();
#endif

2. Main Implementation (studentdb.c)

#include "studentdb.h"
// Initialize database
void initDatabase(Database *db) {
db->head = NULL;
db->count = 0;
db->next_id = 1;
}
// Free all memory in database
void freeDatabase(Database *db) {
Student *current = db->head;
while (current != NULL) {
Student *temp = current;
current = current->next;
free(temp);
}
db->head = NULL;
db->count = 0;
}
// Clear input buffer
void clearInputBuffer() {
int c;
while ((c = getchar()) != '\n' && c != EOF);
}
// Get integer input with validation
int getIntInput(const char *prompt, int min, int max) {
int value;
int result;
char buffer[100];
while (1) {
printf("%s", prompt);
if (fgets(buffer, sizeof(buffer), stdin) != NULL) {
// Check if input is too long
if (strchr(buffer, '\n') == NULL) {
printf("Input too long. Please try again.\n");
clearInputBuffer();
continue;
}
// Try to convert to integer
result = sscanf(buffer, "%d", &value);
if (result == 1 && value >= min && value <= max) {
return value;
}
}
printf("Invalid input. Please enter a number between %d and %d.\n", min, max);
}
}
// Get float input with validation
float getFloatInput(const char *prompt, float min, float max) {
float value;
int result;
char buffer[100];
while (1) {
printf("%s", prompt);
if (fgets(buffer, sizeof(buffer), stdin) != NULL) {
if (strchr(buffer, '\n') == NULL) {
printf("Input too long. Please try again.\n");
clearInputBuffer();
continue;
}
result = sscanf(buffer, "%f", &value);
if (result == 1 && value >= min && value <= max) {
return value;
}
}
printf("Invalid input. Please enter a number between %.2f and %.2f.\n", min, max);
}
}
// Get string input with validation
void getStringInput(const char *prompt, char *buffer, int max_len) {
while (1) {
printf("%s", prompt);
if (fgets(buffer, max_len, stdin) != NULL) {
// Remove newline
size_t len = strlen(buffer);
if (len > 0 && buffer[len - 1] == '\n') {
buffer[len - 1] = '\0';
} else {
// Input too long
printf("Input too long. Maximum %d characters.\n", max_len - 1);
clearInputBuffer();
continue;
}
// Check if empty
if (strlen(buffer) > 0) {
return;
}
}
printf("Input cannot be empty. Please try again.\n");
}
}
// Get gender input
Gender getGenderInput() {
printf("Gender:\n");
printf("1. Male\n");
printf("2. Female\n");
printf("3. Other\n");
int choice = getIntInput("Enter choice (1-3): ", 1, 3);
switch (choice) {
case 1: return MALE;
case 2: return FEMALE;
default: return OTHER;
}
}
// Get year input
int getYearInput() {
return getIntInput("Enter year of study (1-4): ", 1, 4);
}
// Calculate grade based on marks
char calculateGrade(int marks) {
if (marks >= 90) return 'A';
if (marks >= 80) return 'B';
if (marks >= 70) return 'C';
if (marks >= 60) return 'D';
if (marks >= 50) return 'E';
return 'F';
}
// Calculate GPA from subjects
void calculateGPA(Student *s) {
if (s->num_subjects == 0) {
s->gpa = 0.0;
return;
}
float total = 0;
for (int i = 0; i < s->num_subjects; i++) {
// Convert marks to grade points
if (s->subjects[i].marks >= 90) total += 4.0;
else if (s->subjects[i].marks >= 80) total += 3.5;
else if (s->subjects[i].marks >= 70) total += 3.0;
else if (s->subjects[i].marks >= 60) total += 2.5;
else if (s->subjects[i].marks >= 50) total += 2.0;
else total += 1.0;
}
s->gpa = total / s->num_subjects;
}
// Add new student
int addStudent(Database *db) {
Student *newStudent = (Student*)malloc(sizeof(Student));
if (newStudent == NULL) {
printf("Memory allocation failed!\n");
return 0;
}
printf("\n--- Add New Student ---\n");
// Assign ID
newStudent->id = db->next_id++;
// Get basic information
getStringInput("Enter name: ", newStudent->name, MAX_NAME_LEN);
newStudent->gender = getGenderInput();
getStringInput("Enter department: ", newStudent->department, MAX_DEPT_LEN);
newStudent->year = getYearInput();
getStringInput("Enter email: ", newStudent->email, MAX_EMAIL_LEN);
getStringInput("Enter phone: ", newStudent->phone, MAX_PHONE_LEN);
// Get subjects
newStudent->num_subjects = getIntInput("Enter number of subjects (1-10): ", 1, MAX_SUBJECTS);
printf("Enter marks for each subject (0-100):\n");
for (int i = 0; i < newStudent->num_subjects; i++) {
printf("Subject %d name: ", i + 1);
getStringInput("", newStudent->subjects[i].name, 50);
newStudent->subjects[i].marks = getIntInput("Marks: ", 0, 100);
newStudent->subjects[i].grade = calculateGrade(newStudent->subjects[i].marks);
}
// Calculate GPA
calculateGPA(newStudent);
// Add to linked list (insert at beginning)
newStudent->next = db->head;
db->head = newStudent;
db->count++;
printf("\nStudent added successfully! ID: %d\n", newStudent->id);
return 1;
}
// Print a line for formatting
void printLine(char ch, int length) {
for (int i = 0; i < length; i++) {
putchar(ch);
}
putchar('\n');
}
// Print table header
void printHeader() {
printf("\n");
printLine('=', 100);
printf("%-6s %-20s %-8s %-15s %-4s %-6s %-25s %-15s\n",
"ID", "Name", "Gender", "Department", "Year", "GPA", "Email", "Phone");
printLine('-', 100);
}
// Display single student
void displayStudent(const Student *s) {
const char *gender_str[] = {"Male", "Female", "Other"};
printf("%-6d %-20s %-8s %-15s %-4d %-6.2f %-25s %-15s\n",
s->id,
s->name,
gender_str[s->gender],
s->department,
s->year,
s->gpa,
s->email,
s->phone);
// Display subjects if requested
if (s->num_subjects > 0) {
printf("  Subjects:\n");
for (int i = 0; i < s->num_subjects; i++) {
printf("    %-20s %3d marks (%c)\n",
s->subjects[i].name,
s->subjects[i].marks,
s->subjects[i].grade);
}
}
}
// Display all students
void displayAllStudents(const Database *db) {
if (db->head == NULL) {
printf("\nNo students in database.\n");
return;
}
printHeader();
Student *current = db->head;
while (current != NULL) {
displayStudent(current);
current = current->next;
}
printLine('=', 100);
printf("Total students: %d\n", db->count);
}
// Search student by ID
Student* searchStudent(const Database *db, int id) {
Student *current = db->head;
while (current != NULL) {
if (current->id == id) {
return current;
}
current = current->next;
}
return NULL;
}
// Search students by various criteria
void searchStudents(const Database *db) {
if (db->head == NULL) {
printf("\nNo students in database.\n");
return;
}
printf("\n--- Search Students ---\n");
printf("1. Search by ID\n");
printf("2. Search by Name\n");
printf("3. Search by Department\n");
printf("4. Search by Year\n");
int choice = getIntInput("Enter choice (1-4): ", 1, 4);
int found = 0;
printHeader();
switch (choice) {
case 1: {
int id = getIntInput("Enter student ID: ", 1, 99999);
Student *s = searchStudent(db, id);
if (s) {
displayStudent(s);
found = 1;
}
break;
}
case 2: {
char name[MAX_NAME_LEN];
getStringInput("Enter name to search: ", name, MAX_NAME_LEN);
Student *current = db->head;
while (current != NULL) {
if (strstr(current->name, name) != NULL) {
displayStudent(current);
found++;
}
current = current->next;
}
break;
}
case 3: {
char dept[MAX_DEPT_LEN];
getStringInput("Enter department to search: ", dept, MAX_DEPT_LEN);
Student *current = db->head;
while (current != NULL) {
if (strcmp(current->department, dept) == 0) {
displayStudent(current);
found++;
}
current = current->next;
}
break;
}
case 4: {
int year = getYearInput();
Student *current = db->head;
while (current != NULL) {
if (current->year == year) {
displayStudent(current);
found++;
}
current = current->next;
}
break;
}
}
if (found == 0) {
printf("No matching students found.\n");
} else {
printf("\nFound %d matching student(s).\n", found);
}
}
// Update student information
int updateStudent(Database *db) {
if (db->head == NULL) {
printf("\nNo students in database.\n");
return 0;
}
int id = getIntInput("Enter student ID to update: ", 1, 99999);
Student *s = searchStudent(db, id);
if (s == NULL) {
printf("Student with ID %d not found.\n", id);
return 0;
}
printf("\n--- Update Student (ID: %d) ---\n", id);
printf("Current information:\n");
displayStudent(s);
printf("\nEnter new information (press Enter to keep current):\n");
// Update name
char new_name[MAX_NAME_LEN];
printf("Name [%s]: ", s->name);
if (fgets(new_name, MAX_NAME_LEN, stdin) != NULL && new_name[0] != '\n') {
new_name[strcspn(new_name, "\n")] = '\0';
strcpy(s->name, new_name);
}
// Update other fields similarly...
// (Implementation for other fields omitted for brevity)
printf("Student information updated successfully.\n");
return 1;
}
// Delete student
int deleteStudent(Database *db) {
if (db->head == NULL) {
printf("\nNo students in database.\n");
return 0;
}
int id = getIntInput("Enter student ID to delete: ", 1, 99999);
Student *current = db->head;
Student *prev = NULL;
while (current != NULL && current->id != id) {
prev = current;
current = current->next;
}
if (current == NULL) {
printf("Student with ID %d not found.\n", id);
return 0;
}
// Confirm deletion
printf("Are you sure you want to delete student %s (ID: %d)? (y/n): ", 
current->name, id);
char confirm = getchar();
clearInputBuffer();
if (tolower(confirm) != 'y') {
printf("Deletion cancelled.\n");
return 0;
}
// Remove from linked list
if (prev == NULL) {
db->head = current->next;
} else {
prev->next = current->next;
}
free(current);
db->count--;
printf("Student deleted successfully.\n");
return 1;
}
// Swap two students (for sorting)
void swapStudents(Student *a, Student *b) {
// Since we're dealing with linked list, we swap data
Student temp = *a;
// Swap all fields except next pointer
a->id = b->id;
strcpy(a->name, b->name);
a->gender = b->gender;
strcpy(a->department, b->department);
a->year = b->year;
strcpy(a->email, b->email);
strcpy(a->phone, b->phone);
memcpy(a->subjects, b->subjects, sizeof(b->subjects));
a->num_subjects = b->num_subjects;
a->gpa = b->gpa;
b->id = temp.id;
strcpy(b->name, temp.name);
b->gender = temp.gender;
strcpy(b->department, temp.department);
b->year = temp.year;
strcpy(b->email, temp.email);
strcpy(b->phone, temp.phone);
memcpy(b->subjects, temp.subjects, sizeof(temp.subjects));
b->num_subjects = temp.num_subjects;
b->gpa = temp.gpa;
}
// Sort students
void sortStudents(Database *db, SortType sort_by, int ascending) {
if (db->count <= 1) return;
// Bubble sort for linked list
int swapped;
Student *ptr1;
Student *lptr = NULL;
do {
swapped = 0;
ptr1 = db->head;
while (ptr1->next != lptr) {
int compare = 0;
switch (sort_by) {
case SORT_ID:
compare = ptr1->id - ptr1->next->id;
break;
case SORT_NAME:
compare = strcmp(ptr1->name, ptr1->next->name);
break;
case SORT_GPA:
compare = (ptr1->gpa > ptr1->next->gpa) - 
(ptr1->gpa < ptr1->next->gpa);
break;
case SORT_YEAR:
compare = ptr1->year - ptr1->next->year;
break;
}
if (ascending ? (compare > 0) : (compare < 0)) {
swapStudents(ptr1, ptr1->next);
swapped = 1;
}
ptr1 = ptr1->next;
}
lptr = ptr1;
} while (swapped);
printf("Students sorted successfully.\n");
}
// Show statistics
void showStatistics(const Database *db) {
if (db->head == NULL) {
printf("\nNo students in database.\n");
return;
}
printf("\n--- Database Statistics ---\n");
printf("Total students: %d\n", db->count);
// Gender distribution
int male = 0, female = 0, other = 0;
// Year distribution
int year1 = 0, year2 = 0, year3 = 0, year4 = 0;
// Department distribution
typedef struct {
char name[MAX_DEPT_LEN];
int count;
} DeptCount;
DeptCount depts[100];
int num_depts = 0;
// GPA statistics
float total_gpa = 0;
float max_gpa = 0;
float min_gpa = 4.0;
Student *current = db->head;
while (current != NULL) {
// Gender
switch (current->gender) {
case MALE: male++; break;
case FEMALE: female++; break;
case OTHER: other++; break;
}
// Year
switch (current->year) {
case 1: year1++; break;
case 2: year2++; break;
case 3: year3++; break;
case 4: year4++; break;
}
// Department
int found = 0;
for (int i = 0; i < num_depts; i++) {
if (strcmp(depts[i].name, current->department) == 0) {
depts[i].count++;
found = 1;
break;
}
}
if (!found && num_depts < 100) {
strcpy(depts[num_depts].name, current->department);
depts[num_depts].count = 1;
num_depts++;
}
// GPA
total_gpa += current->gpa;
if (current->gpa > max_gpa) max_gpa = current->gpa;
if (current->gpa < min_gpa) min_gpa = current->gpa;
current = current->next;
}
printf("\nGender Distribution:\n");
printf("  Male:   %d (%.1f%%)\n", male, (float)male / db->count * 100);
printf("  Female: %d (%.1f%%)\n", female, (float)female / db->count * 100);
printf("  Other:  %d (%.1f%%)\n", other, (float)other / db->count * 100);
printf("\nYear Distribution:\n");
printf("  Year 1: %d\n", year1);
printf("  Year 2: %d\n", year2);
printf("  Year 3: %d\n", year3);
printf("  Year 4: %d\n", year4);
printf("\nDepartment Distribution:\n");
for (int i = 0; i < num_depts; i++) {
printf("  %s: %d\n", depts[i].name, depts[i].count);
}
printf("\nGPA Statistics:\n");
printf("  Average: %.2f\n", total_gpa / db->count);
printf("  Highest: %.2f\n", max_gpa);
printf("  Lowest:  %.2f\n", min_gpa);
}
// Save to file
int saveToFile(const Database *db) {
FILE *file = fopen(FILENAME, "wb");
if (file == NULL) {
printf("Error: Cannot open file for writing.\n");
return 0;
}
// Write header
fwrite(&db->count, sizeof(int), 1, file);
fwrite(&db->next_id, sizeof(int), 1, file);
// Write students
Student *current = db->head;
while (current != NULL) {
// Write student data
fwrite(current, sizeof(Student), 1, file);
// Write subjects
fwrite(current->subjects, sizeof(Subject), current->num_subjects, file);
current = current->next;
}
fclose(file);
printf("Database saved successfully to %s\n", FILENAME);
return 1;
}
// Load from file
int loadFromFile(Database *db) {
FILE *file = fopen(FILENAME, "rb");
if (file == NULL) {
// File doesn't exist - not an error for first run
return 1;
}
// Clear existing database
freeDatabase(db);
// Read header
int count, next_id;
if (fread(&count, sizeof(int), 1, file) != 1) {
fclose(file);
return 0;
}
if (fread(&next_id, sizeof(int), 1, file) != 1) {
fclose(file);
return 0;
}
db->next_id = next_id;
// Read students
Student *last = NULL;
for (int i = 0; i < count; i++) {
Student *s = (Student*)malloc(sizeof(Student));
if (s == NULL) {
fclose(file);
return 0;
}
// Read student data
if (fread(s, sizeof(Student), 1, file) != 1) {
free(s);
fclose(file);
return 0;
}
// Read subjects
if (fread(s->subjects, sizeof(Subject), s->num_subjects, file) != 
(size_t)s->num_subjects) {
free(s);
fclose(file);
return 0;
}
// Add to linked list
s->next = NULL;
if (last == NULL) {
db->head = s;
} else {
last->next = s;
}
last = s;
db->count++;
}
fclose(file);
printf("Database loaded successfully from %s\n", FILENAME);
return 1;
}
// Main menu
void displayMenu() {
printf("\n╔════════════════════════════════════╗\n");
printf("║     STUDENT DATABASE SYSTEM       ║\n");
printf("╠════════════════════════════════════╣\n");
printf("║  1. Add Student                    ║\n");
printf("║  2. Display All Students           ║\n");
printf("║  3. Search Students                ║\n");
printf("║  4. Update Student                 ║\n");
printf("║  5. Delete Student                 ║\n");
printf("║  6. Sort Students                  ║\n");
printf("║  7. Statistics                     ║\n");
printf("║  8. Save & Exit                    ║\n");
printf("╚════════════════════════════════════╝\n");
}
// Sort menu
void sortMenu(Database *db) {
printf("\n--- Sort Students ---\n");
printf("1. Sort by ID\n");
printf("2. Sort by Name\n");
printf("3. Sort by GPA\n");
printf("4. Sort by Year\n");
int choice = getIntInput("Enter choice (1-4): ", 1, 4);
printf("Sort order:\n");
printf("1. Ascending\n");
printf("2. Descending\n");
int order = getIntInput("Enter choice (1-2): ", 1, 2);
sortStudents(db, choice - 1, order == 1);
}
// Main function
int main() {
Database db;
initDatabase(&db);
// Try to load existing database
loadFromFile(&db);
int choice;
do {
displayMenu();
choice = getIntInput("Enter your choice (1-8): ", 1, 8);
switch (choice) {
case 1:
addStudent(&db);
break;
case 2:
displayAllStudents(&db);
break;
case 3:
searchStudents(&db);
break;
case 4:
updateStudent(&db);
break;
case 5:
deleteStudent(&db);
break;
case 6:
sortMenu(&db);
break;
case 7:
showStatistics(&db);
break;
case 8:
saveToFile(&db);
printf("Thank you for using Student Database System!\n");
break;
}
if (choice != 8) {
printf("\nPress Enter to continue...");
getchar();
}
} while (choice != 8);
freeDatabase(&db);
return 0;
}

3. Makefile

CC = gcc
CFLAGS = -Wall -Wextra -std=c99 -g
TARGET = studentdb
SRCS = studentdb.c
OBJS = $(SRCS:.c=.o)
$(TARGET): $(OBJS)
$(CC) $(CFLAGS) -o $(TARGET) $(OBJS)
%.o: %.c studentdb.h
$(CC) $(CFLAGS) -c $<
clean:
rm -f $(OBJS) $(TARGET)
run: $(TARGET)
./$(TARGET)
valgrind: $(TARGET)
valgrind --leak-check=full ./$(TARGET)
.PHONY: clean run valgrind

4. Sample Data File (students.dat) format

The binary file format is as follows:

[count: 4 bytes]

[next_id: 4 bytes]

[Student 1 data: sizeof(Student) bytes] [Subject data for Student 1: sizeof(Subject) * num_subjects bytes] [Student 2 data: sizeof(Student) bytes] [Subject data for Student 2: sizeof(Subject) * num_subjects bytes] ...

Features Demonstrated

Compilation and Usage

# Compile
make
# Run
make run
# Or directly
./studentdb
# Check for memory leaks
make valgrind
# Clean build files
make clean

Sample Session

╔════════════════════════════════════╗
║     STUDENT DATABASE SYSTEM       ║
╠════════════════════════════════════╣
║  1. Add Student                    ║
║  2. Display All Students           ║
║  3. Search Students                ║
║  4. Update Student                 ║
║  5. Delete Student                 ║
║  6. Sort Students                  ║
║  7. Statistics                     ║
║  8. Save & Exit                    ║
╚════════════════════════════════════╝
Enter your choice (1-8): 1
--- Add New Student ---
Enter name: John Doe
Gender:
1. Male
2. Female
3. Other
Enter choice (1-3): 1
Enter department: Computer Science
Enter year of study (1-4): 2
Enter email: [email protected]
Enter phone: 555-0123
Enter number of subjects (1-10): 3
Enter marks for each subject (0-100):
Subject 1 name: Programming
Marks: 85
Subject 2 name: Data Structures
Marks: 92
Subject 3 name: Algorithms
Marks: 78
Student added successfully! ID: 1

Project Extensions

1. Add more fields: Address, date of birth, photo path
2. Implement advanced search: Regular expressions, fuzzy matching
3. Add report generation: Export to CSV, HTML, PDF
4. Implement user authentication: Login system with different access levels
5. Add course registration: Track which courses each student takes
6. Implement undo/redo: Stack-based operation history
7. Add GUI interface: Using GTK or ncurses
8. Network capabilities: Client-server database access
9. Encryption: Encrypt sensitive student data
10. Backup system: Automatic backup on save

Common Challenges and Solutions

Conclusion

This student database project demonstrates a complete C application with practical features. It showcases:

• Modular design with header files and separate functions
• Robust input handling with validation
• Dynamic data structures using linked lists
• Persistent storage with binary file I/O
• User-friendly interface with formatted output
• Comprehensive functionality covering CRUD operations

Building this project will strengthen your understanding of:

• Pointers and dynamic memory allocation
• File operations
• Data structure implementation
• User interface design
• Error handling and validation
• Software architecture

The project is extensible and can serve as a foundation for more complex database systems or as a learning tool for C programming concepts.