Rube Goldberg Machine

This is a C language based dynamic program which uses various abstract data types like dynamic arrays, linked lists, queues, stacks, binary trees to manage the flow of data in a Rube Goldberg Machine.

Analysis of our application

The performance of our program is efficient and our application is easy to use, easy to enter input, easy to read and understand the output. It is dynamic i.e. any number of inputs can be given by the user and the application will work effectively following the given scenario systematically. As mentioned in the source code, the comments are clearly describing the problem scenario. If the user enters any number other than the said value; the program would show it as an invalid input and continue the process.

In terms of complexity:

Stacks and queues follow the principle of first-in-last-out (stacks) and first-in-first-out (queues). The time complexity for stacks is O(1) and the time complexity for queues is O(n).

How to use our program?

Refer the documentation provided with the instructions for the usage of the application.

Zero-kelvin Team Details-

• Pranjay Poddar (RA1911028010129)
• Shreyansh Pathak (RA1911028010097)
• Nishant Singh (RA1911028010108)
• Ankita Kokkera (RA1911028010111)