Project Overview
Team Members
Tejas Sahoo K057 Mishita Verma K0 Aadit Patil K0
Problem Statement
Managing a library system involves maintaining a dynamic list of books and records of students who issue and return them. Traditional systems often face challenges with:
- Memory management: Fixed storage can be wasteful if the data size fluctuates.
- Insertion and deletion: Frequent addition or removal of books and student records can be inefficient.
Solution
Our Student Library Management System solves these issues by using a singly linked list for both book and student records. This data structure allows efficient dynamic memory allocation and simplifies insertion and deletion, making it ideal for a library system where the number of books and student records varies.
Core Functions
1. initialize_lib()
- Initializes the library with sample books, dynamically creating each book node and linking them in a list.
2. book_issue()
- Displays available books.
- Allows students to issue a book by ID, adding a record in the student list and removing the book from the library list.
3. book_return()
- Takes the student’s book ID, finds their record, removes it from the student list, and adds the book back to the library.
4. display()
- Displays a list of students who have currently issued books.
5. delete_book()
- Removes a book from the library list when it is issued.
6. add_book()
- Adds a book back to the library list when it is returned.
Code
#include <stdio.h>
#include <conio.h>
#include <stdlib.h>
#include <malloc.h>
#include <string.h>
struct book{
char name[30];
char author[30];
int id;
struct book *next;
};
struct student{
char name[30];
char email[20];
char book[20];
char a[30];
int id;
struct student *next;
};
struct book *start_lib=NULL;
struct student *start=NULL;
struct book *initialize_lib(struct book *);
struct student *book_issue(struct student *);
struct student *book_return(struct student *);
struct book *diplay_lib(struct book *);
struct book *delete_book(int);
struct book *add_book(char [],char [],int);
void display(struct student *);
void greetings();
void main_menu();
int main(){
start_lib=initialize_lib(start_lib);
greetings();
main_menu();
return 0;
}
void greetings(){
printf("\n\n");
printf("\t\t\t ****************************************\n");
printf("\t\t\t * *\n");
printf("\t\t\t * *\n");
printf("\t\t\t * ---------------------------- *\n");
printf("\t\t\t * WELCOME TO STUDENT LIBRARY *\n");
printf("\t\t\t * ---------------------------- *\n");
printf("\t\t\t * *\n");
printf("\t\t\t * *\n");
printf("\t\t\t ****************************************\n");
printf("\n\n");
printf("\t\t\t ****************************************\n");
printf("\t\t\t * *\n");
printf("\t\t\t * ------------------------ *\n");
printf("\t\t\t * STUDENT LIBRARY *\n");
printf("\t\t\t * ------------------------ *\n");
printf("\t\t\t * *\n");
printf("\t\t\t * *\n");
printf("\t\t\t * Mumbai,Maharashtra,India *\n");
printf("\t\t\t * Email: [email protected] *\n");
printf("\t\t\t * Contact:8800991010,8800992020 *\n");
printf("\t\t\t * *\n");
printf("\t\t\t ****************************************\n");
printf("\n\n\t\t\t Press any key to continue: ");
getch();
}
void main_menu(){
int choice;
do{
printf("\n\n");
printf("\n\t\t\t*************************************************\n");
printf("\n\t\t\t\t MAIN MENU: ");
printf("\n\t\t\t\t 1.ISSUE OF BOOKS ");
printf("\n\t\t\t\t 2.RETURN OF BOOKS ");
printf("\n\t\t\t\t 3.DISPLAY STUDENT DETAILS ");
printf("\n\t\t\t\t 4.EXIT\n ");
printf("\n\t\t\t*************************************************\n");
printf("\n\t\t\t\t Enter your choice: ");
scanf("%d",&choice);
switch(choice){
case 1:{
start=book_issue(start);
break;
}
case 2:{
start=book_return(start);
break;
}
case 3:{
display(start);
break;
}
case 4:{
exit(1);
}
default:{
printf("\n\t\t\t\t ...Invalid Option!...\n");
printf("\n\t\t\t\t Press any key to try again: ");
getch();
}
}
}while(choice!=4);
}
struct book *initialize_lib(struct book *start){
struct book *ptr,*new_book1,*new_book2,*new_book3,*new_book4,*new_book5;
new_book1=(struct book *)malloc(sizeof(struct book));
new_book1->next=NULL;
start_lib=new_book1;
strcpy(new_book1->name,"The Kite Runner");
strcpy(new_book1->author,"Khaled Hosseini");
new_book1->id=101;
ptr=new_book1;
new_book2=(struct book*)malloc(sizeof(struct book));
new_book2->next=NULL;
strcpy(new_book2->name,"To Kill A Mockingbird");
strcpy(new_book2->author,"Harper Lee");
new_book2->id=102;
ptr->next=new_book2;
ptr=new_book2;
new_book3=(struct book*)malloc(sizeof(struct book));
new_book3->next=NULL;
strcpy(new_book3->name,"The Alchemist");
strcpy(new_book3->author,"Paulo Coelho");
new_book3->id=103;
ptr->next=new_book3;
ptr=new_book3;
new_book4=(struct book*)malloc(sizeof(struct book));
new_book4->next=NULL;
strcpy(new_book4->name,"Pride And Prejudice");
strcpy(new_book4->author,"Jane Austen");
new_book4->id=104;
ptr->next=new_book4;
ptr=new_book4;
new_book5=(struct book*)malloc(sizeof(struct book));
new_book5->next=NULL;
strcpy(new_book5->name,"A Tale Of Two Cities");
strcpy(new_book5->author,"Charles Dickens");
new_book5->id=105;
ptr->next=new_book5;
return start_lib;
}
struct student *book_issue(struct student *start){
struct book *ptr;
struct student *ptr2,*new_student;
int i=1,id,flag=0;
if(start_lib==NULL){
printf("\n\t\t\t\t No books left in the library to issue!\n\t\t\t\t Sorry for the inconvenience!\n");
}else{
system("cls");
ptr=start_lib;
printf("\n\t*************** Books Available: ****************\n");
while(ptr!=NULL){
printf("\n\t_________________________________________________\n");
printf("\n\t Book %d",i);
printf("\n\t Book Title: %s",ptr->name);
printf("\n\t Name of Author: %s",ptr->author);
printf("\n\t Book ID: %d",ptr->id);
printf("\n\t_________________________________________________\n");
ptr=ptr->next;
i++;
}
printf("\n\n\t Enter the Book ID: ");
scanf("%d",&id);
ptr=start_lib;
while(ptr!=NULL){
if(ptr->id==id){
flag=1;
break;
}
ptr=ptr->next;
}
if(flag==1){
ptr=start_lib;
while(ptr->id!=id){
ptr=ptr->next;
}
new_student=(struct student *)malloc(sizeof(struct student));
printf("\n\t Enter Student Details:\n ");
printf("\n\t Enter your Name: ");
scanf("%s",new_student->name);
printf("\n\t Enter your Email: ");
scanf("%s",new_student->email);
strcpy(new_student->book,ptr->name);
strcpy(new_student->a,ptr->author);
new_student->id=ptr->id;
new_student->next=NULL;
printf("\n\t Issue of Book ID %d done successfully!\n",new_student->id);
printf("\n\n\t*************************************************\n");
if(start==NULL){
start=new_student;
}else{
ptr2=start;
while(ptr2->next!=NULL){
ptr2=ptr2->next;
}
ptr2->next=new_student;
}
start_lib=delete_book(new_student->id);
printf("\n\n\t Press any key to go to the main menu: ");
getch();
system("cls");
}else{
printf("\n\t\t ...Invalid Option!...\n");
printf("\n\t\t Press any key to try again: ");
getch();
system("cls");
}
}
return start;
}
struct student *book_return(struct student *start){
struct student *ptr,*preptr;
char bookname[30],authorname[30];
int flag=0,id,identity,c=0,d=1;
printf("\n\n\t*************** Books Submission: ****************\n");
printf("\n\n\t Enter your Book ID: ");
scanf("%d",&identity);
ptr=start;
while(ptr!=NULL){
if(ptr->id==identity){
flag=1;
break;
}
ptr=ptr->next;
}
if(flag==1){
ptr=start;
while(ptr!=NULL){
c++;
ptr=ptr->next;
}
ptr=start;
while(ptr->id!=identity){
d++;
ptr=ptr->next;
}
ptr=start;
if( d==1 ){
printf("\n\t_________________________________________________\n");
printf("\n\t Student Name: %s",start->name);
printf("\n\t Student Email: %s",start->email);
printf("\n\t Name of Book Issued: %s",start->book);
printf("\n\t_________________________________________________\n");
printf("\n\n\t Return of Book ID %d done successfully!\n",identity);
printf("\n\n\t*************************************************\n");
strcpy(bookname,start->book);
strcpy(authorname,start->a);
id=start->id;
start=start->next;
free(ptr);
add_book(bookname,authorname,id);
}else{
ptr=start;
while(ptr->id!=identity){
preptr=ptr;
ptr=ptr->next;
}
printf("\n\t_________________________________________________\n");
printf("\n\t Student Name: %s",ptr->name);
printf("\n\t Student Email: %s",ptr->email);
printf("\n\t Name of Book Issued: %s",ptr->book);
printf("\n\t Book ID: %d",ptr->id);
printf("\n\t_________________________________________________\n");
strcpy(bookname,ptr->book);
strcpy(authorname,ptr->a);
id=ptr->id;
preptr->next=ptr->next;
free(ptr);
add_book(bookname,authorname,id);
}
printf("\n\t Thank you! \n\t Do visit again! ");
printf("\n\n\t Press any key to go to the main menu: ");
getch();
system("cls");
}else{
printf("\n\tSorry the book doesn't exist! Please recheck the entered ID");
printf("\n\t\t\t\t Press any key to try again: ");
getch();
system("cls");
}
return start;
}
void display(struct student *start){
struct student *ptr;
ptr=start;
while(ptr!=NULL){
printf("\n\t************* Details of Students: **************\n");
printf("\n\t_________________________________________________\n");
printf("\n\t\t Student Name: %s",ptr->name);
printf("\n\t\t Student Email: %s",ptr->email);
printf("\n\t\t Name of Book Issued: %s",ptr->book);
printf("\n\t\t Book ID: %d",ptr->id);
printf("\n\t_________________________________________________\n");
printf("\n\n\t*************************************************\n");
ptr=ptr->next;
}
printf("\n\n\t Press any key to go to the main menu: ");
getch();
system("cls");
}
struct book *delete_book(int id){
struct book *ptr,*preptr;
int c=0;
ptr=start_lib;
while(ptr!=NULL){
c++;
ptr=ptr->next;
}
if(c==1){
ptr=start_lib;
start_lib=NULL;
free(ptr);
}else if(start_lib->id==id){
ptr=start_lib;
start_lib=start_lib->next;
free(ptr);
}else{
ptr=start_lib;
while(ptr->id!=id){
preptr=ptr;
ptr=ptr->next;
}
preptr->next=ptr->next;
free(ptr);
}
return start_lib;
}
struct book *add_book(char bookname[30],char authorname[30],int id){
struct book *ptr,*new_book;
new_book=(struct book *)malloc(sizeof(struct book));
strcpy(new_book->name,bookname);
strcpy(new_book->author,authorname);
new_book->id=id;
new_book->next=NULL;
if(start_lib==NULL){
start_lib=new_book;
}else{
ptr=start_lib;
while(ptr->next!=NULL){
ptr=ptr->next;
}
ptr->next=new_book;
}
return start_lib;
}```
---
## Comparison: Linked List vs. Other Data Structures
| Operation | Array | Stack/Queue | Hash Table | Linked List |
|-------------------------|------------------------------|------------------------------|--------------------------------|-------------------------------|
| **Memory Allocation** | Fixed size | Dynamic (top/bottom only) | Dynamic (bucket overhead) | Fully dynamic, on-demand |
| **Insertion/Deletion** | Inefficient (shifting) | Limited to specific positions | Efficient but complex handling | Efficient (pointer updates) |
| **Access Flexibility** | Indexed (random access) | Restricted (LIFO/FIFO) | Key-based access | Flexible sequential access |
| **Ideal Use Case** | Fixed data size, random access | Sequential use (e.g., undo) | Fast key lookups | Dynamic data, frequent changes |
### Key Pointers
1. **Memory Efficiency**: Linked lists allocate memory only when necessary, making them ideal for variable-sized datasets.
2. **Ease of Insertions/Deletions**: Linked lists handle frequent insertions and deletions without rearranging data, unlike arrays or stacks/queues.
3. **Access Flexibility**: Linked lists allow traversal from any position, unlike the strict LIFO/FIFO access patterns of stacks and queues.
4. **Lower Overhead than Hash Tables**: While hash tables provide fast access, they require additional memory for buckets, which isn’t necessary in this library system.
---
# References
###### Information
- date: 2024.11.09
- time: 07:59