Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
15 views1 page

Dsa Lab 1 1darray

The document outlines a lab assignment for B.Tech. CSE students at Manav Rachna University, focusing on implementing operations of One-Dimensional Arrays in C. It includes objectives related to dynamic memory management, linear data structures, and various algorithms, along with specific programming tasks such as reading and printing student marks, sorting, finding the highest marks, and functions for inserting and deleting values in an array. The assignment emphasizes practical application of data structures and algorithms in programming.

Uploaded by

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

Dsa Lab 1 1darray

The document outlines a lab assignment for B.Tech. CSE students at Manav Rachna University, focusing on implementing operations of One-Dimensional Arrays in C. It includes objectives related to dynamic memory management, linear data structures, and various algorithms, along with specific programming tasks such as reading and printing student marks, sorting, finding the highest marks, and functions for inserting and deleting values in an array. The assignment emphasizes practical application of data structures and algorithms in programming.

Uploaded by

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

MANAV RACHNA UNIVERSITY, FARIDABAD

Department of Computer Science and Technology

Course: B.Tech. CSE


Semester: III

Subject: Data Structures CSH103B T&P


________________________________________________________________________

LAB 1

Aim: To implement the operations of One-Dimensional Array

CSH103B.1 (CO1): Understand the concept of Dynamic memory management, algorithms,


and their complexity; demonstrate the abstract properties and operations of Linear data
structures (using Static Memory Allocation): Array; To apply different Searching and Sorting
algorithms.

Bloom's Taxonomy Level: BT1, BT2 and BT3

1. Write a program in C to read and print marks of 10 students (use separate functions
for inputting & printing marks).

2. Write a program in C to create a list of marks of 10 students in descending order,


given input of marks in ascending order.

3. Write a program in C to find the highest marks obtained out of 10 students (use
function to find largest).

4. Define function void insert (int a[], int value, int position) to insert a value at specific
position in an array a, given by the user. Assume that the array is large enough to add
the new value. Write a program in C that uses this function to do the insertion of
value at a position in the array.

5. Define function void delete (int a[], int position) to delete a value from specific
position in an array a, given by the user. Write a program in C that uses this function
to delete an element from a particular position. Print the original and post deletion
contents of the array.

You might also like