docs: add reqs and test oracles

Author: rohinivsenthil

courseProjectDocs/requirements-and-oracles.md

@@ -5,12 +5,16 @@
 The described data structures should be able to:
 1. **Traversal:** Enable traversal methods (e.g., in-order, pre-order, post-order for trees; forward/backward for linked lists).
 2. **Sorting:** Provide built-in or integrable sorting mechanisms where applicable.
+3. **Search & Access:** Support efficient search and retrieval of elements.
+4. **Error Handling:** Gracefully handle invalid operations (e.g., removing from an empty queue).
 
 
 ## Non-Functional Requirements
 
 The data structure should ensure:
 1. **Testability:** Design should allow easy integration with unit testing frameworks.
+2. **Performance / Efficiency:** Operations should be optimized for time and space complexity (e.g., O(1) for stack push/pop).
+3. **Scalability:** Data structures should handle large datasets without significant performance degradation.
 
 
 ## Test Oracles
@@ -19,4 +23,8 @@ The data structure should ensure:
 |----------------|------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------|
 | FR-1           | Enable traversal methods (e.g., in-order, pre-order, post-order for trees; forward/backward for linked lists) | Traversal methods should return elements in the correct sequence based on the traversal type.        |
 | FR-2           | Provide built-in or integrable sorting mechanisms where applicable                       | Sorting operations should generate a correctly ordered sequence of elements.                                              |
-| NFR-1          | Design should allow easy integration with unit testing frameworks                        | All public methods should be testable via standard unit testing frameworks.                                               |
+| FR-3           | Support efficient search and retrieval of elements                                       | For a known dataset, search operations should return the correct element or index in expected time (e.g., O(log n)).      |
+| FR-4           | Gracefully handle invalid operations (e.g., removing from an empty queue)                | Invalid operations should raise appropriate exceptions or return error codes without crashing. 
+| NFR-1          | Design should allow easy integration with unit testing frameworks                        | All public methods should be testable via standard unit testing frameworks.                                               |
+| NFR-2          | Data structures should handle large datasets without significant performance degradation | Usage with large datasets should show stable performance metrics and no memory overflows or timeouts.                     |
+| NFR-3          | Operations should be optimized for time and space complexity (e.g., O(1) for stack push/pop) | Operations should meet the expected time/space complexity bounds under typical scenarios.                             |