Assignment Task
A particular ‘RPA’ firm is in the process of developing a restaurant which has bot waiters. Bot needs to deliver the food from the specified exit door, of the kitchen with multiple exit doors to the specified table.
The restaurant has blocked areas where Bot cannot move and the passages where it can move. The layout of restaurant can be rectangular or square. Layout map can be considered as a matrix of cells where cell with ‘0’ represents the passage and cell with ‘1’, the blocked area. Bot has memorised this map in a particular format for faster processing. Given a particular table location bot needs to find the path from the kitchen from the specified exit door to the table to serve the customer. Bot has a constraint it can move only in either right or down direction one step at a time (i.e. only to the adjacent cell in right or down direction provided it is not blocked) with first preference to right direction.
Layout matrix is stored in the file input.txt
You need to provide the code that helps the bot with the path form specific exit door of the kitchen to the mentioned table if there exists the one. If multiple paths exists your code should find any one.
Implementation
Your code should provide the following functionalities
1. Readmap
Layout matrix consists for ‘0’ (allowed for moving) and ‘1’ (Blocked area) Your code should read the layout matrix from the file input.txt (file reading) and store as multilist data structure (Reference multilinked list representation of sparse matrix).
You need to scan layout matrix and create node whenever ‘0’ is encountered in input file. Node should maintain x coordinate, y coordinate (coordinate position with respect to input file, indexing starts from 0) for each location with ‘0’ value, link to the next node in the same row, link to the next node in the same column.
2. Find path
Help bot to find path from the start point to the end point if one exists.
You should access data only from the created multilinked list structure. You should provide iterative implementation for this functionality. You can use any data structure studied in unit2 as auxiliary data structure to hold the nodes. There could be multiple paths, you program should find out any one of the available paths which satisfy the constraint.
3. Store path
Your program should create output file out.txt
If path exits, program should store path coordinates in sorted order (ascending order of x, for each x ascending order of y) (No other format for output is accepted). If no path exists ‘-1’ should be stored in output file.
This UE20CS202 – IT Assignment has been solved by our IT experts at Schooling Best. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style.
Be it a used or new solution, the quality of the work submitted by our assignment experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.
