Take ‘n’ historic sites in Tamil Nadu as input. Design and implement a code in c language using brute force approach that identifies the shortest possible route for a traveller to visit these sites and come back to his starting point.
write a program for Strassen’s matrix multiplication algorithm using divide and conquer approach in c language.
Rahul lives in City A and would like to travel to City B for work. There is a shuttle service for people in these cities which has a fixed schedule. The schedule for City A is a list of boarding times(at City A) and departure times(from City A) for each bus.
Note: No one is allowed to board a shuttle after the boarding time.
He arrives at time t and sometimes has to wait at the station. You are given a list of arrival times for n days.
Return an array of shuttle indexes that Rahul took for n days.
given a number of mangoes and number of persons. Find the number of ways to distribute identical mangoes among identical persons
All the students in a class are involved in any one of the Sports, be it indoor or outdoor. The details of their Names, Roll_no, Sport are recorded as a list. Write pseudocodes to return the following.
a. Given a Roll_no, return the Sport(s) he/ she has registered.
b. Given a Sport, find the list of students who have enrolled for the same
Write a program to create a class to store details of a student ( name, roll and 3 subject marks ). Input details for 2 students and assign all the details of that student who is having higher average mark to a new student using friend function.
Traverse a singly linked list from the beginning to the end and reverse all the increasing and decreasing sequence of components present in the list. Component is the collection of continuous elements either in increasing or decreasing order. Example: Let the list contains 1, 2, 3, 7, 4, 2, 9, 7, 8 elements. Here the components are “1, 2, 3, 7”, “4, 2”, “9, 7”, and “8”. The code should produce the list with elements 7, 3, 2, 1, 2, 4, 7, 9, 8.