Question

You have been assigned to an ICT firm for your attachment studies and as a result, required to learn and aid in some basic IT-related activities.i. As part of your first task, your supervisor requests you to aid with the development of a bank ticketing system that ensures the first time and already admitted customers are served according to a predefined preference as shown below. Write an algorithm that would ensure customers can be awarded tickets and served based on the type of service requested. Ensure you clearly mention all abstract data structures that the algorithm would use.

Your answer

Answer 1

Solution:

1) For the first task, I am assuming that you are given an array of customers' work in the bank.

A simple sort will work as it will sort the array and we can assign ticket according to the sorted array

for example the given array is 1 3 4 2 1 2

after sorting, it will become 1 1 2 2 3 4 and now we can assign them tickets according to their preference.

ALGORITHM:

take array as input

sort the array

assign ticket

Data Structures Used is array.

2) For the second task

if we don't want to print A type score then just traverse linked list and check whether node's data is equal to it or not

if it's not equal then print it else don't print it.

ALGORITHM:

while(node!=NULL)

{

if(node->data!=A)

print(node->data);

node=node->next;

}

data structure used is linked list as given in input.

************************************************************************************************************************************

#please consider my effort and give me a like...thank u.....