डेटा आइटम A और B पर तीन समवर्ती लेनदेन (transactions) T1, T2, और T3 द्वारा निष्पादित संचालन के निम्नलिखित कालानुक्रमिक अनुसूची (chronological schedule) पर विचार करें: 1. R1(A)2. R2(A)3. W1(A)4. W2(B)5. R3(B)6. W3(A) प्राथमिकता ग्राफ (Precedence Graph / Serialization Graph) का निर्माण करने के लिए संघर्षों (conflicts) का विश्लेषण करके, ग्राफ में अद्वितीय निर्देशित किनारों (unique directed edges) की कुल संख्या और यह निर्धारित करें कि क्या अनुसूची संघर्ष क्रमिक (conflict serializable) है।

Given below are two statements: one is labelled as Assertion (A) and the other is labelled as Reason (R). Assertion (A): Data warehouses are designed to support strategic decision-making through integrated and historical data. Reason (R): Data warehouses primarily process day-to-day operational transactions in real time. In the light of the above statements, choose the most appropriate answer from the options given below:

Match LIST-I with LIST-II regarding NoSQL database types and their built-in primary indexing mechanisms: LIST-I (NoSQL Database Type) A. Key-Value Store B. Document Database C. Column-Family Store D. Graph Database LIST-II (Primary Indexing Mechanism) I. Partition key (hash) plus clustering columns II. Node labels with relationship types III. Hash-based index (O(1) lookup) IV. _id field (primary B-tree index) Choose the correct answer from the options given below: