Introduction to Database Transaction, Transaction states, ACID properties, Concept of Schedule, Serial Schedule
Saturday, 6 September 2025
Wednesday, 3 September 2025
Tuesday, 15 July 2025
In an e-commerce system, customer account IDs are stored in a list write a program to search customer id using linear and binary search.
Savitribai Phule Pune University
Second Year of Computer Engineering and Computer Science and Engineering (2024 Course)
PCC-201A COM: Data Structures Laboratory
Problem Statement:
In an e-commerce system, customer account IDs are stored in a list, and you are tasked with
writing a program that implements the following:
a) Linear Search: Check if a particular customer account ID exists in the list.
b) Binary Search: Implement Binary search to find if a customer account ID exists,
improving the search efficiency over the basic linear
Algorithm:
1. Linear Search:
1. Start
2. Accept Customer ID from user that you want to search in e-commerce system i:e target_id
3. You have to check one by one linearly that target_id is present inside the Customer_Id list.
3.1 if it is present then print or show target _id is present at nth index. or
3.2 if all customer_id scanned or checked and still if you are not getting match of target_id then just print or show customer_id is not present.
4. Stop
2. Binary Search:
1. Start
2. For Binary Search all elements inside the list must be in sorted order. hence sort the list (if not already sorted).
3. Set low = 0 (start index of
the list).
4. Set high = length of the list - 1
(end index).
5. While low is less than or equal
to high,
do:
5.1 Calculate mid
= (low + high) // 2.
5.2 If the element
at mid is equal to the target:
5.2.1 Return
mid
(target found).
5.3 Else if element
at mid is less than the target:
5.3.1 Set
low = mid + 1
(search in right half).
5.4 Else:
5.4.1 Set
high = mid - 1
(search in left half).
6. If the loop ends and the target is
not found:
6.1 Return -1.
Implementation:
Monday, 7 July 2025
Implement student database using dynamically allocated memory and perform various operations.
NEP 2020 Compliant Curriculum Structure
Second Year Engineering (2024 Pattern) – Information Technology
1. Title:
Implement student database using dynamically allocated memory.
2. Objective:
Study various data
structures and do the implementation of specific applications.
3. Problem Statement:
Design a program to maintain a student database that performs the following tasks:
1. Add and store
student details (ID, Name, CGPA) using dynamically allocated memory.
2. Expand the student
list using realloc () as new entries are added.
3. Implement Linear
Search and Binary Search to find student records by ID.
4. Implement at least
two Sorting Algorithms (Bubble Sort, Selection Sort, or Insertion Sort) to sort
student records by: 1. Name (Alphabetically) 2. CGPA (Ascending/Descending)
5. Analyze and compare
the performance of search operations before and after sorting.
4. Outcomes:
After implementing the above problem statement, the expected outcome are as follows:
1. We learn how to allocate memory dynamically and then we store student details in it like id, name, CGPA.
2. We learn how to reallocate memory that is expansion of student list using realloc() function. for e.g. first, we allocate only 10bytes of memory but right now we want to store one more record but there is no sufficient memory so once again we do the reallocation of memory means expansion of memory and store the record.
3. We learn how to search particular student from the list of students by using two searching technique Linear Search and Binary Search.
4. We learn how to sort (Ascending /Descending) the student record using three sorting techniques 1. Bubble Sort 2. Selection Sort and 3. Insertion Sort.
5. We analyze and able to do the comparisons of performance of search operations before and after sorting.
5. Algorithms:
Subscribe to:
Comments (Atom)