Data Structures and Algorithms Laboratory (DSAL)

SET THEORY USING LIST IN PYTHON

Problem Statement :- In second-year computer engineering class, group A student's play cricket, group B students play badminton and group C students play football. Write a Python program using functions to compute the following:- a) List of students who play both cricket and badminton b) List of students who play either cricket or badminton or both c) Number of students who play neither cricket nor badminton d) Number of students who play cricket and football but not badminton. (Note- While realizing the group, duplicate entries should be avoided, Do not use SET built-in functions) Note :- Scroll horizontally to see the full line of code. def Addelem ( A , a ): for i in range ( a ): elem = input ( "Enter the name of student:" ) if ( elem ...

Implementations of Search Algorithms using Python | Linear Sequential Search | Sentinel Sequential Search | Binary Search | Fibonacci Search

Problem Statement:- a) Write a Python program to store roll numbers of student in array who attended training program in random order. Write function for searching whether particular student attended training program or not, using Linear search and Sentinel search. b) Write a Python program to store roll numbers of students array who attended training program in sorted order. Write function for searching whether particular student attended training program or not, using Binary search and Fibonacci search. Note:- Scroll horizontally to see the full line of code. def linear_search ( a , target ): for i in range ( len ( a )): if ( a [ i ]== target ): print ( "Roll no." , target , "is present at index" , i ) break else : print ( "Roll no." , target , "not found in list" ) def binary_search ( a , targ...

Uninstalling AnyDesk from Ubuntu: A Step-by-Step Guide

If you're an Ubuntu user looking to remove AnyDesk from your system and reclaim valuable space, this straightforward guide will walk you through the uninstallation process with easy-to-follow steps. Step 1: Launch the Terminal To initiate the uninstallation process, open the Terminal on your Ubuntu system by simultaneously pressing "Ctrl + Alt + T." Step 2: Verify AnyDesk Installation Confirm that AnyDesk is installed on your system by typing the following command in the Terminal and pressing "Enter": dpkg -l | grep anydesk The relevant information will be displayed if AnyDesk is installed. Step 3: Uninstall AnyDesk Remove AnyDesk from your Ubuntu system using the following command in the Terminal: sudo apt-get remove anydesk Enter your user password when prompted (characters won't be visible as you type) and press "Enter" to authorize the uninstallation. Step 4: Confirm Unins...

C++ Program for storing Appointments Schedule for day using Linked list | Display Free Slots | Book Appointment | Cancel Appointment | Sort Appointments

Problem Statement: Write C++ program for storing appointment schedule for day. Appointments are booked randomly using linked list. Set start and end time and min and max duration for visit slot. Write Functions for- A) Display free slots B) Book appointments C) Sort list based on time D) Cancel appointment ( check validity, time bounds, availability ) E) Sort list base on time using pointer manipulation. Note: Scroll Horizontally to see the full line of code. #include < iostream > using namespace std ; class slot { public : int startTime , endTime , min , max ; bool status ; slot * next ; slot ( int start , int end , int min , int max ) { startTime = start ; endTime = end ; this -> min = min ; this ->...

Implementation of Sorting Algorithms using Python | Insertion Sort | Shell Sort

Problem Statement: Write a Python program to store second year percentage of students in array. Write function for sorting array of floating point numbers in ascending order using a) Insertion sort b) Shell Sort and display top five scores. Note :- Scroll horizontally to see the full line of code. def insertion_sort ( a , n ): for i in range ( 1 , n ): current = a [ i ] j = i - 1 while (( a [ j ]> current ) and j >= 0 ): temp = a [ j + 1 ] a [ j + 1 ]= a [ j ] a [ j ]= temp j = j - 1 a [ j + 1 ]= current print ( "Iteration" , i , ": " , a ) return a def shell_sort ( a , n ): gap = n // 2 ...

Space of Coders

Search This Blog