Anjuman-I-Islam’s

M.H. Saboo Siddik Polytechnic

Subject name: Data Structures Using C (22317)

DEPARTMENT NAME: Computer Engineering

Semester: iii rd

Microproject title: College Management System

Prepared by:

1. Sayyed Abdul Mannan 220447

2. Shaikh Imran Mohammad Islam 220450

3. Shaikh Mohammed Mahir 220452

4. Shaikh Tauheed Abdul Hameed 220457

5. Deepak Ramdarsh Yadav 220463

6. Zaid Surfraz Ahmed Ansari 230486

UNDER THE GUIDANCE OF: Mrs. Shafaque Julaha

1
 MAHARASHTRA STATE
BOARD OF TECHNICAL EDUCATION
Certificate
This is to certify that Mr. Sayyed Abdul Mannan Roll No. 220447 of 3rd Semester of

Diploma in Computer Engineering of Institute MH Saboo Siddik Polytechnic has

successfully completed Micro project work in subject Data Structures Using C

(22317) for the academic year 2023-24 as prescribed in the I-Scheme Curriculum.

Place: Mumbai Enrollment No.: 2200020319

Date: Exam seat no: 100658

Signature Signature Signature

Project Guide H.O.D Principal

Seal Of
Institution

2
 MAHARASHTRA STATE
BOARD OF TECHNICAL EDUCATION
Certificate
This is to certify that Mr. Shaikh Imran Mohammad Islam Roll No. 220450 of 3rd

Semester of Diploma in Computer Engineering of Institute MH Saboo Siddik

Polytechnic has successfully completed Micro project work in subject Data

Structures Using C (22317) for the academic year 2023-24 as prescribed in the I-

Scheme Curriculum.

Place: Mumbai Enrollment No.: 2200020356

Date: Exam seat no: 100695

Signature Signature Signature

Project Guide H.O.D Principal

Seal Of
Institution

3
 MAHARASHTRA STATE
BOARD OF TECHNICAL EDUCATION
Certificate
This is to certify that Mr. Shaikh Mohammed Mahir Roll No. 220452 of 3rd

Semester of Diploma in Computer Engineering of Institute MH Saboo Siddik

Polytechnic has successfully completed Micro project work in subject Data

Structures Using C (22317) for the academic year 2023-24 as prescribed in the I-

Scheme Curriculum.

Place: Mumbai Enrollment No.: 2200020367

Date: Exam seat no: 100706

Signature Signature Signature

Project Guide H.O.D Principal

Seal Of
Institution

4
 MAHARASHTRA STATE
BOARD OF TECHNICAL EDUCATION
Certificate
This is to certify that Mr. Shaikh Tauheed Abdul Hameed Roll No. 220457 of 3rd

Semester of Diploma in Computer Engineering of Institute MH Saboo Siddik

Polytechnic has successfully completed Micro project work in subject Data

Structures Using C (22317) for the academic year 2023-24 as prescribed in the I-

Scheme Curriculum.

Place: Mumbai Enrollment No.: 2200020360

Date: Exam seat no: 100699

Signature Signature Signature

Project Guide H.O.D Principal

Seal Of
Institution

5
 MAHARASHTRA STATE
BOARD OF TECHNICAL EDUCATION
Certificate
This is to certify that Mr. Deepak Ramdarsh Yadav Roll No. 220463 of 3rd Semester

of Diploma in Computer Engineering of Institute MH Saboo Siddik Polytechnic has

successfully completed Micro project work in subject Data Structures Using C

(22317) for the academic year 2023-24 as prescribed in the I-Scheme Curriculum.

Place: Mumbai Enrollment No.: 2200020343

Date: Exam seat no: 100682

Signature Signature Signature

Project Guide H.O.D Principal

Seal Of
Institution

6
 MAHARASHTRA STATE
BOARD OF TECHNICAL EDUCATION
Certificate
This is to certify that Mr. Zaid Surfraz Ahmed Ansari Roll No. 230486 of 3rd

Semester of Diploma in Computer Engineering of Institute MH Saboo Siddik

Polytechnic has successfully completed Micro project work in subject Data

Structures Using C (22317) for the academic year 2023-24 as prescribed in the I-

Scheme Curriculum.

Place: Mumbai Enrollment No.: 23150360356

Date: Exam seat no: 100713

Signature Signature Signature

Project Guide H.O.D Principal

Seal Of
Institution

7
 ACKNOWLEDGMENT

We wish to express our profound gratitude to our guide Mrs. Shafaque

Julaha who guided us endlessly in the framing and completion of the micro project.
She guided us on all the main points in the micro project. We are indebted to her
constant encouragement, cooperation, and help. It was her enthusiastic support that
helped us in overcoming various obstacles in the micro-project.

We are also thankful to our Principal, HOD, faculty members and

classmates of Computer Engineering department for extending their
support and motivation in the completion of this micro-project.

Team Members:

1. Sayyed Abdul Mannan Abdul Salam 220447

2. Shaikh Imran Mohammad Islam 220450
3. Shaikh Mohammed Mahir Mohd Munawar 220452
4. Shaikh Tauheed Abdul Hameed 220457
5. Deepak Ramdarash Yadav 220463
6. Zaid Surfraz Ahmed Ansari 230486

8
 Annexure I
MICRO PROJECT PROPOSAL

COLLEGE MANAGEMENT SYSTEM

1.0 Aims/ Benefits of the Micro Project

Aim: To create College Management System in C by implementing
Data Structure Linked List (Singly Linked List) and generate Merit list
using Selection Sort and do Searching.

Benefit: We will be able to write C program to implement Linked List

and apply various operations like Inserting, Deleting, Searching and
Sorting on the data structure (Linked List). We will be able to handle out
errors which might arise during program execution.

2.0 Course Outcomes Addressed

a) Perform basic operations on arrays
b) Apply different searching and sorting techniques
c) Implement basic operations on stack and queue using array
representation
d) Implement basic operations on Linked List
e) Implement program to create and traverse tree to solve problems

3.0 Proposed Methodology:

 Data Collection: Collected data about the relevant topic and data
structure.
 Algorithms: Created Algorithms for data operations like
Insertion, deletion, searching, switching users, traversing, calling
functions in the main () using switch-case, etc.
 Flowchart: Implemented Algorithm into flowchart to analyze the
flow of the program. Hence resulting in the final implementation
of coding.
 Coding: Implemented the algorithm into the program.
 Program Testing: Testing and analyzing the program to find out
bugs, errors, and ambiguities in the program.
 Debugging: Debugging out the bugs and errors in the compilation
as well as running of the program. Making the program User-
friendly by handling Exceptions in Runtime.
 Final Analysis: Analyzing the working of the program and
efficiency of the code.
 Reporting: Making the report for the created project.

9
 Annexure-I

4.0 Action Plan

Name of
Week Details of activity Planned Planned Responsible
Start date Finish Team
date Members
1 Discussion and finalization of the topic. All Members
2 Preparation of the abstract All Members

3 Planning the design of the project Sayyed Abdul

Mannan, Deepak
Yadav, Imran Shaikh
Submission of micro project proposal Deepak Yadav,
4
(Annexure I) Tauheed Shaikh
Collection of the information on the Shaikh Mohd Imran,
5
topic. Shaikh Md Mahir
Created Algorithms for the operations Shaikh Tauheed,
6 applied on the data structures Shaikh Md
Imran
Discussion and submission of outline of Shaikh Md Imran,
7
the project. Shaikh Tauheed
Making of flowchart and analyzing the Sayyed Abdul
8 & 9 flow of program. Mannan, Deepak
Implementation of algorithm to code. Yadav, Shaikh Md
Mahir
10 Compilation of contents of project Sayyed Abdul
Mannan, Zaid
Ansari
11 Compilation of weekly progress report Shaikh Tauheed,
Deepak Yadav,
Zaid Ansari
Preparation of the project report Deepak Yadav,
12
(Annexure II) Shaikh Tauheed,
Shaikh Md Mahir
13 Viva Voce / Delivery of presentation. All Members

10
 5.0 Resources Required
Sr.
No. Name of Resource/material Specifications Quantity Remarks

Turbo C/C++ TURBOC3 or 1

1 TURBOC4

Internet Website -
2

Laptop/Desktop Computer 8GB RAM, 1 for each

4 Windows 10 Pro

Software MS Word 1
5
Browser Chrome 1
6

Names of Team Members with Roll Nos:

1. Sayyed Abdul Mannan 220447

2. Shaikh Imran Mohammad Islam 220450
3. Shaikh Mohammed Mahir 220452
4. Shaikh Tauheed Abdul Hameed 220457
5. Deepak Ramdarash Yadav 220463
6. Zaid Surfraz Ahmed Ansari 230486

Shafaque Julaha
(To be approved by the concerned teacher)

11
 Annexure - II

Micro-Project Report

COLLEGE MANAGEMENT SYSTEM

1.0 Rationale:
Data structure is an important aspect for Computer Engineering and Information
Technology Diploma graduates. Data structure is a logical & mathematical model
of storing & organizing data in a particular way in a computer. The methods and
techniques of Data Structures are widely used in industries. After learning this
subject student will be able to identify the problem, analyze different algorithms to
solve the problem & choose most appropriate data structure to represent the data.

2.0 Aims/Benefits of the Micro-Project:

The aim of this microproject is to create a College Management System using Linked
Lists and implement the Selection Sort algorithm for sorting.
• Students will learn how to use Linked Lists for data management.
• They will gain practical experience in applying the Selection Sort algorithm.
• This project offers real-world relevance and problem-solving skills.
• It can be completed in small teams, promoting collaboration.
• Students can add this project to their portfolios for future opportunities.
• It helps them learn time management skills.

3.0 Course Outcomes Achieved:

a) Perform basic operations on arrays.
b) Apply different searching and sorting techniques.
c) Implement basic operations on stack and queue using array representation.
d) Implement basic operations on Linked List
e) Implement program to create and traverse tree to solve problems.

4.0 Literature Review:

1. Data Management: College Management Systems require efficient data
handling. Linked lists offer a dynamic structure for managing student and
faculty records.

2. Sorting Students: Selection sort is a straightforward algorithm to sort

student data by criteria like student ID or name.

3. Flexibility and Simplicity: Linked lists allow dynamic data changes, which
simplifies the management of student records.

4. Efficiency: The combination of linked lists and selection sort provides a

straightforward and efficient approach to data management and sorting
in college systems.

12
 5. Future Enhancements: Future research can explore advanced data
structures and algorithms for further optimizing College Management
Systems.

5.0 Actual Methodology Followed:

1. Objective:
To create a College Management System using Linked Lists for data storage and
implementing the Selection Sort algorithm for efficient data sorting in the C
programming language.

2. Methodology:
a. Data Structure Selection:
 Utilize a Linked List data structure to manage and store data efficiently.
b. Software Development Environment:
 Use C as the primary programming language.
 Develop in a C-supported IDE or a simple text editor (e.g., Visual Studio
Code or Turbo C++).
c. System Modules:
 Implement Student Information, Course Management, Administrative,
and Sorting modules using C data structures.
d. Data Entry and User Interface:
 Create a text-based user interface for data input and system interaction.
 Implement a user authentication system and access control for
administrative tasks.
e. Selection Sort Implementation:
 Write and integrate the Selection Sort algorithm in C to efficiently sort data
within the system.
 Ensure the sorting process enhances the system's functionality.
f. Testing and Validation:
 Thoroughly test the system for functionality and data accuracy.
 Validate the Selection Sort algorithm's correctness and efficiency through
test cases.
g. Documentation:
 Document the project's C code, modules, and system functionality.
 Create a user manual in a simple text format for system users and
maintainers.

3. Deliverables:
 A functional College Management System in C with a text-based user interface.
 Integration of the Selection Sort algorithm for data sorting.
 Project documentation in C source code and a user manual.

13
 4. Conclusion:
This simple methodology outlines the development of a College Management System
using Linked Lists and Selection Sort in the C programming language, aiming to improve data
management and administrative tasks in a college environment.

6.0 Actual Resources Used:

Sr No. Name of Resources Specifications Quantity Remarks

Min 8GB RAM,

1 Computer System 1
Windows 10 Pro
Turbo C3,
2 Software 1
MS Word
3 Internet Google 1
Provided by the
4 Lecture PPT As required
guide

7.0 Outputs of the Micro project:

 Research Design:
 The proposed design is made user-friendly and tried to minimize
maximum errors/exceptions that may interrupt user like any invalid
value can lead to infinite loop.
 The program contains two separate sections i.e. two modes in which
the user can login to any one page. The modes are -> View Mode and
Edit Mode.
 View Mode contains only viewing records, mark sheet, merit list and
searching, not allowing to modify any record.
 Edit Mode is secured by a 4-digit numerical string password and
wrong passwords are also handled efficiently.
 Edit Mode contains all features of view mode and allows user to
Insert and delete records.
 There are three data tables viz. Student Record table, Mark Sheet
table and Merit List.
 Student Record is the parent table through which students are
automatically inserted in Mark sheet as well as in Merit list, and same
goes for deletion.
 The Menus are listed as:
Keys View Mode Edit Mode
0 Exit
1 View Record Insert Record
2 View Marks Sheet Delete Record
Search [1. Record |
3 View Merit List
2. Marks]
4 Search Record View Record

14
 5 Search Marks Insert Marks
6 Developers View Mark Sheet
7 Menu Again Generate Merit List
8 - Developers
9 - Menu Again
10 Log Out

 Data Collection: Collected data about Management System and key features
to allow user to manage and view data. No other external data is required
except as directed by the subject guide.
 Data Analysis: Data Structure and algorithms are analyzed before
implementation to code.
 Data Structure Singly Linked List is used to achieve all the features
described above (for data storage, traversing, searching, etc.).
 Selection sort is applied to the existing data in the Merit List
structure to generate Merit List rank wise.
 Switch-case is the main conditional statement used in the creation of
the program. If-else is also used for short conditions like password
verification.
 Goto control statement is used to control the flow, like when user
logs out then it turns the flow towards the beginning Login session
again.
 Do-while loop is used to control the whole-body execution again and
again to prompt the user to enter a choice. Other loops used are while
loop and for loop for traversing purposes.
 Data Processing and Algorithms: The algorithms are required to create
larger programs to achieve a stepwise approach towards problem-Solving.
Algorithms are then implemented to Flow chart to efficiently analyze the
flow program.

Algorithms:

 Insert_rec()
1. Declare *trav,*ptr, trav2,*ptr2, *trav3,ptr3
2. Input n
3. If n=0 then return
4. If total_students=0 then
5. Prompt for student details (roll number, name, date of birth, contact)
and store the data in *start.
6. IF n=1 OR total_students > 0 then
Set j=0
7. Allocate memory for 'record *ptr' , 'mark *ptr2' , and 'merit *ptr3'
8. Prompt for student details (roll number, name, date of birth, contact)

 Delete_rec()
1. Start
2. Declare (record) *trav, *temp, *del, (mark) *trav2, *temp2, *del2
3. Input roll_num to delete

15
 4. Set Ts :=total_students
5. Traverse the linked list of student records:
6. IF trav->rollno= roll
7. IF trav=start
Set i) temp=trav
ii) temp2=trav2
8. Update start=start->next
9. head=head->next
10. Release memory of temp,temp2
11. Decrement total_students by 1
12. IF total_student =Ts then
Print "No record Found"
13. Stop

 Search_rec()
1. Start
2. If total_students = 0 then print empty message and return.
3. Input roll
4. Traverse the list using *trav
If trav->rollno = roll then print data
Else
Print “No Record Found”.
5. Stop.

 Sel_Sort()
1. start
2. Declare (merit) *trav, *trav2, *temp, *ptr, *max, *index
3. trav :=start
4. IF trav->next!=NULL
5. Set i)trav2=trav->next
6. ii) max := trav
7. iii) ptr := trav
8. iv) index := trav
9. IF trav2!=NULL , repeat step 7 to 13
10. IF index->perc is less than trav2->perc, then:
i) Set max := trav2
ii) index :=trav2
11. trav2=trav2->next
12. allocate memory for temp
13. Copy the rollno, total, and perc values from max to temp
14. Copy the rollno, total, and perc values from ptr to max
15. Copy the rollno, total, and perc values from temp to ptr
16. Free (temp)
17. trav=trav->next
18. Stop

16
Flowcharts:
 Insertion: START

Input n

If total_ NO YES
If
students= n<=0
0

YES NO If n=1
OR
ts>0
Input data in *start,
*head, *first

YES

J=0
Next = NULL

NO
If J<n

YES

Allocate memory to
ptr

Input data in
*ptr1, *ptr2, *ptr3

Insert ptr in the next of last node and

ptr->next = NULL

J=J+1

STOP

17
  Deletion:
START

Check Empty
Input roll no condition

NO
If
Traverse the list Print “No
Rollno
record found”
found

YES

Prev->next =
trav->next then STOP
free trav

START

 Searching:

Check empty
condition Input Roll no

*trav = start

YES
If trav-> If trav! NO
Rollno = =
rollno NULL

Display
data trav = trav->next

START 18
 Selection Sort:
START

Trav=start
Trav2 = trav->next

If trav -> max = trav

next! = ptr= trav
NULL index = trav

If (index->perc) If trav2
< (trav2->perc) !=NULL

max = trav2
index = trav2

trav2 = trav2->next

trav= trav->next Swap data of max and ptr

STOP

19
  Traversing:
START

Check empty condition Trav = start

Display trav->data If trav !=

Trav = trav->next NULL

STOP

 Check empty condition START

If GOTO
Total_students ‘STOP’ of
=0 Calling
Function

STOP

20
CODE: return 1;
#include<project.h> else
return 0;
int n,i,total_students=0,in=0; }
typedef struct student{ void printempty(){
int rollno; printf("Record is Empty!\n");
char name[30]; margin(80);
char dob[15]; }
char contact[12];
struct student *next; //Operation Functions
}record; void insert()
record *start; {
record *trav,*ptr,*last;
typedef struct list{ mark *trav2,*ptr2,*last2;
int rollno; merit *trav3,*ptr3,*last3;
int oop; int j=1;
int dsu; margin(80);
int dms; printf("How many records? ");
int cgr; scanf("%d",&n);
int dte; if(n>0){
float total; printf("Enter details for Students:
float perc; \n");
struct list *next; if(total_students==0)
}mark; {
mark *head; printf("\nRoll No.: ");
scanf("%d",&start->rollno);
typedef struct list2{ head->rollno=start->rollno;
int rank, rollno; first->rollno=head->rollno;
float total, perc; head->oop=head->dsu=head-
struct list2 *next; >cgr=NULL;
head->dms=head->dte=head-
}merit; >total=head->perc=NULL;
merit *first; first->total=first-
>perc=NULL;
//Formatting Functions printf("Name: ");
void margin(int length) scanf("%s",&start->name);
{ printf("Date of Birth: ");
for(i=0;i<length;i++) scanf("%s",&start->dob);
{ printf("Contact Number: ");
printf("-"); scanf("%s",start->contact);
} start->next=NULL;
} head->next=NULL;
void heading(char headline[]) first->next=NULL;
{ total_students++;
printf("\t\t\t "); }
puts(headline); else if(n==1 || total_students>0)
} j=0;
void tab(int space,int len) trav=start;
{ trav2=head;
while(space<=len){ trav3=first;
printf(" "); while(trav->next!=NULL){
space++; trav = trav->next;
} trav2 = trav2->next;
} trav3 = trav3->next;
int empty() }
{ for(i=j;i<n;i++)
if(total_students==0) {
21
 ptr=(record tab(string, 12);
*)malloc(sizeof(record)); printf("%s\n",trav->contact);
ptr2=(mark count++;
*)malloc(sizeof(mark)); trav = trav->next;
ptr3=(merit }
*)malloc(sizeof(merit)); margin(80);
printf("\nRoll No.: "); printf("%d rows selected\n",count);
scanf("%d",&ptr->rollno); margin(80);
ptr2->rollno=ptr->rollno; }
ptr3->rollno=ptr2->rollno; void del_merit(int);
ptr2->oop=ptr2->dsu=ptr2- void delete()
>cgr=NULL; {
ptr2->dms=ptr2->dte=ptr2- record *trav,*temp,*del;
>total=ptr2->perc=NULL; mark *trav2,*temp2,*del2;
ptr3->total=ptr3->perc=NULL; merit *trav3,*temp3,*del3;
printf("Name: "); int roll,ts=total_students;
scanf("%s",&ptr->name); trav=start, del=start;
printf("Date of Birth: "); trav2=head, del2=head;
scanf("%s",&ptr->dob); printf("\nEnter Roll No. to delete
printf("Contact Number: "); Record: ");
scanf("%s",&ptr->contact); scanf("%d",&roll);
ptr->next=NULL; while(trav!=NULL){
ptr2->next=NULL; if(trav->rollno==roll)
ptr3->next=NULL; {
trav->next=ptr; if(trav==start){
trav2->next=ptr2; temp=trav;
trav3->next=ptr3; temp2=trav2;
trav=ptr; start=start-
trav2=ptr2; >next;
trav3=ptr3; head=head->next;
total_students++; free(temp);
} free(temp2);
} total_students--;
else{ del_merit(roll);
printf("\nValue should be printf("\nRecord
greater than Zero!\n"); Deleted!\n");
return; return;
} }
margin(80); while(del->next!=trav
printf("%d rows inserted\n",n); && del2->next!=trav2){
margin(80); del=del->next;
} del2=del2->next;
void view_record() }
{ temp=trav;
record *trav; temp2=trav2;
int count=0, string; del->next=trav->next;
trav=start; del2->next=trav2->next;
printf("Roll No\t\tName free(temp);
DOB Mobile No\n"); free(temp2);
margin(80); del_merit(roll);
while(trav!=NULL){ total_students--;
string=strlen(trav->name); printf("\n1 Record
printf("%d\t\t%s",trav- Deleted!\n");
>rollno,trav->name); margin(80);
tab(string, 15); return;
printf("%s",trav->dob); }
string=strlen(trav->dob); trav=trav->next;
22
 trav2=trav2->next; if(trav==NULL){
} printf("Student with Roll No
if(total_students==ts){ %d doesn't exist...\n",roll);
printf("\nNo Record }
Found\n"); else{
margin(80); printf("\nEnter Marks for
return; Roll No %d:",roll);
} printf("\nOOP: ");
} scanf("%d",&trav->oop);
void search_rec() printf("DSU: ");
{ scanf("%d",&trav->dsu);
record *trav; printf("DMS: ");
int roll,string; scanf("%d",&trav->dms);
margin(80); printf("CGR: ");
printf("Enter Roll No to search: scanf("%d",&trav->cgr);
"); printf("DTE: ");
scanf("%d",&roll); scanf("%d",&trav->dte);
trav=start; trav->total=(float)(trav-
while(trav!=NULL){ >oop+trav->dsu+trav->dms+trav->cgr+trav-
if(trav->rollno==roll){ >dte);
printf("Roll No\t\tName trav->perc = (trav-
DOB Mobile No\n"); >total*100)/500;
margin(80); t->total=trav->total;
string=strlen(trav->name); t->perc=trav->perc;
printf("%d\t\t%s",trav- rows++;
>rollno,trav->name); }
tab(string, 15); }
printf("%s",trav->dob); printf("%d rows inserted.\n",rows);
string=strlen(trav->dob); margin(80);
tab(string, 12); }
printf("%s\n",trav->contact); void marksheet()
margin(80); {
return; mark *trav;
} int count =0;
trav=trav->next; trav=head;
} heading("\tMARKSHEET");
printf("\nNo Record Found!\n"); margin(80);
margin(80); printf("Roll
} No\tOOP\tDSU\tDMS\tCGR\tDTE\tTotal\t\tPer
void inmarks() centage\n");
{ margin(80);
mark *trav; int rows=0,roll; while(trav!=NULL)
merit *t; {
for(i=0;i<in;i++){
printf("\nEnter Roll No to enter printf("%d\t%d\t%d\t%d\t%d\t%d\t%.0
marks: "); f\t\t%.2f\n",trav->rollno,trav->oop,trav-
scanf("%d",&roll); >dsu,trav->dms,trav->cgr,trav->dte,trav-
trav=head; >total,trav->perc);
t=first; trav=trav->next;
while(trav!=NULL) count++;
{ }
if(trav->rollno==roll) margin(80);
break; printf("%d rows selected from
else Marksheet\n",count);
trav=trav->next; margin(80);
t=t->next; }
} void search_mark()
23
{ ptr->total = temp->total;
int roll; ptr->perc = temp->perc;
mark *trav; free(temp);
trav=head; trav=trav->next;
printf("Enter Roll No to search }
marks: ");
scanf("%d",&roll); }
margin(80); void meritlist()
while(trav!=NULL) { int rank=1, count=0;
{ merit *trav;
if(trav->rollno==roll){ trav=first;
printf("Roll trav->rank=rank;
No\tOOP\tDSU\tDMS\tCGR\tDTE\tTotal\t\tPer heading("\tMERIT LIST");
centage\n"); margin(80);
margin(80); printf("Rank\tRoll
No\tTotal\tPercentage\n");
printf("%d\t%d\t%d\t%d\t%d\t%d\t%.0 margin(80);
f\t\t%.2f\n",trav->rollno,trav->oop,trav- while(trav!=NULL){
>dsu,trav->dms,trav->cgr,trav->dte,trav-
>total,trav->perc); printf("%d\t%d\t%.0f\t%.2f\n",trav-
return; >rank,trav->rollno,trav->total,trav-
} >perc);
trav=trav->next; count++;
} trav=trav->next;
if(trav==NULL){ trav->rank=++rank;
printf("\nNo Record }
Found!\n"); margin(80);
} printf("%d rows selected from Merit
margin(80); List.\n",count);
} margin(80);
void sel_sort()
{ }
merit void del_merit(int roll)
*trav,*trav2,*temp,*ptr,*max,*index; {
trav=first; merit *trav,*del,*temp;
while(trav->next!=NULL){ trav=first;
trav2=trav->next; del=first;
max=trav; while(trav!=NULL){
ptr=trav; if(trav->rollno==roll)
index=trav; {
while(trav2!=NULL){ if(trav==first){
if((index->perc) < temp=trav;
(trav2->perc)){ first=first-
max=trav2; >next;
index=trav2; printf("\n%d
} deleted...\n",temp->rollno);
trav2=trav2->next; free(temp);
} return;
temp=(merit }
*)malloc(sizeof(merit)); while(del->next!=trav){
temp->rollno = max->rollno; del=del->next;
temp->total = max->total; }
temp->perc = max->perc; temp=trav;
max->rollno = ptr->rollno; printf("\n%d
max->total = ptr->total; deleted\n",temp->rollno);
max->perc = ptr->perc; del->next=trav->next;
ptr->rollno = temp->rollno; free(temp);
24
 return; pixmode();
} x=getmaxx()/2;
trav=trav->next; y=getmaxy()/2;
} settextstyle(1,0,100);
} outtextxy(x-100,y,"COLLEGE
void devs() MANAGEMENT SYSTEM");
{ setcolor(GREEN);
margin(80); rectangle(10,10,30,2*y);
heading("DEVELOPERS"); floodfill(15,15,GREEN);
margin(80); rectangle(10,10,2*x,30);
printf("220447 Sayyed Abdul rectangle(2*x-30,10,2*x,2*y);
Mannan\n"); rectangle(10,2*x-30,2*x,2*y);
printf("220450 Shaikh Imran\n"); floodfill(2*x-10,y,GREEN);
printf("220452 Sayyed Md. for(g=10;g<=getmaxx();g++){
Mahir\n"); delay(7);
printf("220457 Shaikh setcolor(GREEN);
Tauheed\n"); circle(g,20,10);
printf("220463 Deepak Yadav\n"); }delay(50);
printf("220486 Khan Zaid\n"); closegraph();
margin(80); clrscr();
} l1: margin(80);
void menus() heading("COLLEGE MANAGEMENT
{ SYSTEM");
margin(80); margin(80);
printf("MENU:\n"); printf("LOG IN TO: \t0. EXIT \t1.
printf("1. Insert Student VIEW MODE\t2. EDIT MODE\t");
Record\n2. Delete\n3. Search\n4. View scanf("%d",&login);
Record\n"); fail=0;
printf("5. Insert Marks to if(login==2){
Marksheet\n6. View Marksheet\n7. View margin(80);
Merit List\n"); do{
printf("8. Developers\n9. Menu printf("Enter Password: ");
Again\n10. Log Out\n0. Exit\n"); scanf("%s",&pw);
margin(80); if(strcmp(pw,"2204")!=0){
} printf("Wrong Password\n\n");
void menus2() fail++;
{ }
margin(80); if(fail==3){
printf("MENU:\n"); printf("\nWrong Password
printf("1. View Record\n2. View Entered Three Times...\n");
Marksheet\n3. View Meritlist\n"); delay(1000);
printf("4. Search Record\n5. Search clrscr();
Marks\n6. Developers\n"); goto l1;
printf("7. Menu Again\n10. Log }
Out\n0. Exit\n"); }while(strcmp(pw,"2204")!=0);
margin(80); if(strcmp(pw,"2204")==0){
} margin(80);
void main() printf("LOGGED INTO EDIT MODE\n");
{ menus();
int menu, l3: do{
s,login,x,y,g,p,fail,size=200; printf("\nEnter your choice: ");
char pw[10]; scanf("%d",&menu);
start=(record switch(menu){
*)malloc(sizeof(record)); case 1: //insert
head=(mark *)malloc(sizeof(mark)); insert();
first=(merit break;
*)malloc(sizeof(merit));
25
 case 2: //delete }while(in>total_students);
margin(80); inmarks();
if(empty()==1){ break;
printempty();
break; case 6: //marksheet
} margin(80);
delete(); if(empty()==1){
break; printempty();
margin(80);
case 3: //search break;
margin(80); }
if(empty()==1){ marksheet();
printempty(); break;
break;
} case 7: //meritlist
printf("Search into? 1. margin(80);
Record\t2. Marksheet: "); if(empty()==1){
scanf("%d",&s); printempty();
switch(s){ break;
case 1: }
search_rec(); sel_sort();
break; meritlist();
break;
case 2:
search_mark(); case 8:
break; devs();
break;
default:
printf("\nInvalid case 9:
Choice!\n"); menus();
margin(80); break;
break;
} case 10:
break; margin(80);
case 4: //view printf("\nLogging
margin(80); Out........\n\t\t\t\t\tLogged Out!\n");
if(empty()==1){ margin(80);
printempty(); delay(2000);
break; clrscr();
} goto l1;
view_record(); break;
break;
case 0:
case 5: //insert marks printf("Exit...\n");
if(empty()==1){ printf("Press any key to
printempty(); exit...");
break; getch();
} exit();
do{
printf("How many records to default:
enter in Marksheet? "); printf("\nINVALID CHOICE!");
scanf("%d",&in); break;
if(in>total_students){ }
printf("\nEntered }while(menu!=0);
number is more than existing record }
(%d).",total_students); else{
} printf("Wrong
26
Password!"); case 3: //meritlist
} margin(80);
} if(empty()==1){
else if(login==1){ printempty();
margin(80); break;
printf("LOGGED INTO VIEW }
MODE\n"); sel_sort();
menus2(); meritlist();
do{ break;
printf("\nEnter your choice: ");
scanf("%d",&menu); case 6:
switch(menu){ devs();
break;
case 4: //search
margin(80); case 7:
if(empty()==1){ menus2();
printempty(); break;
break;
} case 10:
search_rec(); printf("\nLogging
break; Out........\n\t\t\t\t\tLogged Out!\n");
margin(80);
case 5: delay(2000);
margin(80); clrscr();
if(empty()==1){ goto l1;
printempty(); break;
break;
} case 0:
search_mark(); lxit: printf("Exit...\n");
break; printf("Press any key to
exit...");
case 1: //view getch();
margin(80); exit();
if(empty()==1){
printempty(); default:
break; printf("\nINVALID CHOICE!");
} break;
view_record(); }
break; }while(menu!=0);
}
case 2: //marksheet else if(login==0){
margin(80); goto lxit;
if(empty()==1){ }
printempty(); else{
break; printf("\nInvalid Choice!");
} goto l1;
margin(80); }
marksheet(); getch();
break; }

27
EXECUTION OF THE
PROGRAM:

28
29
30
31
AFTER SWITCHING TO EDIT MODE AND DELETING A RECORD:

32
33
 Annexure IV
Micro Project Evaluation Sheet

Name: Sayyed Abdul Mannan Abdul Salam Enrolment No.: 2200020319

Name of Department: Computer Engineering Semester: 3

Course Title: Data Structures Using C Code: 22317

Title of the Micro project: College Management System

Course Outcomes Achieved: -
a) Perform basic operations on arrays.
b) Apply different searching and sorting techniques.
c) Implement basic operations on stack and queue using array representation.
d) Implement basic operations on Linked List
e) Implement program to create and traverse tree to solve problems.
Sr. Poor Average Good Excellent
Characteristics to be assessed
No. (Marks 1 (Marks 4 - 5) (Marks 6 - 8) (Marks 9- 10)
- 3) Subtotal

(A) Process and Product Assessment (Convert above total marks out of 6 Marks)

1 Relevance to the course

2 Literature
Review/information
Collection
3 Completion of the
Target as per project
proposal
4 Analysis of
Data and
Representation
5 Quality of Prototype/Model

6
Report Preparation

(B) Individual Presentation/ Viva (Convert above total marks out of 4 Marks)

7 Presentation

8 Viva

(A) (B)
Total Marks10
Process and Product Assessment(6 marks) Individual Presentation
&viva (4 marks)

Comments/Suggestions about teamwork/leadership/inter-personal communication (if any)

………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………
Name and designation of the Teacher ………………………………………….

Dated Signature………………………………………………………………
34
 Annexure IV
Micro Project Evaluation Sheet

Name: Shaikh Imran Mohd Islam Enrolment No.: 2200020356

Name of Department: Computer Engineering Semester: 3

Course Title: Data Structures Using C Code: 22317

Title of the Micro project: College Management System

Course Outcomes Achieved: -
a) Perform basic operations on arrays.
b) Apply different searching and sorting techniques.
c) Implement basic operations on stack and queue using array representation.
d) Implement basic operations on Linked List
e) Implement program to create and traverse tree to solve problems.

Sr. Poor Average Good Excellent

Characteristics to be assessed
No. (Marks 1 (Marks 4 - 5) (Marks 6 - 8) (Marks 9- 10)
- 3) Subtotal

(A) Process and Product Assessment (Convert above total marks out of 6 Marks)

1 Relevance to the course

2 Literature
Review/information
Collection
3 Completion of the
Target as per project
proposal
4 Analysis of
Data and
Representation
5 Quality of Prototype/Model

6
Report Preparation

(B) Individual Presentation/ Viva (Convert above total marks out of 4 Marks)

7 Presentation

8 Viva

(A) (B)
Total Marks10
Process and Product Assessment(6 marks) Individual Presentation
&viva (4 marks)

Comments/Suggestions about teamwork/leadership/inter-personal communication (if any)

………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………
Name and designation of the Teacher ………………………………………….

Dated Signature………………………………………………………………
35
 Annexure IV
Micro Project Evaluation Sheet

Name: Shaikh Mohammed Mahir Mohd Munawar Enrolment No.: 2200020367

Name of Department: Computer Engineering Semester: 3

Course Title: Data Structures Using C Code: 22317

Title of the Micro project: College Management System

Course Outcomes Achieved: -
a) Perform basic operations on arrays.
b) Apply different searching and sorting techniques.
c) Implement basic operations on stack and queue using array representation.
d) Implement basic operations on Linked List
e) Implement program to create and traverse tree to solve problems.

Sr. Poor Average Good Excellent

Characteristics to be assessed
No. (Marks 1 (Marks 4 - 5) (Marks 6 - 8) (Marks 9- 10)
- 3) Subtotal

(A) Process and Product Assessment (Convert above total marks out of 6 Marks)

1 Relevance to the course

2 Literature
Review/information
Collection
3 Completion of the
Target as per project
proposal
4 Analysis of
Data and
Representation
5 Quality of Prototype/Model

6
Report Preparation

(B) Individual Presentation/ Viva (Convert above total marks out of 4 Marks)

7 Presentation

8 Viva

(A) (B)
Total Marks10
Process and Product Assessment(6 marks) Individual Presentation
&viva (4 marks)

Comments/Suggestions about teamwork/leadership/inter-personal communication (if any)

………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………
Name and designation of the Teacher ………………………………………….

Dated Signature………………………………………………………………
36
 Annexure IV
Micro Project Evaluation Sheet

Name: Shaikh Tauheed Abdul Hameed Enrolment No.: 2200020360

Name of Department: Computer Engineering Semester: 3

Course Title: Data Structures Using C Code: 22317

Title of the Micro project: College Management System

Course Outcomes Achieved: -
a) Perform basic operations on arrays.
b) Apply different searching and sorting techniques.
c) Implement basic operations on stack and queue using array representation.
d) Implement basic operations on Linked List
e) Implement program to create and traverse tree to solve problems.

Sr. Poor Average Good Excellent

Characteristics to be assessed
No. (Marks 1 (Marks 4 - 5) (Marks 6 - 8) (Marks 9- 10)
- 3) Subtotal

(A) Process and Product Assessment (Convert above total marks out of 6 Marks)

1 Relevance to the course

2 Literature
Review/information
Collection
3 Completion of the
Target as per project
proposal
4 Analysis of
Data and
Representation
5 Quality of Prototype/Model

6
Report Preparation

(B) Individual Presentation/ Viva (Convert above total marks out of 4 Marks)

7 Presentation

8 Viva

(A) (B)
Total Marks10
Process and Product Assessment(6 marks) Individual Presentation
&viva (4 marks)

Comments/Suggestions about teamwork/leadership/inter-personal communication (if any)

………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………
Name and designation of the Teacher ………………………………………….

Dated Signature………………………………………………………………
37
 Annexure IV
Micro Project Evaluation Sheet

Name: Yadav Deepak Ramdarash Enrolment No.: 2200020343

Name of Department: Computer Engineering Semester: 3

Course Title: Data Structures Using C Code: 22317

Title of the Micro project: College Management System

Course Outcomes Achieved: -
a) Perform basic operations on arrays.
b) Apply different searching and sorting techniques.
c) Implement basic operations on stack and queue using array representation.
d) Implement basic operations on Linked List
e) Implement program to create and traverse tree to solve problems.

Sr. Poor Average Good Excellent

Characteristics to be assessed
No. (Marks 1 (Marks 4 - 5) (Marks 6 - 8) (Marks 9- 10)
- 3) Subtotal

(A) Process and Product Assessment (Convert above total marks out of 6 Marks)

1 Relevance to the course

2 Literature
Review/information
Collection
3 Completion of the
Target as per project
proposal
4 Analysis of
Data and
Representation
5 Quality of Prototype/Model

6
Report Preparation

(B) Individual Presentation/ Viva (Convert above total marks out of 4 Marks)

7 Presentation

8 Viva

(A) (B)
Total Marks10
Process and Product Assessment(6 marks) Individual Presentation
&viva (4 marks)

Comments/Suggestions about teamwork/leadership/inter-personal communication (if any)

………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………
Name and designation of the Teacher ………………………………………….

Dated Signature………………………………………………………………
38
 Annexure IV
Micro Project Evaluation Sheet

Name: Zaid Surfraz Ahmed Ansari Enrolment No.: 23150360356

Name of Department: Computer Engineering Semester: 3

Course Title: Data Structures Using C Code: 22317

Title of the Micro project: College Management System

Course Outcomes Achieved: -
a) Perform basic operations on arrays.
b) Apply different searching and sorting techniques.
c) Implement basic operations on stack and queue using array representation.
d) Implement basic operations on Linked List
e) Implement program to create and traverse tree to solve problems.

Sr. Poor Average Good Excellent

Characteristics to be assessed
No. (Marks 1 (Marks 4 - 5) (Marks 6 - 8) (Marks 9- 10)
- 3) Subtotal

(A) Process and Product Assessment (Convert above total marks out of 6 Marks)

1 Relevance to the course

2 Literature
Review/information
Collection
3 Completion of the
Target as per project
proposal
4 Analysis of
Data and
Representation
5 Quality of Prototype/Model

6
Report Preparation

(B) Individual Presentation/ Viva (Convert above total marks out of 4 Marks)

7 Presentation

8 Viva

(A) (B)
Total Marks10
Process and Product Assessment(6 marks) Individual Presentation
&viva (4 marks)

Comments/Suggestions about teamwork/leadership/inter-personal communication (if any)

………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………
Name and designation of the Teacher ………………………………………….

Dated Signature………………………………………………………………
39