Blog

You can access the lecture pdf here. It’s a combined pdf with all 3 chapters. Lecture Slides

Once you scan the file, you would need to email the file to your school e-mail id and open it using Gmail or Outlook. Any other e-mail service would not be allowed. Submit your work here. PDF only.

In a flat-file database for a social media platform, each row represents a post. To handle multiple users making the same post, the design stores UserID values as comma-separated text in a single column:   PostID UserID PostContent PostTimestamp 101 1 Good morning! 2024-01-01 12:00 102 1,2,3 Hello World 2024-01-01 12:10   Which of the following best describes this approach?  

#include #include struct MyStruct { MyStruct(int value) { if (value

#include #include class Person { std::string name; int age; public: Person(std::string name, int age) : name(name), age(age) {} }; std::ostream& operator

Why is DRAM considered volatile memory?  

#include #include #include std::mutex mtx1, mtx2; int shared_resource_1 = 0; int shared_resource_2 = 0; void thread1() { for (int i = 0; i

Consider a banking application where a transaction transfers $100 from Account A to Account B. The transaction follows these steps: Debit $100 from Account A.  Credit $100 to Account B.  Commit the transaction.    Assume that after 1 (Debit $100 from Account A) and before 2 (Credit $100 to Account B), the system crashes.   Which ACID property ensures the changes persist on disk even after a system crash?  

A 2Q buffer replacement policy is managing a 3-frame buffer pool. The current state of the queues is: LRU Queue (ordered least recently used first → most recently used last): {1} FIFO Queue (ordered oldest inserted first → newest inserted last): {2} The next page reference is 2.   What will be the new state of the queues after this access?  

A 2Q buffer replacement policy is managing a 3-frame buffer pool. The current state of the queues is: LRU Queue (ordered least recently used first → most recently used last): {1, 2} FIFO Queue (ordered oldest inserted first → newest inserted last): {}  The next page reference is 3.   What will be the new state of the queues after this access?