Scribd
Upload
3 views2 pages

Introduction To DataStructures - Tutorial1

The document outlines a tutorial for the course 'Introduction to Data Structures' covering various topics such as arrays, dynamic memory allocation, structures, sorting algorithms, and searching techniques. It includes specific programming tasks and examples in C, as well as comparisons between data types and methods of passing structures to functions. The tutorial is designed for students in their 6th semester and includes practical exercises to enhance their understanding of data structures.

Uploaded by

harshiniamrutha13
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
3 views2 pages

Introduction To DataStructures - Tutorial1

The document outlines a tutorial for the course 'Introduction to Data Structures' covering various topics such as arrays, dynamic memory allocation, structures, sorting algorithms, and searching techniques. It includes specific programming tasks and examples in C, as well as comparisons between data types and methods of passing structures to functions. The tutorial is designed for students in their 6th semester and includes practical exercises to enhance their understanding of data structures.

Uploaded by

harshiniamrutha13
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

Department of Information Science and Engineering

Subject Name & Code: Introduction to Data Structures- BCS654A

Semester: 6th A, B & C Tutorial: I Date: 27/02/2026

1. What are arrays? Illustrate the program to display, insert and delete elements in the array
in the desired position.
2. Construct the following dynamic memory allocation functions along with syntax and
example (i)malloc (ii)calloc (iii)realloc iv)free
3. What is structure? Illustrate with syntax and example. Develop a C program to store and
display employee information for the following field Ename, Empid, DOB (Date, Month,
Year), and salary (Basic, DA, HRA).
4. Define an array. Explain the process of declaring and initializing a one-dimensional array
with a suitable code snippet.
5. Distinguish between a structure and an array. Why a structure is considered a "constructed
data type"?
6. Write a C program to find the Median of a list of n numbers. The program must first sort
the array in increasing order.
7. Trace the bubble sorting process step-by-step for the list: 74, 39, 35, 97, 84 and write a
function to sort an elements in the list using bubble sort.
8. Create a structure named personal to store a person's name, date of joining, and salary.
Write a program to read and display this data for a single individual.
9. Design a C program using an Array of Structures to manage marks of 100 students.
Calculate and store the total marks for each student within the structure.
10. Evaluate the use of Nested Structures. Provide a practical example where nesting would be
more efficient than using a flat structure.
11. Compare Structures and Unions in terms of memory allocation. Use a diagram or table to
show how members share memory in a union.
12. Discuss the three methods of passing structure values as arguments to functions. Which
method is most efficient for large structures and why?
13. (a) Describe the fundamental operation of the Linear Search (Sequential Search) technique.
(b) Given the list [50, 40, 30, 60, 10], provide a step-by-step trace to search for the key
item 60.
14. (a) Explain the "Sinking" and "Bubbling" concepts that give Bubble Sort its names.
(b) Illustrate all the pass of Bubble Sort on the array [74, 39, 35, 97, 84], showing every
swap.
15. (a) Explain the Selection Sort (Push-down) procedure.
(b) Trace the Selection Sort algorithm for the list [45, 20, 40, 5, 15]. Show the state of the
array after each of the 4 passes.
16. Write a C program to sort the list of unsorted items in the array using bubble sort.
17. Write a C program to sort the list of unsorted items in the array using selection sort.
18. (a) Given the list [50, 40, 30, 60, 10], provide a step-by-step trace to sort an elements using
insertion sort
(b)Write a C program to sort the list of unsorted items in the array using insertion sort.
19. (a) Describe the fundamental working of the Binary Search technique.
(b) Given the list [50, 40, 5, 60, 10], provide a step-by-step trace to search for the key item
10.

Signature of Staff Signature of HOD

You might also like