Posts
NeW oNe To YoU
Popular Posts
1-1 and 1-2 pyq of BEE ,PPS M1,2 EDC
CD Question Bank
https://drive.google.com/file/d/16TCNNt0ElfwShl0C5EzU5n2RApofd-kW/view?usp=sharing https://docs.google.com/document/d/1_tZw7fmp25hnfVD4SUGDw4W-WDHG0o5h/edit?usp=sharing&ouid=112711162618141236570&rtpof=true&sd=true This document is a detailed Question Bank organized into five units covering core concepts in Compiler Design, complete with Multiple Choice Questions (MCQs), Fill in the Blanks, Match the Following, and descriptive 5-Marks Questions. The structure of the questions also includes the Bloom's Taxonomy Level (BTL: 1. Remembering to 6. Creating) and the corresponding Course Outcome (CO). UNIT I: Introduction & Lexical Analysis This unit focuses on the initial stages of compilation, covering the role and structure of a compiler and the process of lexical analysis. Compiler Fundamentals: The primary function of a compiler is to translate programs written in a high-level language into machine code. The phases of a compiler include L...
DDB Units:2 Notes
https://drive.google.com/file/d/1uMepNKxfuQb3YtWFlGu4q5mdY9qzeTRZ/view?usp=sharing Query processing in a Distributed Database Management System (D-DBMS) is the process of transforming a high-level user query (like SQL) into an efficient, low-level execution strategy across multiple sites. This complex process is broken down into three main steps: Parsing and Translation, Optimisation, and Evaluation. The objective is to minimise a cost function, typically the total cost or response time, by efficiently managing local processing (CPU and I/O costs) and inter-site communication costs. Query processing is layered, beginning with Query Decomposition to translate the query into relational algebra. Next, Data Localisation maps the algebraic query to a query on physical fragments, using data distribution information. Finally, Global Query Optimisation selects the best execution strategy, considering the ordering of relational algebra operators and communication primitives ...