Open
Conversation
We present our Buffer 5.0 project under the category College applications – ‘CUMMINS TASK SCHEDULER’. We have used array list implemented stacks to run our task scheduler. So first we ask the user to enter the number of tasks he needs to get done that day, as he enters the tasks it is displayed to the user so that he knows and then comes the operation menu asking the user 2 choices- whether he has completed the task and what his upcoming task is. So accordingly after finishing his task A, he marks it complete and then chooses option 2 to check what his next work is. After he is done with all the tasks the application is complete and will be run over for the next time. The basic concept behind our project is that we initialize a stack, in which all the elements entered by the user are getting stored. then we declare a second stack pop the items in the original stack, and push them in the second one to organize them in the same order as the user entered since the stack uses the LIFO principle.
Author
|
Team members:
|
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
We present our Buffer 5.0 project under the category College applications – ‘CUMMINS TASK SCHEDULER’. We have used array list implemented stacks to run our task scheduler. So first we ask the user to enter the number of tasks he needs to get done that day, as he enters the tasks it is displayed to the user so that he knows and then comes the operation menu asking the user 2 choices- whether he has completed the task and what his upcoming task is. So accordingly after finishing his task A, he marks it complete and then chooses option 2 to check what his next work is. After he is done with all the tasks the application is complete and will be run over for the next time. The basic concept behind our project is that we initialize a stack, in which all the elements entered by the user are getting stored. then we declare a second stack pop the items in the original stack, and push them in the second one to organize them in the same order as the user entered since the stack uses the LIFO principle.