Scribd
Upload
2 views2 pages

C Program for Student Info Management

The document outlines a practical assignment for a Data Structures and Algorithm Lab, where students are required to write a C program to manage student information using arrays of structures. The assignment includes tasks such as sorting data by percentage, searching for specific roll numbers, and analyzing algorithm performance. Additionally, it provides guidelines for writing algorithms, drawing flowcharts, and answering theoretical questions related to arrays and sorting algorithms.

Uploaded by

yashgaikwas32
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views2 pages

C Program for Student Info Management

The document outlines a practical assignment for a Data Structures and Algorithm Lab, where students are required to write a C program to manage student information using arrays of structures. The assignment includes tasks such as sorting data by percentage, searching for specific roll numbers, and analyzing algorithm performance. Additionally, it provides guidelines for writing algorithms, drawing flowcharts, and answering theoretical questions related to arrays and sorting algorithms.

Uploaded by

yashgaikwas32
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Class: SE Div: A/B Course: Data Structures and Algorithm Lab

Name of Student:

Batch: Roll No.:

Practical assignment: 4

Title: Write C program to store student information (e.g. Roll No, Name, Percentage etc.).
a. Display the data in descending order of Percentage (Bubble Sort/Selection Sort/Insertion sort).
b. Display data for Roll No specified by user (Linear Search/Binary Search).
c. Display the number of passes and comparisons for different test cases (Worst, Average, Best
case).

Objective:
This assignment is designed to implement database of students by using array of structure.

Outcome:
Student will be able to understand and write structure & array of structure concept.

Mapped PO and PSOs:

Software tool/s used:


[Link]
[Link]

References used:
1. Programming in ANSI C by E. Balagurusamy.
2. Let us C by Yashwant Kanetkar
3. Reema Thareja, Data Structures using C, Oxford University Press, 2 nd Edition
4. The C Programming Language by Brian W. Kernighan and Dennis M. Ritchie (K&R)
5. [Link] C Programming Tutorial for Beginners
6. W3Schools C Tutorials
7. GeeksforGeeks C Programming Section

**Write algorithm. Draw flowchart. Attach code and output printout.


Questions : (Write answers on journal pages)
1. What is an array in C? What is its main limitation?
2. Why do we need to manually track the current_size of an array in C?
3. What happens if you try to append an element to a static array that is already full? How
would you solve this problem in a real-world application?

Say No to plagiarism DSA 2024 pattern


Viva Questions:
1. Explain the basic idea of Bubble Sort. After the first full pass of Bubble Sort, where is the
largest element located?
2. What is the worst-case time complexity of a Binary Search? Why is it so much faster than
linear search for large datasets?
3. What is the single most important prerequisite for performing a Binary Search? Why is it
necessary?

Conclusion:

Remarks by course faculty about correctness and improvements:

Criteria Marks

Understanding of Concept /4
Algorithm / Logic /3
Code Implementation /4
Output Accuracy /2
Viva / Explanation /5
Journal Neatness & Presentation /2
Total /20

Signature of staff: Date of Submission: -

Say No to plagiarism DSA 2024 pattern

You might also like